VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

JC2 H3 Mathematics Tutor Bukit Timah | Floor and Ceiling Functions in Integer Proofs

Mathematics textbooks stand behind an open notebook containing written working and a graph, with a calculator and pens alongside.

Did you know? If 53 students need vans holding twelve people each, four full vans are not enough. The answer is five because the leftover passengers still need a vehicle. This is a ceiling calculation. In contrast, if you ask how many complete groups of twelve fit inside 53, the answer is four—a floor calculation. One choice of rounding changes the meaning.

For JC2 learners looking for a JC2 H3 Mathematics tutor in Bukit Timah, floor and ceiling functions are useful for counting integers, proof by cases, divisibility, modular arithmetic and bounding arguments. They are presented as a connected enrichment application of the 2027 H3 Mathematics (9820) syllabus’s non-routine problem-solving competencies, not as a separately named additional-content topic.

Quick answer: The floor ⌊x⌋ is the greatest integer at most x, and ceiling ⌈x⌉ is the least integer at least x. Equivalently ⌊x⌋≤x<⌊x⌋+1 and ⌈x⌉−1<x≤⌈x⌉. For negative values, floor rounds towards negative infinity, not towards zero. Those precise inequalities should guide every proof.

The mathematical definitions before the shortcut

Suppose x=3.7. The greatest integer not exceeding it is three, and the least integer not below it is four. Thus ⌊3.7⌋=3 and ⌈3.7⌉=4. If x=4 exactly, both equal four; neither jumps away from an integer.

eduKate Mathematics Tuition · 11-second introduction

Now take x=−1.2. The greatest integer at most −1.2 is −2, while the least integer at least −1.2 is −1. This is where intuition about ordinary truncation often fails: truncating −1.2 towards zero gives −1, but the floor is −2.

Write n=⌊x⌋. The defining inequality is n≤x<n+1. Conversely, if an integer n satisfies this double inequality, n must be the floor of x. This two-way statement is often more useful for proofs than a staircase picture.

For ceiling, write m=⌈x⌉. Then m−1<x≤m. These intervals give a direct method for solving equations involving floors and ceilings without guessing how a graph behaves at an endpoint.

A key identity is ⌈x⌉=−⌊−x⌋. To prove it, set n=⌊−x⌋, so n≤−x<n+1. Multiply by −1, reversing the inequalities: −n−1<x≤−n. Thus −n is the ceiling of x.

Do not assume ’round to nearest integer’ is either floor or ceiling. Both are directional. Choosing the correct direction is a modelling decision as well as a mathematical definition.

The fractional part organises the proof

Define the fractional part {x}=x−⌊x⌋. It always satisfies 0≤{x}<1, even when x is negative. For x=−1.2, the floor is −2, so the fractional part is 0.8, not −0.2.

Write x=n+r where n=⌊x⌋ is an integer and 0≤r<1. Then x+y can be analysed by separating integer parts and fractional parts. If y=m+s, the floor of the sum is n+m+⌊r+s⌋.

Since 0≤r+s<2, the final floor is either zero or one. Therefore ⌊x⌋+⌊y⌋≤⌊x+y⌋≤⌊x⌋+⌊y⌋+1. The difference depends on whether the fractional parts carry across one.

This proof explains why floor cannot generally be distributed across addition as an equality. For x=y=0.7, each floor is zero, but ⌊x+y⌋=⌊1.4⌋=1.

For every integer k, ⌊x+k⌋=⌊x⌋+k. The corresponding ceiling shift identity also holds. Translation by a whole number changes the integer part but leaves the fractional part unchanged.

An especially useful reflection identity is ⌊x⌋+⌊−x⌋=0 when x is an integer and −1 otherwise. The noninteger case follows from x=n+r with 0<r<1: −x=−n−1+(1−r), whose floor is −n−1.

These are not just facts to memorise. Each follows from one precise representation of a real number by an integer part and a fractional remainder.

Worked count: multiples of seven in a range

How many positive integers up to 100 are multiples of seven? They are 7,14,…,98. The positive multiplier k may be any integer from 1 through ⌊100/7⌋=14, so the count is fourteen.

