Found problems: 5802
Let a sequence $(a_n)$ satisfy: $a_1=5,a_2=13$ and $a_{n+1}=5a_n-6a_{n-1},\forall n\ge2$
a) Prove that $(a_n, a_{n+1})=1,\forall n\ge1$
b) Prove that: $2^{k+1}|p-1\forall k\in\mathbb{N}$, if p is a prime factor of $a_{2^k}$
Let $n$ be a positive integer. There is a pawn in one of the cells of an $n\times n$ table. The pawn moves from an arbitrary cell of the $k$th column, $k \in \{1,2, \cdots, n \}$, to an arbitrary cell in the $k$th row. Prove that there exists a sequence of $n^{2}$ moves such that the pawn goes through every cell of the table and finishes in the starting cell.
There are $n$ cards. Max and Lewis play, alternately, the following game
Max starts the game, he removes exactly $1$ card, in each round the current player can remove any quantity of cards, from $1$ card to $t+1$ cards, which $t$ is the number of removed cards by the previous player, and the winner is the player who remove the last card. Determine all the possible values of $n$ such that Max has the winning strategy.
A sequence of integers $ a_{1},a_{2},a_{3},\ldots$ is defined as follows: $ a_{1} \equal{} 1$ and for $ n\geq 1$, $ a_{n \plus{} 1}$ is the smallest integer greater than $ a_{n}$ such that $ a_{i} \plus{} a_{j}\neq 3a_{k}$ for any $ i,j$ and $ k$ in $ \{1,2,3,\ldots ,n \plus{} 1\}$, not necessarily distinct. Determine $ a_{1998}$.
There are $N$ cities in the country. Any two of them are connected either by a road or by an airway. A tourist wants to visit every city exactly once and return to the city at which he started the trip. Prove that he can choose a starting city and make a path, changing means of transportation at most once.
Let $n \geq 2$ be a positive integer. A subset of positive integers $S$ is said to be [i]comprehensive[/i] if for every integer $0 \leq x < n$, there is a subset of $S$ whose sum has remainder $x$ when divided by $n$. Note that the empty set has sum 0. Show that if a set $S$ is comprehensive, then there is some (not necessarily proper) subset of $S$ with at most $n-1$ elements which is also comprehensive.
Let $A(n)$ denote the number of sequences $a_1\ge a_2\ge\cdots{}\ge a_k$ of positive integers for which $a_1+\cdots{}+a_k = n$ and each $a_i +1$ is a power of two $(i = 1,2,\cdots{},k)$. Let $B(n)$ denote the number of sequences $b_1\ge b_2\ge \cdots{}\ge b_m$ of positive integers for which $b_1+\cdots{}+b_m =n$ and each inequality $b_j\ge 2b_{j+1}$ holds $(j=1,2,\cdots{}, m-1)$. Prove that $A(n) = B(n)$ for every positive integer $n$.
[i]Senior Problems Committee of the Australian Mathematical Olympiad Committee[/i]
A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even.
[i]Proposed by Jeck Lim, Singapore[/i]
Let $\,S\,$ be a finite set of points in three-dimensional space. Let $\,S_{x},\,S_{y},\,S_{z}\,$ be the sets consisting of the orthogonal projections of the points of $\,S\,$ onto the $yz$-plane, $zx$-plane, $xy$-plane, respectively. Prove that \[ \vert S\vert^{2}\leq \vert S_{x} \vert \cdot \vert S_{y} \vert \cdot \vert S_{z} \vert, \] where $\vert A \vert$ denotes the number of elements in the finite set $A$.
[hide="Note"] Note: The orthogonal projection of a point onto a plane is the foot of the perpendicular from that point to the plane. [/hide]
A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$
[i]Proposed by Gerhard Wöginger, Austria[/i]
Given a finite sequence of real numbers $a_1,a_2,\dots ,a_n$ ($\ast$), we call a segment $a_k,\dots ,a_{k+l-1}$ of the sequence ($\ast$) a “[i]long[/i]”(Chinese dragon) and $a_k$ “[i]head[/i]” of the “[i]long[/i]” if the arithmetic mean of $a_k,\dots ,a_{k+l-1}$ is greater than $1988$. (especially if a single item $a_m>1988$, we still regard $a_m$ as a “[i]long[/i]”). Suppose that there is at least one “[i]long[/i]” among the sequence ($\ast$), show that the arithmetic mean of all those items of sequence ($\ast$) that could be “[i]head[/i]” of a certain “[i]long[/i]” individually is greater than $1988$.
Find the $n$-th derivative with respect to $x$ of
$$\int_{0}^{x} \left(1+\frac{x-t}{1!}+\frac{(x-t)^{2}}{2!}+\ldots+\frac{(x-t)^{n-1}}{(n-1)!}\right)e^{nt} dt.$$
Given a sphere, a great circle of the sphere is a circle on the sphere whose diameter is also a diameter of the sphere. For a given positive integer $n,$ the surface of a sphere is divided into several regions by $n$ great circles, and each region is colored black or white. We say that a coloring is good if any two adjacent regions (that share an arc as boundary, not just a finite number of points) have different colors. Find, with proof, all positive integers $n$ such that in every good coloring with $n$ great circles, the sum of the areas of the black regions is equal to the sum of the areas of the white regions.
Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
Two bored millionaires, Bilion and Trilion, decide to play a game. They each have a sufficient supply of $\$ 1, \$ 2,\$ 5$, and $\$ 10$ bills. Starting with Bilion, they take turns putting one of the bills they have into a pile. The game ends when the bills in the pile total exactly $\$1{,}000{,}000$, and whoever makes the last move wins the $\$1{,}000{,}000$ in the pile (if the pile is worth more than $\$1{,}000{,}000$ after a move, then the person who made the last move loses instead, and the other person wins the amount of cash in the pile). Assuming optimal play, how many dollars will the winning player gain?
[i]Proposed by Yannick Yao[/i]
Let $\{u_n\}_{n \ge 1}$ be a sequence of real numbers defined as $u_1 = 1$ and
\[ u_{n+1} = u_n + \frac{1}{u_n} \text{ for all $n \ge 1$.}\]
Prove that $u_n \le \frac{3\sqrt{n}}{2}$ for all $n$.
Let $a$ and $b$ be two positive integers. Prove that the integer
\[a^2+\left\lceil\frac{4a^2}b\right\rceil\]
is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.)
[i]Russia[/i]
Prove $ \frac{1}{10\sqrt2}<\frac{1}{2}\frac{3}{4}\frac{5}{6}...\frac{99}{100}<\frac{1}{10} $
Let $n$ be positive integer and $S$= {$0,1,…,n$}, Define set of point in the plane. $$A = \{(x,y) \in S \times S \mid -1 \leq x-y \leq 1 \} $$, We want to place a electricity post on a point in $A$ such that each electricity post can shine in radius 1.01 unit. Define minimum number of electricity post such that every point in $A$ is in shine area
[b]p1.[/b] Find all triples of positive integers such that the sum of their reciprocals is equal to one.
[b]p2.[/b] Prove that $a(a + 1)(a + 2)(a + 3)$ is divisible by $24$.
[b]p3.[/b] There are $20$ very small red chips and some blue ones. Find out whether it is possible to put them on a large circle such that
(a) for each chip positioned on the circle the antipodal position is occupied by a chip of different color;
(b) there are no two neighboring blue chips.
[b]p4.[/b] A $12$ liter container is filled with gasoline. How to split it in two equal parts using two empty $5$ and $8$ liter containers?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $ m,n$ be two natural numbers with $ m > 1$ and $ 2^{2m \plus{} 1} \minus{} n^2\geq 0$. Prove that:
\[ 2^{2m \plus{} 1} \minus{} n^2\geq 7 .\]
Prove that $1\cdot2\cdot3\cdots 2002<\left(\frac{2003}{2}\right)^{2002}.$
Answer the following questions :
$\textbf{(a)}~$ A natural number $k$ is called stable if there exist $k$ distinct natural numbers $a_1, a_2,\cdots, a_k$, each $a_i>1$, such that $$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_k}=1$$ Show that if $k$ is stable, then $(k+1)$ is also stable. Using this or otherwise, find all stable numbers.
$\textbf{(b)}$ Let $f$ be a differentiable function defined on a subset $A$ of the real numbers. Define $$f^*(y):=\max_{x\in A} \left\{yx-f(x)\right\}$$ whenever the above maximum is finite.
For the function $f(x)=\ln x$, determine the set of points for which $f^*$ is defined and find an expression for $f^*(y)$ involving only $y$ and constants.
Suppose $F$ is a family of finite subsets of $\mathbb{N}$ and for any 2 sets $A,B \in F$ we have $A \cap B \not= \O$.
(a) Is it true that there is a finite subset $Y$ of $\mathbb{N}$ such that for any $A,B \in F$ we have $A\cap B\cap Y \not= \O$?
(b) Is the above true if we assume that all members of $F$ have the same size?
Let $n \geq 2$ be a positive integer, and suppose buildings of height $1, 2, \ldots, n$ are built
in a row on a street. Two distinct buildings are said to be $\emph{roof-friendly}$ if every building
between the two is shorter than both buildings in the pair. For example, if the buildings are
arranged $5, 3, 6, 2, 1, 4,$ there are $8$ roof-friendly pairs: $(5, 3), (5, 6), (3, 6), (6, 2), (6, 4), (2, 1),$
$(2, 4), (1, 4).$ Find, with proof, the minimum and maximum possible number of roof-friendly
pairs of buildings, in terms of $n.$