Example 1
Question: For the statement below, determine whether it is always true, sometimes true, or never true. Explain your answer with examples and a non-example where appropriate, and justify using algebra. The sum of a multiple of 4 and a multiple of 10 is a multiple of 6.
Solution: We first test with examples and a non-example, then prove algebraically. Let the multiple of 4 be \( 4p \) and the multiple of 10 be \( 10q \), where p and q are integers. Their sum is \( 4p + 10q \). Example 1: Take \( p = 3, q = 3 \). Multiple of 4: \( 4 \times 3 = 12 \). Multiple of 10: \( 10 \times 3 = 30 \). Sum: \( 12 + 30 = 42 \). Is 42 divisible by 6? \( 42 = 6 \times 7 \). Yes. Example 2 (non-example): Take \( p = 1, q = 1 \). Multiple of 4: \( 4 \times 1 = 4 \). Multiple of 10: \( 10 \times 1 = 10 \). Sum: \( 4 + 10 = 14 \). Is 14 divisible by 6? \( 14 = 6 \times 2 + 2 \). No, remainder is 2. Algebraic justification: The sum is \[ 4p + 10q = 2(2p + 5q). \] This shows the sum is always a multiple of 2, but NOT necessarily a multiple of 6 (which requires divisibility by both 2 and 3). For divisibility by 6 we also need \( 2p + 5q \) to be divisible by 3, but that depends on the specific values of p and q — it is not guaranteed for all integers p and q. For instance, when \( p = 3, q = 3 \): \( 2(3) + 5(3) = 6 + 15 = 21 \), and \( 21 = 3 \times 7 \), so the sum is \( 2 \times 21 = 42 \), a multiple of 6. But when \( p = 1, q = 1 \): \( 2(1) + 5(1) = 7 \), and 7 is not divisible by 3, so the sum \( 2 \times 7 = 14 \) is not a multiple of 6. Therefore, the statement is SOMETIMES TRUE.
Answer: Sometimes true
Example 2
Question: For the statement below, determine whether it is always true, sometimes true, or never true. Explain your answer with examples and a non-example where appropriate, and justify using algebra. The sum of a multiple of 8 and a multiple of 12 is a multiple of 4.
Solution: We first test with examples and a non-example, then prove algebraically. Let the multiple of 8 be \( 8p \) and the multiple of 12 be \( 12q \), where p and q are integers. Their sum is \( 8p + 12q \). Example 1: Take \( p = 1, q = 1 \). Multiple of 8: \( 8 \times 1 = 8 \). Multiple of 12: \( 12 \times 1 = 12 \). Sum: \( 8 + 12 = 20 \). Is 20 divisible by 4? \( 20 = 4 \times 5 \). Yes. Example 2: Take \( p = 5, q = 3 \). Multiple of 8: \( 8 \times 5 = 40 \). Multiple of 12: \( 12 \times 3 = 36 \). Sum: \( 40 + 36 = 76 \). Is 76 divisible by 4? \( 76 = 4 \times 19 \). Yes. Algebraic justification: Factor the sum: \[ 8p + 12q = 4(2p + 3q). \] Since \( 8p + 12q \) equals 4 multiplied by the integer \( (2p + 3q) \), the sum is always divisible by 4, for every integer choice of p and q. There is no non-example possible: no matter which multiples of 8 and 12 we choose, their sum will always be a multiple of 4. Therefore, the statement is ALWAYS TRUE.
Answer: Always true