Maths Olympiad Prep

Library / /342 of 520

Number theory Difficulty 6.3 National olympiad Prove it

16. a) Show that the probability that nn is a strong pseudoprime for a base bb randomly chosen with 1bn11 \leqslant b \leqslant n-1 is near (n1)/4(n-1) / 4 only when nn has a prime factorization of the form n=p1p2n=p_{1} p_{2} where p1=1+2q1p_{1}=1+2 q_{1} and p2=1+4q2p_{2}=1+4 q_{2} with q1q_{1} and q2q_{2} prime or n=p1p2p3n=p_{1} p_{2} p_{3} where p1=1+2q1p_{1}=1+2 q_{1}, p2=1+2q2,p3=1+2q3p_{2}=1+2 q_{2}, p_{3}=1+2 q_{3} with q1,q2,q3q_{1}, q_{2}, q_{3} distinct odd primes.
b) Find the probability that n=49939.99877n=49939.99877 is a strong pseudoprime to the base bb randomly chosen with 1bn11 \leqslant b \leqslant n-1.

Solution

16. b) (49938.99876)/(44993999877)=.24999249(49938.99876) /(4 \cdot 49939 \cdot 99877)=.24999249 \ldots

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.