Let $x_1$ and $x_2$ be roots of the equation $x^2 - 6x + 1 = 0$. Prove that for any integer $n \ge 1$ the number $x_1^n + x_2^n$ is integer and is not divisible by $5$.

Let $n$ be a natural number. We have $n$ colors. Each of the numbers $1, 2, 3,... , 1000$ was colored with one of the $n$ colors. It is known that, for any two distinct numbers, if one divides the other then these two numbers have different colors. Determine the smallest possible value of $n$.

In triangle $\triangle ABC$, $BC>AC$, $I_B$ is the $B$-excenter, the line through $C$ parallel to $AB$ meets $BI_B$ at $F$. $M$ is the midpoint of $AI_B$ and the $A$-excircle touches side $AB$ at $D$. Point $E$ satisfies $\angle BAC=\angle BDE, DE=BC$, and lies on the same side as $C$ of $AB$. Let $EC$ intersect $AB,FM$ at $P,Q$ respectively. Prove that $P,A,M,Q$ are concyclic.

Given a regular nonagon $A_1A_2A_3A_4A_5A_6A_7A_8A_9$ with side length $1$. Diagonals $A_3A_7$ and $A_4A_8$ intersect at point $P$. Find the length of segment $P A_1$.

Let $T$ be the triangle in the coordinate plane with vertices $\left(0,0\right)$, $\left(4,0\right)$, and $\left(0,3\right)$. Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}$, $180^{\circ}$, and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.) $\textbf{(A) } 12\qquad\textbf{(B) } 15\qquad\textbf{(C) }17 \qquad\textbf{(D) }20 \qquad\textbf{(E) }25$

[b]p1.[/b] Prove that no matter what digits are placed in the four empty boxes, the eight-digit number $9999\Box\Box\Box\Box$ is not a perfect square. [b]p2.[/b] Prove that the number $m/3+m^2/2+m^3/6$ is integral for all integral values of $m$. [b]p3.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor? [b]p4.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.) [img]https://cdn.artofproblemsolving.com/attachments/4/b/ca707bf274ed54c1b22c4f65d3d0b0a5cfdc56.png[/img] [b]p5.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $7$ rocks in the first pile and $9$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p6.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits. $\begin{tabular}{ccccc} & & & a & b \\ * & & & c & d \\ \hline & & c & e & f \\ + & & a & b & \\ \hline & c & f & d & f \\ \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Anne multiplies each two-digit number by $588$ in turn, and writes down the so-obtained products. How many perfect squares does she write down?

If $0<\alpha<\beta<\gamma<2\pi$, for all $x\in\mathbb{R}$, $\cos(x+\alpha)+\cos(x+\beta)+\cos(x+\gamma)=0$, then $\gamma-\alpha=$________.

In a magical swamp there are two species of talking amphibians: toads, whose statements are always true, and frogs, whose statements are always false. Four amphibians, Brian, Chris, LeRoy, and Mike live together in the swamp, and they make the following statements: Brian: "Mike and I are different species." Chris: "LeRoy is a frog." LeRoy: "Chris is a frog." Mike: "Of the four of us, at least two are toads." How many of these amphibians are frogs? $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ 4$

Starting at a vertex $x_0$, we walk over the edges of a connected graph $G$ according to the following rules: 1. We never walk the same edge twice in the same direction. 2. Once we reach a vertex $x \ne x_0$, never visited before, we mark the edge by which we come to $x$. We can use this marked edge to leave vertex $x$ only if we already have traversed, in both directions, all other edges incident to $x$. Show that, regardless of the path followed, we will always be stuck at $x_0$ and that all other edges will have been traveled in both directions.

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}^{\ast}$ be a strictly increasing function. Prove that: [list=a] [*]There exists a decreasing sequence of positive real numbers, $(y_{n})_{n\in\mathbb{N}}$, converging to $0$, such that $y_{n}\leq2y_{f(n)}$, for all $n\in\mathbb{N}$. [*]If $(x_{n})_{n\in\mathbb{N}}$ is a decreasing sequence of real numbers, converging to $0$, then there exists a decreasing sequence of real numbers $(y_{n})_{n\in\mathbb{N}}$, converging to $0$, such that $x_{n}\leq y_{n} \leq2y_{f(n)}$, for all $n\in\mathbb{N}$.[/list]

For the given triangle $ABC$, prove that a point $X$ on the side $AB$ satisfies the condition $\overrightarrow{XA} \cdot\overrightarrow{XB} +\overrightarrow{XC} \cdot \overrightarrow{XC} = \overrightarrow{CA} \cdot \overrightarrow{CB} $, iff $X$ is the basepoint of the altitude or median of the triangle $ABC$.

Botvid left home between $4$ and $5$ for a short visit to Amanda. When he came back between $5$ and $6$, he found that the hands of the clock had changed places. What time was it?

