This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 30

2014 Indonesia MO Shortlist, C5

Determine all pairs of natural numbers $(m, r)$ with $2014 \ge m \ge r \ge 1$ that fulfill $\binom{2014}{m}+\binom{m}{r}=\binom{2014}{r}+\binom{2014-r}{m-r} $

2003 Singapore Senior Math Olympiad, 2

For each positive integer $k$, we define the polynomial $S_k(x)=1+x+x^2+x^3+...+x^{k-1}$ Show that $n \choose 1$ $S_1(x) +$ $n \choose 2$ $S_2(x) +$ $n \choose 3$ $S_3(x)+...+$ $n \choose n$ $S_n(x) = 2^{n-1}S_n\left(\frac{1+x}{2}\right)$ for every positive integer $n$ and every real number $x$.

1993 Romania Team Selection Test, 4

For each integer $n > 3$ find all quadruples $(n_1,n_2,n_3,n_4)$ of positive integers with $n_1 +n_2 +n_3 +n_4 = n$ which maximize the expression $$\frac{n!}{n_1!n_2!n_3!n_4!}2^{ {n_1 \choose 2}+{n_2 \choose 2}+{n_3 \choose 2}+{n_4 \choose 2}+n_1n_2+n_2n_3+n_3n_4}$$

1990 Romania Team Selection Test, 2

Prove the following equality for all positive integers $m,n$: $$\sum_{k=0}^{n} {m+k \choose k} 2^{n-k} +\sum_{k=0}^m {n+k \choose k}2^{m-k}= 2^{m+n+1}$$

2011 Saudi Arabia Pre-TST, 2

Find all positive integers $x$ and $y$ such that $${x \choose y} = 1432$$

2013 VJIMC, Problem 4

Let $n$ and $k$ be positive integers. Evaluate the following sum $$\sum_{j=0}^k\binom kj^2\binom{n+2k-j}{2k}$$where $\binom nk=\frac{n!}{k!(n-k)!}$.

2010 Thailand Mathematical Olympiad, 10

Find all primes $p$ such that ${100 \choose p} + 7$ is divisible by $p$.

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}$$

2020 Czech and Slovak Olympiad III A, 6

For each positive integer $k$, denote by $P (k)$ the number of all positive integers $4k$-digit numbers which can be composed of the digits $2, 0$ and which are divisible by the number $2 020$. Prove the inequality $$P (k) \ge \binom{2k - 1}{k}^2$$ and determine all $k$ for which equality occurs. (Note: A positive integer cannot begin with a digit of $0$.) (Jaromir Simsa)

2023 USA TSTST, 4

Let $n\ge 3$ be an integer and let $K_n$ be the complete graph on $n$ vertices. Each edge of $K_n$ is colored either red, green, or blue. Let $A$ denote the number of triangles in $K_n$ with all edges of the same color, and let $B$ denote the number of triangles in $K_n$ with all edges of different colors. Prove \[ B\le 2A+\frac{n(n-1)}{3}.\] (The [i]complete graph[/i] on $n$ vertices is the graph on $n$ vertices with $\tbinom n2$ edges, with exactly one edge joining every pair of vertices. A [i]triangle[/i] consists of the set of $\tbinom 32=3$ edges between $3$ of these $n$ vertices.) [i]Proposed by Ankan Bhattacharya[/i]

1967 Putnam, B5

Show that the sum of the first $n$ terms in the binomial expansion of $(2-1)^{-n}$ is $\frac{1}{2},$ where $n$ is a positive integer.

2013 QEDMO 13th or 12th, 2

Let $p$ be a prime number and $n, k$ and $q$ natural numbers, where $q\le \frac{n -1}{p-1}$ should be. Let $M$ be the set of all integers $m$ from $0$ to $n$, for which $m-k$ is divisible by $p$. Show that $$\sum_{m \in M} (-1) ^m {n \choose m}$$ is divisible by $p^q$.

