2. An investigation of perfect numbers Our goal is to give a proof of the following:...

Transcribed Image Text:

2. An investigation of perfect numbers Our goal is to give a proof of the following: 2m-1(2m –1), Theorem: Suppose n is an even perfect number, then n has the form n = where 2m – 1 is a prime. (a) In class we proved that (r * U)(n) = 0r(n), showing that the arithmetic function Ok is multiplicative. Deduce a formula for or(p°) where p is a prime and e is some natural number. Hint: List all the divisors of pº, notice that the sum of their kth powers forms a geometric summation and recall that a geometric summation has closed form sl+1 = a j=0 What are the numbers a and s in this example? (b) Specializing part (a) to the case when k explicitly o(2m-1(2m – 1)), thus concluding that for any Mersenne prime 2m – 1 the integer 2m-1(2m – 1) is perfect. = 1, assume 2m – 1 is prime and compute (c) Now assume n is even and perfect, meaning that we can write n = 2m-lt for some odd t and o(n) = 2n. Prove that t is a Mersenne prime. Hint: Deduce that 2m – 1 | t=t = (2™ – 1)M for some integer M and plug this in to two different expressions for o(n). 2. An investigation of perfect numbers Our goal is to give a proof of the following: 2m-1(2m –1), Theorem: Suppose n is an even perfect number, then n has the form n = where 2m – 1 is a prime. (a) In class we proved that (r * U)(n) = 0r(n), showing that the arithmetic function Ok is multiplicative. Deduce a formula for or(p°) where p is a prime and e is some natural number. Hint: List all the divisors of pº, notice that the sum of their kth powers forms a geometric summation and recall that a geometric summation has closed form sl+1 = a j=0 What are the numbers a and s in this example? (b) Specializing part (a) to the case when k explicitly o(2m-1(2m – 1)), thus concluding that for any Mersenne prime 2m – 1 the integer 2m-1(2m – 1) is perfect. = 1, assume 2m – 1 is prime and compute (c) Now assume n is even and perfect, meaning that we can write n = 2m-lt for some odd t and o(n) = 2n. Prove that t is a Mersenne prime. Hint: Deduce that 2m – 1 | t=t = (2™ – 1)M for some integer M and plug this in to two different expressions for o(n).

Answer rating: 100% (QA)

Ansurer of Part loi Wa have du o ulbes bis brme en... View the full answer