Maths Olympiad Prep

Library / /422 of 520

Number theory Difficulty 6.0 National olympiad Prove it

5. Prove: There are infinitely many primes of the form 4k+14k+1:

Keep the original text's line breaks and format, and output the translation result directly.

However, it seems there was a misunderstanding in your request. Here is the correct translation:

5. Prove: There are infinitely many primes of the form 4k+14k+1:

Solution

5. Assume there are only finitely many such primes, let them be p1,p2,,pk p_{1}, p_{2}, \cdots, p_{k} .

We consider (2p1pk)2+1=p\left(2 p_{1} \cdots p_{k}\right)^{2}+1=p. By assumption and p1(mod4) p \equiv 1(\bmod 4) , so p p is not a prime, let p0 p_{0} be a prime factor of p p , p0 p_{0} is of course odd, so -1 is a quadratic residue modulo p0 p_{0} , i.e., (1p0)=1\left(\frac{-1}{p_{0}}\right)=1, thus p01(mod4) p_{0} \equiv 1(\bmod 4) , but p0 p_{0} is clearly not p1,p2,,pk p_{1}, p_{2}, \cdots, p_{k} , which contradicts the assumption.
Therefore, there are infinitely many primes of the form 4k+1 4 k+1 .

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.