# Functions Problem 2

This is a typical pigeonhole principle problem. There is a trick to making work. And you're going to feel really stupid until you see the trick. Accept that. If you keep pounding on this and aren't making progress, put it down for a while (perhaps overnight) so you can see it from a fresh perspective.

### Modular numbers

Suppose you are working in $$\mathbb{Z}_{11}$$ and you compute $$[5]^m$$ for various values of m.

• How many different values are there in $$\mathbb{Z}_{11}$$?
• How many different modular numbers can you get if you compute $$[5]^m$$ for many values of m?
• Suppose we compute $$5^m$$ as a normal integer power. How many different possible values are there for the remainder of $$5^m$$ divided by 11?

### Giving meaning to the equation

Perhaps you are thinking of $$13^m-13^n$$ as a single algebraic expression, and then trying to figure out when it might be divisible by 13. However, remember that "x-y is divisible by k" is equivalent to $$x \equiv y \pmod{k}$$. Maybe the problem is easier to think about if you think about $$13^m$$ and $$13^n$$ as separate numbers, and then try to compare them in some modular way.