This preview shows pages 1–3. Sign up to view the full content.
1
MAE3811–Sp. 2010 Mahoney–1
Determining if a Number is Prime [More]
The Sieve of Eratosthenes
…This is Tedious…. That’s why it was last!
This is an ancient algorithm for determining if a number is prime. You need a big
table first.
Locate the first Prime
number and circle it. Then
cross out all multiples of it
using repeated additions.
The Uncrossed Out
number is Prime, but any
multiples of it can be
crossed out because they
are not…
…Repeat…
MAE3811–Sp. 2010 Mahoney–2
The GCD
The ______________ _______________ _______________ (GCD) of two natural
numbers a and b is the greatest natural
number that divides both a and b.
Two numbers are called _______________ ________________ if there GCD is ___.
Colored Rods Method/Number Line Method: 6, 9
Set Intersection Method: 24, 28
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document2
MAE3811–Sp. 2010 Mahoney–3
The GCD
Prime Factorization Method:
120, 252
Given the Prime Factorization of Two numbers. The GCD is given by the
product of the common prime factors, each raised to the __________ power that
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '11
 Mahoney

Click to edit the document details