Unformatted text preview: . If p is a prime, show that all prime divisors of 2 p-1 are congruent to 1 mod p . (For example, 2 11-1 = 23 Â· 89 is divisible by the primes 23 and 89 and by no others.) 5 (7 points) . Let Î¼ be the MÂ¨obius function, and let Ï be the function whose value on n â¥ 1 is the number of divisors of n . Explain why the function F ( n ) := X d | n Î¼ ( d ) Ï ( d ) satisï¬es the relation F ( n 1 n 2 ) = F ( n 1 ) F ( n 2 ) when gcd( n 1 , n 2 ) = 1. Calculate F ( p e ) when p is a prime and e is a positive integer....
View Full Document
- Spring '08
- Prime number, closed-book, complete English sentences, K. A. Ribet, primitive roots mod, Professor K. A. Ribet