A binary sequence is a sequence in which each term is equal to $0$ or $1$. A binary sequence is called $\text{friendly}$ if each term is adjacent to at least on term that is equal to $1$. For example , the sequence $0,1,1,0,0,1,1,1$ is $\text{friendly}$. Let $F_{n}$ denote the number of $\text{friendly}$ binary sequences with $n$ terms. Find the smallest positive integer $n\ge 2$ such that $F_{n}>100$

Prove that there exists no innite sequence of prime numbers $p_0, p_1, p_2,...$ such that for all positive integers $k$: $p_k = 2p_{k-1} + 1$ or $p_k = 2p_{k-1} - 1$.

Find all positive integer $n\ge 3$ such that it is possible to mark the vertices of a regular $n$- gon with the number from 1 to n so that for any three vertices $A, B$ and $C$ with $AB = AC$, the number in $A$ is greater or smaller than both numbers in $B, C$.

Let $P$ be a polygon that is convex and symmetric to some point $O$. Prove that for some parallelogram $R$ satisfying $P\subset R$ we have \[\frac{|R|}{|P|}\leq \sqrt 2\] where $|R|$ and $|P|$ denote the area of the sets $R$ and $P$, respectively. [i]Proposed by Witold Szczechla, Poland[/i]

The given natural numbers are $ k, n $. We inductively define two sequences of numbers $ (a_j) $ and $ (r_j) $ as follows: Step one: we divide $ k $ by $ n $ and get the quotient $ a_1 $ and the remainder $ r_i $, step j: we divide $ k+r_{j-1} $ by $ n $ and get the quotient $ a_j $ and the remainder $ r_j $. Calculate the sum of $ a_1 + \ldots + a_n $.

Given a positive integer $n$ and a real valued $n\times n$ matrix $A$. $J$ is $n\times n$ matrix with every entry $1$. Suppose $A$ satisfies the following relations. $$A+A^T = \frac{1}{n} J, \quad AJ = \frac{1}{2} J$$ Show that $A^m-I$ is an invertible matrix for all positive odd integer $m$.

The number $6545$ can be written as a product of a pair of positive two-digit numbers. What is the sum of this pair of numbers? $\text{(A)}\ 162 \qquad \text{(B)}\ 172 \qquad \text{(C)}\ 173 \qquad \text{(D)}\ 174 \qquad \text{(E)}\ 222$

Let $n$ be a positive integer greater than 1. Determine all the collections of real numbers $x_1,\ x_2,\dots,\ x_n\geq1\mbox{ and }x_{n+1}\leq0$ such that the next two conditions hold: (i) $x_1^{\frac12}+x_2^{\frac32}+\cdots+x_n^{n-\frac12}= nx_{n+1}^\frac12$ (ii) $\frac{x_1+x_2+\cdots+x_n}{n}=x_{n+1}$

a) Points $A$ and $B$ move uniformly and with equal angle speed along the circumferences with $O_a$ and $O_b$ centres (both clockwise). Prove that a vertex $C$ of the equilateral triangle $ABC$ also moves along a certain circumference uniformly. b) The distance from the point $P$ to the vertices of the equilateral triangle $ABC$ equal $|AP|=2, |BP|=3$. Find the maximal value of $CP$.

Two circles $k_1(O_1,R)$ and $k_2(O_2,r)$ are given in the plane such that $R \ge \sqrt2 r$ and $$O_1O_2 =\sqrt{R^2 +r^2 - r\sqrt{4R^2 +r^2}}.$$ Let $A$ be an arbitrary point on $k_1$. The tangents from $A$ to $k_2$ touch $k_2$ at $B$ and $C$ and intersect $k_1$ again at $D$ and $E$, respectively. Prove that $BD \cdot CE = r^2$

We say $p(x,y)\in \mathbb{R}\left[x,y\right]$ is [i]good[/i] if for any $y \neq 0$ we have $p(x,y) = p\left(xy,\frac{1}{y}\right)$ . Prove that there are good polynomials $r(x,y) ,s(x,y)\in \mathbb{R}\left[x,y\right]$ such that for any good polynomial $p$ there is a $f(x,y)\in \mathbb{R}\left[x,y\right]$ such that \[f(r(x,y),s(x,y))= p(x,y)\] [i]Proposed by Mohammad Ahmadi[/i]

Consider the cube $ABCDA'B'C'D'$ ($ABCD$ and $A'B'C'D'$ are the upper and lower bases, repsectively, and edges $AA', BB', CC', DD'$ are parallel). The point $X$ moves at a constant speed along the perimeter of the square $ABCD$ in the direction $ABCDA$, and the point $Y$ moves at the same rate along the perimiter of the square $B'C'CB$ in the direction $B'C'CBB'$. Points $X$ and $Y$ begin their motion at the same instant from the starting positions $A$ and $B'$, respectively. Determine and draw the locus of the midpionts of the segments $XY$.

Find all prime numbers $p$ for which the number of ordered pairs of integers $(x, y)$ with $0\leq x, y < p$ satisfying the condition \[y^2 \equiv  x^3 - x \pmod p\] is exactly $p.$

[b]8.[/b] The figure below shows a broken piece of a circular plate made of glass. [img]https://cdn.artofproblemsolving.com/attachments/7/3/a49f60d803f802c54e2295932b34579514b4fe.png[/img] $C$ is the midpoint of $AB$, and $D$ is the midpoint of arc $AB$. Given that $AB = 24$ cm and $CD = 6$ cm, what is the radius of the plate in centimetres? (The figure is not drawn to scale.)