2014 Hanoi Open Mathematics Competitions, 2

How many integers are there in $\{0,1, 2,..., 2014\}$ such that $C^x_{2014} \ge C^{999}{2014}$ ? (A): $15$, (B): $16$, (C): $17$, (D): $18$, (E) None of the above. Note: $C^{m}_{n}$ stands for $\binom {m}{n}$

1996 VJIMC, Problem 2

Let $\{a_n\}^\infty_{n=0}$ be the sequence of integers such that $a_0=1$, $a_1=1$, $a_{n+2}=2a_{n+1}-2a_n$. Decide whether $$a_n=\sum_{k=0}^{\left\lfloor\frac n2\right\rfloor}\binom n{2k}(-1)^k.$$

2008 Thailand Mathematical Olympiad, 4

Let $n$ be a positive integer. Show that $${2n+1 \choose 1} -{2n+1 \choose 3}2008 + {2n+1 \choose 5}2008^2- ...+(-1)^{n}{2n+1 \choose 2n+1}2008^n $$ is not divisible by $19$.

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$$

2025 Vietnam Team Selection Test, 4

Find all positive integers $k$ for which there are infinitely many positive integers $n$ such that $\binom{(2025+k)n}{2025n}$ is not divisible by $kn+1$.

2005 iTest, 7

Find the coefficient of the fourth term of the expansion of $(x+y)^{15}$.

1923 Eotvos Mathematical Competition, 2

If $$s_n = 1 + q + q^2 +... + q^n$$ and $$ S_n = 1 +\frac{1 + q}{2}+ \left( \frac{1 + q}{2}\right)^2 +... + \left( \frac{1 + q}{2}\right)^n,$$ prove that $${n + 1 \choose 1}+{n + 1 \choose 2} s_1 + {n + 1 \choose 3} s_2 + ... + {n + 1 \choose n + 1} s_n = 2^nS_n$$

2015 Irish Math Olympiad, 10

Prove that, for all pairs of nonnegative integers, $j,n$, $$\sum_{K=0}^{n}k^j\binom n k \ge 2^{n-j} n^j$$

2002 Singapore MO Open, 3

Let $n$ be a positive integer. Determine the smallest value of the sum $a_1b_1+a_2b_2+...+a_{2n+2}b_{2n+2}$ where $(a_1,a_2,...,a_{2n+2})$ and $(b_1,b_2,...,b_{2n+2})$ are rearrangements of the binomial coefficients $2n+1 \choose 0$, $2n+1 \choose 1$,...,$2n+1 \choose 2n+1$. Justify your answer

2005 iTest, 33

If the coefficient of the third term in the binomial expansion of $(1 - 3x)^{1/4}$ is $-a/b$, where $ a$ and $b$ are relatively prime integers, find $a+b$.

2014 IMAC Arhimede, 5

Let $p$ be a prime number. The natural numbers $m$ and $n$ are written in the system with the base $p$ as $n = a_0 + a_1p +...+ a_kp^k$ and $m = b_0 + b_1p +..+ b_kp^k$. Prove that $${n \choose m} \equiv \prod_{i=0}^{k}{a_i \choose b_i} (mod p)$$

1962 Putnam, B1

Let $x^{(n)}=x(x-1)\cdots (x-n+1)$ for $n$ a positive integer and let $x^{(0)}=1.$ Prove that $$(x+y)^{(n)}= \sum_{k=0}^{n} \binom{n}{k} x^{(k)} y^{(n-k)}.$$

1996 VJIMC, Problem 2

Let $\{x_n\}^\infty_{n=0}$ be the sequence such that $x_0=2$, $x_1=1$ and $x_{n+2}$ is the remainder of the number $x_{n+1}+x_n$ divided by $7$. Prove that $x_n$ is the remainder of the number $$4^n\sum_{k=0}^{\left\lfloor\frac n2\right\rfloor}2\binom n{2k}5^k$$