How many three-digit positive integers are divisible by seven? The range is 100 through 999 inclusive. There are ⌊999/7⌋=142 positive multiples up to 999 and ⌊99/7⌋=14 up to 99. Subtract to get 128 three-digit multiples.

For a positive integer divisor d and integer range 1≤A≤B, the count of multiples in [A,B] is ⌊B/d⌋−⌊(A−1)/d⌋. The A−1 matters because the lower endpoint is included.

Check A=7,B=21,d=7. The formula gives ⌊21/7⌋−⌊6/7⌋=3−0=3, correctly counting 7,14,21. Using ⌊A/d⌋ in the second term would incorrectly exclude the first endpoint.

For arbitrary integer endpoints, the number of integer multiples of d between A and B inclusive can be written ⌊B/d⌋−⌈A/d⌉+1, provided A≤B and d>0. This describes the allowed integer multipliers directly.

Counting by floors is often the missing step in an inclusion–exclusion problem: count multiples of two, multiples of three, and subtract multiples of their least common multiple so common items are not counted twice.

The generalised pigeonhole principle uses a ceiling

Suppose N objects are placed into k nonempty labelled categories, with k a positive integer. At least one category receives ⌈N/k⌉ objects. Otherwise every category would contain at most ⌈N/k⌉−1, and their total capacity would be below N.

For example, 53 students placed into twelve discussion groups guarantee at least one group has at least ⌈53/12⌉=5 students. It is possible some groups have more; the theorem guarantees a minimum load in one group, not that all groups have exactly five.

The proof is by contradiction. If every group contained at most four, twelve groups would hold at most 48 students, less than 53. Therefore some group must contain five or more.

The floor appears in a different formulation: among k groups containing N objects in total, some group has at most ⌊N/k⌋ objects. Otherwise every group would exceed that floor and the total would be too large.

To prove either direction, identify whether you are asking for a necessarily crowded group or a necessarily lightly occupied group. One requires ceiling, the other floor. The exact wording determines the appropriate inequality.

This application connects to the syllabus’s named pigeonhole principle and shows why a precise integer-rounding definition is useful even when floor and ceiling are not independently listed as a content heading.

A floor-sum identity from consecutive odd numbers

Consider Sₙ=Σ from k=1 to 2n of ⌊k/2⌋, where n is a positive integer. The first few values are ⌊1/2⌋=0, ⌊2/2⌋=1, ⌊3/2⌋=1, ⌊4/2⌋=2, and so on.

Group consecutive pairs: ⌊(2j−1)/2⌋=j−1 and ⌊2j/2⌋=j. The jth pair contributes 2j−1, the jth positive odd number.

Therefore Sₙ=Σ from j=1 to n of (2j−1)=n². This is an exact identity for every positive integer n. For n=3 the six terms sum 0+1+1+2+2+3=9, agreeing with 3².

One added term gives a related result: Σ from k=1 to 2n+1 of ⌊k/2⌋=n²+n, because the last added term has value n.

These results are good H3 proof exercises because the discovery of a repeated pattern must be converted into an arbitrary-index argument. A table suggests pairing, but the general jth pair is the proof.

The identity can also be proved by counting points in a staircase diagram. Each column contributes its floor-defined height, while grouping horizontal strips produces the same total. A correct bijection or double count can be as informative as algebra.

A careful extension to lattice points

Suppose we want integer points (x,y) satisfying 0≤x≤3, y≥0 and 3y≤2x+1. For each fixed integer x, the allowed y run from zero to ⌊(2x+1)/3⌋ inclusive.

Thus the number of points for that x is ⌊(2x+1)/3⌋+1. At x=0,1,2,3 the maximal y values are 0,1,1,2. The counts are 1,2,2,3 and sum to 8.

One might try to draw the triangular region and eyeball the answer, but floor notation gives an exact count and handles points lying on the boundary correctly.

If the inequality were strict, 3y<2x+1, a boundary equality might need exclusion. A reliable solution converts the strict inequality to an integer upper bound rather than copying the non-strict formula.

