Found problems: 167
Find all positive integers $k > 1$ for which there exists a positive integer $n$ such that $\tbinom{n}{k}$ is divisible by $n$, and $\tbinom{n}{m}$ is not divisible by $n$ for $2\leq m < k$.
[i]Merlijn Staps[/i]
Prove that $ \sum_{k \equal{} 0}^{995} \frac {( \minus{} 1)^k}{1991 \minus{} k} {1991 \minus{} k \choose k} \equal{} \frac {1}{1991}$
In the expansion of
\[ \left(1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{27}\right)\left(1 \plus{} x \plus{} x^2 \plus{} \cdots \plus{} x^{14}\right)^2,
\]what is the coefficient of $ x^{28}$?
$ \textbf{(A)}\ 195 \qquad \textbf{(B)}\ 196 \qquad \textbf{(C)}\ 224 \qquad \textbf{(D)}\ 378 \qquad \textbf{(E)}\ 405$
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.
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$).
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]
Let $k,m,n$ be natural numbers such that $m+k+1$ is a prime greater than $n+1$. Let $c_s=s(s+1)$. Prove that
\[(c_{m+1}-c_k)(c_{m+2}-c_k)\ldots(c_{m+n}-c_k)\]
is divisible by the product $c_1c_2\ldots c_n$.
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$).
Prove that $\binom{n+k}{n}$ can be written as product of $n$ pairwise coprime numbers $a_1,a_2,\dots,a_n$ such that $k+i$ is divisible by $a_i$ for all indices $i$.
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$).
$(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$
Let $p=101.$ The sum
\[\sum_{k=1}^{10}\frac1{\binom pk}\]
can be written as a fraction of the form $\dfrac a{p!},$ where $a$ is a positive integer. Compute $a\pmod p.$
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]
Let $N$ be the sum of all binomial coefficients $\binom{a}{b}$ such that $a$ and $b$ are nonnegative integers and $a+b$ is an even integer less than 100. Find the remainder when $N$ is divided by 144. (Note: $\binom{a}{b} = 0$ if $a<b$, and $\binom{0}{0} = 1$.)
The function $f:\mathbb R^{\ge 0} \longrightarrow \mathbb R^{\ge 0}$ satisfies the following properties for all $a,b\in \mathbb R^{\ge 0}$:
[b]a)[/b] $f(a)=0 \Leftrightarrow a=0$
[b]b)[/b] $f(ab)=f(a)f(b)$
[b]c)[/b] $f(a+b)\le 2 \max \{f(a),f(b)\}$.
Prove that for all $a,b\in \mathbb R^{\ge 0}$ we have $f(a+b)\le f(a)+f(b)$.
[i]Proposed by Masoud Shafaei[/i]
Prove that $(2m)!(2n)!$ is a multiple of $m!n!(m+n)!$ for any non-negative integers $m$ and $n$.
Prove that for any positive integer $n$, the number
\[ S_n = {2n+1\choose 0}\cdot 2^{2n}+{2n+1\choose 2}\cdot 2^{2n-2}\cdot 3 +\cdots + {2n+1 \choose 2n}\cdot 3^n \] is the sum of two consecutive perfect squares.
[i]Dorin Andrica[/i]
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}). \]
For positive integers $j\le n$, prove that
$$\sum_{k=j}^n\binom{2n}{2k}\binom kj=\frac{n\cdot4^{n-j}}j\binom{2n-j-1}{j-1}.$$
[i]Proposed by Ángel Plaza[/i]
$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
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]
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$).
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.
\]
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]
Prove that $ \sum_{k \equal{} 0}^{995} \frac {( \minus{} 1)^k}{1991 \minus{} k} {1991 \minus{} k \choose k} \equal{} \frac {1}{1991}$