Exercise 2: Divisibility Rules Applied to n = 3,168 — Possible Solution
====================================================================

GIVEN
------------------------------
n = 3168

RULE CHECKS
------------------------------
Divisible by 2? Last digit is 8, which is even -> YES
Divisible by 3? Digit sum = 3+1+6+8 = 18, and 18 is divisible by
  3 -> YES
Divisible by 5? Last digit is 8, not 0 or 5 -> NO
Divisible by 9? Digit sum = 18, and 18 is divisible by 9 -> YES
Divisible by 10? Last digit is 8, not 0 -> NO
Divisible by 11? Alternating sum from the right: 8 - 6 + 1 - 3 = 0,
  and 0 is divisible by 11 -> YES

CONFIRMING AGAINST ACTUAL REMAINDERS
------------------------------
3168 % 2  = 0  (matches: divisible)
3168 % 3  = 0  (matches: divisible)
3168 % 5  = 3  (matches: not divisible)
3168 % 9  = 0  (matches: divisible)
3168 % 10 = 8  (matches: not divisible)
3168 % 11 = 0  (matches: divisible)

Every rule-based prediction matches the actual computed remainder
exactly.

RESULT
------------------------------
n = 3168 is divisible by 2, 3, 9, and 11, but NOT by 5 or 10.

WHY THIS WORKS AS AN ANSWER
------------------------------
Each rule is applied using its own specific test (last digit for
2/5/10, digit sum for 3/9, alternating sum for 11) rather than
just computing the remainder directly and reverse-engineering a
"rule," and every prediction is independently double-checked
against the real remainder to confirm the rules genuinely work,
not just asserted to work.