Found problems: 167
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.
\]
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.
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$).
For integers $k$ and $n$ such that $1\le k<n$, let $C^n_k=\frac{n!}{k!(n-k)!}$. Then $\left(\frac{n-2k-1}{k+1}\right)C^n_k$ is an integer
$\textbf{(A) }\text{for all }k\text{ and }n\qquad$
$\textbf{(B) }\text{for all even values of }k\text{ and }n,\text{ but not for all }k\text{ and }n\qquad$
$\textbf{(C) }\text{for all odd values of }k\text{ and }n,\text{ but not for all }k\text{ and }n\qquad$
$\textbf{(D) }\text{if }k=1\text{ or }n-1,\text{ but not for all odd values }k\text{ and }n\qquad$
$\textbf{(E) }\text{if }n\text{ is divisible by }k,\text{ but not for all even values }k\text{ and }n$
Let $k$ be a fixed positive integer. Prove that the sequence $\binom{2}{1},\binom{4}{2},\binom{8}{4},\ldots,
\binom{2^{n+1}}{2^n},\ldots$ is eventually constant modulo $2^k$.
[i]Proposed by V. Rastorguyev[/i]
Let $n > 1$ be an integer.
Determine the greatest common divisor of the set of numbers $\left\{ \left( \begin{matrix}
2n \\
2i+1 \\
\end{matrix} \right):0 \le i \le n-1 \right\}$
i.e. the largest positive integer, dividing $\left( \begin{matrix}
2n \\
2i+1 \\
\end{matrix} \right)$ without remainder for every $i = 0, 1, ..., n–1$ .
(Here $\left( \begin{matrix}
m \\
l \\
\end{matrix} \right)=\text{C}_{m}^{l}=\frac{m\text{!}}{l\text{!}\left( m-l \right)\text{!}}$ is binomial coefficient.)
Prove that from $x + y = 1 \ (x, y \in \mathbb R)$ it follows that
\[x^{m+1} \sum_{j=0}^n \binom{m+j}{j} y^j + y^{n+1} \sum_{i=0}^m \binom{n+i}{i} x^i = 1 \qquad (m, n = 0, 1, 2, \ldots ).\]
Given a positive integer $n$, let $D$ is the set of positive divisors of $n$, and let $f: D \to \mathbb{Z}$ be a function. Prove that the following are equivalent:
(a) For any positive divisor $m$ of $n$,
\[ n ~\Big|~ \sum_{d|m} f(d) \binom{n/d}{m/d}. \]
(b) For any positive divisor $k$ of $n$,
\[ k ~\Big|~ \sum_{d|k} f(d). \]
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 an integer $n > 1$ is a prime number if and only if, for every integer $k$ with $1\le k \le n-1$, the binomial coefficient $n \choose k$ is divisible by $n$.
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$.
Prove that for any positive integer $n$, the number of odd integers among the binomial coefficients $\binom nh \ ( 0 \leq h \leq n)$ is a power of 2.
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$.
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}$.
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}$$
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 the number of odd binomial coefficients in any finite binomial expansion is a power of $2.$