Exercises — Real number system — ℕ ⊂ ℤ ⊂ ℚ ⊂ ℝ
Before we start, one number line to anchor every symbol we use. Keep this picture open — almost every exercise below points back to it (which coloured mark is my number?).

Look at the picture: the hollow orange dots are integers (whole positions, no fraction), the teal ticks are a few rationals squeezed between them, and the plum cross at sits in a gap the rationals never land on. Every exercise below is really asking: which of these coloured things is my number?
Level 1 — Recognition
Recall Solution
"Smallest set" means: go as far left in the chain as the number still fits. Locate each on the number-line figure above — orange dot, teal tick, or plum-style gap?
- : a counting number (an orange-dot type) → smallest set is .
- : negative, so not natural, but whole → .
- : a ratio of integers, not whole (a teal-tick type) → .
- : simplify first! is a counting number → .
- : is not a perfect square, so this cannot be (a plum-cross type, in a gap) → smallest set is (it is irrational, and irrationals live only in ).
Recall Solution
- (a) False under the convention used in the parent note (0 starts ).
- (b) True: , a ratio of integers.
- (c) True: any integer .
- (d) False: but .
Level 2 — Application
Recall Solution
Why the midpoint? For any two numbers with , adding to both sides of gives , and adding gives ; dividing by (which preserves order since ): So the average always lands strictly between — that is the on-page proof. Now compute it: A sum/quotient of rationals is rational, so . Check: . ✓ So .
Recall Solution
The block "27" has length , so multiply by to shift one whole block left: Subtract to kill the infinite tail: Lowest terms since . So . (See Decimal Representations.)
Recall Solution
Closure = every result of the operation stays inside .
- Addition: . Not closed.
- Multiplication: all products , and anything ; every result is in . Closed.
(This mirrors the parent's example — see Properties of Operations.)
Level 3 — Analysis
Recall Solution
Tool: "rational + irrational = irrational" — why? If is rational and were rational, then would be a difference of rationals, hence rational — contradiction. So the sum is irrational.
- (a) . The irrational parts cancel → (equals ).
- (b) Suppose . Square: , so . But is not a perfect square, so is irrational — contradiction. → .
- (c) → .
Moral: never trust the surface form — simplify and reason.
Recall Solution
Recall from the definition box: means " divides ", and lowest terms means . Assume in lowest terms. Then , so . Key fact (the tool): is prime, so . (Why: a prime dividing a product must divide one of the factors — here the two factors are both ; this is Euclid's lemma, a consequence of the FTA cited above.) Write : So and , contradicting . Hence is irrational. □ What replaced "even/odd"? The step "" becomes "", which works because is prime. This same argument works for whenever is not a perfect square (see Number Theory Fundamentals).
Level 4 — Synthesis

Recall Solution
(i) Rational: take the midpoint . Why is rational? A terminating decimal is a fraction over a power of ten: so , and by the midpoint inequality . ✓ (ii) Irrational: we claim lies in . Justify by squaring (squaring preserves order for positive numbers): and . Since and everything is positive, . And is irrational (parent proof). ✓ See the figure: the interval is blown up, the teal tick at and the plum cross at both sit inside. Big idea: both and the irrationals are dense — every interval, however short, contains infinitely many of each.
Recall Solution
Sum: and . Each is irrational (if were rational, would be rational — false). Their sum . Product: and (or ). Then , and . Both factors irrational, product rational. Lesson: the irrationals fail closure under both and — reinforcing that they do not form a field.
Recall Solution
is countable (zig-zag list of , see Cardinality and Infinity), so . But (via Cantor's Diagonal Argument). If the irrationals were also countable, then would be a union of two countable sets, hence countable — contradiction. So the irrationals are uncountable. Precise meaning of "almost every": you cannot list all reals, yet you can list all rationals; in the sense of cardinality the rationals are a vanishingly thin slice () of the uncountable continuum (). "Almost every real is irrational" = the exceptions (rationals) form a countable set.
Level 5 — Mastery
Recall Solution
() not a perfect square irrational. Suppose in lowest terms, . Then . If , then by the Fundamental Theorem of Arithmetic (every integer has a prime divisor — cited in the definition box) pick a prime with . From we get , and since is prime, (Euclid's lemma) — contradicting . Hence , giving , a perfect square. Contrapositive: if is not a perfect square, no such exists, so is irrational. () contrapositive: if is a perfect square, then , so it is rational. Combining both directions gives the "iff". □
Recall Solution
Consider . Either is rational or it is irrational.
- Case 1: is rational. Take (both irrational). Done — is rational.
- Case 2: is irrational. Take (irrational by assumption) and . Then In either case a valid pair exists. The beauty: we never had to decide which case is true! (This concerns Algebraic vs. Transcendental Numbers deeply, but the logic needs no such classification.)

Recall Solution
First, two distinct ideas (do not confuse them):
- The Archimedean property: for any real there is a natural number with — "no real is bigger than every natural". This is what we use here.
- The Completeness Axiom (a different statement): has no gaps — every bounded set has a least upper bound. It implies the Archimedean property but is not the same thing. We only need the Archimedean property below.
Recall = greatest integer (from the definition box). Step 1 — pick a fine enough denominator. Since , by the Archimedean property choose with , so . Why: we want a grid of spacing the gap, so a grid point is forced inside (see the figure: the ruler ticks are closer together than the gap). Step 2 — pick the numerator. Let , the first integer with . Then Step 3 — conclude. So , and . Since were any reals (including irrationals), a rational sits between any two reals. □
Recall Self-test summary
One-line takeaway per level ::: L1 simplify before you classify; L2 run midpoint & -shift procedures; L3 pick the right prime-divisibility / cancellation tool; L4 combine density + counting; L5 prove the general theorems. Does density of imply ? ::: No — dense but countable; is uncountable, so infinitely many irrational gaps remain.
Related deep threads: Dedekind Cuts, Continuum Hypothesis.