math:EraTOSthenes Word Scramble
|
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Question | Answer |
Sieve of Eratosthenes | ancient algorithm for finding all prime numbers up to a specified integer. crossing-off of multiples of each found prime number can be started at the square of the number, as lower multiples have already been crossed out during the previous steps. |
Prime Number | natural number that has exactly two distinct natural number divisors: 1 and itself. |
Composite Number | positive integer which has a positive divisor other than one or itself. |
Largest Known Prime | (2^43,112,609) − 1 |
Created by:
murphyspooks
Popular Math sets