Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

There should be infinitely many primes of the form $5+6n$. How do you prove it? The same should be true for $7+6n$.

share|cite|improve this question
related. – TMM May 31 '13 at 0:24

Primes of the form $6n+5$ is particularly easy:

Suppose that there are finitely many primes of the form $6n+5$, namely $p_1,\cdots, p_n$.

Consider $p^*=6p_1\cdots p_n -1$.

Note that any odd prime other than 3, is of the form $6n+1$ or $6n+5$.

Thus, prime divisors of $p^*$ are either of the form $6n+1$ or $6n+5$.

The prime divisors of $p^*$ should have at least one prime divisor of the form $6n+5$.

This is a contradiction.

For primes of the form $6n+1$, use the following:

"Existence of $x$ in $x^2-x+1\equiv 0\textrm{ mod }p$ $\Longleftrightarrow$ $p$ is of the form $6n+1$."

Suppose there are only finitely many $6n+1$ primes, namely $p_1,\cdots, p_n$,

Then consider $p^*=(p_1\cdots p_n)^2-(p_1\cdots p_n) + 1$.

Prime divisor of $p^*$ should be of the form $6n+1$ according to the above equivalence.

This is a contradiction.

share|cite|improve this answer

If we cross out from sequence of positive integers all numbers divisible by 2 and 3 than all remaining numbers will be in one of two forms:

$ S1(p)=6p+5=5, 11, 17,...$ or $S2(p)=6p+7=7, 13, 19,...$

So all prime numbers also will be in these two forms.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.