SOLVER7 Study. Nothing Else.
Figure It Out 1 Q3(iii)

For each statement below, determine whether it is always true, sometimes true, or never true. Explain your answer. Mention examples and non-examples as appropriate. Justify your claim using algebra. If two numbers are not divisible by \(6,\) then their sum is not divisible by \(6.\)

CBSE Class 8 Maths · Number Play

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have two broken pieces of a cookie. Neither piece is a complete cookie on its own. But if you put them together, you might get exactly one whole cookie! Numbers work the same way. Two numbers that are not divisible by 6 can sometimes add up to a number that is divisible by 6. It does not always happen, but it can. So the statement is only sometimes true, not always true.

Answer: The statement is SOMETIMES TRUE. Example where it holds: \( 1 \) and \( 2 \) give \( 1 + 2 = 3 \), not divisible by 6. Counter-example where it fails: \( 2 \) and \( 4 \) give \( 2 + 4 = 6 \), which IS divisible by 6. Algebraically, since \( a + b = 6(m + n) + (r_1 + r_2) \), the sum is divisible by 6 exactly when \( r_1 + r_2 \) is a multiple of 6, which may or may not happen.

📖 Is the Statement Always, Sometimes, or Never True?

Detailed Explanation

The claim is: If two numbers are not divisible by 6, then their sum is not divisible by 6. To test a statement like this, we do not just try one pair of numbers. We ask: can we find even a single example where two numbers are each NOT divisible by 6, but their sum IS divisible by 6? If we can find such an example, the statement is not always true. If it works for some pairs but fails for others, the statement is only sometimes true. Recall that a number is divisible by 6 if it leaves remainder 0 when divided by 6. A number is 'not divisible by 6' when it leaves a remainder of 1, 2, 3, 4, or 5. The key idea is that two remainders can add up to 6 (or 12), giving a total that IS divisible by 6.

Formula Used

A number \( n \) is divisible by 6 means \( n = 6k \) for some whole number \( k \). Not divisible by 6 means the remainder is one of \( 1, 2, 3, 4, 5 \).

Solution

  1. Step 1: Understand what the statement claims. It says: whenever two numbers are each NOT divisible by 6, their sum must also be NOT divisible by 6. We must check if this is guaranteed every single time.
  2. Step 2: Look for a counter-example (a non-example that breaks the rule). Take the numbers \( 2 \) and \( 4 \). Neither is divisible by 6, since \( 2 = 6 \times 0 + 2 \) and \( 4 = 6 \times 0 + 4 \).
  3. Step 3: Add them and check the sum. \[ 2 + 4 = 6 \] Here \( 6 \) IS divisible by 6. So two numbers not divisible by 6 gave a sum that IS divisible by 6. This one example already shows the statement is not always true.
  4. Step 4: Now show it CAN also work the other way, so the statement is not never true either. Take \( 1 \) and \( 2 \). Neither is divisible by 6, and their sum is \[ 1 + 2 = 3 \] which is NOT divisible by 6. Here the statement holds. So sometimes it is true and sometimes it is false.
  5. Step 5: Justify with algebra using remainders. Write the two numbers as \( a = 6m + r_1 \) and \( b = 6n + r_2 \), where \( r_1 \) and \( r_2 \) are remainders from \( 1, 2, 3, 4, 5 \) (not 0, since they are not divisible by 6). Their sum is \[ a + b = 6(m + n) + (r_1 + r_2) \]
  6. Step 6: Analyse the remainder part \( r_1 + r_2 \). If \( r_1 + r_2 \) is a multiple of 6 (for example \( 2 + 4 = 6 \) or \( 1 + 5 = 6 \)), the whole sum is divisible by 6. If \( r_1 + r_2 \) is not a multiple of 6 (for example \( 1 + 2 = 3 \)), the sum is NOT divisible by 6. Since both situations can happen, the outcome depends on the numbers chosen.

Final Answer

The statement is SOMETIMES TRUE. Example where it holds: \( 1 \) and \( 2 \) give \( 1 + 2 = 3 \), not divisible by 6. Counter-example where it fails: \( 2 \) and \( 4 \) give \( 2 + 4 = 6 \), which IS divisible by 6. Algebraically, since \( a + b = 6(m + n) + (r_1 + r_2) \), the sum is divisible by 6 exactly when \( r_1 + r_2 \) is a multiple of 6, which may or may not happen.

Common Mistake

