The Prime Pages - Finding Primes and Proving Primality
Peer Review for material titled "The Prime Pages - Finding Primes and Proving Primality"
User Rating for material titled "The Prime Pages - Finding Primes and Proving Primality"
Member Comments for material titled "The Prime Pages - Finding Primes and Proving Primality"
Personal Collections for material titled "The Prime Pages - Finding Primes and Proving Primality"
Learning Exercises for material titled "The Prime Pages - Finding Primes and Proving Primality"
Accessibility Info for material titled "The Prime Pages - Finding Primes and Proving Primality"
Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II




        

Search > Material Results >

The Prime Pages - Finding Primes and Proving Primality

        

The Prime Pages - Finding Primes and Proving Primality

Logo for The Prime Pages - Finding Primes and Proving Primality
Test and search procedures for prime numbers including material on proofs
Material Type: Reference Material
Technical Format: HTML/Text
Date Added to MERLOT: September 28, 2002
Date Modified in MERLOT: October 04, 2010
Author:
Send email to caldwell@utm.edu
Submitter: Ian Walton
Keywords: Elliptic Curves, Lucas Lehmer for Mersenne Primes, Sieve of Eratosthenes, Probable Primality, APR and APR-CL, n-1 and n+1 tests

Quality


About

Primary Audience: College General Ed
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: no
Accessiblity Information Available: no
Creative Commons: unsure

Connections





QR Code for this Page

Browse in Categories

Discussion

Discussion for The Prime Pages - Finding Primes and Proving Primality

Log in to participate in the discussions or Register if you are not already a MERLOT member.

Return to Top of Page
Avatar for Laila Barakat
5 years ago

Laila Barakat (Student)

I think this site is very useful in quickly finding prime numbers. I've spent alot of time trying to divide numbers that I later found out were prime numbers and could not be divided by anything accept itself and 1. Fortunately for me I will be able to quickly figure out whether a number is prime or not before I divide any numbers in the future!

Technical Remarks:

The wheel factorization explanation was a little bit confusing. I had to reread that part a few times before finally understanding its concept.
Time spent reviewing site: 25-30 minutes

Avatar for Matt Imwalle
10 years ago

Matt Imwalle (Student)

It really surprises me when they say that there are numbers with thousands and
even millions of digits that are proven prime numbers. The test that they have
been doing is the same test for 99.99% of the largest known primes. The only way
that I knew about finding primes is factoring, but this article says factoring
is much harder than primality proving for the "average" integer. This article
took me a while to go over and understand it. I think I read through it about
three or four times because the first couple all this information just went in
then right back out. This content was very good, it had a lot of good
information, it only had one example on it but it helped out a little. To
understand this page you need to know some background on Prime numbers. It
helped me out a little more on understanding prime numbers because I have
previously read about them. I think that first timers would not have a hard time
using this site but maybe a hard time understanding it.
Used in course