Intuition What this page does
The parent note gave you the rules. Here we stress-test them against every kind of input you could ever be handed: fractions that terminate, fractions that repeat, negatives, denominators equal to 1, whole numbers, "mixed" repeaters, and even a trap question that looks rational but isn't. Each worked example is tagged with the exact cell of the matrix it lives in, so by the end you have seen the whole map — no blind spots.
Before solving anything, let us lay out the full battlefield. Every rational-decimal problem you meet is one of these case classes :
#
Case class
What makes it special
Covered by
A
Terminating, denom = 2 a 5 b
division just stops
Ex. 1
B
Pure repeating, one prime = 2 , 5
remainder loops, decimal point right before the loop
Ex. 2
C
Mixed repeating (both a 2/5 part and another prime)
some digits settle, then a loop starts
Ex. 3
D
Negative numerator / sign handling
where does the minus go?
Ex. 4
E
Denominator = 1 (integer / degenerate)
"decimal" that is just a whole number
Ex. 5
F
Zero numerator (degenerate)
0/ q for any q
Ex. 5
G
Repeating decimal → fraction (reverse direction)
the "multiply and subtract" trick
Ex. 6
H
Limiting value: 0. 9
the famous edge case where a repeat equals a terminator
Ex. 7
I
Word problem (real-world units)
translate, then classify
Ex. 8
J
Exam-style twist: "for which n does n 1 terminate?"
reasoning about the whole family at once
Ex. 9
Two tools do all the work, so let us name them up front.
Definition The two questions we keep asking
"Does it stop?" — factor the denominator (in lowest terms). If the only prime factors are 2 and 5 , it terminates. Otherwise it repeats. This is Prime factorization applied to the bottom of a fraction.
"Where does it loop?" — do long division and watch the remainders . A remainder can only be 0 , 1 , 2 , … , q − 1 , so within q steps one must reappear, and from there the digits copy themselves. Watching remainders is really Modular arithmetic in disguise: each remainder is "the numerator so far, mod q ".
Look at the figure: the horizontal bar is the number line of possible remainders 0 to q − 1 . Long division walks along it, and because there are only finitely many slots, the walk must eventually step onto a slot it already stamped — that is the moment repetition is born (unless it lands on 0 first, which is termination).
Worked example Example 1 · cell A
Write 40 9 as a decimal.
Forecast: Guess now — will this stop or loop? Look only at 40 .
Factor the denominator. 40 = 2 3 ⋅ 5 1 .
Why this step? The rule from the parent note says a fraction terminates iff the denominator (in lowest terms) has only 2 s and 5 s. g cd( 9 , 40 ) = 1 , so it is already lowest terms, and 40 passes the test — it will stop.
Balance the powers of 2 and 5. We have three 2 s but only one 5 . To make a power of ten 1 0 n = 2 n 5 n , the exponents must match. The bigger exponent is 3 , so we need 1 0 3 . Multiply top and bottom by 5 2 = 25 :
40 9 = 2 3 5 1 9 = 2 3 5 3 9 ⋅ 5 2 = 1000 225 .
Why this step? A denominator of 1 0 3 means "move the decimal point 3 places" — that is what base ten is .
Read off the decimal. 1000 225 = 0.225 .
Verify: 0.225 × 40 = 9 ✓. And it stopped after exactly max ( a , b ) = max ( 3 , 1 ) = 3 digits, exactly as the balancing predicted.
Worked example Example 2 · cell B
Write 11 4 as a decimal.
Forecast: 11 is prime and it is not 2 or 5 . Stop or loop?
Classify. 11 is a prime other than 2 or 5 , so this repeats , and since 11 shares no factor of 2 or 5 with the numerator, the repeat starts right after the decimal point (a pure repeater).
Why this step? Only a 2 /5 part in the denominator can produce non-repeating "settling" digits; here there is none.
Long division, tracking remainders.
40 ÷ 11 = 3 , remainder 7 .
70 ÷ 11 = 6 , remainder 4 ← remainder 4 is the one we started with.
Why this step? The instant a remainder reappears, every future step is a copy — that is the loop.
Read the repetend. The digits produced between the first "4 " remainder and its return are 3 , 6 :
11 4 = 0. 36 .
Length 2 , and ϕ ( 11 ) = 10 ; 2 divides 10 ✓ (matches Euler's totient function as an upper bound, per the parent note).
Verify: 0. 36 = 99 36 = 11 4 ✓ (we reverse this move in Example 6).
Worked example Example 3 · cell C
Write 60 7 as a decimal.
Forecast: 60 has 2 s, 5 s and a 3 . What happens when a denominator carries both kinds of prime?
Factor. 60 = 2 2 ⋅ 3 ⋅ 5 . Lowest terms already (g cd( 7 , 60 ) = 1 ).
Why this step? The presence of the extra prime 3 guarantees a repeat; the 2 2 ⋅ 5 part will produce a short non-repeating lead-in.
Predict the shape. Split off the 2/5 part. The largest 2 /5 exponent is 2 (from 2 2 ), so 2 digits settle before the loop begins.
Why this step? Multiplying by 1 0 2 absorbs the 2 2 ⋅ 5 influence, leaving a pure repeater over the leftover 3 .
Long division.
70 ÷ 60 = 1 , remainder 10 .
100 ÷ 60 = 1 , remainder 40 .
400 ÷ 60 = 6 , remainder 40 ← remainder 40 repeats.
60 7 = 0.11 6 .
The "11 " is the settling part, "6 " is the loop.
Verify: 0.11 6 = 0.11 + 0.00 6 . Now 0.00 6 = 900 6 = 150 1 , and 0.11 = 100 11 = 150 16.5 … cleaner: 60 7 = 0.1166 … ; check 0.11666 × 60 ≈ 7.0 ✓. Exact check in VERIFY.
Worked example Example 5 · cells E and F
(a) Write 1 6 as a decimal. (b) Write 17 0 as a decimal.
Forecast: These look silly — but the definition q p still applies. Are they rational? Terminating?
(a) Denominator = 1 . 1 = 2 0 ⋅ 5 0 — an empty product of 2 s and 5 s, which still counts.
Why this step? a = b = 0 satisfies q = 2 a 5 b , so by the rule it terminates. Indeed 1 6 = 6 = 6.0 : it "terminates" after zero decimal digits. Every integer is a terminating rational — this is why Real numbers contain Z as terminating decimals.
(b) Zero numerator. 17 0 = 0 for any nonzero denominator.
Why this step? 0 divided by anything (nonzero) is 0 ; the denominator never gets to matter because the division ends immediately with remainder 0 . So 17 0 = 0.0 , terminating — even though 17 is a "bad" prime! The lesson: the denominator rule assumes lowest terms , and 17 0 reduces to 1 0 .
Verify: (a) 6.0 × 1 = 6 ✓. (b) 0 × 17 = 0 ✓, and g cd( 0 , 17 ) = 17 so lowest terms is 1 0 ✓.
Worked example Example 6 · cell G
Convert 0. 36 back to a fraction (this is the reverse of Example 2).
Forecast: The repetend is 2 digits. What power of ten will we multiply by?
Name it. Let x = 0. 36 = 0.363636 …
Shift by one full period. Repetend length is 2 , so multiply by 1 0 2 = 100 :
100 x = 36.363636 …
Why this step? Shifting by exactly one period lines the tails up so they cancel.
Subtract.
100 x − x = 36.3636 … − 0.3636 … ⇒ 99 x = 36.
Why this step? The infinite repeating tails are identical, so their difference is 0 — the whole point.
Solve and reduce. x = 99 36 = 11 4 .
Verify: matches Example 2 exactly ✓. Note 99 = 1 0 2 − 1 , the fingerprint of a length-2 pure repeater.
Worked example Example 7 · cell H
What fraction is 0. 9 ?
Forecast: Trust your gut — bigger than, smaller than, or equal to 1 ?
Apply the same machine. x = 0. 9 , repetend length 1 , multiply by 10 :
10 x = 9.999 …
Subtract. 10 x − x = 9.999 … − 0.999 … ⇒ 9 x = 9 ⇒ x = 1 .
Why this step? Identical tails cancel, and there is no rounding — this is an exact equation.
Interpret. 0. 9 = 1 exactly . This is not an approximation; it is the same point on the number line.
Why this matters: a "repeating" decimal and a "terminating" decimal can name the same number. So the terminate-vs-repeat labels describe a way of writing , not two disjoint sets of numbers — a subtlety about how rationals sit inside Real numbers .
Verify: 3 1 + 3 2 = 0. 3 + 0. 6 = 0. 9 and also = 1 ✓.
Worked example Example 8 · cell I
A recipe splits 2 litres of syrup equally among 16 jars. Does each jar's amount have an exact (terminating) decimal, and what is it in millilitres?
Forecast: 16 — friendly or nasty?
Set up the fraction. Each jar gets 16 2 = 8 1 litres.
Why this step? Reduce to lowest terms before testing the denominator, or the rule can mislead (see Example 5b).
Classify. 8 = 2 3 — only 2 s ⇒ terminates .
Convert. 8 1 = 1000 125 = 0.125 litres.
Units. 0.125 L × 1000 = 125 mL per jar.
Why this step? Litres → millilitres is × 1000 ; the exact decimal makes the mL an exact whole number — handy for a measuring cup.
Verify: 125 mL × 16 = 2000 mL = 2 L ✓.
Worked example Example 9 · cell J
For which n in { 1 , 2 , … , 20 } does n 1 have a terminating decimal?
Forecast: Guess how many of the twenty qualify.
State the criterion. n 1 terminates ⟺ n = 2 a 5 b .
Why this step? g cd( 1 , n ) = 1 always, so n 1 is already in lowest terms — the denominator test applies directly.
List the 2 a 5 b numbers up to 20 . Take products of 2 s and 5 s:
1 , 2 , 4 , 5 , 8 , 10 , 16 , 20.
Why this step? Systematically: 2 a gives 1 , 2 , 4 , 8 , 16 ; multiply each by 5 0 or 5 1 (and 5 2 = 25 is already > 20 ) to catch 5 , 10 , 20 .
Count. That is 8 values of n .
Every other n (like 3 , 6 , 7 , 9 , 11 , 12 , 13 , 14 , 15 , 17 , 18 , 19 ) carries a forbidden prime and therefore repeats.
Verify: the set is { 1 , 2 , 4 , 5 , 8 , 10 , 16 , 20 } , size 8 ✓ (checked in VERIFY).
Common mistake The trap in Example 5b
Do not classify by looking at the denominator before reducing . 17 0 , 17 34 = 2 , or 17 51 = 3 all reduce to a denominator of 1 and terminate, even though 17 is a "bad" prime. Reduce first, then test.
Recall Quick self-check
Does 28 7 terminate? ::: Reduce first: 28 7 = 4 1 = 0.25 . Yes — 4 = 2 2 .
Why must a long division of q p eventually repeat or stop? ::: Only q possible remainders (0 to q − 1 ); by pigeonhole one must recur (or hit 0 ).
What number does 0. 9 equal? ::: Exactly 1 .
Does the length of the repetend of n 1 have to be n − 1 ? ::: No — it divides ϕ ( n ) ; it can be much shorter.