CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about |Store| Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "proving prime number?"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange High school Topic #208
Reading Topic #208
Cman
guest
Oct-14-02, 09:11 PM (EST)
 
"proving prime number?"
 
   Hello:

I just visited your site. I had a simply question to ask? I know 1321 is a prime number? But, is there a
formula or method to prove it? I find it hard to figure out the formulas posted on the web.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
alexb
Charter Member
1219 posts
Oct-14-02, 09:12 PM (EST)
Click to EMail alexb Click to send private message to alexb Click to view user profileClick to add this user to your buddy list  
1. "RE: proving prime number?"
In response to message #0
 
   > I know 1321 is a prime number?

How do you know it is a prime?


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
japam
guest
Feb-24-04, 07:15 PM (EST)
 
4. "RE: proving prime number?"
In response to message #1
 
  
i will give you this hint to your problem

look at this
01 *21= 21------------------0+2=2
11 *11= 121-----------------1+1=2
21 *01= 21------------------2+0=2
31 *91= 2821----------------3+9=12
41 *81= 3321----------------4+8=12
51 *71= 3621----------------5+7=12
61 *61= 3721----------------6+6=12


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
RicBrad
Member since Nov-16-01
Oct-15-02, 10:31 AM (EST)
Click to EMail RicBrad Click to send private message to RicBrad Click to view user profileClick to add this user to your buddy list  
2. "RE: proving prime number?"
In response to message #0
 
   There is no really easy way to find if a number is prime, especially by hand. For small numbers, with a computer, the simplest method is trial division (up to sqrt(n)).

For very small numbers (in computing terms), such as this one, you might like to know Wilson's Theorem:

A number p is prime if, and only if,

(p - 1)! = -1 (mod p)

In this case:

(p - 1)! = 1320! = 7051433211515310579887386749........00000000000
= approx 103551, and ending with 328 zeros
= 1320 (mod 1321) = -1 (mod 1321)

So it is prime.

As I said, this might be a little tricky to do by hand.

Rich

p.s. I tried to put in all 3551 digits, but the form wouldn't let me preview it... lol


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
noname
guest
Oct-15-02, 10:31 AM (EST)
 
3. "RE: proving prime number?"
In response to message #0
 
   to prove a number is prime, you must prove that it cannot be divided by any prime number inferiour to its square root.
Here, (1321)^(1/2) must be about 40 so check out that
for k in {2,3,5,7,11,13,17,19,23,29,31,37} you have 1321/k not an integer.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

|Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny

71548520