Difference between revisions of "1970 IMO Problems/Problem 4"
(creation) |
(→Solution) |
||
| Line 3: | Line 3: | ||
==Solution== | ==Solution== | ||
| − | { | + | The only primes dividing numbers in the set can be 2, 3 or 5, because if any larger prime was a factor, then it would only divide one number in the set and hence only one product. Three of the numbers must be odd. At most one of the odd numbers can be a multiple of 3 and at most one can be a multiple of 5. The other odd number cannot have any prime factors. The only such number is 1, so the set must be <math>{1, 2, 3, 4, 5, 6}</math>, but that does not work because only one of the numbers is a multiple of 5. So there are no such sets. |
{{IMO box|year=1970|num-b=3|num-a=5}} | {{IMO box|year=1970|num-b=3|num-a=5}} | ||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] | ||
Revision as of 02:06, 29 December 2007
Problem
Find the set of all positive integers 
with the property that the set 
can be partitioned into two sets such that the product of the numbers in one set equals the product of the numbers in the other set.
Solution
The only primes dividing numbers in the set can be 2, 3 or 5, because if any larger prime was a factor, then it would only divide one number in the set and hence only one product. Three of the numbers must be odd. At most one of the odd numbers can be a multiple of 3 and at most one can be a multiple of 5. The other odd number cannot have any prime factors. The only such number is 1, so the set must be 
, but that does not work because only one of the numbers is a multiple of 5. So there are no such sets.
| 1970 IMO (Problems) • Resources | ||
| Preceded by Problem 3 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 5 |
| All IMO Problems and Solutions | ||
