1. Verify that Φ(84)=Φ(12)Φ(7) by finding a bijection between ordered pairs. % Y; E1 b. K! Z# I5 {* V& |2. Programme Rowland's formular and verify his results. Try different starting values and see what happens.7 P$ v& E @ q7 T7 K: i: D! T. u
3. Verify the following result called Wilson's Theory: An integer n is prime if and only if (n-1)!≡-1(mod n ) for the cases n=2,3,4,5...,10. Can this be used as an efficent test for a prime?* I$ C% L; U9 F7 Q4 r1 s0 k! @
4. Prove that if n is a pseudoprime to base 2 then 2^n-1 is a pseudoprime to base 2 also. % x, g1 X2 F) _1 J5 w; Y5. IS 341 a pseudoprime to the base 5? Is 341 a pseudoprime to base 7? Is 341 a pseudoprime to base 13? # v. j7 e7 @. Q0 K6. Verify that 1729 and 2465 are Carmichael numbers using the Korselt criterion and directly. * q. K, |1 n! w7 c1 x8 z2 i7. Can pq be a Carmichael number where p and q are odd primes. & B- D7 e) t' m: q
8. Find a k such that 6k+1,12k+1,18k+1 are all prime numbers. Prove that then n=(6k+1)(12k+1)(18k+1) is a Carmichael number. ; E2 ?% _; K+ f* P* ~9. Apply the Rabin-Miller test to n=1729 and n=2465 " Y% P3 F4 U& g7 p10. Let n=667. For which a is a^667≡a(mod 667). Do the same for n=833. You might need to write a ** programme in Maple.