9464
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Tricks for Finding Small Divisors of Large Integers
This Demonstration gives simple ways to quickly tell if an integer is divisible by the numbers 1-9.
Contributed by:
Sarah Lichtblau
SNAPSHOTS
RELATED LINKS
Divisor
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Tricks for Finding Small Divisors of Large Integers
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/TricksForFindingSmallDivisorsOfLargeIntegers/
Contributed by:
Sarah Lichtblau
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Rounding Large Integers
Sarah Lichtblau
Dividing Integers
Sarah Lichtblau
Comparing Integers
Sarah Lichtblau
Multiplication of Integers
Sarah Lichtblau
Addition and Subtraction of Integers
Sarah Lichtblau
Small Signed Integer Addition 3D
Michael Schreiber
Small-Digit Addition
Michael Schreiber
Exact Recurrent Computations with Integers
Jacqueline Zizi
Integers Mod n and the Cyclic Subgroups
Richard Hennigan
An Algorithm to Compute Square Roots of Integers
Jaime Rangel-Mondragon
Related Topics
Integers
Middle School Mathematics
Browse all topics
Related Curriculum Standards
US Common Core State Standards, Mathematics
3.OA.B.5
3.OA.C.7
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+