Found problems: 766
Suppose the numbers $a_0, a_1, a_2, ... , a_n$ satisfy the following conditions:
$a_0 =\frac12$, $a_{k+1} = a_k +\frac{1}{n}a_k^2$ for $k = 0, 1, ... , n - 1$.
Prove that $1 - \frac{1}{n}< a_n < 1$
Positive integer $k(\ge 8)$ is given. Prove that if there exists a pair of positive integers $(x,y)$ that satisfies the conditions below, then there exists infinitely many pairs $(x,y)$.
(1) $ $ $x\mid y^2-3, y\mid x^2-2$
(2) $ $ $gcd\left(3x+\frac{2(y^2-3)}{x},2y+\frac{3(x^2-2)}{y}\right)=k$ $ $
The sequence $(a_n)$ of complex numbers is considered in the complex plane, in which is: $$a_0 = 1, \,\,\, a_n = a_{n-1} +\frac{1}{n}(\cos 45^o + i \sin 45^o )^n.$$
Prove that the sequence of the real parts of the terms of $(a_n)$ is convergent and its limit is a number between $0.85$ and $1.15$.
Let $1,2,3,\dots,2005,2006,2007,2009,2012,2016,\dots$ be a sequence defined by $x_{k}=k$ for $k=1,2\dots,2006$ and $x_{k+1}=x_{k}+x_{k-2005}$ for $k\ge 2006.$ Show that the sequence has 2005 consecutive terms each divisible by 2006.
Define the sequences $ a_n, b_n, c_n$ as follows. $ a_0 \equal{} k, b_0 \equal{} 4, c_0 \equal{} 1$.
If $ a_n$ is even then $ a_{n \plus{} 1} \equal{} \frac {a_n}{2}$, $ b_{n \plus{} 1} \equal{} 2b_n$, $ c_{n \plus{} 1} \equal{} c_n$.
If $ a_n$ is odd, then $ a_{n \plus{} 1} \equal{} a_n \minus{} \frac {b_n}{2} \minus{} c_n$, $ b_{n \plus{} 1} \equal{} b_n$, $ c_{n \plus{} 1} \equal{} b_n \plus{} c_n$.
Find the number of positive integers $ k < 1995$ such that some $ a_n \equal{} 0$.
There are $n$ balls numbered from $1$ to $n$, and $2n-1$ boxes numbered from $1$ to $2n-1$. For each $i$, ball number $i$ can only be put in the boxes with numbers from $1$ to $2i-1$. Let $k$ be an integer from $1$ to $n$. In how many ways we can choose $k$ balls, $k$ boxes and put these balls in the selected boxes so that each box has exactly one ball?
Given a sequence $\{x_n\}$, $$x_1 = x_2 = 1, x_{n+2} = x^2_{n+1} - \frac{x_n}{2}$$ Prove that the sequence has limit and find it.
The following figure shows a [i]walk[/i] of length 6:
[asy]
unitsize(20);
for (int x = -5; x <= 5; ++x)
for (int y = 0; y <= 5; ++y)
dot((x, y));
label("$O$", (0, 0), S);
draw((0, 0) -- (1, 0) -- (1, 1) -- (0, 1) -- (-1, 1) -- (-1, 2) -- (-1, 3));
[/asy]
This walk has three interesting properties:
[list]
[*] It starts at the origin, labelled $O$.
[*] Each step is 1 unit north, east, or west. There are no south steps.
[*] The walk never comes back to a point it has been to.[/list]
Let's call a walk with these three properties a [i]northern walk[/i]. There are 3 northern walks of length 1 and 7 northern walks of length 2. How many northern walks of length 6 are there?
Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$.
Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$.
Find a closed form for $a_n$.
[i]Proposed by Bobby Shen[/i]
A sequence of real numbers $u_1, u_2, u_3, \dots$ is determined by $u_1$ and the following recurrence relation for $n \geq 1$:
\[4u_{n+1} = \sqrt[3]{ 64u_n + 15.}\]
Describe, with proof, the behavior of $u_n$ as $n \to \infty.$
Find all function pairs $(f,g)$ where each $f$ and $g$ is a function defined on the integers and with values, such that, for all integers $a$ and $b$,
\[f(a+b)=f(a)g(b)+g(a)f(b)\\
g(a+b)=g(a)g(b)-f(a)f(b).\]
Let $(a_k)^{\infty}_{k=0}$ be a sequence of real numbers such that if $k$ is a non-negative integer, then
$$a_{k+1} = 3a_k - \lfloor 2a_k \rfloor - \lfloor a_k \rfloor.$$
Definitely all positive integers $n$ such that if $a_0 = 1/n$, then this sequence is constant after a certain term.
A gambling student tosses a fair coin. She gains $1$ point for each head that turns up, and gains $2$ points for each tail that turns up. Prove that the probability of the student scoring [i]exactly[/i] $n$ points is $\frac{1}{3}\cdot\left(2+\left(-\frac{1}{2}\right)^{n}\right)$.
If $R_n=\frac{1}{2}(a^n+b^n)$ where $a=3+2\sqrt{2}$, $b=3-2\sqrt{2}$, and $n=0,1,2, ...,$ then $R_{12345}$ is an integer. Its units digit is
$ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9 $
The Fibonacci sequence $f_1,f_2,f_3,\dots$ is defined by $f_1=f_2=1$, $f_{n+2}=f_{n+1}+f_n$. Find all $n$ such that $f_n = n^2$.
Let $P_{1}(x)=x^{2}-2$ and $P_{j}(x)=P_{1}(P_{j-1}(x))$ for j$=2,\ldots$ Prove that for any positive integer n the roots of the equation $P_{n}(x)=x$ are all real and distinct.
Let the sequence $\{K_{n}\}_{n \ge 1}$ be defined by \[K_{1}=2, K_{2}=8, K_{n+2}=3K_{n+1}-K_{n}+5(-1)^{n}.\] Prove that if $K_{n}$ is prime, then $n$ must be a power of $3$.
Let $N$ be an integer greater than $1$ and let $T_n$ be the number of non empty subsets $S$ of $\{1,2,.....,n\}$ with the property that the average of the elements of $S$ is an integer.Prove that $T_n - n$ is always even.
An infinite sequence of positive real numbers $x_0,x_1,x_2,...$ is called $vasco$ if it satisfies the following properties:
(a) $x_0=1,x_1=3$; and
(b) $x_0+x_1+...+x_{n-1}\ge3x_{n}-x_{n+1}$, for every $n\ge1$.
Find the greatest real number $M$ such that, for every $vasco$ sequence, the inequality $\frac{x_{n+1}}{x_{n}}>M$ is true for every $n\ge0$.
Let be given the sequence $(x_n)$ defined by $x_1 = 1$ and $x_{n+1} = 3x_n + \lfloor x_n \sqrt5 \rfloor$ for all $n = 1,2,3,...,$ where $\lfloor x \rfloor$ denotes the greatest integer that does not exceed $x$. Prove that for any positive integer $n$ we have $$x_nx_{n+2} - x^2_{n+1} = 4^{n-1}$$
Trần Nam Dũng
We consider the sequence $\{u_n\}$ defined by recursion $u_{n+1} =\frac{u_n(u_n + 1)}{n}$ for $n \ge 1$.
(a) Determine the terms of the sequence for $u_1 = 1$.
(b) Show that if a member of the sequence is rational, then all subsequent members are also rational numbers.
(c) Show that for every natural number $K$ there is a $u_1 > 1$ such that the first $K$ terms of the sequence are natural numbers.
Find the number of subsets $X$ of $\{1,2,\dots,10\}$ such that $X$ contains at least two elements and such that no two elements of $X$ differ by $1$.
A polynomial $P(x, y, z)$ in three variables with real coefficients satisfies the identities
$$P(x, y, z)=P(x, y, xy-z)=P(x, zx-y, z)=P(yz-x, y, z).$$
Prove that there exists a polynomial $F(t)$ in one variable such that
$$P(x,y,z)=F(x^2+y^2+z^2-xyz).$$
Natalie has a copy of the unit interval $[0,1]$ that is colored white. She also has a black marker, and she colors the interval in the following manner: at each step, she selects a value $x\in [0,1]$ uniformly at random, and
(a) If $x\leq\tfrac12$ she colors the interval $[x,x+\tfrac12]$ with her marker.
(b) If $x>\tfrac12$ she colors the intervals $[x,1]$ and $[0,x-\tfrac12]$ with her marker.
What is the expected value of the number of steps Natalie will need to color the entire interval black?
The Fibonacci sequence $\{F_{n}\}$ is defined by \[F_{1}=1, \; F_{2}=1, \; F_{n+2}=F_{n+1}+F_{n}.\] Show that $F_{mn}-F_{n+1}^{m}+F_{n-1}^{m}$ is divisible by $F_{n}^{3}$ for all $m \ge 1$ and $n>1$.