We have three circles $w_1$, $w_2$ and $\Gamma$ at the same side of line $l$ such that $w_1$ and $w_2$ are tangent to $l$ at $K$ and $L$ and to $\Gamma$ at $M$ and $N$, respectively. We know that $w_1$ and $w_2$ do not intersect and they are not in the same size. A circle passing through $K$ and $L$ intersect $\Gamma$ at $A$ and $B$. Let $R$ and $S$ be the reflections of $M$ and $N$ with respect to $l$. Prove that $A, B, R, S$ are concyclic.

Let $k$ be an integer number and $P(X)$ be the polynomial $$P(X) = X^{1997}-X^{1995} +X^2-3kX+3k+1$$ Prove that: a) the polynomial has no integer root; β) the numbers $P(n)$ and $P(n) + 3$ are relatively prime, for every integer $n$.

In the increasing sequence of positive integers $a_1$, $a_2$,. . . , the number $a_k$ is said to be funny if it can be represented as the sum of some other terms (not necessarily distinct) of the sequence. (a) Prove that all but finitely terms of the sequence are funny. (b) Does the result in (a) always hold if the terms of the sequence can be any positive rational numbers?

Let $ H$ be the piont of midpoint of the cord $ PQ$ that is on the circle centered the origin $ O$ with radius $ 1.$ Suppose the length of the cord $ PQ$ is $ 2\sin \frac {t}{2}$ for the angle $ t\ (0\leq t\leq \pi)$ that is formed by half-ray $ OH$ and the positive direction of the $ x$ axis. Answer the following questions. (1) Express the coordiante of $ H$ in terms of $ t$. (2) When $ t$ moves in the range of $ 0\leq t\leq \pi$, find the minimum value of $ x$ coordinate of $ H$. (3) When $ t$ moves in the range of $ 0\leq t\leq \frac {\pi}{2}$, find the area $ S$ of the region bounded by the curve drawn by the point $ H$ and the $ x$ axis and the $ y$ axis.

We consider the following operation applied to a positive integer: The integer is represented in an arbitrary base $b \ge 2$, in which it has exactly two digits and in which both digits are different from $0$. Then the two digits are swapped and the result in base $b$ is the new number. Is it possible to transform every number $> 10$ to a number $\le 10$ with a series of such operations? (Theresia Eisenkölbl)

Find the continuous function satisfying the following equation. \[\int_0^x f(t)dt+\int_0^x tf(x-t)dt=e^{-x}-1.\] [i]1978 Shibaura Institute of Technology entrance exam[/i]

Find the smallest natural number $n$ for which it is possible to partition the set $M = \{1,2, ... ,40\}$ into n subsets $M_1, . . . ,M_n$ so that none of the $M_i$ contains elements $a,b,c$ (not necessarily distinct) with $a+b = c$.

Let $ABCD$ be a trapezoid such that $AB \parallel CD$, $|AB|<|CD|$, and $\text{Area}(ABC)=30$. Let the line through $B$ parallel to $AD$ meet $[AC]$ at $E$. If $|AE|:|EC|=3:2$, then what is the area of trapezoid $ABCD$? $ \textbf{(A)}\ 45 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 72 \qquad\textbf{(D)}\ 80 \qquad\textbf{(E)}\ 90 $

Let $P$ and $Q$ be two horizontal neighbouring squares on a $n \times n$ chess board, $P$ on the left and $Q$ on the right. On the left square $P$ there is a stone that shall be moved around the board. The following moves are allowed: 1) move it one square upwards 2) move it one square to the right 3) move it one square down and one square to the left (diagonal movement) Example: you can get from $e5$ to $f5$, $e6$ and $d4$. Show that for no $n$ there is tour visting every square exactly once and ending in $Q$.

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a three times differentiable function. Prove that there exists $w \in [-1,1]$ such that \[ \frac{f'''(w)}{6} = \frac{f(1)}{2}-\frac{f(-1)}{2}-f'(0). \]

[b]p1.[/b] Arrange the whole numbers $1$ through $15$ in a row so that the sum of any two adjacent numbers is a perfect square. In how many ways this can be done? [b]p2.[/b] Prove that if $p$ and $q$ are prime numbers which are greater than $3$ then $p^2 - q^2$ is divisible by $24$. [b]p3.[/b] If a polyleg has even number of legs he always tells truth. If he has an odd number of legs he always lies. Once a green polyleg told a dark-blue polyleg ”- I have $8$ legs. And you have only $6$ legs!” The offended dark-blue polyleg replied ”-It is me who has $8$ legs, and you have only $7$ legs!” A violet polyleg added ”-The dark-blue polyleg indeed has $8$ legs. But I have $9$ legs!” Then a stripped polyleg started ”None of you has $8$ legs. Only I have $8$ legs!” Which polyleg has exactly $8$ legs? [b][b]p4.[/b][/b] There is a small puncture (a point) in the wall (as shown in the figure below to the right). The housekeeper has a small flag of the following form (see the figure left). Show on the figure all the points of the wall where you can hammer in a nail such that if you hang the flag it will close up the puncture. [img]https://cdn.artofproblemsolving.com/attachments/a/f/8bb55a3fdfb0aff8e62bc4cf20a2d3436f5d90.png[/img] [b]p5.[/b] Assume $ a, b, c$ are odd integers. Show that the quadratic equation $ax^2 + bx + c = 0$ has no rational solutions. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].