Question

Let p be a prime. Consider the sequence 11,22,3, 44,55 modulo p. Prove that the resulting sequence is periodic with smallest

0 0
Add a comment Improve this question Transcribed image text
Answer #1

We will first show that when l=p(p-1), then the property holds. Let nmmod , that is n=m kl for some integer k.

If m 0 mod , the trivially Pn- m m as p | l.

Look at m+kl n - mmn -m m-mm (n - m)(m m m

(n m)m (m - 1).

n m n hence Pn-m . Now since m,p) = 1m^{kl} -1 \equiv 0 \mod p since p-1 | l.

Therefore Pn- m m .

We now show that p(p-1) is the smallest integer with this property. Let l be any integer with the property.

Take m= p \text{ and } n = p+l . Look at the following equation modulo p

n^n -m^m \equiv (p+l)^{p+l} - p^p \equiv (p^p +l^p)(p+l)^l \equiv l^p (p+l)^l \equiv 0 \mod p

Which means p | l \text{ or } p | p+l . Hence p|l.

Take m=2 \text{ and } n=l+2 , then

n^n - m^m \equiv (l+2)^{l+2} - 2^2 \equiv (l^l+2^l)(l+2)^2-4 \equiv 2^l \times 4 -4 as p|l.

\implies p|4(2^l-1). But p is an odd prime hence

p | 2^l-1. But 2 have order p-1 in the multiplicative group \mathbb{F}^{\times}_p .

Hence p-1|l.

We have that p(p-1)|l. The smallest such integer is p(p-1).

Therefore the period is p(p-1).

Add a comment
Know the answer?
Add Answer to:
Let p be a prime. Consider the sequence 11,22,3, 44,55 modulo p. Prove that the resulting...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT