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

The purpose of this problem is to prove the following theorem. Theorem 1. For all positive integers we have Let be positive integers. For , the theorem holds trivially, so we assume from now on that and write its primepower factorization as for different primes and positive integer exponents and some positive integer k. Let and focus on the prime power in the primepower factorization of m. (a) Prove that if then Hint: Use Euler's theorem and prove/use that 
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 

The hint in the problem tells you how this proof should be formulated. 
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. Proceed as in the hint given in the problem. Notice that
holding since is multiplicative. Hence and for simplicity, say for some integer s. Thus
where the last line holds by Euler's theorem since we are given in this question that so . 