Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How can one tell that a given sequence is perodic modulo m?

For example its easy to see that the sequence $1^1, 2^2, 3^3, \dots$ is periodic modulo 10. But how can we prove this?

share|improve this question
3  
Euler's totient theorem (en.wikipedia.org/wiki/Euler's_theorem) is a good start. –  Qiaochu Yuan Mar 15 '11 at 20:14
add comment

1 Answer

up vote 3 down vote accepted

HINT $\rm\ \ \ \ \ \ \ \:mod\ 5\::\ (N+20)^{N+20}\ \equiv\ N^{20}\ N^N\ \equiv\ N^N\ $ for $\rm\ N\not\equiv 0\ $

Generally $\rm\ \ mod\ P\::\ (N+P(P-1))^{N+P(P-1)}\ \equiv\ N^N\ N^{P(P-1)}\ N^N\ \equiv\ N^N\ $ for $\rm\ N\not\equiv 0$

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.