Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Divisibility rule
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Shorthand way of determining whether a given number is divisible by a fixed divisor}} A '''divisibility rule''' is a shorthand and useful way of determining whether a given [[integer]] is divisible by a fixed [[Divisor (number theory)|divisor]] without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any [[radix]], or base, and they are all different, this article presents rules and examples only for [[decimal]], or base 10, numbers. [[Martin Gardner]] explained and popularized these rules in his September 1962 [[Mathematical Games column|"Mathematical Games" column]] in ''[[Scientific American]]''.<ref>{{cite journal |last1=Gardner |first1=Martin |title=Mathematical Games: Tests that show whether a large number can be divided by a number from 2 to 12 |journal=Scientific American |date=September 1962 |volume=207 |issue=3 |pages=232β246 |jstor=24936675|doi=10.1038/scientificamerican0962-232 }}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)