Found problems: 766
Let $N_0$ denote the set of nonnegative integers and $Z$ the set of all integers. Let a function $f : N_0 \times Z \to Z$ satisfy the conditions
(i) $f(0, 0) = 1$, $f(0, 1) = 1$
(ii) for all $k, k \ne 0, k \ne 1$, $f(0, k) = 0$ and
(iii) for all $n \ge 1$ and $k, f(n, k) = f(n -1, k) + f(n- 1, k - 2n)$. Find the value of
$$\sum_{k=0}^{2009 \choose 2} f(2008, k)$$
The sequences $(x_n)$ and $(y_n)$ are defined as follows:
$$
x_{n+1} = \frac{x_n+2}{x_n+1},\quad y_{n+1}=\frac{y_n^2+2}{2y_n} \quad \text{ for } n= 0,1,2,\ldots.$$
Prove that for every integer $ n\geq 0 $ the equality $ y_n = x_{2^n-1} $ holds.
Given an integer $n\geq 2,$ let $a_{n},b_{n},c_{n}$ be integer numbers such that \[
\left( \sqrt[3]{2}-1\right) ^{n}=a_{n}+b_{n}\sqrt[3]{2}+c_{n}\sqrt[3]{4}.
\] Prove that $c_{n}\equiv 1\pmod{3} $ if and only if $n\equiv 2\pmod{3}.$
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.
\]
Let $\{x_n\}$ be a sequence defined by $x_1 = 2$ and $x_{n+1} = x_n^2 - x_n + 1$ for $n \ge 1$. Prove that
$$1 -\frac{1}{2^{2^{n-1}}} < \frac{1}{x_1}+\frac{1}{x_2}+ ... +\frac{1}{x_n}< 1 -\frac{1}{2^{2^n}}$$
for all $n$
Consider the sequence of polynomials $P_0(x) = 2$, $P_1(x) = x$ and $P_n(x) = xP_{n-1}(x) - P_{n-2}(x)$ for $n \geq 2$. Let $x_n$ be the greatest zero of $P_n$ in the the interval $|x| \leq 2$. Show that $$\lim \limits_{n \to \infty}n^2\left(4-2\pi +n^2\int \limits_{x_n}^2P_n(x)dx\right)=2\pi - 4-\frac{\pi^3}{12}$$
Solve the equation ("$2$" encounters $1985$ times):
$$\dfrac{x}{2+ \dfrac{x}{2+\dfrac{x}{2+... \dfrac{x}{2+\sqrt {1+x}}}}}=1$$
For a positive integer $n$, $S_n$ is the set of positive integer $n$-tuples $(a_1,a_2, \cdots ,a_n)$ which satisfies the following.
(i). $a_1=1$.
(ii). $a_{i+1} \le a_i+1$.
For $k \le n$, define $N_k$ as the number of $n$-tuples $(a_1, a_2, \cdots a_n) \in S_n$ such that $a_k=1, a_{k+1}=2$.
Find the sum $N_1 + N_2+ \cdots N_{k-1}$.
Let $f(n)=n+\lfloor \sqrt{n}\rfloor$. Prove that, for every positive integer $m$, the sequence \[m, f(m), f(f(m)), f(f(f(m))), \cdots\] contains at least one square of an integer.
Let $a_{1}={11}^{11}$, $a_{2}={12}^{12}$, $a_{3}={13}^{13}$, and \[a_{n}= \vert a_{n-1}-a_{n-2}\vert+\vert a_{n-2}-a_{n-3}\vert, n \ge 4.\] Determine $a_{{14}^{14}}$.
Define the sequence $A_1, A_2, A_3, \dots$ by $A_1 = 1$ and for $n=1,2,3,\dots$
$$A_{n+1}=\frac{A_n+2}{A_n +1}.$$
Define the sequences $B_1, B_2, B_3,\dots$ by $B_1=1$ and for $n=1,2,3,\dots$
$$B_{n+1}=\frac{B_n^2 +2}{2B_n}.$$
Prove that $B_{n+1}=A_{2^n}$ for all non-negative integers $n$.
The sequence $f_1, f_2, \cdots, f_n, \cdots $ of functions is defined for $x > 0$ recursively by
\[f_1(x)=x , \quad f_{n+1}(x) = f_n(x) \left(f_n(x) + \frac 1n \right)\]
Prove that there exists one and only one positive number $a$ such that $0 < f_n(a) < f_{n+1}(a) < 1$ for all integers $n \geq 1.$
The harmonic table is a triangular array:
$1$
$\frac 12 \qquad \frac 12$
$\frac 13 \qquad \frac 16 \qquad \frac 13$
$\frac 14 \qquad \frac 1{12} \qquad \frac 1{12} \qquad \frac 14$
Where $a_{n,1} = \frac 1n$ and $a_{n,k+1} = a_{n-1,k} - a_{n,k}$ for $1 \leq k \leq n-1.$ Find the harmonic mean of the $1985^{th}$ row.
The sequence of numbers $a_1, a_2, a_3, ...$ is defined recursively by $a_1 = 1, a_{n + 1} = \lfloor \sqrt{a_1+a_2+...+a_n} \rfloor $ for $n \ge 1$. Find all numbers that appear more than twice at this sequence.
The first four terms of an infinite sequence $S$ of decimal digits are $1$, $9$, $8$, $2$, and succeeding terms are given by the final digit in the sum of the four immediately preceding terms. Thus $S$ begins $1$, $9$, $8$, $2$, $0$, $9$, $9$, $0$, $8$, $6$, $3$, $7$, $4$, $\cdots$. Do the digits $3$, $0$, $4$, $4$ ever come up consecutively in $S$?
The sequence $a_0,a_1,a_2,...$ is defined by $a_0 = 0, a_1 = a_2 = 1$ and $a_{n+2} +a_{n-1} = 2(a_{n+1} +a_n)$ for all $n \in N$. Show that all $a_n$ are perfect squares .
Sequences $(a_n)_{n=0}^{\infty}$ and $(b_n)_{n=0}^{\infty}$ are defined with recurrent relations :
$$a_0=0 , \;\;\; a_1=1, \;\;\;\; a_{n+1}=\frac{2018}{n} a_n+ a_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$ and
$$b_0=0 , \;\;\; b_1=1, \;\;\;\; b_{n+1}=\frac{2020}{n} b_n+ b_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$
Prove that :$$\frac{a_{1010}}{1010}=\frac{b_{1009}}{1009}$$
Let $a_1, a_2, \dots, a_n$ be real numbers, and let $b_1, b_2, \dots, b_n$ be distinct positive integers. Suppose that there is a polynomial $f(x)$ satisfying the identity
\[
(1-x)^n f(x) = 1 + \sum_{i=1}^n a_i x^{b_i}.
\]
Find a simple expression (not involving any sums) for $f(1)$ in terms of $b_1, b_2, \dots, b_n$ and $n$ (but independent of $a_1, a_2, \dots, a_n$).
Let $N$ be a positive integer. Define a sequence $a_0,a_1,\ldots$ by $a_0=0$, $a_1=1$, and $a_{n+1}+a_{n-1}=a_n(2-1/N)$ for $n\ge1$. Prove that $a_n<\sqrt{N+1}$ for all $n$.
[i]Evan O'Dorney.[/i]
Let $n$ be a positive integer and let $a_1, \ldots, a_{n-1} $ be arbitrary real numbers. Define the sequences $u_0, \ldots, u_n $ and $v_0, \ldots, v_n $ inductively by $u_0 = u_1 = v_0 = v_1 = 1$, and $u_{k+1} = u_k + a_k u_{k-1}$, $v_{k+1} = v_k + a_{n-k} v_{k-1}$ for $k=1, \ldots, n-1.$
Prove that $u_n = v_n.$
Determine whether there exists an infinite sequence $a_1, a_2, a_3, \dots$ of positive integers
which satisfies the equality \[a_{n+2}=a_{n+1}+\sqrt{a_{n+1}+a_{n}} \] for every positive integer $n$.
Let $\{u_{n}\}_{n \ge 0}$ be a sequence of positive integers defined by \[u_{0}= 1, \;u_{n+1}= au_{n}+b,\] where $a, b \in \mathbb{N}$. Prove that for any choice of $a$ and $b$, the sequence $\{u_{n}\}_{n \ge 0}$ contains infinitely many composite numbers.
Let $a$ be a positive integer and let $\{a_n\}$ be defined by $a_0 = 0$ and
\[a_{n+1 }= (a_n + 1)a + (a + 1)a_n + 2 \sqrt{a(a + 1)a_n(a_n + 1)} \qquad (n = 1, 2 ,\dots ).\]
Show that for each positive integer $n$, $a_n$ is a positive integer.
Prove that the sequence $ \{y_{n}\}_{n \ge 1}$ defined by
\[ y_{0}=1, \; y_{n+1}= \frac{1}{2}\left( 3y_{n}+\sqrt{5y_{n}^{2}-4}\right) \]
consists only of integers.
Prove that there is no polynomial $P(x)$ with integer coefficients such that
$$P(\sqrt[3]{5} + \sqrt[3]{25}) = 2\sqrt[3]{5}+3\sqrt[3]{25}$$