Found problems: 166
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.$
2008 Federal Competition For Advanced Students, P1, 1
What is the remainder of the number $1 \binom{2008}{0 }+2\binom{2008}{1}+ ...+2009\binom{2008}{2008}$ when divided by $2008$?
1998 Iran MO (3rd Round), 6
For any two nonnegative integers $n$ and $k$ satisfying $n\geq k$, we define the number $c(n,k)$ as follows:
- $c\left(n,0\right)=c\left(n,n\right)=1$ for all $n\geq 0$;
- $c\left(n+1,k\right)=2^{k}c\left(n,k\right)+c\left(n,k-1\right)$ for $n\geq k\geq 1$.
Prove that $c\left(n,k\right)=c\left(n,n-k\right)$ for all $n\geq k\geq 0$.
2015 Switzerland Team Selection Test, 2
Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that
\[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]
PEN Q Problems, 6
Prove that for a prime $p$, $x^{p-1}+x^{p-2}+ \cdots +x+1$ is irreducible in $\mathbb{Q}[x]$.
2018 Thailand TSTST, 7
Evaluate $\sum_{n=2017}^{2030}\sum_{k=1}^{n}\left\{\frac{\binom{n}{k}}{2017}\right\}$.
[i]Note: $\{x\}=x-\lfloor x\rfloor$ for every real numbers $x$.[/i]
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$
2023 ISI Entrance UGB, 5
There is a rectangular plot of size $1 \times n$. This has to be covered by three types of tiles - red, blue and black. The red tiles are of size $1 \times 1$, the blue tiles are of size $1 \times 1$ and the black tiles are of size $1 \times 2$. Let $t_n$ denote the number of ways this can be done. For example, clearly $t_1 = 2$ because we can have either a red or a blue tile. Also $t_2 = 5$ since we could have tiled the plot as: two red tiles, two blue tiles, a red tile on the left and a blue tile on the right, a blue tile on the left and a red tile on the right, or a single black tile.
[list=a]
[*]Prove that $t_{2n+1} = t_n(t_{n-1} + t_{n+1})$ for all $n > 1$.
[*]Prove that $t_n = \sum_{d \ge 0} \binom{n-d}{d}2^{n-2d}$ for all $n >0$.
[/list]
Here,
\[ \binom{m}{r} = \begin{cases}
\dfrac{m!}{r!(m-r)!}, &\text{ if $0 \le r \le m$,} \\
0, &\text{ otherwise}
\end{cases}\]
for integers $m,r$.
2024 JHMT HS, 15
Let $\ell = 1$, $M = 23$, $N = 45$, and $u = 67$. Compute the number of ordered pairs of nonnegative integers $(X, Y)$ with $X \leq M - \ell$ and $Y \leq N + u$ such that the sum
\[ \sum_{k=\ell}^{u} \binom{X + k}{M}\cdot\binom{Y - k}{N} \]
is divisible by $89$ (for integers $a$ and $b$, define the binomial coefficient $\tbinom{a}{b}$ to be the number of $b$-element subsets of any given $a$-element set, which is $0$ when $a < 0$, $b < 0$, or $b > a$).
2009 China Team Selection Test, 3
Let $ f(x)$ be a $ n \minus{}$degree polynomial all of whose coefficients are equal to $ \pm 1$, and having $ x \equal{} 1$ as its $ m$ multiple root. If $ m\ge 2^k (k\ge 2,k\in N)$, then $ n\ge 2^{k \plus{} 1} \minus{} 1.$
2019 Pan-African, 6
Find the $2019$th strictly positive integer $n$ such that $\binom{2n}{n}$ is not divisible by $5$.
1974 IMO Longlists, 36
Consider the binomial coefficients $\binom{n}{k}=\frac{n!}{k!(n-k)!}\ (k=1,2,\ldots n-1)$. Determine all positive integers $n$ for which $\binom{n}{1},\binom{n}{2},\ldots ,\binom{n}{n-1}$ are all even numbers.
1965 Putnam, A2
Show that, for any positive integer $n$,
\[
\sum_{r=0}^{[(n-1)/2]}\left\{\frac{n-2r}n\binom nr\right\}^2 = \frac 1n\binom{2n-2}{n-1},
\]
where $[x]$ means the greatest integer not exceeding $x$, and $\textstyle\binom nr$ is the binomial coefficient "$n$ choose $r$", with the convention $\textstyle\binom n0 = 1$.
2018 China Team Selection Test, 5
Given a positive integer $k$, call $n$ [i]good[/i] if among $$\binom{n}{0},\binom{n}{1},\binom{n}{2},...,\binom{n}{n}$$ at least $0.99n$ of them are divisible by $k$. Show that exists some positive integer $N$ such that among $1,2,...,N$, there are at least $0.99N$ good numbers.
1956 Putnam, A7
Prove that the number of odd binomial coefficients in any finite binomial expansion is a power of $2.$
Russian TST 2020, P1
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$).
1981 IMO, 2
Take $r$ such that $1\le r\le n$, and consider all subsets of $r$ elements of the set $\{1,2,\ldots,n\}$. Each subset has a smallest element. Let $F(n,r)$ be the arithmetic mean of these smallest elements. Prove that: \[ F(n,r)={n+1\over r+1}. \]
2020 Taiwan TST Round 1, 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$).
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.
1929 Eotvos Mathematical Competition, 2
Let $k \le n$ be positive integers and $x$ be a real number with $0 \le x < 1/n$. Prove that
$${n \choose 0} - {n \choose 1} x +{n \choose 2} x^2 - ... + (-1)^k {n \choose k} x^k > 0$$
1979 Spain Mathematical Olympiad, 3
Prove the equality
$${n \choose 0}^2+ {n \choose 1}^2+ {n \choose 2}^2+...+{n \choose n}^2={2n \choose 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}$.
2018 Bosnia And Herzegovina - Regional Olympiad, 1
$a)$ Prove that for all positive integers $n \geq 3$ holds:
$$\binom{n}{1}+\binom{n}{2}+...+\binom{n}{n-1}=2^n-2$$ where $\binom{n}{k}$ , with integer $k$ such that $n \geq k \geq 0$, is binomial coefficent
$b)$ Let $n \geq 3$ be an odd positive integer. Prove that set $A=\left\{ \binom{n}{1},\binom{n}{2},...,\binom{n}{\frac{n-1}{2}} \right\}$ has odd number of odd numbers
2025 Romania EGMO TST, P4
How does one show $$\text{lcm}\left(\binom{n}{1},\binom{n}{2},\ldots,\binom{n}{n}\right)=\frac{\text{lcm}(1,2,\ldots,n+1)}{n+1}$$
1985 IMO, 3
For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_1}+Q_{i_2}+\ldots+Q_{i_n})\ge o(Q_{i_1}). \]