mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2020-12-12, 05:16   #1
ONeil
 
Dec 2017

24·3·5 Posts
Question How to determine if a large number is prime? Is this True?

Is the below statement True?

Quote:
You check every prime number that's less than the square root of the number you're concerned with. The square root of 941 is 30.67, so check every prime number up to 29. If none of them divide 941, then it is prime.
https://www.reddit.com/r/learnmath/c...mber_is_prime/
ONeil is offline   Reply With Quote
Old 2020-12-12, 05:25   #2
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

2×29×103 Posts
Default

Less than or equal to, yes. (The bold part is necessary in case you encounter the square of a prime.) But this is a very slow method and much better ones are known even for quite small numbers.
CRGreathouse is offline   Reply With Quote
Old 2020-12-13, 13:35   #3
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

492110 Posts
Default

https://brilliant.org/wiki/prime-testing/
https://tutorialspoint.dev/algorithm...primality-test
easily found with https://duckduckgo.com/?t=ffnt&q=pri...ing+aks&ia=web

Last fiddled with by kriesel on 2020-12-13 at 13:38
kriesel is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
I Think The Twin Prime Conjecture Is True MathDoggy Miscellaneous Math 37 2019-04-15 23:42
Verify the existence of a large enough prime number? Godzilla Miscellaneous Math 25 2018-09-28 17:10
How do I determine the xth-highest prime on prime pages? jasong Data 7 2005-09-13 20:41
Putting prime 95 on a large number of machines moo Software 10 2004-12-15 13:25
Is this a relatively large number? MavsFan Math 3 2003-12-12 02:23

All times are UTC. The time now is 05:05.

Fri Mar 5 05:05:41 UTC 2021 up 92 days, 1:17, 0 users, load averages: 3.13, 2.61, 2.03

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.