| Thread Closed |
Prime Numbers |
Share Thread | Thread Tools |
| Oct11-08, 02:26 PM | #1 |
|
|
Prime Numbers
Ok, here's a challenge for you guys.
Lets figure out a pattern for prime numbers. |
| Oct11-08, 03:04 PM | #2 |
|
|
Right. Get back to you with the solution as soon as I have a moment.
|
| Oct11-08, 03:09 PM | #3 |
|
|
Ooh, I've figured it out. The prime numbers appear precisely at those integers that have exactly two positive factors!
|
| Oct11-08, 03:28 PM | #4 |
|
|
Prime Numbers
Do you mean besides 1 and the number itself?
|
| Oct11-08, 03:29 PM | #5 |
|
|
|
| Oct11-08, 04:51 PM | #6 |
|
|
|
| Oct11-08, 07:53 PM | #7 |
|
Recognitions:
|
A prime number is divisible by precisely two positive factors, one and itself. |
| Oct11-08, 07:56 PM | #8 |
|
Recognitions:
|
|
| Oct12-08, 05:54 AM | #9 |
|
|
Of course, a lot of non-primes like 49 or 77 fit the pattern as well. :)
There should be some sort of FAQ on these forums, since this subject (and others) repeat very often, and I believe you (CR) posted a 'prime formula' just a few months ago. Nor I can say I understand the OP's motivation. This ain't no circus, yo. |
| Oct12-08, 06:28 AM | #10 |
|
|
Prime numbers have exactly two (positive integer) divisors: 1, and the number itself. after all, N = 1 * N, and N = N * 1.
As far as I know, some patterns have been found which generate only prime numbers, but no pattern has been found which generates all of them. In general, to see if some large numer is prime, one has to try all possible divisors. (In practice some divisors, such as 2, 3 and 5, are readily discernible if the number is written in base 10.) One interesting pattern is the following. If the last prime number found is M, calculate N = M! + 1, or 1 * 2 * 3 *....*(M-1) * M + 1. Now, either N is itself prime, or else it has a prime divisor larger than M. This recipe generates an infinite number of primes, therefore proving that there is no largest prime. Starting with 1, the recipe gives the sequence 2, 3, 7, 71... and already misses 5. |
| Oct12-08, 02:02 PM | #11 |
|
Recognitions:
|
I did post a formula for primes not too long ago. |
| Oct12-08, 07:56 PM | #12 |
|
Blog Entries: 2
|
|
| Oct12-08, 08:10 PM | #13 |
|
|
|
| Oct12-08, 11:43 PM | #14 |
|
Recognitions:
|
Admittedly, all of these people are famous to some degree. But less complicated or worthwhile methods are created all the time. Further, there are methods (like the LL test for Mersenne primes) that are conjectured to produce infinitely many primes but no one has proven it yet. |
| Oct13-08, 02:09 AM | #15 |
|
|
I believe the 'great unsolved problem' is a closed form for the sequence of primes. This thread won't rest in peace until you copy it *again*, or paste a link, or something.
In the meantime, Google is wise, Google is good. http://mathworld.wolfram.com/PrimeFormulas.html |
| Oct13-08, 07:17 AM | #16 |
|
Recognitions:
|
|
| Nov27-08, 05:58 PM | #17 |
|
|
There are a number of algorithms to derive primes, it goes without saying - but these don't resolve to, or immediately suggest any simple predictable "pattern". Yet the distribution of the primes does have what seems to be apparent "pattern", it could be said, anyway. Against this, Mandlebrot patterns aren't apparent by just glancing at the equation for that set, either.
|
| Thread Closed |
| Tags |
| math, numbers, pattern, prime, sequence, thegreatmyth |
| Thread Tools | |
Similar Threads for: Prime Numbers
|
||||
| Thread | Forum | Replies | ||
| Prime Numbers | Linear & Abstract Algebra | 24 | ||
| a prime number which equals prime numbers | General Math | 10 | ||
| A formula of prime numbers for interval (q; (q+1)^2), where q is prime number. | Linear & Abstract Algebra | 0 | ||
| Prime Numbers in the Diophantine equation q=(n^2+1)/p and p is Prime | Linear & Abstract Algebra | 5 | ||
| Prime Numbers From 2 | General Math | 10 | ||