🏠
Guest Not signed in

Divisibility Tests

90 seconds of yes/no β€” type 1 for yes, 0 for no

90.0s

Technique: Divisibility shortcuts

For each question, decide whether the number is divisible by the given divisor. Type 1 for YES, 0 for NO. The divisor cycles randomly across six rules β€” pick the right shortcut for each.

The six rules

  • Γ·3 β€” digit sum is divisible by 3. 4731 β†’ 4+7+3+1=15 → yes (15 = 3×5).
  • Γ·4 β€” last two digits divisible by 4. 1232 β†’ 32 → yes (32 = 4×8). Ignore everything else.
  • Γ·7 β€” subtract 2×(last digit) from the rest, repeat until small. 4732 β†’ 473 βˆ’ 2×2 = 469 β†’ 46 βˆ’ 2×9 = 28 → yes (28 = 7×4).
  • Γ·8 β€” last three digits divisible by 8. 4072 β†’ 072 = 72 → yes (72 = 8×9).
  • Γ·9 β€” digit sum divisible by 9. 4329 β†’ 4+3+2+9=18 → yes (18 = 9×2).
  • Γ·11 β€” alternating digit sum divisible by 11. 4719 β†’ 4βˆ’7+1βˆ’9 = βˆ’11 → yes.

Why these shortcuts work

Each rule comes from how the divisor relates to powers of 10. 10 ≑ 1 (mod 9), so each digit contributes its face value to n mod 9 β€” that’s the digit-sum rule for 3 and 9. 100 ≑ 0 (mod 4), so only the last two digits matter for Γ·4. 10 ≑ βˆ’1 (mod 11), so each successive digit flips sign β€” alternating sum.

The Γ·7 trick uses 10n + d ≑ 0 (mod 7) ⇔ n βˆ’ 2d ≑ 0 (mod 7) β€” repeatedly chops the trailing digit until you reach a number you can recognize.

Every question has a 30 second shot clock.

Independent · Legal