Answer on Question #51698 – Math – Combinatorics | Number Theory
Let be a prime number. If divides , prove that divides , where is a positive integer.
Solution
Let divide . Assume that doesn't divide .
Since divides , then there exists integer such that . Hence we obtain .
Since is a positive integer, then is a positive integer. Since is a prime number then it has only two divisors: 1 and . Due to our assumption doesn't divide , therefore . Hence is a positive integer. Assume that , then is a positive integer.
Therefore , where is a positive integer, but this means that divides . So, we come to a contradiction to our assumption.
Thus, divides .
www.AssignmentExpert.com
Comments