1970 IMO Problems/Problem 4

Revision as of 02:31, 2 January 2023 by Sblnuclear17 (talk | contribs)

Problem

Find the set of all positive integers $n$ with the property that the set $\{ n, n+1, n+2, n+3, n+4, n+5 \}$ 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 $\{ 1, 2, 3, 4, 5, 6 \}$, but that does not work because only one of the numbers is a multiple of 5. So there are no such sets.

Solution 2

As in the previous solution, none of the six consecutive numbers can be multiples of $7$. This means that together, they take on the values $\{ 1, 2, 3, 4, 5, 6, \} \mod 7$. The product of all the numbers in this set, then, is $-1 \mod 7$, by Wilson's Theorem. However, $-1$ is not a quadratic residue $\mod 7$, which means that we cannot partition the original set into two sets of equal product. Thus, no such $n$ exist.

See Also

1970 IMO (Problems) • Resources
Preceded by
Problem 3
1 2 3 4 5 6 Followed by
Problem 5
All IMO Problems and Solutions