Found problems: 166
1997 IMO Shortlist, 13
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.$
2022 Caucasus Mathematical Olympiad, 8
Paul can write polynomial $(x+1)^n$, expand and simplify it, and after that change every coefficient by its reciprocal. For example if $n=3$ Paul gets $(x+1)^3=x^3+3x^2+3x+1$ and then $x^3+\frac13x^2+\frac13x+1$. Prove that Paul can choose $n$ for which the sum of Paul’s polynomial coefficients is less than $2.022$.
2001 VJIMC, Problem 2
Prove that for any prime $p\ge5$, the number
$$\sum_{0<k<\frac{2p}3}\binom pk$$is divisible by $p^2$.
2016 Taiwan TST Round 1, 3
Let $\mathbb{Z}^+$ denote the set of all positive integers. Find all surjective functions $f:\mathbb{Z}^+ \times \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ that satisfy all of the following conditions: for all $a,b,c \in \mathbb{Z}^+$,
(i)$f(a,b) \leq a+b$;
(ii)$f(a,f(b,c))=f(f(a,b),c)$
(iii)Both $\binom{f(a,b)}{a}$ and $\binom{f(a,b)}{b}$ are odd numbers.(where $\binom{n}{k}$ denotes the binomial coefficients)
2012 Purple Comet Problems, 12
Ted flips seven fair coins. there are relatively prime positive integers $m$ and $n$ so that $\frac{m}{n}$ is the probability that Ted flips at least two heads given that he flips at least three tails. Find $m+n$.
2020 Greece Team Selection Test, 3
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$).
2013 BMT Spring, P1
Prove that for all positive integers $m$ and $n$,
$$\frac1m\cdot\binom{2n}0-\frac1{m+1}\cdot\binom{2n}1+\frac1{m+2}\cdot\binom{2n}2-\ldots+\frac1{m+2n}\cdot\binom{2n}{n2}>0$$
1972 IMO Shortlist, 8
Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.
2012 ELMO Shortlist, 8
Fix two positive integers $a,k\ge2$, and let $f\in\mathbb{Z}[x]$ be a nonconstant polynomial. Suppose that for all sufficiently large positive integers $n$, there exists a rational number $x$ satisfying $f(x)=f(a^n)^k$. Prove that there exists a polynomial $g\in\mathbb{Q}[x]$ such that $f(g(x))=f(x)^k$ for all real $x$.
[i]Victor Wang.[/i]
2018 VTRMC, 4
Let $m, n$ be integers such that $n \geq m \geq 1$. Prove that $\frac{\text{gcd} (m,n)}{n} \binom{n}{m}$ is an integer. Here $\text{gcd}$ denotes greatest common divisor and $\binom{n}{m} = \frac{n!}{m!(n-m)!}$ denotes the binomial coefficient.
1980 Polish MO Finals, 6
Prove that for every natural number $n$ we have $$\sum_{s=n}^{2n} 2^{2n-s}{s \choose n}= 2^{2n}.$$
1974 IMO Shortlist, 6
Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \]
cannot be divided by $5$.
2005 District Olympiad, 1
Prove that for all $a\in\{0,1,2,\ldots,9\}$ the following sum is divisible by 10:
\[ S_a = \overline{a}^{2005} + \overline{1a}^{2005} + \overline{2a}^{2005} + \cdots + \overline{9a}^{2005}. \]
2011 Indonesia TST, 2
Find the limit, when $n$ tends to the infinity, of $$\frac{\sum_{k=0}^{n} {{2n} \choose {2k}} 3^k} {\sum_{k=0}^{n-1} {{2n} \choose {2k+1}} 3^k}$$
2014 NIMO Problems, 6
10 students are arranged in a row. Every minute, a new student is inserted in the row (which can occur in the front and in the back as well, hence $11$ possible places) with a uniform $\tfrac{1}{11}$ probability of each location. Then, either the frontmost or the backmost student is removed from the row (each with a $\tfrac{1}{2}$ probability).
Suppose you are the eighth in the line from the front. The probability that you exit the row from the front rather than the back is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $100m+n$.
[i]Proposed by Lewis Chen[/i]
1981 Romania Team Selection Tests, 3.
Let $n>r\geqslant 3$ be two integers and $d$ be a positive integer such that $nd\geqslant \dbinom{n+r}{r+1}$. Show that \[(n-t)(d-t)>\dbinom{n-t+r}{r+1},\] for $t=1,2,\ldots,n-1$
[i]Vasile Brânzănescu[/i]
1969 IMO Shortlist, 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$
2014 Greece Team Selection Test, 4
Square $ABCD$ is divided into $n^2$ equal small squares by lines parallel to its sides.A spider starts from $A$ and moving only rightward or upwards,tries to reach $C$.Every "movement" of the spider consists of $k$ steps rightward and $m$ steps upwards or $m$ steps rightward and $k$ steps upwards(it can follow any possible order for the steps of each "movement").The spider completes $l$ "movements" and afterwards it moves without limitation (it still moves rightwards and upwards only).If $n=m\cdot l$,find the number of the possible paths the spider can follow to reach $C$.Note that $n,m,k,l\in \mathbb{N^{*}}$ with $k<m$.
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.$
1973 Kurschak Competition, 1
For what positive integers $n, k$ (with $k < n$) are the binomial coefficients $${n \choose k- 1} \,\,\, , \,\,\, {n \choose k} \,\,\, , \,\,\, {n \choose k + 1}$$ three successive terms of an arithmetic progression?
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]
2003 Poland - Second Round, 1
Prove that exists integer $n > 2003$ that in sequence
$\binom{n}{0}$, $\binom{n}{1}$, $\binom{n}{2}$, ..., $\binom{n}{2003}$
each element is a divisor of all elements which are after him.
2011 Morocco TST, 1
Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \]
cannot be divided by $5$.
2013 NIMO Problems, 5
For every integer $n \ge 1$, the function $f_n : \left\{ 0, 1, \cdots, n \right\} \to \mathbb R$ is defined recursively by $f_n(0) = 0$, $f_n(1) = 1$ and \[ (n-k) f_n(k-1) + kf_n(k+1) = nf_n(k) \] for each $1 \le k < n$. Let $S_N = f_{N+1}(1) + f_{N+2}(2) + \cdots + f_{2N} (N)$. Find the remainder when $\left\lfloor S_{2013} \right\rfloor$ is divided by $2011$. (Here $\left\lfloor x \right\rfloor$ is the greatest integer not exceeding $x$.)
[i]Proposed by Lewis Chen[/i]
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$).