Browse · MathNet
PrintAPMO
algebra
Problem
For a positive integer , call an integer a pure -th power if it can be represented as for some integer . Show that for every positive integer there exist distinct positive integers such that their sum is a pure -th power, and their product is a pure -th power.
Solution
For the sake of simplicity, let us set .
First of all, choose distinct positive integers suitably so that their product is a pure -th power (for example, let for ). Then we have for some positive integer . Set .
Now we set for , and show that satisfy the required conditions. Since are distinct positive integers, it is clear that so are . From we can see that satisfy the conditions on the sum and the product as well. This ends the proof of the assertion.
First of all, choose distinct positive integers suitably so that their product is a pure -th power (for example, let for ). Then we have for some positive integer . Set .
Now we set for , and show that satisfy the required conditions. Since are distinct positive integers, it is clear that so are . From we can see that satisfy the conditions on the sum and the product as well. This ends the proof of the assertion.
Techniques
IntegersOther