For the positive integer , let denote the sum of all the positive divisors of with the exception of itself. For example, and . What is ?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
The divisors of 6 other than 6 are 1, 2 and 3, which add up to 6. So each step turns 6 back into 6.
Solution
1. The brackets are nested, so start with the innermost one: .
2. The divisors of are . Leave out itself and add the rest:
3. The answer came back as . So the next bracket is again , which is again .
4. The same happens for the outer bracket:
The answer is .
Why this works
With brackets inside brackets, always work from the inside out and actually compute the first step. Here the first step gives back the number you started with, so nothing ever changes. Numbers like , equal to the sum of their divisors other than themselves, are called perfect numbers ( is the next one).
The trap
Counting 6 itself as one of the divisors, getting 12, and then carrying on with the divisors of 12.
Concise solution
Work from the inside out. The divisors of other than itself are , so
The operation sends back to , so the next two applications change nothing:
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Algebra, Chapter 16: Functions
- Introduction to Number Theory, Chapter 5: Divisor Problems (§5.2, §5.3)
- Introduction to Algebra, Chapter 17: Graphing Functions (§17.2)
Techniques
Set up the equation/formula and compute; no special trick needed