Coordinate counting often turns a geometric question into a floor sum. This is a useful bridge between H2 graphs, integer arithmetic and the H3 problem-solving heuristic of restating a problem in a more tractable form.

An effective tutor asks which variable to fix first and whether every counted point is included exactly once. A student who can answer those questions has a sound counting model.

65 original floor-and-ceiling learning clinics

1. Floor of 3.7

Worked answer: ⌊3.7⌋=3, since 3≤3.7<4.

Why it matters: The greatest integer not exceeding x is the floor. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

2. Ceiling of 3.7

Worked answer: ⌈3.7⌉=4, since 3<3.7≤4.

Why it matters: Ceiling is the smallest integer at least x, not ordinary nearest-integer rounding. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

3. An exact integer

Worked answer: ⌊4⌋=⌈4⌉=4.

Why it matters: An integer is already equal to both directional roundings. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

4. A negative noninteger

Worked answer: ⌊−1.2⌋=−2 and ⌈−1.2⌉=−1.

Why it matters: Negative values make floor different from truncating towards zero. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

5. Another negative example

Worked answer: ⌊−7/3⌋=−3 and ⌈−7/3⌉=−2.

Why it matters: Use inequalities around neighbouring negative integers. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

6. Negative one-half

Worked answer: ⌊−1/2⌋=−1, while ⌈−1/2⌉=0.

Why it matters: The floor lies to the left of x on the number line. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

7. Zero exactly

Worked answer: ⌊0⌋=⌈0⌉=0.

Why it matters: Check boundary inputs explicitly; floors need not move an integer. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

8. Full groups of twelve

Worked answer: ⌊53/12⌋=4 complete groups of twelve.

Why it matters: A floor counts only the groups that are completely filled. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

9. Vans required

Worked answer: ⌈53/12⌉=5 vans with twelve places each.

Why it matters: A partially filled final group still needs its own container. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

10. A divisible capacity

Worked answer: ⌈48/12⌉=⌊48/12⌋=4.

Why it matters: No extra van is needed when the count divides exactly. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

11. One student more

Worked answer: ⌈49/12⌉=5.

Why it matters: A single leftover person changes the required ceiling. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

12. First five multiples of seven

Worked answer: The positive multiples through 35 are 7,14,21,28,35.

Why it matters: The multiplier k runs from one through ⌊35/7⌋. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

13. Multiples of seven up to 100

Worked answer: ⌊100/7⌋=14.

Why it matters: The count follows from the largest allowed positive integer multiplier. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

14. Multiples of twelve up to 100

Worked answer: ⌊100/12⌋=8.

Why it matters: A floor turns a divisibility question into an exact counting formula. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

15. Multiples from 7 to 21 inclusive

Worked answer: The multiples of seven are 7,14,21, giving three.

Why it matters: Include the lower endpoint when it itself is a multiple. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

16. Count three-digit multiples of seven

Worked answer: ⌊999/7⌋−⌊99/7⌋=142−14=128.

Why it matters: Subtract multiples below the first three-digit integer. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

17. Multiples of ten from 100 to 200

Worked answer: ⌊200/10⌋−⌊99/10⌋=20−9=11.

Why it matters: Both 100 and 200 are included, so the answer is eleven. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

18. Multiples of five from 12 to 30

Worked answer: ⌊30/5⌋−⌊11/5⌋=6−2=4: 15,20,25,30.

Why it matters: Use A−1 for an inclusive lower boundary. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

19. Integers in [2.3,7.9]

Worked answer: They are 3,4,5,6,7, a total of five.

Why it matters: Compute ⌊7.9⌋−⌈2.3⌉+1. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

20. Integers between −2.1 and 2.1

Worked answer: The integers −2,−1,0,1,2 give five.

Why it matters: Ceiling and floor handle a range crossing zero. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

21. Integers in [1,10)

Worked answer: The integers are one through nine, giving nine.

Why it matters: A strict right endpoint excludes ten even though it is an integer. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

22. Nonnegative 3x≤20

Worked answer: The solutions x=0,1,…,6 number seven.