A common mistake is to test only one convenient pair (like \( 1 \) and \( 2 \)), see it works, and conclude the statement is always true. To prove a statement is only sometimes true, you must give both a supporting example AND a counter-example.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Read the claim carefully: 'If two numbers are each not divisible by 6, then their sum is also not divisible by 6.' — Reason: Before testing, we must know exactly what we are trying to verify or disprove. The claim says this rule holds every single time, so we must check whether there is any exception at all.
  2. Step 2: Recall what 'not divisible by 6' means. A number is not divisible by 6 when dividing it by 6 leaves a non-zero remainder, i.e., a remainder of \( 1, 2, 3, 4, \) or \( 5 \). — Reason: We need this definition to correctly identify which numbers qualify for our test.
  3. Step 3: Try a pair where the claim seems to hold. Pick \( 1 \) and \( 2 \). Neither is divisible by 6. Their sum is \( 1 + 2 = 3 \), and \( 3 \) is not divisible by 6. — Reason: This shows the statement can be true for some pairs, so it is not always false either. We now look for a pair where it breaks.
  4. Step 4: Search for a counter-example. Choose \( 2 \) and \( 4 \). Check each: \( 2 = 6 \times 0 + 2 \) (remainder 2, so not divisible by 6), and \( 4 = 6 \times 0 + 4 \) (remainder 4, so not divisible by 6). — Reason: Both numbers satisfy the condition of not being divisible by 6, so this pair is a valid test case.
  5. Step 5: Add the chosen pair and test the sum. \[2 + 4 = 6\] Now check: \( 6 \div 6 = 1 \) with remainder \( 0 \), so \( 6 \) IS divisible by 6. — Reason: This directly contradicts the claim. Two numbers that are individually not divisible by 6 have produced a sum that is divisible by 6.
  6. Step 6: Understand why this can happen using remainders. Write \( a = 6m + r_1 \) and \( b = 6n + r_2 \). Then \( a + b = 6(m + n) + (r_1 + r_2) \). For our counter-example, \( r_1 = 2 \) and \( r_2 = 4 \), giving \( r_1 + r_2 = 6 \), a multiple of 6. — Reason: The algebraic form shows that even when both remainders are non-zero, they can add up to 6 (or 12), making the total sum divisible by 6.
  7. Step 7: Draw the conclusion. The statement holds for some pairs (like \( 1 \) and \( 2 \)) but fails for others (like \( 2 \) and \( 4 \)). Since it is not true in every case and not false in every case, the statement is SOMETIMES TRUE. — Reason: A statement is 'always true' only if no counter-example exists; here we found one, so 'sometimes true' is the correct verdict.

Final Answer

The statement is SOMETIMES TRUE. Example where it holds: \( 1 \) and \( 2 \) give \( 1 + 2 = 3 \), not divisible by 6. Counter-example where it fails: \( 2 \) and \( 4 \) give \( 2 + 4 = 6 \), which IS divisible by 6. Algebraically, since \( a + b = 6(m + n) + (r_1 + r_2) \), the sum is divisible by 6 exactly when \( r_1 + r_2 \) is a multiple of 6, which may or may not happen.

Common Mistake

One common mistake: students test only one or two pairs where the sum is not divisible by 6 and conclude the statement is always true, without realising that a single counter-example (like 2 and 4) is enough to prove the statement is not always true.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Check: neither \( 2 \) nor \( 4 \) is divisible by 6.
  2. Step 2: Sum: \[ 2 + 4 = 6 \] which IS divisible by 6 — statement fails here.
  3. Step 3: Check: neither \( 1 \) nor \( 2 \) is divisible by 6, and \( 1 + 2 = 3 \) is NOT divisible by 6 — statement holds here.
  4. Step 4: General form: \( a + b = 6(m + n) + (r_1 + r_2) \); divisible by 6 only when \( r_1 + r_2 \) is a multiple of 6 — depends on the pair chosen.

Answer: The statement is SOMETIMES TRUE. Example where it holds: \( 1 \) and \( 2 \) give \( 1 + 2 = 3 \), not divisible by 6. Counter-example where it fails: \( 2 \) and \( 4 \) give \( 2 + 4 = 6 \), which IS divisible by 6. Algebraically, since \( a + b = 6(m + n) + (r_1 + r_2) \), the sum is divisible by 6 exactly when \( r_1 + r_2 \) is a multiple of 6, which may or may not happen.

➕ More Examples

