Example 1
Question: Consider any 3-digit number written as \( \overline{pqr} \), which equals \( 100p + 10q + r \), where p, q, r are its digits. Form two new 3-digit numbers by cycling the digits: \( \overline{qrp} \) and \( \overline{rpq} \). Add all three numbers together. Using algebra, show that the sum is always divisible by 111. Also check: is it always divisible by 3?
Solution: Write the three numbers in expanded form. The original number is \( 100p + 10q + r \). The first rotation \( \overline{qrp} \) is \( 100q + 10r + p \). The second rotation \( \overline{rpq} \) is \( 100r + 10p + q \). Now add all three: \[ (100p + 10q + r) + (100q + 10r + p) + (100r + 10p + q) \] Group the terms with the same digit: \[ = (100p + p + 10p) + (10q + 100q + q) + (r + 10r + 100r) \] \[ = 111p + 111q + 111r \] \[ = 111(p + q + r) \] Since the sum equals \( 111(p + q + r) \), it is always divisible by 111. Note that \( 111 = 3 \times 37 \), so the sum is divisible by both 3 and 37. Therefore, the sum is always divisible by 111, and also always divisible by 3. Verification with an example: Take the number 253. Its rotations are 532 and 325. \[ 253 + 532 + 325 = 1110 \] \[ 1110 = 111 \times 10 \] and \( p + q + r = 2 + 5 + 3 = 10 \). This matches \( 111 \times 10 \). The result is verified.
Answer: The sum of the three cyclically rotated numbers always equals \( 111(p + q + r) \), so it is always divisible by 111. Since \( 111 = 3 \times 37 \), the sum is also always divisible by 3.
Example 2
Question: Reena picks any 3-digit number, say with digits x, y, z (so the number is \( \overline{xyz} = 100x + 10y + z \)). She forms two new numbers by cycling the digits to get \( \overline{yzx} \) and \( \overline{zxy} \). She then multiplies the digit-sum \( (x + y + z) \) by 111 and claims it always equals the sum of her three numbers. Prove her claim using algebra, and find all single-digit divisors (from 1 to 9) that always divide this sum.
Solution: Write each number in expanded form. The original number: \( 100x + 10y + z \). The first rotation \( \overline{yzx} \): \( 100y + 10z + x \). The second rotation \( \overline{zxy} \): \( 100z + 10x + y \). Add the three numbers: \[ S = (100x + 10y + z) + (100y + 10z + x) + (100z + 10x + y) \] Collect coefficients of x, y, and z separately: \[ S = (100 + 1 + 10)x + (10 + 100 + 1)y + (1 + 10 + 100)z \] \[ S = 111x + 111y + 111z \] \[ S = 111(x + y + z) \] This proves Reena's claim: the sum is always \( 111 \times (x + y + z) \). Now find which single-digit numbers always divide S. Factorise 111: \[ 111 = 3 \times 37 \] So the fixed factor in S is \( 3 \times 37 \). The single-digit divisors of 111 are 1, 3. The number 37 is not a single-digit number. So among digits 1 through 9, the ones that always divide S (regardless of what x, y, z are) are the divisors of 111 that are single-digit: 1 and 3. (Note: 9 divides S only when \( x + y + z \) is a multiple of 3, which is not always true.) Verification: Take 147. Rotations are 471 and 714. \[ 147 + 471 + 714 = 1332 \] \( x + y + z = 1 + 4 + 7 = 12 \), and \( 111 \times 12 = 1332 \). Confirmed. \( 1332 \div 3 = 444 \). Yes, divisible by 3. \( 1332 \div 9 = 148 \). Yes here, but that is because \( 12 \div 3 = 4 \). If we take 123: sum \( = 111 \times 6 = 666 \), \( 666 \div 9 = 74 \). Still works. Try 124: \( 124 + 241 + 412 = 777 \), \( 777 \div 9 = 86.33... \) Not divisible. So 9 does not always divide S.
Answer: The sum of the three cyclically rotated numbers always equals \( 111(x + y + z) \), confirming Reena's claim. The single-digit numbers that always divide this sum are 1 and 3 (since \( 111 = 3 \times 37 \)).