Paper 1, Section I, 1F1 F

Number Theory | Part II, 2014

Define what it means for a number NN to be a pseudoprime to the base bb.

Show that if there is a base bb to which NN is not a pseudoprime, then NN is a pseudoprime to at most half of all possible bases.

Let nn be an integer greater than 1 such that Fn=22n+1F_{n}=2^{2^{n}}+1 is composite. Show that FnF_{n} is a pseudoprime to the base 2 .

Typos? Please submit corrections to this page on GitHub.