More Examples

Example 1

Question: For each statement below, determine whether it is always true, sometimes true, or never true. Explain your answer. Give examples and non-examples. Justify your claim using algebra. Statement: If two numbers are not divisible by 4, then their sum is not divisible by 4.

Solution: We check whether the statement is always true, sometimes true, or never true. Step 1: Try an example where the statement seems TRUE. Let the two numbers be 5 and 7. Neither is divisible by 4 (since 5 = 4 × 1 + 1 and 7 = 4 × 1 + 3). Their sum is 5 + 7 = 12, and 12 is NOT divisible by 4 (since 12 = 4 × 3, wait — 4 × 3 = 12, so 12 IS divisible by 4). Actually, 5 + 7 = 12, and \( 12 \div 4 = 3 \), so 12 IS divisible by 4. So here, two numbers not divisible by 4 gave a sum that IS divisible by 4. The statement is FALSE in this case. Step 2: Try another example where the statement is TRUE. Let the two numbers be 5 and 6. Neither 5 nor 6 is divisible by 4. Their sum is 5 + 6 = 11. Since \( 11 = 4 \times 2 + 3 \), 11 is NOT divisible by 4. So the statement is TRUE in this case. Step 3: Since the statement is true in some cases and false in others, it is SOMETIMES TRUE. Step 4: Algebraic justification. Any integer not divisible by 4 has remainder 1, 2, or 3 when divided by 4. Write the two numbers as \( 4a + r_1 \) and \( 4b + r_2 \), where \( r_1, r_2 \in \{1, 2, 3\} \). Their sum is: \[ (4a + r_1) + (4b + r_2) = 4(a + b) + (r_1 + r_2) \] The sum is divisible by 4 exactly when \( r_1 + r_2 \) is divisible by 4. Case A: \( r_1 = 1, r_2 = 3 \) gives \( r_1 + r_2 = 4 \), which IS divisible by 4. So the sum IS divisible by 4 — statement is FALSE. Example: 5 and 7 (remainders 1 and 3; sum = 12). Case B: \( r_1 = 2, r_2 = 2 \) gives \( r_1 + r_2 = 4 \), which IS divisible by 4. Example: 6 and 10 (both have remainder 2; sum = 16). Case C: \( r_1 = 1, r_2 = 2 \) gives \( r_1 + r_2 = 3 \), which is NOT divisible by 4. Example: 5 and 6 (sum = 11). Since there exist cases where the sum is divisible by 4 and cases where it is not, the statement is SOMETIMES TRUE.

Answer: Sometimes true. When the remainders of the two numbers (on division by 4) add up to 4 (e.g., remainders 1 and 3, or both 2), the sum IS divisible by 4, making the statement false. When the remainders add to a non-multiple of 4 (e.g., 1 and 2, giving sum 3), the sum is not divisible by 4, making the statement true.

Example 2

Question: For each statement below, determine whether it is always true, sometimes true, or never true. Explain your answer. Give examples and non-examples. Justify your claim using algebra. Statement: If two numbers are not divisible by 8, then their sum is not divisible by 8.

Solution: We check whether the statement is always true, sometimes true, or never true. Step 1: Try an example where the statement seems TRUE. Let the two numbers be 3 and 6. Neither 3 nor 6 is divisible by 8. Their sum is 3 + 6 = 9. Since \( 9 = 8 \times 1 + 1 \), the number 9 is NOT divisible by 8. The statement is TRUE for this pair. Step 2: Try to find a counterexample (where the statement is FALSE). Let the two numbers be 5 and 11. Check: \( 5 = 8 \times 0 + 5 \) (not divisible by 8) and \( 11 = 8 \times 1 + 3 \) (not divisible by 8). Their sum is 5 + 11 = 16. Since \( 16 = 8 \times 2 \), the sum IS divisible by 8. The statement is FALSE for this pair. Step 3: Since the statement is true in some cases (Step 1) and false in others (Step 2), it is SOMETIMES TRUE. Step 4: Algebraic justification. Any integer not divisible by 8 has a non-zero remainder when divided by 8. Write the two numbers as \( 8a + r_1 \) and \( 8b + r_2 \), where \( r_1, r_2 \in \{1, 2, 3, 4, 5, 6, 7\} \). Their sum is: \[ (8a + r_1) + (8b + r_2) = 8(a + b) + (r_1 + r_2) \] The sum is divisible by 8 exactly when \( r_1 + r_2 \) is a multiple of 8. Since each remainder is between 1 and 7, the possible values of \( r_1 + r_2 \) range from 2 to 14. The only multiple of 8 in this range is 8 itself. So the sum is divisible by 8 when \( r_1 + r_2 = 8 \). Example pairs of remainders: (1, 7), (2, 6), (3, 5), (4, 4). For 5 and 11: remainders are 5 and 3, so \( r_1 + r_2 = 5 + 3 = 8 \). The sum \( 5 + 11 = 16 = 8 \times 2 \) is divisible by 8. Statement is FALSE. For 3 and 6: remainders are 3 and 6, so \( r_1 + r_2 = 3 + 6 = 9 \), which is not a multiple of 8. The sum \( 3 + 6 = 9 \) is not divisible by 8. Statement is TRUE. Since the statement is true in some cases and false in others, the statement is SOMETIMES TRUE.

