Science:Math Exam Resources/Courses/MATH312/December 2008/Question 06 (b)
{{#incat:MER QGQ flag|{{#incat:MER QGH flag|{{#incat:MER QGS flag|}}}}}}
• 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 (b) |
|---|
|
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 prime-power factorization as for different primes and positive integer exponents and some positive integer k. Let and focus on the prime power in the prime-power factorization of m. (b) Prove that if then . You might want to do this as follows:
|
|
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 |
|---|
|
Again the question outlines the proof fairly thoroughly. |
|
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 |
|---|
|
We prove the sub claims as outlines in the question. Prove that . For this, we use the property of the phi function to see
and thus by the multiplicativity of the phi function, we have
and hence . Prove that . The above shows that and this completes the proof. Prove that (here you may use without proof that .) We have that . Therefore, . We finish off this problem by noticing that . |
{{#incat:MER CT flag||
}}
