Unformatted text preview: 2010 when divided by 7. 4. Using Euler’s Theorem, ﬁnd the last two digits of the number 3 2010 in the decimal representation. 5. If n is any integer, prove that n 2 ≡ 0 (mod 4) or n 2 ≡ 1 (mod 8). 6. Bonus Question! Find the last three digits of 2 2010 in the decimal representation....
View
Full
Document
This note was uploaded on 12/07/2011 for the course MATH 245 taught by Professor Cioaba during the Fall '10 term at University of Delaware.
 Fall '10
 CIOABA
 Integers

Click to edit the document details