Science:Math Exam Resources/Courses/MATH437/December 2011/Question 01

MATH437 December 2011

Work in progress: this question page is incomplete, there might be mistakes in the material you are seeing here.

  •  Q1  •  Q2  •  Q3  •  Q4  •  Q5  •  Q6  •  Q7 (i)  •  Q7 (ii)  •  

   Other MATH437 Exams

  •  December 2006  •  December 2011  •  

Question 01
Let n be an integer such that $\displaystyle n>1$. Prove that $\displaystyle n\nmid (2^{n}-1)$.

Make sure you understand the problem fully: What is the question asking you to do? Are there specific conditions or constraints that you should take note of? How will you know if your answer is correct from your work only? Can you rephrase the question in your own words in a way that makes sense to you?

If you are stuck, check the hints below. Read the first one and consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it! If after a while you are still stuck, go for the next hint.

Hint 1
Prove this by contradiction.

Hint 2
A helpful idea is to consider the smallest prime dividing n.

Hint 3
Combining Fermat's Little Theorem as well as notice that if $\displaystyle 2^{a}\equiv 1\mod {p}$ and $\displaystyle 2^{b}\equiv 1\mod {p}$ then $\displaystyle 2^{\gcd(a,b)}\equiv 1\mod {p}$ will help complete the problem.

Checking a solution serves two purposes: helping you if, after having used all the hints, you still are stuck on the problem; or if you have solved the problem and would like to check your work. If you are stuck on a problem: Read the solution slowly and as soon as you feel you could finish the problem on your own, hide it and work on the problem. Come back later to the solution if you are stuck or if you want to check your work. If you want to check your work: Don't only focus on the answer, problems are mostly marked for the work you do, make sure you understand all the steps that were required to complete the problem and see if you made mistakes or forgot some aspects. Your goal is to check that your mental process was correct, not only the result.

Solution

Found a typo? Is this solution unclear? Let us know here. Please rate my easiness! It's quick and helps everyone guide their studies. Assume towards a contradiction that $\displaystyle n\mid (2^{n}-1)$. Let p be the smallest prime dividing n. Notice that $\displaystyle 2^{n}-1$ is odd and so p is not 2. Thus, we have that $\displaystyle 2^{n}\equiv 1\mod {p}$ and by Fermat's Little Theorem, we also have that $\displaystyle 2^{p-1}\equiv 1\mod {p}$. Thus, we also have that (via the Euclidean Algorithm) $\displaystyle 2^{\gcd(n,p-1)}\equiv 1\mod {p}$. However $\displaystyle \gcd(n,p-1)=1$ since p was the smallest prime dividing n. This gives us that $\displaystyle 2\equiv 1\mod {p}$ which is a contradiction.

Click here for similar questions

MER QGQ flag, MER RH flag, MER RS flag, MER RT flag, MER Tag Fermat's little theorem, Pages using DynamicPageList3 parser function, Pages using DynamicPageList3 parser tag