Consider the equation $ax^{2}+by^{2}=1$, where $a,b$ are fixed rational numbers. Prove that either such an equation has no solutions in rational numbers, or it has infinitely many solutions.

Given a sequence $s$ consisting of digits $0$ and $1$. For any positive integer $k$, define $v_k$ the maximum number of ways in any sequence of length $k$ that several consecutive digits can be identified, forming the sequence $s$. (For example, if $s=0110$, then $v_7=v_8=2$, because in sequences $0110110$ and $01101100$ one can find consecutive digits $0110$ in two places, and three pairs of $0110$ cannot meet in a sequence of length $7$ or $8$.) It is known that $v_n<v_{n+1}<v_{n+2}$ for some positive integer $n$. Prove that in the sequence $s$, all the numbers are the same. [i]A. Golovanov[/i]

Point $D$ is an arbitary point on side $BC$ of triangle $ABC$. $I$,$I_1$ and$I_2$ are the incenters of triangles $ABC$,$ABD$ and $ACD$ respectively. $M\not=A$ and $N\not=A$ are the intersections of circumcircle of triangle $ABC$ and circumcircles of triangles $IAI_1$ and $IAI_2$ respectively. Prove that regardless of point $D$, line $MN$ goes through a fixed point.

A function $f : R -\{0\} \to R$ has the following properties: (i) $f(x)- f(y) = f(x)f\left(\frac{1}{y}\right)- f(y)f\left(\frac{1}{x}\right)$ for all $x,y \ne 0$, (ii) $f$ takes the value $\frac12$ at least once. Determine $f(-1)$. Prove that $f$ is a periodic function

We call a number [i]pal[/i] if it doesn't have a zero digit and the sum of the squares of the digits is a perfect square. For example, $122$ and $34$ are pal but $304$ and $12$ are not pal. Prove that there exists a pal number with $n$ digits, $n > 1$.

Let $ABC$ be an acute scalene triangle with incenter $I$, and let $M$ be the circumcenter of triangle $BIC$. Points $D$, $B'$, and $C'$ lie on side $BC$ so that $ \angle BIB' = \angle CIC' = \angle IDB = \angle IDC = 90^{\circ} $. Define $P = \overline{AB} \cap \overline{MC'}$, $Q = \overline{AC} \cap \overline{MB'}$, $S = \overline{MD} \cap \overline{PQ}$, and $K = \overline{SI} \cap \overline{DF}$, where segment $EF$ is a diameter of the incircle selected so that $S$ lies in the interior of segment $AE$. It is known that $KI=15x$, $SI=20x+15$, $BC=20x^{5/2}$, and $DI=20x^{3/2}$, where $x = \tfrac ab(n+\sqrt p)$ for some positive integers $a$, $b$, $n$, $p$, with $p$ prime and $\gcd(a,b)=1$. Compute $a+b+n+p$. [i]Proposed by Evan Chen[/i]

If $x$ is a positive rational number show that $x$ can be uniquely expressed in the form $x = \sum^n_{k=1} \frac{a_k}{k!}$ where $a_1, a_2, \ldots$ are integers, $0 \leq a_n \leq n - 1$, for $n > 1,$ and the series terminates. Show that $x$ can be expressed as the sum of reciprocals of different integers, each of which is greater than $10^6.$

Let $a_1 < a_2 < ... < a_n$ be a sequence of natural numbers such that for $i < j$ the decimal representation of $a_i$ does not occur as the leftmost digits of the decimal representation of $a_j$ . (For example, $137$ and $13729$ cannot both occur in the sequence.) Prove that $\sum_{i=1}^n \frac{1}{a_i} \le 1+\frac12 +\frac13 +...+\frac19$ .

Ben Y's favorite number $p$ is prime, and his second favorite number is some integer $n$. Given that $p$ divides $n$ and $n$ divides $3p+91$, find the maximum possible value of $n$.

Let $m,n$ be positive integers such that the equation (in respect of $x$) \[(x+m)(x+n)=x+m+n\] has at least one integer root. Prove that $\frac{1}{2}n<m<2n$.

