Every way of signing a ± b ± c ± d gives the same parity
Question 1
Take the numbers 3, 5, 7 and 8, and put a + or a − before each of the last three. What is the parity of the eight possible results?
(a)All odd
(b)All even
(c)Positive results odd; negative results with no parity
(d)A mixture of odd and even
Show answer
(a) All odd
The sum is odd. Switching a sign changes the result by twice the corresponding number, which is even. Adding or subtracting an even number keeps an odd result odd. Therefore, all eight results are odd, including the negative results.
Question 2
1 + 2 + 3 + 5 = 11 and 1 - 2 - 3 - 5 = -9. What decides whether 11 and -9 have the same parity?
(a)The three minus signs
(b)The change, 2 × (2 + 3 + 5), which is even
(c)The minus sign of -9
Show answer
(b) The change, 2 × (2 + 3 + 5), which is even
Switching the sign before a number changes the value by twice that number. The two chains differ only in the signs before 2, 3 and 5. So the whole change is 2 × (2 + 3 + 5) = 20, which is even. An even change keeps the parity, so 11 and -9 have the same parity. The number of minus signs does not matter, since each switch moves the value by an even amount. A negative multiple of 2 is even in the same way a positive one is.
Numbers leaving a fixed remainder, and how remainders add
Question 3
In each expression, k can be any integer, chosen independently. How do the numbers generated by 6k + 2 and 6k - 4 compare?
(a)No numbers in common
(b)Exactly the same numbers
(c)Exactly one number in common
Show answer
(b) Exactly the same numbers
The expressions generate exactly the same numbers. Using k + 1 in the minus form gives . Using k - 1 in the plus form gives . These inputs are integers, so every number generated by either expression also occurs in the other.
Question 4
Does 3k + 5, for k = 1, 2, 3, …, give exactly the numbers that leave a remainder of 3 when divided by 5?
(a)No: only 5k + 3 gives them
(b)Yes: 3k + 5 is the rule for remainder 3
(c)No: 11 leaves remainder 1
Show answer
(c) No: 11 leaves remainder 1
No. For k = 1, 2, 3, 3k + 5 gives 8, 11, 14, and 11 leaves remainder 1 when divided by 5. The numbers that leave remainder 3 are 3, 8, 13, …, given by 5k + 3: the divisor 5 multiplies k and the remainder 3 is added.
Parity can be read off an expression without evaluating it
Question 5
For which integers is even?
(a)Only odd integers
(b)Only even integers
(c)Every integer x
Show answer
(b) Only even integers
Squaring preserves parity: an even integer has an even square, and an odd integer has an odd square. Two integers have an even sum exactly when they have the same parity. Since 10 is even, is even exactly when is even.
Question 6
Without multiplying, is 10 x 809 x 213 even or odd?
(a)Depends on the order of multiplication
(b)Even
(c)Odd
Show answer
(b) Even
The product is even. The factor 10 is a multiple of 2, so the whole product is a multiple of 2. The odd factors 809 and 213 do not change this. Changing the order of multiplication leaves the product unchanged.
Two even numbers add to a multiple of 4 when their remainders match
Question 7
Let and be whole numbers. Two even numbers are and . What is their sum?
(a)4(u + v)
(b)4(u + v) + 2
(c)4(u + v + 1)
Show answer
(c) 4(u + v + 1)
Adding gives , since . Taking out the common factor of 4 gives . This is a multiple of 4 because is a whole number.
Question 8
How many of these four sums are multiples of 4: , , , ?
(a)4
(b)2
(c)1
Show answer
(b) 2
The four sums are , , , and . Exactly two, and , are multiples of 4. Two even numbers give a multiple of 4 when their remainders on division by 4 are equal. The remainders can be 0 and 0, or 2 and 2. Remainders of 0 and 2 give a sum with remainder 2.
Which pairs of factors may be used to test a composite divisor
Question 9
A number passes the test for 5. Does that make it divisible by 40?
(a)Yes -- 5 and 8 multiply to 40
(b)No -- 10 is a counterexample
(c)Yes -- 5 is a factor of 40
Show answer
(b) No -- 10 is a counterexample
No -- 10 is divisible by 5 and is not divisible by 40. A single factor test can rule a number OUT for certain: failing the test for 5 means 40 is impossible, since 5 divides 40. What it cannot do is rule one in, because it says nothing about the part of 40 that 8 is responsible for. So the answer is not that nothing follows -- a great deal follows in the failing direction -- and it is not that the pair multiplying to 40 settles it either, since both tests still have to be passed.
How divisibility travels through sums, multiples and factors
Question 10
42 and 30 are multiples of 6. Which numbers must be multiples of 6?
(a)42 + 30, 42 - 30, and any two numbers that add up to 72
(b)42 + 30 and 42 - 30
(c)42 + 30 only
Show answer
(b) 42 + 30 and 42 - 30
Write the two numbers as 6a and 6b. Their sum is 6(a + b) and their difference is 6(a - b). Both carry the factor 6, so 6 divides 72 and 12. Taking whole groups away from whole groups leaves whole groups. The rule does not run backwards. For example, 32 + 40 = 72, but neither 32 nor 40 is a multiple of 6.
Cryptarithms: recovering digits from letters by reasoning
Question 11
In the cryptarithm , each letter stands for a digit. Different letters must stand for different digits. A number cannot begin with 0. Which digit assignment solves the cryptarithm?
(a)P = 1, Q = 3, R = 7, S = 8
(b)P = 0, Q = 7, R = 4, S = 2
(c)P = 1, Q = 2, R = 7, S = 2
Show answer
(a) P = 1, Q = 3, R = 7, S = 8
For P = 1, Q = 3, R = 7, S = 8, the multiplication is . All four letters stand for different digits, and each number begins with a nonzero digit. The other assignments either repeat a digit for different letters or put 0 at the start of PQ.
Why the digit sum decides divisibility by 9 and by 3
Question 12
459 is a multiple of 9. Its digits are reversed to give 954. Is 954 also a multiple of 9?
(a)Yes -- the digits still add to 18
(b)Only if dividing it by 9 confirms it, since the digit sum alone is not conclusive
(c)It has to be checked separately, number by number
Show answer
(a) Yes -- the digits still add to 18
Yes, and it is certain rather than lucky. The test for 9 reads only the SUM of the digits, and reversing rearranges the digits without adding or removing any, so the sum is still 18 -- a multiple of 9 -- and so is 954. This is why Sreelatha is right about every multiple of 9, not just the ones she tried, and why any other shuffle of the digits works too. The rule runs in both directions: a digit sum divisible by 9 does not merely suggest that 954 is a multiple of 9, it settles it, so no division is needed to confirm the answer.
Writing a number as a sum of place values, and what that settles
Question 13
Which number is divisible by 4?
(a)531
(b)532
(c)530
Show answer
(b) 532
For divisibility by 4, check the last two digits. For 532, these form 32, and 32 = 4 × 8. So 532 is divisible by 4. For 530, the last two digits form 30, which is not a multiple of 4. Its units digit alone gives the wrong answer. The remaining option, 531, is odd, so it cannot be divisible by 4.
Why the digits alternate in sign when testing for 11
Question 14
How much must be ADDED to 7025 to reach the next multiple of 11?
(a)-4
(b)4
(c)7
Show answer
(b) 4
4. The alternating sum of 7025 is -4, so 7025 is 4 short of a multiple of 11 -- which is exactly the amount that has to be added. The number 7 answers the other half of the same fact: it is how far 7025 sits ABOVE the multiple below it, and the two add to 11. Both describe the same position and only one of them was asked for. The value -4 itself is the signed shortfall and is not an amount to add.
The digital root, and why it is the remainder on division by 9
Question 15
What is the digital root of 58396?
(a)31
(b)4
(c)6
Show answer
(b) 4
The digital root is 4. Adding the digits of 58396 gives 31. Adding the digits of 31 gives 4. Repeat if needed until one digit remains: 4. Stopping at 31 is too soon because it still has two digits. The units digit 6 alone does not give the digital root.
Can a pattern of examples establish a number rule?
Wrong
If n² + n + 41 is prime for the first several whole numbers, it must always be prime.
Why it feels right. A long run of matches feels like proof.
Right
A rule that claims to work for every number fails if even one example breaks it.
Worked example
Small inputs
n = 0: 41→n = 1: 43→n = 2: 47
Counterexample
n = 40→1,681→41 × 41
Several successes do not rule out a counterexample. At n = 40 the output is 41 squared.
At n = 0, 1 and 2 the outputs are 41, 43 and 47.
At n = 40, the output is 40² + 40 + 41 = 41², a composite number.
Cookies
We use cookies, including Meta’s and, if a ChatGPT advert brought
you, OpenAI’s, to see how visitors find us.
They are never used on your child’s screens in the app. You can turn them
off here, and change your mind any time.
Privacy policy