Why it matters: Solve the inequality, floor the upper bound and include zero. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

23. Positive squares up to twenty

Worked answer: They are 1,4,9,16, a total of ⌊√20⌋=4.

Why it matters: Count positive integer square roots rather than the squares individually. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

24. Binary digits of 100

Worked answer: Since 2⁶≤100<2⁷, the binary representation uses seven digits.

Why it matters: For positive integer n, the digit count is ⌊log₂n⌋+1. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

25. Fractional part of 3.7

Worked answer: {3.7}=3.7−3=0.7.

Why it matters: The fractional part lies in [0,1). This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

26. Fractional part of −1.2

Worked answer: {−1.2}=−1.2−(−2)=0.8.

Why it matters: The fractional part is never negative, even for negative inputs. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

27. Carry across one

Worked answer: ⌊0.7⌋+⌊0.7⌋=0 but ⌊1.4⌋=1.

Why it matters: Floor does not distribute across addition without a possible carry. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

28. A mixed carry

Worked answer: ⌊1.8⌋+⌊2.3⌋=3 but ⌊4.1⌋=4.

Why it matters: Fractional parts adding above one cause the extra unit. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

29. No carry

Worked answer: ⌊1.2⌋+⌊2.3⌋=3 and ⌊3.5⌋=3.

Why it matters: If fractional parts sum below one, floors add exactly. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

30. Integer translation

Worked answer: ⌊x+5⌋=⌊x⌋+5 for every real x.

Why it matters: Adding an integer shifts the entire unit interval. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

31. Ceiling translation

Worked answer: ⌈x−3⌉=⌈x⌉−3.

Why it matters: The same translation principle holds for ceilings. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

32. Reflection identity

Worked answer: ⌈x⌉=−⌊−x⌋.

Why it matters: Negating the defining floor inequality reverses its direction. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

33. Negative-floor sum for noninteger

Worked answer: For x=1.25, ⌊x⌋+⌊−x⌋=1−2=−1.

Why it matters: A nonzero fractional part produces one extra negative unit. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

34. Negative-floor sum for integer

Worked answer: For x=3, ⌊x⌋+⌊−x⌋=3−3=0.

Why it matters: The identity distinguishes integer inputs from nonintegers. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

35. Floor plus opposite ceiling

Worked answer: ⌊x⌋+⌈−x⌉=0 for every real x.

Why it matters: This follows directly from the floor-ceiling reflection identity. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

36. Ceiling minus floor

Worked answer: For a noninteger x, ⌈x⌉−⌊x⌋=1.

Why it matters: For an integer x the corresponding difference is zero. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

37. Bounds on fractional part

Worked answer: For any x, 0≤x−⌊x⌋<1.

Why it matters: This one inequality powers many floor-sum and counting proofs. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

38. Floor of a doubled real

Worked answer: For x=0.6, ⌊2x⌋=1 while 2⌊x⌋=0.

Why it matters: Multiplying a real before rounding can change the result. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

39. A general doubled identity

Worked answer: ⌊2x⌋=⌊x⌋+⌊x+1/2⌋ for every real x.

Why it matters: Split the fractional part into below or above one-half. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

40. An integer ratio floor

Worked answer: ⌊⌊x⌋/3⌋=⌊x/3⌋ for every real x.

Why it matters: Writing x as integer plus fractional part proves the nested-floor rule for positive divisors. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

41. Floor of sum bound

Worked answer: ⌊x⌋+⌊y⌋≤⌊x+y⌋≤⌊x⌋+⌊y⌋+1.

Why it matters: Only a zero-or-one carry can arise from two fractional parts. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

42. The ceiling of a negative

Worked answer: ⌈−2.2⌉=−2.

Why it matters: Ceiling rounds upward along the number line, even when values are negative. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

43. A strict-floor equation

Worked answer: ⌊x⌋=4 exactly when 4≤x<5.

Why it matters: The right endpoint is excluded; x=5 has floor five. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

44. A ceiling equation

Worked answer: ⌈x⌉=4 exactly when 3<x≤4.

