90 seconds of yes/no β type 1 for yes, 0 for no
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.
4731 β 4+7+3+1=15 → yes (15 = 3×5).1232 β 32 → yes (32 = 4×8). Ignore everything else.4732 β 473 β 2×2 = 469 β 46 β 2×9 = 28 → yes (28 = 7×4).4072 β 072 = 72 → yes (72 = 8×9).4329 β 4+3+2+9=18 → yes (18 = 9×2).4719 β 4β7+1β9 = β11 → yes.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.
Bug, wording issue, or polish suggestion β all go straight into the dogfood backlog.