Choose any \(3\) numbers. When is their sum divisible by \(3?\) Explore all possible cases and generalise.
CBSE Class 8 Maths · Number Play
CBSE Class 8 Maths · Number Play
Imagine sorting balls into three buckets labelled 0, 1, and 2. Every number lands in exactly one bucket based on what is left over after dividing by 3. When you pick three numbers, their sum is divisible by 3 only if the bucket labels add up to 3 or 0. All three labels matching — like 1, 1, 1 — works perfectly. So does having one ball from each bucket — like 0, 1, 2. You never need to add the big numbers; just check the small leftover labels.
Answer: The sum of any three numbers is divisible by 3 if and only if the sum of their remainders on division by 3 is divisible by 3. This happens when the three remainders are all equal, that is \( (0,0,0) \), \( (1,1,1) \), or \( (2,2,2) \), or when they are all different, that is one each of \( 0 \), \( 1 \), and \( 2 \). In symbols, if \( a = 3q_1 + r_1 \), \( b = 3q_2 + r_2 \), \( c = 3q_3 + r_3 \), then \( a + b + c \) is divisible by 3 exactly when \( r_1 + r_2 + r_3 \) is divisible by 3.
When any number is divided by 3, it leaves a remainder of \( 0 \), \( 1 \), or \( 2 \). So every whole number can be sorted into one of three groups based on its remainder when divided by 3. The key idea is: a sum of numbers is divisible by 3 exactly when the sum of their remainders is divisible by 3. This is because each number can be written as a multiple of 3 plus its remainder, and the multiples of 3 part never affects divisibility. So instead of checking the big sum directly, we only need to add up the three remainders and see if that small total is divisible by 3.
A number \( n \) can be written as \( n = 3q + r \), where \( r = 0, 1, \) or \( 2 \). The sum \( a + b + c \) is divisible by 3 if and only if \( (r_1 + r_2 + r_3) \) is divisible by 3.
The sum of any three numbers is divisible by 3 if and only if the sum of their remainders on division by 3 is divisible by 3. This happens when the three remainders are all equal, that is \( (0,0,0) \), \( (1,1,1) \), or \( (2,2,2) \), or when they are all different, that is one each of \( 0 \), \( 1 \), and \( 2 \). In symbols, if \( a = 3q_1 + r_1 \), \( b = 3q_2 + r_2 \), \( c = 3q_3 + r_3 \), then \( a + b + c \) is divisible by 3 exactly when \( r_1 + r_2 + r_3 \) is divisible by 3.
A common mistake is thinking that all three numbers must themselves be divisible by 3. That is only one case; the sum can also be divisible by 3 when the numbers have different remainders, such as \( 4 + 7 + 10 = 21 \), where none of the numbers is a multiple of 3.
The sum of any three numbers is divisible by 3 if and only if the sum of their remainders on division by 3 is divisible by 3. This happens when the three remainders are all equal, that is \( (0,0,0) \), \( (1,1,1) \), or \( (2,2,2) \), or when they are all different, that is one each of \( 0 \), \( 1 \), and \( 2 \). In symbols, if \( a = 3q_1 + r_1 \), \( b = 3q_2 + r_2 \), \( c = 3q_3 + r_3 \), then \( a + b + c \) is divisible by 3 exactly when \( r_1 + r_2 + r_3 \) is divisible by 3.
One common mistake: students check whether each individual number is divisible by 3 rather than checking the sum of their remainders — for example, they might think that because 4 and 7 are not divisible by 3, the sum 4 + 7 + 10 cannot be divisible by 3, which is wrong. It is the combined remainder total that matters, not the remainders individually.
Answer: The sum of any three numbers is divisible by 3 if and only if the sum of their remainders on division by 3 is divisible by 3. This happens when the three remainders are all equal, that is \( (0,0,0) \), \( (1,1,1) \), or \( (2,2,2) \), or when they are all different, that is one each of \( 0 \), \( 1 \), and \( 2 \). In symbols, if \( a = 3q_1 + r_1 \), \( b = 3q_2 + r_2 \), \( c = 3q_3 + r_3 \), then \( a + b + c \) is divisible by 3 exactly when \( r_1 + r_2 + r_3 \) is divisible by 3.
Question: Choose any 4 consecutive integers starting from some integer \(n\). Show that their sum is always divisible by 2 but explore, using the idea of remainders mod 3, in which cases the sum of the first three of those four consecutive integers is divisible by 3. List all cases and generalise.
Solution: Let the three consecutive integers be \(n\), \(n+1\), and \(n+2\). Their sum is \[n + (n+1) + (n+2) = 3n + 3 = 3(n+1).\] Since the sum equals \(3(n+1)\), it is always a multiple of 3, regardless of the value of \(n\). To understand this using remainders, every integer \(n\) belongs to one of three remainder classes when divided by 3. Case 1: \(n\) has remainder 0, so \(n = 3q\). Then \(n+1\) has remainder 1 and \(n+2\) has remainder 2. Sum of remainders: \[0 + 1 + 2 = 3,\] which is divisible by 3. Case 2: \(n\) has remainder 1, so \(n = 3q + 1\). Then \(n+1\) has remainder 2 and \(n+2\) has remainder 0. Sum of remainders: \[1 + 2 + 0 = 3,\] which is divisible by 3. Case 3: \(n\) has remainder 2, so \(n = 3q + 2\). Then \(n+1\) has remainder 0 and \(n+2\) has remainder 1. Sum of remainders: \[2 + 0 + 1 = 3,\] which is divisible by 3. In every case the sum of the three remainders is 3, which is divisible by 3. This confirms algebraically that three consecutive integers always have a sum divisible by 3, because their remainders are always \(\{0, 1, 2\}\) in some order, and \(0 + 1 + 2 = 3\).
Answer: The sum of any three consecutive integers is always divisible by 3, because their remainders mod 3 are always 0, 1, and 2 in some order, and \(0 + 1 + 2 = 3\) is divisible by 3.
Question: Pick any three integers from the set \(\{4, 7, 10, 13, 16, 19\}\). Investigate when their sum is divisible by 3. Explore all possible cases by looking at the remainders of these numbers when divided by 3, and state a generalisation.
Solution: First, find the remainder of each element when divided by 3. \[4 = 3 \times 1 + 1 \quad \Rightarrow \text{ remainder } 1\] \[7 = 3 \times 2 + 1 \quad \Rightarrow \text{ remainder } 1\] \[10 = 3 \times 3 + 1 \quad \Rightarrow \text{ remainder } 1\] \[13 = 3 \times 4 + 1 \quad \Rightarrow \text{ remainder } 1\] \[16 = 3 \times 5 + 1 \quad \Rightarrow \text{ remainder } 1\] \[19 = 3 \times 6 + 1 \quad \Rightarrow \text{ remainder } 1\] Every element of the set has remainder 1 when divided by 3. So any three numbers chosen from this set have remainders \(r_1 = 1\), \(r_2 = 1\), \(r_3 = 1\). Sum of remainders: \[1 + 1 + 1 = 3,\] which is divisible by 3. Let the three chosen numbers be \(3a + 1\), \(3b + 1\), and \(3c + 1\). Their sum is \[(3a + 1) + (3b + 1) + (3c + 1) = 3a + 3b + 3c + 3 = 3(a + b + c + 1).\] Since the sum equals \(3(a + b + c + 1)\), it is always divisible by 3. For example, choosing 4, 13, and 19: \[4 + 13 + 19 = 36 = 3 \times 12.\] Divisible by 3. Confirmed. Generalisation: If all three chosen numbers have the same remainder when divided by 3 (all remainder 0, all remainder 1, or all remainder 2), their sum is divisible by 3. In this problem, every number in the set has remainder 1, so every possible choice of three numbers from the set gives a sum divisible by 3.
Answer: The sum of any three numbers chosen from \(\{4, 7, 10, 13, 16, 19\}\) is always divisible by 3, because every element of the set has remainder 1 when divided by 3, and \(1 + 1 + 1 = 3\) is divisible by 3.
Question: Choose any 4 whole numbers. Explore all possible cases and determine when their sum is divisible by 4. Write each number in the form \( 4q + r \) where \( r \in \{0, 1, 2, 3\} \), and generalise which combinations of remainders make the sum divisible by 4.
Answer: The sum of any four whole numbers is divisible by 4 if and only if the sum of their individual remainders on division by 4 is divisible by 4. Writing \( a = 4q_1 + r_1 \), \( b = 4q_2 + r_2 \), \( c = 4q_3 + r_3 \), \( d = 4q_4 + r_4 \), the condition is that \( r_1 + r_2 + r_3 + r_4 \) is a multiple of 4. Valid remainder combinations include \( (0,0,0,0) \), \( (1,1,1,1) \), \( (2,2,2,2) \), \( (3,3,3,3) \), \( (0,0,2,2) \), \( (0,1,1,2) \), \( (1,1,3,3) \), \( (0,3,3,2) \), \( (1,2,3,2) \), and all other four-element multisets from \( \{0,1,2,3\} \) whose elements add to a multiple of 4.