Found problems: 766
Given is a number $a$ with 0 $\le \alpha \le \pi$. A sequence $c_0,c_1, c_2,...$ is defined as
$$c_0=\cos \alpha$$
$$C_{n+1}=\sqrt{\frac{1+c_n}{2}} \,\, for \,\,\, n=0,1,2,...$$
Calculate $\lim_{n\to \infty}2^{2n+1}(1-c_n)$
The sequence $a_1, a_2,...$ is de fined by the equalities $a_1 = 2, a_2 = 12$ and $a_{n+1} = 6a_n-a_{n-1}$ for every positive integer $n \ge 2$. Prove that no member of this sequence is equal to a perfect power (greater than one) of a positive integer.
Positive integers $a_1, a_2, \dots, a_{2023}$ satisfy the following conditions.
[list]
[*] $a_1 = 5, a_2 = 25$
[*] $a_{n + 2} = 7a_{n+1}-a_n-6$ for each $n = 1, 2, \dots, 2021$
[/list]
Prove that there exist integers $x, y$ such that $a_{2023} = x^2 + y^2.$
We wish to tile a strip of $n$ $1$-inch by $1$-inch squares. We can use dominos which are made up of two tiles that cover two adjacent squares, or $1$-inch square tiles which cover one square. We may cover each square with one or two tiles and a tile can be above or below a domino on a square, but no part of a domino can be placed on any part of a different domino. We do not distinguish whether a domino is above or below a tile on a given square. Let $t(n)$ denote the number of ways the strip can be tiled according to the above rules. Thus for example, $t(1)=2$ and $t(2)=8$. Find a recurrence relation for $t(n)$, and use it to compute $t(6)$.
An integer sequence is defined by \[{ a_n = 2 a_{n-1} + a_{n-2}}, \quad (n > 1), \quad a_0 = 0, a_1 = 1.\] Prove that $2^k$ divides $a_n$ if and only if $2^k$ divides $n$.
Let $(a_n)_{n\ge 1}$ be a sequence given by $a_1 = 45$ and $$a_n = a^2_{n-1} + 15a_{n-1}$$ for $n > 1$. Prove that the sequence contains no perfect squares.
Given a string of at least one character in which each character is either A or B, Kathryn is allowed to make these moves:
[list]
[*] she can choose an appearance of A, erase it, and replace it with BB, or
[*] she can choose an appearance of B, erase it, and replace it with AA.
[/list]
Kathryn starts with the string A. Let $a_n$ be the number of strings of length $n$ that Kathryn can reach using a sequence of zero or more moves. (For example, $a_1=1$, as the only string of length 1 that Kathryn can reach is A.) Then $\sum_{n=1}^{\infty} \frac{a_n}{5^n} = \frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$.
[i]Proposed by Luke Robitaille[/i]
Let $(n+3)a_{n+2}=(6n+9)a_{n+1}-na_n$ and $a_0=1$ and $a_1=2$ prove that all the terms of the sequence are integers
The sequence $a = (a_0, a_1,a_2,...)$ is defined by $a_0 = 0, a_1 =2$ and $$a_{n+2} = 2a_{n+1} + 41a_n$$Prove that $a_{2016}$ is divisible by $2017.$
Find all functions $f:\mathbb{Q}\rightarrow\mathbb{R}$ such that
\[
f(x)^2-f(y)^2=f(x+y)\cdot f(x-y),
\]
for all $x,y\in \mathbb{Q}$.
[i]Proposed by Portugal.[/i]
In a country, mathematicians chose an $\alpha> 2$ and issued coins in denominations of 1 ruble, as well as $\alpha ^k$ rubles for each positive integer k. $\alpha$ was chosen so that the value of each coins, except the smallest, was irrational. Is it possible that any natural number of rubles can be formed with at most 6 of each denomination of coins?
In town $ A,$ there are $ n$ girls and $ n$ boys, and each girl knows each boy. In town $ B,$ there are $ n$ girls $ g_1, g_2, \ldots, g_n$ and $ 2n \minus{} 1$ boys $ b_1, b_2, \ldots, b_{2n\minus{}1}.$ The girl $ g_i,$ $ i \equal{} 1, 2, \ldots, n,$ knows the boys $ b_1, b_2, \ldots, b_{2i\minus{}1},$ and no others. For all $ r \equal{} 1, 2, \ldots, n,$ denote by $ A(r),B(r)$ the number of different ways in which $ r$ girls from town $ A,$ respectively town $ B,$ can dance with $ r$ boys from their own town, forming $ r$ pairs, each girl with a boy she knows. Prove that $ A(r) \equal{} B(r)$ for each $ r \equal{} 1, 2, \ldots, n.$
In town $ A,$ there are $ n$ girls and $ n$ boys, and each girl knows each boy. In town $ B,$ there are $ n$ girls $ g_1, g_2, \ldots, g_n$ and $ 2n \minus{} 1$ boys $ b_1, b_2, \ldots, b_{2n\minus{}1}.$ The girl $ g_i,$ $ i \equal{} 1, 2, \ldots, n,$ knows the boys $ b_1, b_2, \ldots, b_{2i\minus{}1},$ and no others. For all $ r \equal{} 1, 2, \ldots, n,$ denote by $ A(r),B(r)$ the number of different ways in which $ r$ girls from town $ A,$ respectively town $ B,$ can dance with $ r$ boys from their own town, forming $ r$ pairs, each girl with a boy she knows. Prove that $ A(r) \equal{} B(r)$ for each $ r \equal{} 1, 2, \ldots, n.$
Define the numbers $a_0, a_1, \ldots, a_n$ in the following way:
\[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \]
Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]
Let $\{a_n \}_{n=0}^{\infty}$ be a sequence given recrusively such that $a_0=1$ and $$a_{n+1}=\frac{7a_n+\sqrt{45a_n^2-36}}{2}$$ for $n\geq 0$
Show that :
a) $a_n$ is a positive integer.
b) $a_n a_{n+1}-1$ is a square of an integer.
[i]Proposed by Stefan Gyurki (Matej Bel University, Banska Bystrica).[/i]
For each $k$, $\mathcal{C}_k$ is biased so that, when tossed, it has probability $\tfrac{1}{(2k+1)}$ of falling heads. If the $n$ coins are tossed, what is the probability that the number of heads is odd? Express the answer as a rational function $n$.
For any natural number $n$, consider a $1\times n$ rectangular board made up of $n$ unit squares. This is covered by $3$ types of tiles : $1\times 1$ red tile, $1\times 1$ green tile and $1\times 2$ domino. (For example, we can have $5$ types of tiling when $n=2$ : red-red ; red-green ; green-red ; green-green ; and blue.) Let $t_n$ denote the number of ways of covering $1\times n$ rectangular board by these $3$ types of tiles. Prove that, $t_n$ divides $t_{2n+1}$.
Prove that for any integer $n \ge 2$, there exists a unique finite sequence $x_0, x_1,..., x_n$ of real numbers which satisfies $x_0 = x_n = 0$ and $x_{i+1} - 8x_i^3 -4x_i + 3x_{i-1} + 1 = 0$ for all $i = 1,2,...,n - 1$. Prove moreover that $ |x_i| \le \frac12$ for all $i = 1,2,...,n - 1$.
Nguyễn Duy Thái Sơn
For each positive integer $n$, let $f(n)$ denote the number of ways of representing $n$ as a sum of powers of 2 with nonnegative integer exponents. Representations which differ only in the ordering of their summands are considered to be the same. For instance, $f(4)=4$, because the number $4$ can be represented in the following four ways: \[4, 2+2, 2+1+1, 1+1+1+1.\] Prove that, for any integer $n \geq 3$, \[2^{n^{2}/4}< f(2^{n}) < 2^{n^{2}/2}.\]
Let $ \mathbb{R}^\plus{}$ be the set of all non-negative real numbers. Given two positive real numbers $ a$ and $ b,$ suppose that a mapping $ f: \mathbb{R}^\plus{} \mapsto \mathbb{R}^\plus{}$ satisfies the functional equation:
\[ f(f(x)) \plus{} af(x) \equal{} b(a \plus{} b)x.\]
Prove that there exists a unique solution of this equation.
Let $f(x) = x-\tfrac1{x}$, and defi ne $f^1(x) = f(x)$ and $f^n(x) = f(f^{n-1}(x))$ for $n\ge2$. For each $n$, there is a minimal degree $d_n$ such that there exist polynomials $p$ and $q$ with $f^n(x) = \tfrac{p(x)}{q(x)}$ and the degree of $q$ is equal to $d_n$. Find $d_n$.
Prove that for each natural number $d$, There is a monic and unique polynomial of degree $d$ like $P$ such that $P(1)$≠$0$ and for each sequence like $a_{1}$,$a_{2}$, $...$ of real numbers that the recurrence relation below is true for them, there is a natural number $k$ such that $0=a_{k}=a_{k+1}= ...$ :
$P(n)a_{1} + P(n-1)a_{2} + ... + P(1)a_{n}=0$
$n>1$
A rectangle is divided into $200\times 3$ unit squares. Prove that the number of ways of splitting this rectangle into rectangles of size $1\times 2$ is divisible by $3$.
Let $\{x_{n}\}_{n\ge0}$ and $\{y_{n}\}_{n\ge0}$ be two sequences defined recursively as follows \[x_{0}=1, \; x_{1}=4, \; x_{n+2}=3 x_{n+1}-x_{n},\] \[y_{0}=1, \; y_{1}=2, \; y_{n+2}=3 y_{n+1}-y_{n}.\] [list=a][*] Prove that ${x_{n}}^{2}-5{y_{n}}^{2}+4=0$ for all non-negative integers. [*] Suppose that $a$, $b$ are two positive integers such that $a^{2}-5b^{2}+4=0$. Prove that there exists a non-negative integer $k$ such that $a=x_{k}$ and $b=y_{k}$.[/list]
Let $\mathbb{N}^2$ denote the set of ordered pairs of positive integers. A finite subset $S$ of $\mathbb{N}^2$ is [i]stable[/i] if whenever $(x,y)$ is in $S$, then so are all points $(x',y')$ of $\mathbb{N}^2$ with both $x'\leq x$ and $y'\leq y$.
Prove that if $S$ is a stable set, then among all stable subsets of $S$ (including the empty set and $S$ itself), at least half of them have an even number of elements.
[i]Ashwin Sah and Mehtaab Sawhney[/i]