Prove that:$a+b+c+d \geq \frac{2}{3}(ab+bc+ca+ad+ac+bd)$ where $a;b;c;d$ are positive real numbers satisfying $2(ab+bc+cd+da+ac+bd)+abc+bcd+cda+dab=16$

You are tossing an unbiased coin. The last $ 28 $ consecutive flips have all resulted in heads. Let $ x $ be the expected number of additional tosses you must make before you get $ 60 $ consecutive heads. Find the sum of all distinct prime factors in $ x $.

Let $A$ and $B$ be positive integers. Define the arithmetic sequence $a_0, a_1, a_2, ...$ by $a_n = A_n + B$. Suppose that there exists an $n\ge 0$ such that $a_n$ is a square. Let $M$ be a positive integer such that $M^2$ is the smallest square in the sequence. Prove that $M < A +\sqrt{B}$.

Let $A$ and $B$ be points on a circle $\mathcal{C}$ with center $O$ such that $\angle AOB = \dfrac {\pi}2$. Circles $\mathcal{C}_1$ and $\mathcal{C}_2$ are internally tangent to $\mathcal{C}$ at $A$ and $B$ respectively and are also externally tangent to one another. The circle $\mathcal{C}_3$ lies in the interior of $\angle AOB$ and it is tangent externally to $\mathcal{C}_1$, $\mathcal{C}_2$ at $P$ and $R$ and internally tangent to $\mathcal{C}$ at $S$. Evaluate the value of $\angle PSR$.

We define the sets $A_1,A_2,...,A_{160}$ such that $\left|A_{i} \right|=i$ for all $i=1,2,...,160$. With the elements of these sets we create new sets $M_1,M_2,...M_n$ by the following procedure: in the first step we choose some of the sets $A_1,A_2,...,A_{160}$ and we remove from each of them the same number of elements. These elements that we removed are the elements of $M_1$. In the second step we repeat the same procedure in the sets that came of the implementation of the first step and so we define $M_2$. We continue similarly until there are no more elements in $A_1,A_2,...,A_{160}$, thus defining the sets $M_1,M_2,...,M_n$. Find the minimum value of $n$.

A circle center $O$ is inscribed in the quadrilateral $ABCD$. $AB$ is parallel to and longer than $CD$ and has midpoint $M$. The line $OM$ meets $CD$ at $F$. $CD$ touches the circle at $E$. Show that $DE = CF$ iff $AB = 2CD$.

If you have an algorithm for finding all the real zeros of any cubic polynomial, how do you find the real solutions to $x = p(y), y = p(x)$, where $p$ is a cubic polynomial?

Let $a{}$ and $b{}$ be positive integers. Prove that for any real number $x{}$ \[\sum_{j=0}^a\binom{a}{j}\big(2\cos((2j-a)x)\big)^b=\sum_{j=0}^b\binom{b}{j}\big(2\cos((2j-b)x)\big)^a.\]

Let $\triangle ABC$ be an acute angle triangle and $\omega$ be its circumcircle. Let $N$ be a point on arc $AC$ not containing $B$ and $S$ be a point on line $AB$. The line tangent to $\omega$ at $N$ intersects $BC$ at $T$, $NS$ intersects $\omega$ at $K$. Assume that $\angle NTC = \angle KSB$. Prove that $CK\parallel AN \parallel TS$.

Denote by $\mathbb{Q}^+$ the set of all positive rational numbers. Determine all functions $f : \mathbb{Q}^+ \mapsto \mathbb{Q}^+$ which satisfy the following equation for all $x, y \in \mathbb{Q}^+:$ \[f\left( f(x)^2y \right) = x^3 f(xy).\] [i]Proposed by Thomas Huber, Switzerland[/i]

Sixteen squares of an $8\times 8$ chessboard are chosen so that there are exactly lwo in each row and two in each column. Prove that eight white pawns and eight black pawns can be placed on these sixteen squares so that there is one white pawn and one black pawn in each row and in cach colunm.

A rectangle of dimensions $2024 \times 2023$ is filled with pieces of the following types: [asy] size(200); // Figure (A) draw((0,0)--(4,0)--(4,1)--(0,1)--cycle); draw((1,0)--(1,1)); draw((2,0)--(2,1)); draw((3,0)--(3,1)); // Figure (B) draw((6,0)--(8,0)--(8,2)--(6,2)--cycle); draw((7,0)--(7,2)); draw((6,1)--(8,1)); // Figure (C) draw((10,0)--(12,0)--(12,1)--(11,1)--(11,2)--(9,2)--(9,1)--(10,1)--cycle); draw((10,0)--(10,1)); draw((11,0)--(11,1)); draw((10,1)--(11,1)); draw((9,1)--(9,2)); draw((10,1)--(10,2)); draw((11,0)--(12,0)); draw((10,1)--(12,1)); // Labeling label("(A)", (2, -0.5)); label("(B)", (7, -0.5)); label("(C)", (10.5, -0.5)); [/asy] Each piece can be turned arround, and each square has side length $1$. Is it possible to use exactly 2023 pieces of type $(A)$?