- #1
ƒ(x)
- 328
- 0
Ok, here's a challenge for you guys.
Lets figure out a pattern for prime numbers.
Lets figure out a pattern for prime numbers.
Hurkyl said:Ooh, I've figured it out. The prime numbers appear precisely at those integers that have exactly two positive factors!
ƒ(x) said:Um, correct me if I'm wrong, but prime numbers don't have factors.
ƒ(x) said:Um, correct me if I'm wrong, but prime numbers don't have factors.
ƒ(x) said:Ok, here's a challenge for you guys.
Lets figure out a pattern for prime numbers.
Dodo said:Of course, a lot of non-primes like 49 or 77 fit the pattern as well. :)
Dodo said: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.
Dodo said:Nor I can say I understand the OP's motivation. This ain't no circus, yo.
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.
ramsey2879 said:Show us an infinite pattern which generates ONLY PRIME numbers and you will be famous.
When do I get my accolades?Hurkyl said:The prime numbers appear precisely at those integers that have exactly two positive factors!
ramsey2879 said:Show us an infinite pattern which generates ONLY PRIME numbers and you will be famous.
Dodo said:I believe the 'great unsolved problem' is a closed form for the sequence of primes.
kenewbie said:Maybe I am misreading what some of the more prominent people in this thread are saying, but a function such that
f(n) = pn
would surely be a feat which guarantees a spot in mathematical history?
CRGreathouse said:No. It wouldn't even guarantee that you could publish a paper on it -- though if it's creative, a journal like American Mathematical Monthly or Recreational Mathematics might take it.
kenewbie said:Wow! But there is no such function found to date is there?
kenewbie said:And I thought the Riemann zeros were all about modifying gauss' ln-based prime prediction to be 100% accurate?
kenewbie said:I get a sneeking suspicion that I have to unlearn everything thought to me by the pop-sci math books.
Can you list any functions F(n) = the nth prime number that will gve an answer independently of the determination of all lower primes?CRGreathouse said:First, the function is just that: f(n) = the nth prime number, if n is a positive integer, and undefined otherwise.
But there are probably a good half dozen or dozen closed form versions of that formula, based on things like Wilson's Theorem. None of them are particularly interesting.
http://mathworld.wolfram.com/PrimeFormulas.html
ramsey2879 said:Can you list any functions F(n) = the nth prime number that will gve an answer independently of the determination of all lower primes?
Also, can you give a function P(n) which gives a 1 or 0 depending upon whether n is prime or not that in effect does not depend upon the calculation or n! or of all primes less than the square root of 'n'?
ramsey2879 said:Can you list any functions F(n) = the nth prime number that will gve an answer independently of the determination of all lower primes?
Also, can you give a function P(n) which gives a 1 or 0 depending upon whether n is prime or not that in effect does not depend upon the calculation or n! or of all primes less than the square root of 'n'?
If yes to either question, please cite relevant descriptive material.
The pattern of prime numbers refers to the sequence of numbers that can only be divided by 1 and itself. Prime numbers do not have any other factors and are considered the building blocks of all other numbers.
Scientists use various mathematical methods and algorithms to study and analyze the distribution of prime numbers. This includes sieving techniques, number theory, and computer algorithms.
There is no specific rule or equation for finding prime numbers. However, there are certain patterns and properties that can help identify prime numbers, such as the Sieve of Eratosthenes and the Prime Number Theorem.
Understanding the pattern of prime numbers can help in various fields such as cryptography, data encryption, and computer science. It also helps in predicting the occurrence of prime numbers and identifying any potential mathematical patterns.
Prime numbers play a crucial role in mathematics as they are the fundamental building blocks of all other numbers. They also have various applications in number theory, algebra, and geometry, making them an important concept in the field of mathematics.