I've read about many attempts to find patterns in prime numbers. First, is there a mathematical way to prove there is not a pattern to prime numbers? Since there are ways to check if a number is prime or not, can these methods be combined into some large function that produces prime numbers? And in case it isn't obvious, no, I never got passed pre-Cal.
|
|
I like Dirichlet's Theorem, which states that for relatively prime $a,d \in \mathbb{Z}^+$, there are infinitely many primes in the progression $\{a + nd \mid n \in \mathbb{Z^+}\}$. Further, the proportion of primes in any relatively prime residue class of $d$ is about $1/\phi(d)$, where $\phi$ is the Euler phi function. In essence, the primes can be seen as somewhat evenly distributed. You can see more below. http://en.wikipedia.org/wiki/Dirichlet%27s_theorem_on_arithmetic_progressions |
|||
|
|
|
It really depends on what you mean by patterns. Legendre showed that there is no rational algebraic function that outputs only primes. You can read more about prime generating functions here http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html The famous Green-Tao theorem states that there are arbitrarily large arithmetic progressions in primes |
|||
|
|
|
I especially like this characterization of primes made by Don Zagier
This is taken from this site where you can find many more quotations from prominent mathematicians. Here you can find some formulas for primes. |
||||
|
|