
Advanced Engineering Mathematics
10th Edition
ISBN: 9780470458365
Author: Erwin Kreyszig
Publisher: Wiley, John & Sons, Incorporated
expand_more
expand_more
format_list_bulleted
Question
![2.
The Hellenistic mathematician Nicomachus studied the following
concept related to perfect numbers: A positive integer is said to be deficient if it is greater
than the sum of its proper divisors and abundant if it is less than the sum of its proper
divisors. Prove that there are infinitely many numbers of each type as follows:
[Hint: What are its
a) If p is a prime, prove that every power of p is deficient.
proper divisors?]
(b) If m is a positive integer, prove that 40m is abundant. [Hint: Consider first the
case m = 1 and note (2) if d divides 40, then dm divides 40m, (ii) it is enough to the sum
of a subset of the proper divisors of a number is greater than the number itself.]
%3D](https://content.bartleby.com/qna-images/question/8b0185de-0645-4c2a-aea4-e046d61ab5cb/bb117225-b978-4f46-a3ed-956be8d5db5c/bgorkmo.jpeg)
Transcribed Image Text:2.
The Hellenistic mathematician Nicomachus studied the following
concept related to perfect numbers: A positive integer is said to be deficient if it is greater
than the sum of its proper divisors and abundant if it is less than the sum of its proper
divisors. Prove that there are infinitely many numbers of each type as follows:
[Hint: What are its
a) If p is a prime, prove that every power of p is deficient.
proper divisors?]
(b) If m is a positive integer, prove that 40m is abundant. [Hint: Consider first the
case m = 1 and note (2) if d divides 40, then dm divides 40m, (ii) it is enough to the sum
of a subset of the proper divisors of a number is greater than the number itself.]
%3D
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 2 images

Knowledge Booster
Similar questions
- Assuming every integer is either even or odd, How would I show that for any integer, the difference between it and its cube is evenarrow_forward(1) Let p be a prime number. Show that for any integer a the greatest common divisor of p and a is either p (if pla) or is 1 (if p does not divide a).arrow_forwardwhat steps need more justification or explanation Proof: 1) Proof by contradiction, so I need to show that the negation is false. 2) Negation: There exists a largest prime number N. 3) Suppose there exists a largest prime number N. Then all numbers bigger than N can be factored into some smaller primes. 4) Consider the product N!+1= (1*2*3*4 … *N) +1 5) Any number between 1 and N will have a remainder of 1 when you try to divide it into N! +1. 6) Rephrasing: (N!+1)/x is not a whole number for any integer x in {1, … N}. 7) That means none of those numbers {1, … ,N} can be factors of N!+1 because they don’t divide in evenly. 8) So N!+1 has no factors between 1 and N. But all of the primes are between 1 and N because N is the largest prime. So N!+1 would need to be a prime! 9) But N!+1 is bigger than N. Contradictionarrow_forward
- Prove or refute the each of the following similar statements:(∀n∈N)(4 |n2→4 |n)(If the square of any natural number is divisible by 4, that number isdivisible by 4.)arrow_forwardThere are 11 cows in a field. Each cow has a non-negative integer number of spots on it. Is it possible to always find a subset of the 11 cows such that the sum of the spots on the cows in that subset is a multiple of 11arrow_forwardConsider all positive integers with seven different digits. (Note that zero cannot be the first digit, and by different, we mean that there is no repeated digit in the number.) a.) Find the number of them if there's no other restriction.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Advanced Engineering MathematicsAdvanced MathISBN:9780470458365Author:Erwin KreyszigPublisher:Wiley, John & Sons, IncorporatedNumerical Methods for EngineersAdvanced MathISBN:9780073397924Author:Steven C. Chapra Dr., Raymond P. CanalePublisher:McGraw-Hill EducationIntroductory Mathematics for Engineering Applicat...Advanced MathISBN:9781118141809Author:Nathan KlingbeilPublisher:WILEY
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,

Advanced Engineering Mathematics
Advanced Math
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Wiley, John & Sons, Incorporated

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...
Advanced Math
ISBN:9781118141809
Author:Nathan Klingbeil
Publisher:WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,

