MATH312 December 2012
• Q1 (a) • Q1 (b) • Q1 (c) • Q1 (d) • Q1 (e) • Q1 (f) • Q1 (g) • Q2 (a) • Q2 (b) • Q2 (c) • Q2 (d) • Q3 • Q4 • Q5 •
Question 01 (f)
Short answer questions: Each question carries 6 marks, your answers should quote the results being used and show your work.
Define a Carmichael number. Use the necessary and sufficient condition for a number to be a Carmichael number to show that 561 is a Carmichael number.
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 hint below. Consider it for a while. Does it give you a new idea on how to approach the problem? If so, try it!
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
Checking a solution serves two purposes: helping you if, after having used the hint, 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.
Found a typo? Is this solution unclear? Let us know here.
Please rate my easiness! It's quick and helps everyone guide their studies.
A Carmichael number is a composite number n which satisfies
for all integers with .
For 561, we use Korselt's criterion which states that for each prime dividing n, we must check that . Since
we check that
valid since . Thus 561 is a Carmichael number.
Click here for similar questions
MER QGH flag, MER QGQ flag, MER QGS flag, MER RT flag, MER Tag Carmichael number, Pages using DynamicPageList parser function, Pages using DynamicPageList parser tag