You are here:

Number Theory/Properties of Congruence

Advertisement


Question
Question: For n>= 1(n is greater or equal to 1) use congruence theory to
establish:
27|2^5n+1 + 5^5n+2.

I tried breaking it up to 27|2^5n(2^1) + 5^5n(5^2).  This brings me to
27|32^n(2) + 5^5n(25). Then I break it up more by 3*9|32^n(2) +
5^5n(25).
Now I am stuck. Please help.

Answer
Hello JJ
I am afraid there is a misprint somewhere.  it doesn't work when n=1.  The expression evaluates to 78189 which is congruent to 24 mod 27.  I am assuming that 5n+1 and 5n+2 should be parenthesised.
When you find out the misprint, the following could be useful:
5^2 = -2 mod 27. 2^5 = 5 mod 27.  
2^18 = 5^18 = 1 mod 27 from Euler's theorem (Phi(27) = 18.
Best wishes
vijilant

Number Theory

All Answers


Answers by Expert:


Ask Experts

Volunteer


Vijilant

Expertise

Most questions on number theory, divisibility, primes, Euclidean algorithm, Fermat`s theorem, Wilson`s theorem, factorisation, euclidean algorithm, diophantine equations, Chinese remainder theorem, group theory, congruences, continued fractions.

Experience

Teacher of math for 50 years

Organizations
ATL

Publications
Journal of mathematics and its applications

Education/Credentials
BSc Hons Liverpool

Awards and Honors
State Scholarship 1955

Past/Present Clients
I taught John Birt, former Director of the BBC in 1961. His homework book was the most perfect I have ever marked. And also the most neat. I could tell he was destined for great things. One of my classmates was the poet Roger McGough, and I have a mention in his autobiography.

©2012 About.com, a part of The New York Times Company. All rights reserved.