[b]p1.[/b] If $P$ is a (convex) polygon, a triangulation of $P$ is a set of line segments joining pairs of corners of $P$ in such a way that $P$ is divided into non-overlapping triangles, each of which has its corners at corners of $P$. For example, the following are different triangulations of a square. (a) Prove that if $P$ is an $n$-gon with $n > 3$, then every triangulation of $P$ produces at least two triangles $T_1$, $T_2$ such that two of the sides of $T_i$, $i = 1$ or $2$ are also sides of $P$. (b) Find the number of different possible triangulations of a regular hexagon. [img]https://cdn.artofproblemsolving.com/attachments/9/d/0f760b0869fafc882f293846c05d182109fb78.png[/img] [b]p2.[/b] There are $n$ students, $n \ge 2$, and $n + 1$ cubical cakes of volume $1$. They have the use of a knife. In order to divide the cakes equitably they make cuts with the knife. Each cut divides a cake (or a piece of a cake) into two pieces. (a) Show that it is possible to provide each student with a volume $(n + 1)/n$ of a cake while making no more than $n - 1$ cuts. (b) Show that for each integer $k$ with $2 \le k \le n$ it is possible to make $n - 1$ cuts in such a way that exactly $k$ of the $n$ students receive an entire (uncut) cake in their portion. [b]p3. [/b]The vertical lines at $x = 0$, $x = \frac12$ , $x = 1$, $x = \frac32$ ,$...$ and the horizontal lines at $y = 0$, $y = \frac12$ , $y = 1$, $y = \frac32$ ,$ ...$ subdivide the first quadrant of the plane into $\frac12 \times \frac12$ square regions. Color these regions in a checkerboard fashion starting with a black region near the origin and alternating black and white both horizontally and vertically. (a) Let $T$ be a rectangle in the first quadrant with sides parallel to the axes. If the width of $T$ is an integer, prove that $T$ has equal areas of black and white. Note that a similar argument works to show that if the height of $T$ is an integer, then $T$ has equal areas of black and white. (b) Let $R$ be a rectangle with vertices at $(0, 0)$, $(a, 0)$, $(a, b)$, and $(0, b)$ with $a$ and $b$ positive. If $R$ has equal areas of black and white, prove that either $a$ is an integer or that $b$ is an integer. (c) Suppose a rectangle $R$ is tiled by a finite number of rectangular tiles. That is, the rectangular tiles completely cover $R$ but intersect only along their edges. If each of the tiles has at least one integer side, prove that $R$ has at least one integer side. [b]p4.[/b] Call a number [i]simple [/i] if it can be expressed as a product of single-digit numbers (in base ten). (a) Find two simple numbers whose sum is $2014$ or prove that no such numbers exist. (b) Find a simple number whose last two digits are $37$ or prove that no such number exists. [b]p5.[/b] Consider triangles for which the angles $\alpha$, $\beta$, and $\gamma$ form an arithmetic progression. Let $a, b, c$ denote the lengths of the sides opposite $\alpha$, $\beta$, $\gamma$ , respectively. Show that for all such triangles, $$\frac{a}{c}\sin 2\gamma +\frac{c}{a} \sin 2\alpha$$ has the same value, and determine an algebraic expression for this value. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$A, B, C, D$ are consecutive vertices of a regular $7$-gon. $AL$ and $AM$ are tangents to the circle center $C$ radius $CB$. $N$ is the intersection point of $AC$ and $BD$. Show that $L, M, N$ are collinear.

We call natural number $m$ [b]ziba[/b], iff every natural number $n$ with the condition $1\le n\le m$ can be shown as sum of [some of] positive and [u]distinct[/u] divisors of $m$. Prove that infinitely ziba numbers in the form of $(k\in\mathbb{N})k^2+k+2022$ exist.

Five people form several commissions to prepare a competition. Here any commission must be nonempty and any two commissions cannot contain the same members. Moreover, any two commissions have at least one common member. There are already $14$ commissions. Prove that at least one additional commission can be formed.

Let $x,y$ be positive real numbers .Find the minimum of $x+y+\frac{|x-1|}{y}+\frac{|y-1|}{x}$.

A convex polygon is given, no two of whose sides are parallel. For each side we consider the angle the side subtends at the vertex farthest from the side. Show that the sum of these angles equals $180^\circ$. [i]M. Smurov[/i]