Does there exists a base in which the numbers of the form: \[ 10101, 101010101, 1010101010101,\cdots \] are all prime numbers?

Let points $A, B$ and $C$ lie on the parabola $\Delta$ such that the point $H$, orthocenter of triangle $ABC$, coincides with the focus of parabola $\Delta$. Prove that by changing the position of points $A, B$ and $C$ on $\Delta$ so that the orthocenter remain at $H$, inradius of triangle $ABC$ remains unchanged. [i]Proposed by Mahdi Etesamifard[/i]

The trapezium ${ABCD}$, where ${AB}$ and ${CD}$ are parallel and ${AD < CD}$, is inscribed in the circle ${c}$. Let ${DP}$ be a chord of the circle, parallel to ${AC}$. Assume that the tangent to ${c}$ at ${D}$ meets the line ${AB}$ at ${E}$ and that ${PB}$ and ${DC}$ meet at ${Q}$. Show that ${EQ = AC}$.

Suppose $ \cos x \equal{} 0$ and $ \cos (x \plus{} z) \equal{} 1/2$. What is the smallest possible positive value of $ z$? $ \textbf{(A) } \frac {\pi}{6}\qquad \textbf{(B) } \frac {\pi}{3}\qquad \textbf{(C) } \frac {\pi}{2}\qquad \textbf{(D) } \frac {5\pi}{6}\qquad \textbf{(E) } \frac {7\pi}{6}$

Centuries ago, the pirate Captain Blackboard buried a vast amount of treasure in a single cell of a $2 \times 4$ grid-structured island. Treasure was buried in a single cell of an $M\times N$ ($2\le M$, $N$) grid. You and your crew have reached the island and have brought special treasure detectors to find the cell with the treasure For each detector, you can set it up to scan a specific subgrid $[a,b]\times[c,d]$ with $1\le a\le b\le 2$ and $1\le c\le d\le 4$. Running the detector will tell you whether the treasure is in the region or not, though it cannot say where in the region the treasure was detected. You plan on setting up $Q$ detectors, which may only be run simultaneously after all $Q$ detectors are ready. What is the minimum $Q$ required to gaurantee to determine the location of the Blackboard’s legendary treasure?

The set $N$ has been partitioned into two sets A and $B$. Show that for every $n \in N$ there exist distinct integers $a, b > n$ such that $a, b, a + b$ either all belong to $A$ or all belong to $B$.

Assume that $C$ is a convex subset of $\mathbb R^{d}$. Suppose that $C_{1},C_{2},\dots,C_{n}$ are translations of $C$ that $C_{i}\cap C\neq\emptyset$ but $C_{i}\cap C_{j}=\emptyset$. Prove that \[n\leq 3^{d}-1\] Prove that $3^{d}-1$ is the best bound. P.S. In the exam problem was given for $n=3$.

[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].

In the triangle $ABC , \angle A = \alpha, BC = a$. The inscribed circle touches the lines $AB$ and $AC$ at points $M$ and $P$. Find the length of the chord cut by the line $MP$ in a circle with diameter $BC$.

A sequence of integers, $\{a_{n}\}_{n \ge 1}$ with $a_{1}>0$, is defined by \[a_{n+1}=\frac{a_{n}}{2}\;\;\; \text{if}\;\; n \equiv 0 \;\; \pmod{4},\] \[a_{n+1}=3 a_{n}+1 \;\;\; \text{if}\;\; n \equiv 1 \; \pmod{4},\] \[a_{n+1}=2 a_{n}-1 \;\;\; \text{if}\;\; n \equiv 2 \; \pmod{4},\] \[a_{n+1}=\frac{a_{n}+1}{4}\;\;\; \text{if}\;\; n \equiv 3 \; \pmod{4}.\] Prove that there is an integer $m$ such that $a_{m}=1$.

