You can decide whether a number is divisible by 3 by forming its cross sum,
that is the sum of all its decimal digits: It is divisible by three exactly if its cross sum is. Similarly, a threedigit number is
divisible by seven if (and only if) the sum of twice its most significant
digit plus three times its middle digit plus its least significant digit is
divisible by seven.
Can you find a similar scheme for checking divisibility by 33 and 37, for numbers with an arbitrary number of digits?
(In reply to
Generally speaking ... by Steve Herman)
Absolutely right. The trick with 33 and 37 is that their remainders modulo 10^k (k=0,1..) are in the set {1,1,10,10,11,11} which allows for particularly "nice" rules.

Posted by JLo
on 20061025 12:24:32 