How to use this set
Here are twelve questions covering the whole chapter: factorisation, HCF and LCM, and irrationality. Try each one honestly before you look at its answer. When a question says "without dividing" or "without factorising", take that seriously; the restriction is the whole point. It checks whether you can reason from prime factorisations instead of grinding through the arithmetic.
One piece of advice from experience: in the exam, marks are lost far more often to a wrong prime factorisation than to a wrong method. So check every factorisation by multiplying back.
Section A, Factorisation
- Express as a product of prime powers: (a) , (b) , (c) .
- A number is . Write down three different factors of it that are greater than .
- Explain why can never end in the digit , for any natural number .
Section B, HCF and LCM
- Find the HCF and LCM of and by prime factorisation, then verify product.
- Given , find the LCM without factorising.
- Find the LCM of , and .
- Three wires of lengths cm, cm and cm are cut into equal pieces of the greatest possible length, with nothing left over. Find that length and the total number of pieces.
- Two lights flash at intervals of seconds and seconds respectively, and flash together at am. At what time do they next flash together?
Section C, Irrational numbers
- Prove that is irrational.
- Prove that is irrational, given that is irrational.
- State whether each is rational or irrational, with a reason: (a) , (b) , (c) .
- A student writes: "The sum of two irrational numbers is always irrational." Give a counterexample.
Answers
Show answers
-
(a) . (b) . (c) .
-
Any three of, for example, , , , . Each uses only primes available, with exponents no larger than those in the number.
-
Ending in requires divisibility by , so a factor must appear. But contains only the primes and , and by unique factorisation no can appear.
-
and . Common prime , smaller exponent , so . All primes, larger exponents: . Check: . ✓
-
. Divide first: , so .
-
, , share no prime, so the LCM is the product: .
-
, , . Common: . Greatest length cm, giving pieces.
-
, , so seconds minutes. They next flash together at am.
-
Assume with sharing no factor. Then , so , and since is prime, . Put : , so , giving . Both are divisible by , contradicting the assumption.
-
Suppose is rational. Then , which is a difference of rationals divided by a rational, hence rational. That contradicts being irrational.
-
(a) Rational, . (b) Rational, . (c) Irrational, , a non-zero rational times an irrational.
-
and are both irrational, and their sum is , which is rational. (Equally, and sum to .)