Answer: Sometimes true. When the remainders of the two numbers (on division by 8) add up to exactly 8 — for example, remainders 5 and 3 (numbers 5 and 11, sum = 16) — the sum IS divisible by 8, making the statement false. When remainders add to a non-multiple of 8, the sum is not divisible by 8, making the statement true.

🎯 Try a Similar Question

Try a Similar Question

Question: Determine whether the following statement is always true, sometimes true, or never true. Give at least one example and one counterexample (if they exist), and justify your answer using algebra. Statement: 'If two whole numbers are each NOT divisible by 9, then their sum is also NOT divisible by 9.'

Solution

  1. Step 1: Understand the Statement: We need to check: if whole numbers \( a \) and \( b \) are both not divisible by 9, must their sum \( a + b \) also fail to be divisible by 9? We will test with specific numbers first.
  2. Step 2: Find an Example Where the Statement Holds: Let \( a = 2 \) and \( b = 4 \). Neither is divisible by 9. Their sum is \( 2 + 4 = 6 \), and 6 is NOT divisible by 9. So the statement holds for this pair.
  3. Step 3: Find a Counterexample Where the Statement Fails: Let \( a = 4 \) and \( b = 5 \). Check: \( 4 \div 9 \) gives remainder 4, and \( 5 \div 9 \) gives remainder 5, so neither is divisible by 9. Their sum is \( 4 + 5 = 9 \), which IS divisible by 9. The statement fails for this pair.
  4. Step 4: Algebraic Justification: Write \( a = 9m + r_1 \) and \( b = 9n + r_2 \), where \( m, n \) are whole numbers and \( r_1, r_2 \) are remainders with \( 1 \le r_1 \le 8 \) and \( 1 \le r_2 \le 8 \) (since neither is divisible by 9, their remainders are non-zero). Then: \[ a + b = 9m + r_1 + 9n + r_2 = 9(m + n) + (r_1 + r_2). \] The sum \( a + b \) is divisible by 9 exactly when \( r_1 + r_2 \) is a multiple of 9. Since \( r_1 \) and \( r_2 \) each range from 1 to 8, their sum \( r_1 + r_2 \) ranges from 2 to 16. It IS possible for \( r_1 + r_2 = 9 \) (e.g. \( r_1 = 4, r_2 = 5 \)), making the sum divisible by 9, and it is also possible for \( r_1 + r_2 \ne 9 \) (e.g. \( r_1 = 2, r_2 = 4 \)), making the sum NOT divisible by 9.
  5. Step 5: Conclusion: Because there exist pairs where the statement holds AND pairs where it fails, the statement is SOMETIMES TRUE. It is not always true (the counterexample \( 4 + 5 = 9 \) shows this) and it is not never true (the example \( 2 + 4 = 6 \) shows this).

Answer: The statement is SOMETIMES TRUE. Example where it holds: \( 2 \) and \( 4 \) give \( 2 + 4 = 6 \), which is NOT divisible by 9. Counterexample where it fails: \( 4 \) and \( 5 \) give \( 4 + 5 = 9 \), which IS divisible by 9. Algebraically, writing \( a = 9m + r_1 \) and \( b = 9n + r_2 \), the sum \( a + b = 9(m+n) + (r_1 + r_2) \) is divisible by 9 only when \( r_1 + r_2 \) is itself a multiple of 9. Since each remainder is between 1 and 8, this can happen (e.g. \( r_1 + r_2 = 9 \)) but does not always happen.

Everything you get with Solver7

More questions in Number Play