Why it matters: The left endpoint is excluded; x=3 has ceiling three. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

45. A graph endpoint

Worked answer: At x=2 the floor graph includes height two, not the height-one step.

Why it matters: Floor steps have closed left endpoints and open right endpoints. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

46. Sum of six half-floors

Worked answer: Σ from k=1 to 6 of ⌊k/2⌋ equals 0+1+1+2+2+3=9.

Why it matters: Pairing consecutive terms reveals a sum of odd numbers. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

47. General even-length sum

Worked answer: Σ from k=1 to 2n of ⌊k/2⌋=n².

Why it matters: The jth pair contributes (j−1)+j=2j−1. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

48. Odd-length extension

Worked answer: Σ from k=1 to 2n+1 of ⌊k/2⌋=n²+n.

Why it matters: The final unpaired term contributes n. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

49. Sum k=0 through 8, divided by three

Worked answer: Σ⌊k/3⌋=0+0+0+1+1+1+2+2+2=9.

Why it matters: Group floor values into blocks of equal size. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

50. A complete quotient-block sum

Worked answer: Σ from k=0 to 3n−1 of ⌊k/3⌋=3n(n−1)/2.

Why it matters: Each quotient j from 0 through n−1 occurs exactly three times. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

51. Pigeonhole with 53 students

Worked answer: In twelve groups, some group has at least ⌈53/12⌉=5 students.

Why it matters: If every group had at most four, total capacity would be 48. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

52. Guaranteed lightly occupied group

Worked answer: With 53 objects in twelve boxes, some box has at most ⌊53/12⌋=4.

Why it matters: If every box held at least five, at least sixty objects would be required. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

53. 20 objects into six boxes

Worked answer: Some box contains at least ⌈20/6⌉=4 objects.

Why it matters: A ceiling gives the guaranteed maximum occupancy lower bound. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

54. 100 items, nine bins

Worked answer: Some bin receives at least ⌈100/9⌉=12 items.

Why it matters: Assuming every bin has at most eleven gives capacity only 99. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

55. Multiples of two or three to 100

Worked answer: There are 50+33−16=67 such integers.

Why it matters: Use floors for each divisor and correct overlap with inclusion–exclusion. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

56. Neither multiple of two nor three

Worked answer: 100−67=33 positive integers in 1,…,100 avoid both divisors.

Why it matters: Complement counting is often easier after finding the union. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

57. Not divisible by 2,3,5 up to 100

Worked answer: There are 26; inclusion–exclusion counts 74 divisible by at least one.

Why it matters: Combine exact floors with the principle of overlapping sets. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

58. A lattice-point example

Worked answer: For x=0,1,2,3 and 0≤3y≤2x+1, the point counts are 1,2,2,3: total eight.

Why it matters: Fix one integer coordinate and floor the maximum permitted other coordinate. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

59. A strict lattice boundary

Worked answer: Replacing 3y≤2x+1 by 3y<2x+1 requires excluding boundary equalities.

Why it matters: Strict inequalities must not inherit non-strict endpoint counts without checking. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

60. A general integer range

Worked answer: For real A≤B, integer count is max(0,⌊B⌋−⌈A⌉+1).

Why it matters: The maximum with zero handles intervals containing no integers. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

61. A general multiple range

Worked answer: For integer A≤B and positive d, the multiple count is ⌊B/d⌋−⌊(A−1)/d⌋.

Why it matters: The difference of quotient counts works across positive and negative endpoints. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

62. Zero included in range

Worked answer: For −4≤x≤3, the multiples of five consist only of zero.

Why it matters: A negative lower endpoint can make zero an important feasible multiple. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

63. False floor multiplication

Worked answer: For x=0.7, ⌊2x⌋=1 differs from 2⌊x⌋=0.

Why it matters: Do not distribute floor over multiplication by an integer as an equality. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

64. A proof audit

Worked answer: State the direction of rounding, the allowed integers, and whether endpoints are included.

Why it matters: A correct formula is only useful when its interval and domain match the problem. This exact count or inequality should be traced to the defining floor or ceiling interval, rather than guessed from decimal rounding.

