IMO 1967

------
 
 
Problem A3

Let k, m, n be natural numbers such that m + k + 1 is a prime greater than n + 1. Let cs = s(s+1). Prove that:

        (cm+1 - ck)(cm+2 - ck) ... (cm+n - ck)

is divisible by the product c1c2 ... cn.

 

Solution

The key is that ca - cb = (a - b)(a + b + 1). Hence the product (cm+1 - ck)(cm+2 - ck) ... (cm+n - ck) is the product of the n consecutive numbers (m - k + 1), ... , (m - k + n), times the product of the n consecutive numbers (m + k + 2), ... , (m + k + n + 1). The first product is just the binomial coefficient (m-k+n)Cn times n!, so it is divisible by n!. The second product is 1/(m + k + 1) x (m + k + 1)(m + k + 2) ... (m + k + n + 1) = 1/(m + k + 1) x (m+k+n+1)C(n+1) x (n+1)!. But m + k + 1 is a prime greater than n + 1, so it has no factors in common with (n+1)!, hence the second product is divisible by (n+1)!. Finally note that c1c2 ... cn= n! (n+1)!.

 


Solutions are also available in:   Samuel L Greitzer, International Mathematical Olympiads 1959-1977, MAA 1978, and in   István Reiman, International Mathematical Olympiad 1959-1999, ISBN 189-8855-48-X.

 

9th IMO 1967

© John Scholes
jscholes@kalva.demon.co.uk
4 Oct 1998
Last corrected/updated 4 Oct 1998