BetonaBG Posted September 23, 2004 Posted September 23, 2004 First of all, I'd like to say Hello to everyone as this is my first post Now the fun part, I spend 2-3h in painful strugle and I was unable to prove the following question. If anyone knows how to solve it it will be largely appreciated Prove for any positive integer n that: 2196^n – 25^n – 180^n + 13^n is divisible by 2004 Have Fun
haggy Posted September 25, 2004 Posted September 25, 2004 2004 = 167*3*4 These are relatively prime to one another. 2196^n – 25^n – 180^n + 13^n = (13*167+25)^n -25^n -(167+13)^n +13^n Therefore 2196^n – 25^n – 180^n + 13^n = 25^n -25^n -13^n +13^n (mod 167) 2196^n – 25^n – 180^n + 13^n = 0 (mod 167) Likewise 2196^n – 25^n – 180^n + 13^n = 0 (mod 3) 2196^n – 25^n – 180^n + 13^n = 0 (mod 4) Therefore 2196^n – 25^n – 180^n + 13^n = 0 (mod 2004)
BetonaBG Posted September 27, 2004 Author Posted September 27, 2004 I'll say simple - Thanks but my gratitude pales in comparatively with my words.
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now