A seven-session JC2 practice plan

Session one focuses on floor and ceiling values at positive, negative and integer inputs. Ask students to write the defining double inequality for each answer. A tutor can diagnose an incorrect rounding direction immediately.

Session two introduces fractional parts and the identity x=⌊x⌋+{x}, with 0≤{x}<1. Prove the floor sum inequality and reflection identity. Change x from an integer to a noninteger to test whether a formula needs cases.

Session three uses floors for divisibility counts. Count multiples of seven up to one hundred and three-digit multiples of seven. Insist on an inclusive lower endpoint and explain why the formula subtracts multiples up to A−1.

Session four applies ceiling to pigeonhole reasoning. Use examples such as 53 students in twelve groups, and prove the guaranteed lower bound on some group’s size by contradiction.

Session five studies floor sums. Derive the sum Σ⌊k/2⌋ by pairing terms and prove it holds for arbitrary n, rather than stopping after a table for n=1,2,3.

Session six turns geometric regions into lattice-point counts. Fix one integer coordinate, solve for the other, use a floor bound and distinguish strict from non-strict inequalities on boundaries.

Session seven mixes floor identities, multiples and pigeonhole tasks without naming the desired method. The learner should choose whether a floor, ceiling, complement count or direct inequality is appropriate.

A parent can ask what happens if one more student needs a van, whether the number is negative or positive, and why an integer endpoint is included. A student who explains those choices is developing the proof skill rather than just selecting a calculator function.

The immutable eduKateSG three-student Mathematics reference near Sixth Avenue MRT describes a Secondary 1 programme. It does not establish a current JC2 H3 class. Enquire directly about current advanced Mathematics support.

The revision log should separate negative-rounding mistakes, endpoint errors, an incorrect divisor, confusion between a count of full groups and a count of required containers, and failure to prove a sum formula. Each category calls for a different repair.

Frequently asked questions

Are floor and ceiling separately listed H3 Mathematics topics?

The 2027 syllabus names mathematical proof, problem-solving heuristics, the pigeonhole principle, modular arithmetic and H2 knowledge. Floor and ceiling functions are useful enrichment techniques connecting these ideas.

Why is floor of −1.2 equal to −2?

Because −2 is the greatest integer no larger than −1.2. Rounding towards zero would give −1, which exceeds the number and is therefore not its floor.

What is the difference between floor and ceiling?

Floor is the greatest integer at most x; ceiling is the least integer at least x. At an integer, both have the same value.

Which one counts the number of vans required?

Use the ceiling of people divided by capacity, because any leftover group still requires another van. The floor instead counts only completely filled vans.

How many positive multiples of d are at most N?

For positive integers d and N, there are ⌊N/d⌋ multiples. Over an inclusive integer interval [A,B], subtract ⌊(A−1)/d⌋ from ⌊B/d⌋.

Can I split floor across addition?

Not always. The difference between ⌊x+y⌋ and ⌊x⌋+⌊y⌋ can be zero or one, depending on the fractional parts.

How does ceiling connect to the pigeonhole principle?

If N objects enter k boxes, some box contains at least ⌈N/k⌉ objects, since a smaller maximum capacity could not hold all N.

Why do strict endpoints matter?

An integer exactly at a closed boundary is included, while one at an open boundary is excluded. The difference can change a count by one.

Are floor-sum identities proofs or patterns?

A table is a discovery aid. A general proof uses arbitrary n, a pairing or another structure, and states why every term is counted exactly once.

How do I avoid calculator rounding mistakes?

Use the defining inequalities and exact fractions, especially for negative values and boundary points. Check the domain before interpreting a floor or ceiling.

Official syllabus and additional reading

The 2027 H3 Mathematics (9820) syllabus lists mathematical statements and proofs, the pigeonhole principle, modular arithmetic and problem-solving heuristics. This guide uses floor and ceiling functions to develop those specified competencies, not to claim a new required chapter.

Continue with induction and pigeonhole counting, modular arithmetic and inclusion–exclusion. The main lesson is to turn an informal rounding idea into an exact inequality that supports the count or proof.