The city of Bridge Village has some highways. Highways are closed curves that have intersections with each other or themselves in $4$-way crossroads. Mr.Bridge Lover, mayor of the city, wants to build a bridge on each crossroad in order to decrease the number of accidents. He wants to build the bridges in such a way that in each highway, cars pass above a bridge and under a bridge alternately. By knowing the number of highways determine that this action is possible or not. [i]Proposed by Erfan Salavati[/i]

Let $n > 1$ be a positive integer and $a_1, a_2, \dots, a_{2n} \in \{ -n, -n + 1, \dots, n - 1, n \}$. Suppose \[ a_1 + a_2 + a_3 + \dots + a_{2n} = n + 1 \] Prove that some of $a_1, a_2, \dots, a_{2n}$ have sum 0.

Let $a_1=0$, $a_2=1$, and $a_{n+2}=a_{n+1}+a_n$ for all positive integers $n$. Show that there exists an increasing infinite arithmetic progression of integers, which has no number in common in the sequence $\{a_n\}_{n \ge 0}$.

Let $A_1A_2A_3A_4A_5$ be a regular pentagon with side length 1. The sides of the pentagon are extended to form the 10-sided polygon shown in bold at right. Find the ratio of the area of quadrilateral $A_2A_5B_2B_5$ (shaded in the picture to the right) to the area of the entire 10-sided polygon. [asy] size(8cm); defaultpen(fontsize(10pt)); pair A_2=(-0.4382971011,5.15554989475), B_4=(-2.1182971011,-0.0149584477027), B_5=(-4.8365942022,8.3510997895), A_3=(0.6,8.3510997895), B_1=(2.28,13.521608132), A_4=(3.96,8.3510997895), B_2=(9.3965942022,8.3510997895), A_5=(4.9982971011,5.15554989475), B_3=(6.6782971011,-0.0149584477027), A_1=(2.28,3.18059144705); filldraw(A_2--A_5--B_2--B_5--cycle,rgb(.8,.8,.8)); draw(B_1--A_4^^A_4--B_2^^B_2--A_5^^A_5--B_3^^B_3--A_1^^A_1--B_4^^B_4--A_2^^A_2--B_5^^B_5--A_3^^A_3--B_1,linewidth(1.2)); draw(A_1--A_2--A_3--A_4--A_5--cycle); pair O = (A_1+A_2+A_3+A_4+A_5)/5; label("$A_1$",A_1, 2dir(A_1-O)); label("$A_2$",A_2, 2dir(A_2-O)); label("$A_3$",A_3, 2dir(A_3-O)); label("$A_4$",A_4, 2dir(A_4-O)); label("$A_5$",A_5, 2dir(A_5-O)); label("$B_1$",B_1, 2dir(B_1-O)); label("$B_2$",B_2, 2dir(B_2-O)); label("$B_3$",B_3, 2dir(B_3-O)); label("$B_4$",B_4, 2dir(B_4-O)); label("$B_5$",B_5, 2dir(B_5-O)); [/asy]

Compare the size of the definite integrals? \[ \int_0^{\frac {\pi}{4}} x^{2008}\tan ^{2008}x\ dx,\ \int_0^{\frac {\pi}{4}} x^{2009}\tan ^{2009}x\ dx,\ \int_0^{\frac {\pi}{4}} x^{2010}\tan ^{2010}x\ dx\]

Let $a, b$ be coprime positive integers. A positive integer $n$ is said to be [i]weak[/i] if there do not exist any nonnegative integers $x, y$ such that $ax+by=n$. Prove that if $n$ is a [i]weak[/i] integer and $n < \frac{ab}{6}$, then there exists an integer $k \geq 2$ such that $kn$ is [i]weak[/i].

Let $a,b,c $be positive real numbers.Prove that $\frac{8}{(a+b)^2 + 4abc} + \frac{8}{(b+c)^2 + 4abc} + \frac{8}{(a+c)^2 + 4abc} + a^2 + b^2 + c ^2 \ge \frac{8}{a+3} + \frac{8}{b+3} + \frac{8}{c+3}$.

