Maths Olympiad Prep

Track / Stage 5 / 254 of 400 #854 of 1964

Problem 854

AIME late
Combinatorics Difficulty 5.6 Prove it

13th Eötvös 1906 Problem 3 (a 1 , a 2 , ... , a n ) is a permutation of (1, 2, ... , n). Show that ∏ (a i - i) is even if n is odd.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

Put n = 2m+1. Suppose there are k values of i for which both a i and i are odd. Then since there are m+1 odd values in total, there must be m+1-k values for which a i is odd, but i is not and m+1-k values for which a i is even and i is odd. The remaining k-1 values have both a i and i even. Since a i - i is odd iff a i and i have opposite parity, there are 2(m+1-k) values for which that is true. Since that is even, there must be at least one value for which a i and i have the same parity. Hence the product is even. 13th Eötvös 1906 © John Scholes [email protected] 29 Oct 2003 Last corrected/updated 29 Oct 03

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.