Found problems: 167
2019 Pan-African Shortlist, N6
Find the $2019$th strictly positive integer $n$ such that $\binom{2n}{n}$ is not divisible by $5$.
1991 IMO Shortlist, 11
Prove that $ \sum_{k \equal{} 0}^{995} \frac {( \minus{} 1)^k}{1991 \minus{} k} {1991 \minus{} k \choose k} \equal{} \frac {1}{1991}$
2007 IMO Shortlist, 4
For every integer $ k \geq 2,$ prove that $ 2^{3k}$ divides the number
\[ \binom{2^{k \plus{} 1}}{2^{k}} \minus{} \binom{2^{k}}{2^{k \minus{} 1}}
\]
but $ 2^{3k \plus{} 1}$ does not.
[i]Author: Waldemar Pompe, Poland[/i]
2017 Greece Team Selection Test, 2
Prove that the number $A=\frac{(4n)!}{(2n)!n!}$ is an integer and divisible by $2^{n+1}$,
where $n$ is a positive integer.
2011 China Western Mathematical Olympiad, 3
Let $n \geq 2$ be a given integer
$a)$ Prove that one can arrange all the subsets of the set $\{1,2... ,n\}$ as a sequence of subsets $A_{1}, A_{2},\cdots , A_{2^{n}}$, such that $|A_{i+1}| = |A_{i}| + 1$ or $|A_{i}| - 1$ where $i = 1,2,3,\cdots , 2^{n}$ and $A_{2^{n} + 1} = A_{1}$
$b)$ Determine all possible values of the sum $\sum \limits_{i = 1}^{2^n} (-1)^{i}S(A_{i})$ where $S(A_{i})$ denotes the sum of all elements in $A_{i}$ and $S(\emptyset) = 0$, for any subset sequence $A_{1},A_{2},\cdots ,A_{2^n}$ satisfying the condition in $a)$
2014 Balkan MO, 4
Let $n$ be a positive integer. A regular hexagon with side length $n$ is divided into equilateral triangles with side length $1$ by lines parallel to its sides.
Find the number of regular hexagons all of whose vertices are among the vertices of those equilateral triangles.
[i]UK - Sahl Khan[/i]
1998 Belarus Team Selection Test, 2
In town $ A,$ there are $ n$ girls and $ n$ boys, and each girl knows each boy. In town $ B,$ there are $ n$ girls $ g_1, g_2, \ldots, g_n$ and $ 2n \minus{} 1$ boys $ b_1, b_2, \ldots, b_{2n\minus{}1}.$ The girl $ g_i,$ $ i \equal{} 1, 2, \ldots, n,$ knows the boys $ b_1, b_2, \ldots, b_{2i\minus{}1},$ and no others. For all $ r \equal{} 1, 2, \ldots, n,$ denote by $ A(r),B(r)$ the number of different ways in which $ r$ girls from town $ A,$ respectively town $ B,$ can dance with $ r$ boys from their own town, forming $ r$ pairs, each girl with a boy she knows. Prove that $ A(r) \equal{} B(r)$ for each $ r \equal{} 1, 2, \ldots, n.$
1972 IMO Longlists, 15
Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.
2006 Irish Math Olympiad, 4
Let $n$ be a positive integer.
Find the greatest common divisor of the numbers $\binom{2n}{1},\binom{2n}{3},\binom{2n}{5},...,\binom{2n}{2n-1}$.
2006 Alexandru Myller, 1
For an odd prime $ p, $ show that $ \sum_{k=1}^{p-1} \frac{k^p-k}{p}\equiv \frac{1+p}{2}\pmod p . $
2014 Czech-Polish-Slovak Match, 5
Let all positive integers $n$ satisfy the following condition:
for each non-negative integers $k, m$ with $k + m \le n$,
the numbers $\binom{n-k}{m}$ and $\binom{n-m}{k}$ leave the same remainder when divided by $2$.
(Poland)
PS. The translation was done using Google translate and in case it is not right, there is the original text in Slovak
2008 IMO Shortlist, 4
Let $ n$ be a positive integer. Show that the numbers
\[ \binom{2^n \minus{} 1}{0},\; \binom{2^n \minus{} 1}{1},\; \binom{2^n \minus{} 1}{2},\; \ldots,\; \binom{2^n \minus{} 1}{2^{n \minus{} 1} \minus{} 1}\]
are congruent modulo $ 2^n$ to $ 1$, $ 3$, $ 5$, $ \ldots$, $ 2^n \minus{} 1$ in some order.
[i]Proposed by Duskan Dukic, Serbia[/i]
1973 IMO Shortlist, 8
Prove that there are exactly $\binom{k}{[k/2]}$ arrays $a_1, a_2, \ldots , a_{k+1}$ of nonnegative integers such that $a_1 = 0$ and $|a_i-a_{i+1}| = 1$ for $i = 1, 2, \ldots , k.$
1972 IMO, 3
Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.
1956 Putnam, A7
Prove that the number of odd binomial coefficients in any finite binomial expansion is a power of $2.$
2009 Kazakhstan National Olympiad, 1
Let $S_n$ be number of ordered sets of natural numbers $(a_1;a_2;....;a_n)$ for which $\frac{1}{a_1}+\frac{1}{a_2}+....+\frac{1}{a_n}=1$. Determine
1)$S_{10} mod(2)$.
2)$S_7 mod(2)$.
(1) is first problem in 10 grade, (2)- third in 9 grade.
1994 Hong Kong TST, 2
In a table-tennis tournament of $10$ contestants, any $2$ contestants meet only once.
We say that there is a winning triangle if the following situation occurs: $i$-th contestant defeated the $j$-th contestant, $j$-th contestant defeated the $k$-th contestant, and, $k$-th contestant defeated the $i$-th contestant.
Let, $W_i$ and $L_i $ be respectively the number of games won and lost by the $i$-th contestant.
Suppose, $L_i+W_j\geq 8$ whenever the $j$-th contestant defeats the $i$-th contestant.
Prove that, there are exactly $40$ winning triangles in this tournament.
1983 Czech and Slovak Olympiad III A, 4
Consider an arithmetic progression $a_0,\ldots,a_n$ with $n\ge2$. Prove that $$\sum_{k=0}^n(-1)^k\binom{n}{k}a_k=0.$$
2020 Estonia Team Selection Test, 1
The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).
1969 IMO Longlists, 6
$(BEL 6)$ Evaluate $\left(\cos\frac{\pi}{4} + i \sin\frac{\pi}{4}\right)^{10}$ in two different ways and prove that $\dbinom{10}{1}-\dbinom{10}{3}+\frac{1}{2}\dbinom{10}{5}=2^4$
2015 Postal Coaching, Problem 2
Let $ n$ be a positive integer. Find the number of odd coefficients of the polynomial
\[ u_n(x) \equal{} (x^2 \plus{} x \plus{} 1)^n.
\]
PEN A Problems, 27
Show that the coefficients of a binomial expansion $(a+b)^n$ where $n$ is a positive integer, are all odd, if and only if $n$ is of the form $2^{k}-1$ for some positive integer $k$.
1990 IMO Longlists, 2
Prove that $ \sum_{k \equal{} 0}^{995} \frac {( \minus{} 1)^k}{1991 \minus{} k} {1991 \minus{} k \choose k} \equal{} \frac {1}{1991}$
1972 IMO Shortlist, 8
Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.
1987 Spain Mathematical Olympiad, 2
Show that for each natural number $n > 1$
$1 \cdot \sqrt{{n \choose 1}}+ 2 \cdot \sqrt{{n \choose 2}}+...+n \cdot \sqrt{{n \choose n}} <\sqrt{2^{n-1}n^3}$