Let real number sequences $a_k$ and $x_k$ be defined for $1 \le k \le 7$ and suppose that $a_1=1$ and $a_{k+1}=a_k+x_k$ for $1 \le k \le 7.$ Let $x_k$ be chosen such that the quantity $S=\sum_{k=1}^7 (a_k^2+x_k^2)$ is minimized. Then $S=\tfrac{m}{n}$ for coprime positive integers $m$ and $n.$ Find $m+n.$

[b]p1.[/b] A band of pirates unloaded some number of treasure chests from their ship. The number of pirates was between $60$ and $69$ (inclusive). Each pirate handled exactly $11$ treasure chests, and each treasure chest was handled by exactly $7$ pirates. Exactly how many treasure chests were there? Show that your answer is the only solution. [b]p2.[/b] Let $a$ and $b$ be the lengths of the legs of a right triangle, let $c$ be the length of the hypotenuse, and let $h$ be the length of the altitude drawn from the vertex of the right angle to the hypotenuse. Prove that $c+h>a+b$. [b]p3.[/b] Prove that $$\frac{1}{70}< \frac{1}{2} \frac{3}{4} \frac{5}{6} ... \frac{2001}{2002} < \frac{1}{40}$$ [b]p4.[/b] Given a positive integer $a_1$ we form a sequence $a_1 , a_2 , a _3,...$ as follows: $a_2$ is obtained from $a_1$ by adding together the digits of $a_1$ raised to the $2001$-st power; $a_3$ is obtained from $a_2$ using the same rule, and so on. For example, if $a_1 =25$, then $a_2 =2^{2001}+5^{2001}$, which is a $1399$-digit number containing $106$ $0$'s, $150$ $1$'s, 4124$ 42$'s, $157$ $3$'s, $148$ $4$'s, $141$ $5$'s, $128$ $6$'s, $1504 47$'s, $152$ $8$'s, $143$ $9$'s. So $a_3 = 106 \times 0^{2001}+ 150 \times 1^{2001}+ 124 \times 2^{2001}+ 157 \times 3^{2001}+ ...+ 143 \times 9^{2001}$ which is a $1912$-digit number, and so forth. Prove that if any positive integer $a_1$ is chosen to start the sequence, then there is a positive integer $M$ (which depends on $a_1$ ) that is so large that $a_n < M$ for all $n=1,2,3,...$ [b]p5.[/b] Let $P(x)$ be a polynomial with integer coefficients. Suppose that there are integers $a$, $b$, and $c$ such that $P(a)=0$, $P(b)=1$, and $P(c)=2$. Prove that there is at most one integer $n$ such that $P(n)=4$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $(\Omega, \mathcal A, P)$ be a probability space, and let $(X_n, \mathcal F_n)$ be an adapted sequence in $(\Omega, \mathcal A, P)$ (that is, for the $\sigma$-algebras $\mathcal F_n$, we have $\mathcal F_1\subseteq \mathcal F_2\subseteq \dots \subseteq \mathcal A$, and for all $n$, $X_n$ is an $\mathcal F_n$-measurable and integrable random variable). Assume that $$\mathrm E (X_{n+1} \mid \mathcal F_n )=\frac12 X_n+\frac12 X_{n-1}\,\,\,\,\, (n=2, 3, \ldots )$$ Prove that $\mathrm{sup}_n \mathrm{E}|X_n|<\infty$ implies that $X_n$ converges with probability one as $n\to\infty$. [I. Fazekas]

[b]p1.[/b] A function $f$ defined on the set of positive numbers satisfies the equality $$f(xy) = f(x) + f(y), x, y > 0.$$ Find $f(2007)$ if $f\left( \frac{1}{2007} \right) = 1$. [b]p2.[/b] The plane is painted in two colors. Show that there is an isosceles right triangle with all vertices of the same color. [b]p3.[/b] Show that the number of ways to cut a $2n \times 2n$ square into $1\times 2$ dominoes is divisible by $2$. [b]p4.[/b] Two mirrors form an angle. A beam of light falls on one mirror. Prove that the beam is reflected only finitely many times (even if the angle between mirrors is very small). [b]p5.[/b] A sequence is given by the recurrence relation $a_{n+1} = (s(a_n))^2 +1$, where $s(x)$ is the sum of the digits of the positive integer $x$. Prove that starting from some moment the sequence is periodic. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The sequence $(a_n)$ is defined by $a_1 =\sqrt2$ and $a_{n+1} =\sqrt{2-\sqrt{4-a_n^2}}$. Let $b_n =2^{n+1}a_n$. Prove that $b_n \le 7$ and $b_n < b_{n+1}$ for all $n$.

