Maths Olympiad Prep

Library / /327 of 520

Number theory Difficulty 6.2 National olympiad Prove it

6. Show that there are infinitely many primes of the form 5k+45 k+4. (Hint: Let nn be a positive integer and form Q=5(n!)2+4Q=5(n!)^{2}+4. Show that QQ has a prime divisor of the form 5k+45 k+4 greater than nn. To do this, use the law of quadratic reciprocity to show that if a prime pp divides QQ, then (p5)=1\left(\frac{p}{5}\right)=1.)

Solution

None

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.