Science:Math Exam Resources/Courses/MATH312/December 2008/Question 04 (b)

MATH312 December 2008

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

  •  Q1 (a)  •  Q1 (b)  •  Q1 (c)  •  Q1 (d)  •  Q1 (e)  •  Q1 (f)  •  Q2 (a) i  •  Q2 (a) ii  •  Q2 (a) iii  •  Q2 (a) iv  •  Q2 (b)  •  Q3 (a)  •  Q3 (b)  •  Q3 (c)  •  Q4 (a)  •  Q4 (b)  •  Q4 (c)  •  Q5 (a)  •  Q5 (b)  •  Q5 (c)  •  Q6 (a)  •  Q6 (b)  •  Q6 (c)  •  Q6 (d)  •  

   Other MATH312 Exams

  •  December 2010  •  December 2008  •  December 2005  •  December 2013  •  December 2012  •  December 2009  •  

Question 04 (b)
Prove that $\displaystyle 1729=7\cdot 13\cdot 19$ is a Carmichael number. (Hint: $\displaystyle 1728=6\cdot 288=12\cdot 144=18\cdot 96$)

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
A Carmichael number is a composite number n which satisfies $\displaystyle b^{n-1}\equiv 1\mod {n}$ for all integers with $\displaystyle \gcd(b,n)=1$.

Hint 2
Recall Korselt's criterion which states that a positive composite integer n is a Carmichael number if and only if n is square free and for all prime divisors p of n, it is true that $\displaystyle (p-1)\mid (n-1)$

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. We proceed using the hints. Clearly 1729 is square free so it suffices to check that for each prime divisor, we have that $(p-1)\mid (n-1)$. We proceed mechanically ${\begin{aligned}(7-1)&=6\mid 1728\\(13-1)&=12\mid 1728\\(19-1)&=18\mid 1728\end{aligned}}$ And all of these are true since $\displaystyle 1728=12^{3}=2^{6}3^{3}$. Hence 1729 is a Carmichael number.

Click here for similar questions

MER QGQ flag, MER RH flag, MER RS flag, MER RT flag, MER Tag Carmichael number, Pages using DynamicPageList3 parser function, Pages using DynamicPageList3 parser tag