WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Visible Divisibility Tests

n
5234
mode
Long
Brief
divisible by
2
3
4
5
6
7
8
9
10
11
Rule for 3: Add up the digits
5234
:
5+2+3+4
14
14
:
1+4
5
5
:
not divisible by 3
Most people are familiar with the test for divisibility by 3: add up all the digits and check whether the result (the digit sum) is divisible by 3. Other divisibility tests are less well known, such as alternately adding and subtracting digits to test for divisibility by 11. This Demonstration implements divisibility tests for dividing by 2, 3, , 11. In all cases the rule is given and a step-by-step application shown, either in "Long" or "Brief" form. The radio buttons choose which test to apply and the slider selects the number to test. (Clicking the "+" sign by the slider opens another panel where numbers can be entered directly or incremented/decremented.)
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.