Problem

Source: 2010 China South East Mathematical Olympiad

Tags: algebra, polynomial, modular arithmetic, LaTeX, number theory, number theory unsolved



For any set $A=\{a_1,a_2,\cdots,a_m\}$, let $P(A)=a_1a_2\cdots a_m$. Let $n={2010\choose99}$, and let $A_1, A_2,\cdots,A_n$ be all $99$-element subsets of $\{1,2,\cdots,2010\}$. Prove that $2010|\sum^{n}_{i=1}P(A_i)$.