Alice's favorite number has the following properties: [list] [*] It has 8 distinct digits. [*]The digits are decreasing when read from left to right. [*]It is divisible by 180.[/list] What is Alice's favorite number? [i]Author: Anderson Wang[/i]

Let $ABCD$ be a circumscribed quadrilateral (i. e. a quadrilateral which has an incircle). The exterior angle bisectors of the angles $DAB$ and $ABC$ intersect each other at $K$; the exterior angle bisectors of the angles $ABC$ and $BCD$ intersect each other at $L$; the exterior angle bisectors of the angles $BCD$ and $CDA$ intersect each other at $M$; the exterior angle bisectors of the angles $CDA$ and $DAB$ intersect each other at $N$. Let $K_{1}$, $L_{1}$, $M_{1}$ and $N_{1}$ be the orthocenters of the triangles $ABK$, $BCL$, $CDM$ and $DAN$, respectively. Show that the quadrilateral $K_{1}L_{1}M_{1}N_{1}$ is a parallelogram.

Let $c = \frac{2\pi}{11}.$ What is the value of $$\frac{\sin 3c \cdot \sin 6c \cdot \sin 9c \cdot \sin 12c \cdot \sin 15c}{\sin c \cdot \sin 2c \cdot \sin 3c \cdot \sin 4c \cdot \sin 5c}?$$ $\textbf{(A)}\ -1 \qquad\textbf{(B)}\ \frac{\sqrt{-11}}{5} \qquad\textbf{(C)}\ \frac{\sqrt{11}}{5} \qquad\textbf{(D)}\ \frac{10}{11} \qquad\textbf{(E)}\ 1$

Let $S$ be a set of $N \ge 3$ points in the plane. Assume that no $3$ points in $S$ are collinear. The segments with both endpoints in $S$ are colored in two colors. Prove that there is a set of $N - 1$ segments of the same color which don't intersect except in their endpoints such that no subset of them forms a polygon with positive area.

Let $\Pi$ be the set of rectangular parallelepipeds that have at least one edge of integer length. If a rectangular parallelepiped $P_0$ can be decomposed into parallelepipeds $P_1,P_2, . . . ,P_N\in \Pi$, prove that $P_0\in \Pi$.

$1399$ points and some chords between them is given. $a)$ In every step we can take two chords $RS,PQ$ with a common point other than $P,Q,R,S$ and erase [u]exactly one[/u] of $RS,PQ$ and draw $PS,PR,QS,QR$ let $s$ be the minimum of chords after some steps. Find the maximum of $s$ over all initial positions. $b)$ In every step we can take two chords $RS,PQ$ with a common point other than $P,Q,R,S$ and erase [u]both[/u] of $RS,PQ$ and draw $PS,PR,QS,QR$ let $s$ be the minimum of chords after some steps. Find the maximum of $s$ over all initial positions. [i]Proposed by Afrouz Jabalameli, Abolfazl Asadi[/i]

Let $\left\{ {{a}_{n}} \right\}_{n \geq 1}$ and $\left\{ {{b}_{n}} \right\}_{n \geq 1}$ be two infinite arithmetic progressions, each of which the first term and the difference are mutually prime natural numbers. It is known that for any natural $n$, at least one of the numbers $\left( a_n^2+a_{n+1}^2 \right)\left( b_n^2+b_{n+1}^2 \right) $ or $\left( a_n^2+b_n^2 \right) \left( a_{n+1}^2+b_{n+1}^2 \right)$ is an perfect square. Prove that ${{a}_{n}}={{b}_{n}}$, for any natural $n$ .

Quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$, both of which have real roots, are called friendly if for all $t \in [0,1]$ quadratic polynomial $tP(x)+(1-t)Q(x)$ also has real roots. a) Provide an example of quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$ and which have real roots, that are not friendly. b) Prove that for any two quadratic polynomials $P(x)$ and $Q(x)$ with leading coefficients $1$ that have real roots, there is a quadratic polynomial $R(x)$ which has a leading coefficient $1$ and which is friendly to both $P$ and $Q$