- Foundation
- About 16 min
- 5 practice questions
Proving propositions and converses about numbers
Prove simple divisibility propositions using algebra, decide whether their converses hold, and follow the factor-pair argument that a number has an odd number of factors exactly when it is a perfect square.
If something looks wrong, please tell us.
By the end of this lesson you can
- Write a short proof of a divisibility proposition using 'n = k × something'.
- Decide whether the converse of a divisibility proposition is true, with a proof or a counterexample.
- Explain, using factor pairs, why perfect squares and numbers with an odd number of factors are the same numbers.
A counterexample shows a proposition is false. To show one is true, we need a proof: an argument that works for every case at once. Number facts are a good place to practise, because algebra lets us talk about all numbers together.
Proving a divisibility proposition
'n is a multiple of 6' means n = 6k for some whole number k. Writing it this way turns words into algebra we can work with.
Worked example 1: multiples of 6 and of 3
Proposition P: 'If n is a multiple of 6, then n is a multiple of 3.'
Proof: if n is a multiple of 6, then n = 6k for some whole number k. Since 6 = 3 × 2, n = 3 × (2k). As 2k is a whole number, n is 3 times a whole number, so n is a multiple of 3. P is true.
Converse Q: 'If n is a multiple of 3, then n is a multiple of 6.' Try 9: 9 = 3 × 3, so it is a multiple of 3, but 9 ÷ 6 = 1.5 is not whole. Q is false, with counterexample 9.
Worked example 2: a converse that depends on the numbers
P: 'If n is divisible by 40, then n is divisible by both 4 and 10.' Proof: n = 40k = 4 × (10k) and n = 10 × (4k), so P is true.
Converse: 'If n is divisible by both 4 and 10, then n is divisible by 40.' Try 20: 20 = 4 × 5 and 20 = 10 × 2, but 20 ÷ 40 is not whole. The converse is false.
Compare: 'If n is divisible by 20, then it is divisible by both 4 and 10.' Here the converse is true, because the smallest number divisible by both 4 and 10 (their LCM) is 20, and every common multiple of 4 and 10 is a multiple of 20. Whether a converse holds depends on the details, so always check.
Perfect squares and the number of factors
Every factor of a number has a partner: the factor you multiply it by to get the number. For 36 the factor pairs are (1, 36), (2, 18), (3, 12), (4, 9) and (6, 6). Factors usually come two at a time, so they are counted in twos, except when a factor is its own partner, as 6 is for 36. That happens exactly when the number is f × f, a perfect square.
| Number | Factor pairs | Number of factors | Perfect square? |
|---|---|---|---|
| 28 | (1, 28), (2, 14), (4, 7) | 6 | No |
| 36 | (1, 36), (2, 18), (3, 12), (4, 9), (6, 6) | 9 | Yes, 6 × 6 |
| 49 | (1, 49), (7, 7) | 3 | Yes, 7 × 7 |
Proving Q: odd number of factors means a perfect square
- n has an odd number of factors
- Some factor must be its own partner If every factor had a different partner, they would pair off into an even count
- That factor f satisfies f × f = n
- n is a perfect square
This chain proves Q: 'If n has an odd number of factors, then n is a perfect square.' It does not prove the other direction, P: 'If n is a perfect square, then n has an odd number of factors.' To prove P we start from n = f × f, so f pairs with itself. Could a second factor g also pair with itself? Then g × g = n = f × f, and two different positive numbers cannot have the same square. So exactly one factor pairs with itself and all others pair off: the count is (an even number) + 1, which is odd. P is true too. The two statements imply each other.
A positive whole number has an odd number of factors if and only if it is a perfect square.
Worked example 3: digit sums and 3
The divisibility test for 3 can be written as two propositions. P: 'If a number is divisible by 3, then the sum of its digits is divisible by 3.' Q: 'If the sum of a number's digits is divisible by 3, then the number is divisible by 3.' Both are true, which is exactly why the test works in both directions. For 4,251: digit sum 4 + 2 + 5 + 1 = 12, divisible by 3, and 4,251 = 3 × 1,417. For 4,252: digit sum 13, not divisible by 3, and 4,252 = 3 × 1,417 + 1.
Key takeaways
- To prove a divisibility proposition, write the number as k times something and rearrange.
- Prove each direction separately: an argument for P does not prove its converse.
- Factors come in partner pairs; only a perfect square has a factor that is its own partner.
- A number has an odd number of factors if and only if it is a perfect square.
Check your understanding
-
1. Which argument proves 'If n is a multiple of 6, then n is a multiple of 3'?
- 9 is a multiple of 3 but not of 6.
- n = 6k = 3 × (2k), so n is 3 times a whole number.
- 6 and 12 are both multiples of 3, so it is always true.
- 3 + 3 = 6, so the statement is true.
Show answer
Answer: B. A proof must work for every multiple of 6. Writing n = 6k = 3 × (2k) shows any such n is 3 times the whole number 2k. Checking 6 and 12 only covers two cases, and 9 is a counterexample to the converse, not a proof of P.
-
2. Which of these numbers has an odd number of factors?
- 48
- 50
- 64
- 72
Show answer
Answer: C. Only perfect squares have an odd number of factors, and 64 = 8 × 8. Its factors are 1, 2, 4, 8, 16, 32, 64: seven of them. 48, 50 and 72 are not perfect squares, so their factors pair off into an even count.
-
3. P: 'If n is divisible by 40, then n is divisible by both 4 and 10.' Which statement about its converse is correct?
- The converse is true, because 40 = 4 × 10.
- The converse is false; 40 is a counterexample.
- The converse is false; 80 is a counterexample.
- The converse is false; 20 is divisible by 4 and by 10 but not by 40.
Show answer
Answer: D. The converse says: if n is divisible by 4 and 10, then by 40. But 20 = 4 × 5 = 10 × 2 is divisible by both, and 20 ÷ 40 = 0.5 is not whole. 40 and 80 are divisible by 40, so they agree with the converse and cannot be counterexamples.
-
4. Which pair of statements about a whole number n imply each other?
- 'n is divisible by 3' and 'the sum of the digits of n is divisible by 3'
- 'n is divisible by 2' and 'n is divisible by 4'
- 'n is odd' and 'n is prime'
- 'n is a multiple of 5' and 'n ends in 5'
Show answer
Answer: A. The divisibility test for 3 works in both directions, so these imply each other. The others fail one way: 6 is divisible by 2 but not 4; 9 is odd but not prime; 10 is a multiple of 5 but ends in 0.
-
5. An argument runs: 'n has an odd number of factors, so some factor is its own partner, so n = f × f.' What has it proved?
- If n is a perfect square, then n has an odd number of factors.
- Every number has an odd number of factors.
- If n has an odd number of factors, then n is a perfect square.
- Both directions at once.
Show answer
Answer: C. The argument starts from 'odd number of factors' (its condition) and ends at 'n is a perfect square' (its conclusion), so it proves exactly that direction. The other direction needs its own argument: that no second factor can also be its own partner.
Sign in to keep track of the lessons you finish.