Maths Olympiad Prep

Library / /94 of 151

, 2018

Combinatorics Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

For any finite sequence (x1,,xn)(x_1,\ldots,x_n), denote by N(x1,,xn)N(x_1,\ldots,x_n) the number of ordered index pairs (i,j)(i,j) for which 1i<jn1\le i<j\le n and xi=xjx_i=x_j. Let pp be an odd prime, 1n<p1\le n<p, and let a1,a2,,ana_1,a_2,\ldots,a_n and b1,b2,,bnb_1,b_2,\ldots,b_n be arbitrary residue classes modulo pp. Prove that there exists a permutation π\pi of the indices 1,2,,n1,2,\ldots,n for which

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.