bers Euclid (born approx. 300 BCE) discovered that the first four perfect numbers are generated by the formula (2P-1)(2P – 1), where P is prime. a.) The second part of this formula, (2P – 1), is a special kind of prime number, invented by a French monk, called a prime (sec. 2.1). b.) Show how you would use this formula (2P-1)(2P – 1)with P= 2. You should get the first perfect number, 6. Caution: in the first part, (2P-1), all of the P-1 is in the exponent. In the second part, (2P – 1), only the P is in the exponent. c.) Show how you know 6 is perfect by showing what its proper divisors add up to.
bers Euclid (born approx. 300 BCE) discovered that the first four perfect numbers are generated by the formula (2P-1)(2P – 1), where P is prime. a.) The second part of this formula, (2P – 1), is a special kind of prime number, invented by a French monk, called a prime (sec. 2.1). b.) Show how you would use this formula (2P-1)(2P – 1)with P= 2. You should get the first perfect number, 6. Caution: in the first part, (2P-1), all of the P-1 is in the exponent. In the second part, (2P – 1), only the P is in the exponent. c.) Show how you know 6 is perfect by showing what its proper divisors add up to.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
100%
![ient and Abl
ural number is deficient if it is greater than
bundant if it is less than the sum of its proper divisors.
lente
her is one with proper divisors that add up to
--is one with proper divisors that
nner divisors of 8
Project 2: Number Patterns, p. 11
9. Perfect Numbers
Euclid (born approx. 300 BCE) discovered that the first four perfect numbers are
generated by the formula (2P-1)(2P – 1), where P is prime.
a.) The second part of this formula, (2P – 1), is a special kind of prime number, invented
by a French monk, called a
prime (sec. 2.1).
b.) Show how you would use this formula (2P-1)(2P – 1)with P= 2. You should get the
first perfect number, 6. Caution: in the first part, (2P-1), all of the P-1 is in the
exponent. In the second part, (2P – 1), only the P is in the exponent.
c.) Show how you know 6 is perfect by showing what its proper divisors add up to.
d.) Find the second perfect number using the formula (2P-1)(2P – 1)and the next prime
number for P. (Do not use P = 4, since 4 is not prime). TIP: when you are done, you
might do a web search for perfect numbers to see if you are right.
wtar
with sre
e.) Show how you know this new number is perfect by showing what the proper
divisors add up to.
the
f.) Find the third perfect number using the formula (2P-1)(2P – 1) and the next prime
number for P. Show your work, not just your answer.
g.) Use a prime factor tree to find all the prime factors of your new perfect number.
This will help you find the proper divisors.
FOlin Che blonks, aalng a inatnd of
the the forule in the
The la fon
h.) Show how you know this new number is perfect by showing what the proper
divisors add up to.
thesome elants](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbd5c79e5-70ae-4a6c-8880-f3d5d9d15fc2%2Fcbc66df3-510d-48b8-bd80-830c811bf9ef%2Fra5f7r_processed.jpeg&w=3840&q=75)
Transcribed Image Text:ient and Abl
ural number is deficient if it is greater than
bundant if it is less than the sum of its proper divisors.
lente
her is one with proper divisors that add up to
--is one with proper divisors that
nner divisors of 8
Project 2: Number Patterns, p. 11
9. Perfect Numbers
Euclid (born approx. 300 BCE) discovered that the first four perfect numbers are
generated by the formula (2P-1)(2P – 1), where P is prime.
a.) The second part of this formula, (2P – 1), is a special kind of prime number, invented
by a French monk, called a
prime (sec. 2.1).
b.) Show how you would use this formula (2P-1)(2P – 1)with P= 2. You should get the
first perfect number, 6. Caution: in the first part, (2P-1), all of the P-1 is in the
exponent. In the second part, (2P – 1), only the P is in the exponent.
c.) Show how you know 6 is perfect by showing what its proper divisors add up to.
d.) Find the second perfect number using the formula (2P-1)(2P – 1)and the next prime
number for P. (Do not use P = 4, since 4 is not prime). TIP: when you are done, you
might do a web search for perfect numbers to see if you are right.
wtar
with sre
e.) Show how you know this new number is perfect by showing what the proper
divisors add up to.
the
f.) Find the third perfect number using the formula (2P-1)(2P – 1) and the next prime
number for P. Show your work, not just your answer.
g.) Use a prime factor tree to find all the prime factors of your new perfect number.
This will help you find the proper divisors.
FOlin Che blonks, aalng a inatnd of
the the forule in the
The la fon
h.) Show how you know this new number is perfect by showing what the proper
divisors add up to.
thesome elants
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Advanced Engineering Mathematics](https://www.bartleby.com/isbn_cover_images/9780470458365/9780470458365_smallCoverImage.gif)
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
![Numerical Methods for Engineers](https://www.bartleby.com/isbn_cover_images/9780073397924/9780073397924_smallCoverImage.gif)
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
![Introductory Mathematics for Engineering Applicat…](https://www.bartleby.com/isbn_cover_images/9781118141809/9781118141809_smallCoverImage.gif)
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
![Mathematics For Machine Technology](https://www.bartleby.com/isbn_cover_images/9781337798310/9781337798310_smallCoverImage.jpg)
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
![Basic Technical Mathematics](https://www.bartleby.com/isbn_cover_images/9780134437705/9780134437705_smallCoverImage.gif)
![Topology](https://www.bartleby.com/isbn_cover_images/9780134689517/9780134689517_smallCoverImage.gif)