Unformatted text preview: x and y , must it be true that 2 x â‰¡ 2 y (mod n ) if x â‰¡ y (mod n )? (b) Show that 2 70 + 3 70 is divisible by 13. (c) Calculate the last two digits of 3 1200 . 4. Suppose that n > 1 is a positive integer greater such that 2 n + n 2 is prime. Show that n is divisible by 3. (Hint: work in mod 6.)...
View
Full
Document
This note was uploaded on 01/12/2010 for the course CALC 2b taught by Professor Doolittle during the Winter '06 term at Berkeley.
 Winter '06
 doolittle

Click to edit the document details