Science:Math Exam Resources/Courses/MATH312/December 2008/Question 01 (e)
• 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) •
Question 01 (e) 

For each of the following statements, indicate if it holds for every positive integers (if so, a simple true without a proof suffices, if not, a false together with a counterexample is expected). If , then . 
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! 
Hint 

This should remind you of a mixture of Fermat's Little Theorem and Euler's Theorem. Can you use these to guide your solution? 
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.

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. The statement is false We seek a counter example and we take the smallest composite number for b, namely . We then take . Then . For a more enlightening proof, recall that by Euler's Theorem
Thus if we find a value of b where we would be able to construct a counter example since in this case there are integers s and t such that
and so choosing an a coprime to b between 2 and b1 would give us that
which would be a contradiction. This is what we did above. 