Five distinct numbers are drawn successively and at random from the set $\{1, \cdots , n\}$. Show that the probability of a draw in which the first three numbers as well as all five numbers can be arranged to form an arithmetic progression is greater than $\frac{6}{(n-2)^3}$

Let $p > 3$ be a prime number. A sequence of $p-1$ integers $a_1,a_2, \dots, a_{p-1}$ is called [i]wonky[/i] if they are distinct modulo \(p\) and $a_ia_{i+2} \not\equiv a_{i+1}^2 \pmod p$ for all \(i \in \{1, 2, \dots, p-1\}\), where \(a_p = a_1\) and \(a_{p+1} = a_2\). Does there always exist a wonky sequence such that $$a_1a_2, \qquad a_1a_2+a_2a_3, \qquad \dots, \qquad a_1a_2+\cdots +a_{p-1}a_1,$$ are all distinct modulo $p$? [i]Proposed by Harun Khan[/i]

. Anthony denotes in sequence all positive integers which are divisible by $2$. Bertha denotes in sequence all positive integers which are divisible by $3$. Claire denotes in sequence all positive integers which are divisible by $4$. Orderly Dora denotes all numbers written by the other three. Thereby she puts them in order by size and does not repeat a number. What is the $2017th$ number in her list? [i]¨Proposed by Richard Henner[/i]

An infinite arithmetic progression is given. The products of the pairs of its members are considered. Prove that two of these numbers differ by no more than 1. [i]Proposed by A. Kuznetsov[/i]

Consider a sequence $x_1,x_2,\cdots x_{12}$ of real numbers such that $x_1=1$ and for $n=1,2,\dots,10$ let \[ x_{n+2}=\frac{(x_{n+1}+1)(x_{n+1}-1)}{x_n}. \] Suppose $x_n>0$ for $n=1,2,\dots,11$ and $x_{12}=0$. Then the value of $x_2$ can be written as $\frac{\sqrt{a}+\sqrt{b}}{c}$ for positive integers $a,b,c$ with $a>b$ and no square dividing $a$ or $b$. Find $100a+10b+c$. [i]Proposed by Michael Kural[/i]

$ p >3 $ is a prime number such that $ p | 2^{p-1} -1 $ and $ p \not | 2^x - 1 $ for $ x = 1, 2, \cdots , p-2 $. Let $ p = 2k+3 $. Now we define sequence $ \{ a_n \} $ as \[ a_i = a_{i+k}= 2^i ( 1 \le i \le k ) , \ a_{j+2k} = a_j a_{j+k} \ ( j \ge 1 ) \] Prove that there exist $2k$ consecutive terms of sequence $ a_{x+1} , a_{x+2} , \cdots , a_{x+2k} $ such that for all $ 1 \le i < j \le 2k $, $ a_{x+i} \not \equiv a_{x+j} \ (mod \ p) $.

Let $ABC$ be an equilateral triangle with side 3. A circle $C_1$ is tangent to $AB$ and $AC$. A circle $C_2$, with a radius smaller than the radius of $C_1$, is tangent to $AB$ and $AC$ as well as externally tangent to $C_1$. Successively, for $n$ positive integer, the circle $C_{n+1}$, with a radius smaller than the radius of $C_n$, is tangent to $AB$ and $AC$ and is externally tangent to $C_n$. Determine the possible values for the radius of $C_1$ such that 4 circles from this sequence, but not 5, are contained on the interior of the triangle $ABC$.

There are $1999$ balls in a row, some are red and some are blue (it could be all red or all blue). Under every ball we write a number equal to the sum of the amount of red balls in the right of this ball plus the sum of the amount of the blue balls that are in the left of this ball. In the sequence of numbers that we get with this balls we have exactly three numbers that appears an odd number of times, which numbers could these three be?

Answer either (i) or (ii). (i) Given that the sequence whose $n$th term is $(s_n + 2s_{n + 1})$ converges, show that the sequence $\{ s_n \}$ converges also. (ii) A plane varies so that it includes a cone of constant value equal to $\pi a^3 / 3$ with the surface the equation of which in rectangular coordinates is $2xy = z^2.$ Find the equation of the envelope of the various positions of this plane. State the result so that it applies to a general cone (that is, conic surface) of the second order.

Given [i]Fibonacci[/i] sequence $(F_n),$ and a positive integer $m$, denote $k(m)$ by the smallest positive integer satisfying $F_{n+k(m)}\equiv F_n(\bmod m),$ for all natural numbers $n$. Prove that: $k(m)$ is even for all $m>2.$