Q.If . Write in the roster form.
The set consists of all positive divisors of a perfect number of the form where is prime. Since is prime, the divisors are and each multiplied by the prime . So .
The problem gives you a number of the form , with the condition that is prime. This is the classic form of an even perfect number — every even perfect number is of this shape, and conversely, whenever is prime (a Mersenne prime), is perfect.
But we don't need the perfection property here. What matters is the factor structure. Since is prime, call it . Then , where is an odd prime and is a power of 2. The two parts are coprime (one is a power of 2, the other is an odd prime), so the divisors of are simply all possible products of a divisor of and a divisor of .
Let's list them systematically.
-
Divisors of : These are . That's numbers.
-
Divisors of (where is prime): Only and itself.
-
All divisors of : Take each divisor of and multiply it by each divisor of . That gives:
- Multiply by :
- Multiply by :
No other combinations exist because has no other factors.
-
Total count: There are divisors from the first row and from the second, so divisors in all. This matches the divisor-count formula: if , then .
A common mistake is to forget that is a divisor, or to think that itself might factor further. The problem explicitly states is prime, so it has exactly two divisors: and itself.
Notice that the divisors come in natural pairs: each divisor from the first row pairs with from the second row. For example, pairs with , pairs with , and so on. This is a hallmark of perfect numbers — the sum of all divisors equals .
So the roster form of is simply the list of all these numbers.
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.