This question already has an answer here:
How do I prove the following using the Pigeonhole principle?
Let $n$ be an odd integer. Prove that there exists a positive integer $k$ such that $2^k \mod n = 1$.
I don't understand how I can prove this. Any help would be appreciated.