For a real number $ x$ is $ [x]$ the next smaller integer to $ x$, that is the integer $ g$ with $ g\leqq<g+1$, and $ \{x\}=x-[x]$ is the “decimal part” of $ x$. Determine all triples $ (a,b,c)$ of real numbers, which fulfil the following system of equations: \[ \{a\}+[b]+\{c\}=2,9\]\[ \{b\}+[c]+\{a\}=5,3\]\[\{c\}+[a]+\{b\}=4,0\]

Call a number $n$ [i]good[/i] if it can be expressed as $2^x+y^2$ for where $x$ and $y$ are nonnegative integers. (a) Prove that there exist infinitely many sets of $4$ consecutive good numbers. (b) Find all sets of $5$ consecutive good numbers. [i]Proposed by Michael Ma[/i]

The square of an integer is called a [i]perfect square[/i]. If $x$ is a perfect square, the next larger perfect square is $\textbf{(A) }x+1\qquad\textbf{(B) }x^2+1\qquad\textbf{(C) }x^2+2x+1\qquad\textbf{(D) }x^2+x\qquad\textbf{(E) }x+2\sqrt{x}+1$

Determine all positive integers $n$ such that the following statement holds: If a convex polygon with with $2n$ sides $A_1 A_2 \ldots A_{2n}$ is inscribed in a circle and $n-1$ of its $n$ pairs of opposite sides are parallel, which means if the pairs of opposite sides \[(A_1 A_2, A_{n+1} A_{n+2}), (A_2 A_3, A_{n+2} A_{n+3}), \ldots , (A_{n-1} A_n, A_{2n-1} A_{2n})\] are parallel, then the sides \[ A_n A_{n+1}, A_{2n} A_1\] are parallel as well.

The price of 6 roses and 3 carnations is higher than 24 [i]yuan[/i], while the price of 4 roses and 5 carnations is lower than 22 [i]yuan[/i]. Compare the price of 2 roses and 3 carnations, the result is $\text{(A)}$ The price of 2 roses is higher. $\text{(B)}$ The price of 3 carnations is higher. $\text{(C)}$ Their prices are the same. $\text{(D)}$ Unknown.

In right triangle $ABC$, $\angle ACB = 90^{\circ}$ and $\tan A > \sqrt{2}$. $M$ is the midpoint of $AB$, $P$ is the foot of the altitude from $C$, and $N$ is the midpoint of $CP$. Line $AB$ meets the circumcircle of $CNB$ again at $Q$. $R$ lies on line $BC$ such that $QR$ and $CP$ are parallel, $S$ lies on ray $CA$ past $A$ such that $BR = RS$, and $V$ lies on segment $SP$ such that $AV = VP$. Line $SP$ meets the circumcircle of $CPB$ again at $T$. $W$ lies on ray $VA$ past $A$ such that $2AW = ST$, and $O$ is the circumcenter of $SPM$. Prove that lines $OM$ and $BW$ are perpendicular.

Robin has obtained a circular pizza with radius $2$. However, being rebellious, instead of slicing the pizza radially, he decides to slice the pizza into $4$ strips of equal width both vertically and horizontally. What is the area of the smallest piece of pizza?

Let $ f$ be a function defined on $ \text{N}_0 \equal{} \{ 0,1,2,3,...\}$ and with values in $ \text{N}_0$, such that for $ n,m \in \text{N}_0$ and $ m \leq 9, f(10n \plus{} m) \equal{} f(n) \plus{} 11m$ and $ f(0) \equal{} 0.$ How many solutions are there to the equation $ f(x) \equal{} 1995$? A. None B. 1 C. 2 D. 11 E. Infinitely many

Let's consider all possible quadratic trinomials of the form $x^2 + ax + b$, where $a$ and $b$ are positive integers not exceeding some positive integer $N$. Prove that the number of pairs of such trinomials having a common root does not exceed $N^2$.

Let $z_1$, $z_2$, $z_3$, $\cdots$, $z_{2021}$ be the roots of the polynomial $z^{2021}+z-1$. Evaluate $$\frac{z_1^3}{z_{1}+1}+\frac{z_2^3}{z_{2}+1}+\frac{z_3^3}{z_{3}+1}+\cdots+\frac{z_{2021}^3}{z_{2021}+1}.$$

Kelvin and Quinn are collecting trading cards; there are $6$ distinct cards that could appear in a pack. Each pack contains exactly one card, and each card is equally likely. Kelvin buys packs until he has at least one copy of every card, and then he stops buying packs. If Quinn is missing exactly one card, the probability that Kelvin has at least two copies of the card Quinn is missing is expressible as $\tfrac{m}{n}$ for coprime positive integers $m$ and $n$. Determine $m+n$.

In every cell of a $ 60 \times 60$ board is written a real number, whose absolute value is less or equal than $ 1$. The sum of all numbers on the board equals $ 600$. Prove that there is a $ 12 \times 12$ square in the board such that the absolute value of the sum of all numbers on it is less or equal than $ 24$.

The real numbers $a$, $b$ and $c$ verify that the polynomial $p(x)=x^4+ax^3+bx^2+ax+c$ has exactly three distinct real roots; these roots are equal to $\tan y$, $\tan 2y$ and $\tan 3y$, for some real number $y$. Find all possible values of $y$, $0\leq y < \pi$.

Let $ABC$ be an acute triangle with incenter $I$ and circumcenter $O$. Assume that $\angle OIA = 90^{\circ}$. Given that $AI = 97$ and $BC = 144$, compute the area of $\triangle ABC$.

In triangle $ABC$, let $\omega$ be the excircle opposite to $A$. Let $D, E$ and $F$ be the points where $\omega$ is tangent to $BC, CA$, and $AB$, respectively. The circle $AEF$ intersects line $BC$ at $P$ and $Q$. Let $M$ be the midpoint of $AD$. Prove that the circle $MPQ$ is tangent to $\omega$.

There are $14$ players participating at a chess tournament, each playing one game with every other player. After the end of the tournament, the players were ranked in descending order based on their points. The sum of the points of the first three players is equal with the sum of the points of the last nine players. What is the highest possible number of draws in the tournament.(For a victory the player gets $1$ point, for a loss $0$ points, in a draw both players get $0,5$ points.)

A square-shaped pizza with side length $30$ cm is cut into pieces (not necessarily rectangular). All cuts are parallel to the sides, and the total length of the cuts is $240$ cm. Show that there is a piece whose area is at least $36$ cm$^2$

As part of his effort to take over the world, Edward starts producing his own currency. As part of an effort to stop Edward, Alex works in the mint and produces $1$ counterfeit coin for every $99$ real ones. Alex isn't very good at this, so none of the counterfeit coins are the right weight. Since the mint is not perfect, each coin is weighed before leaving. If the coin is not the right weight, then it is sent to a lab for testing. The scale is accurate $95\%$ of the time, $5\%$ of all the coins minted are sent to the lab, and the lab's test is accurate $90\%$ of the time. If the lab says a coin is counterfeit, what is the probability that it really is?

If you roll four standard, fair six-sided dice, the top faces of the dice can show just one value (for example, $3333$), two values (for example, $2666$), three values (for example, $5215$), or four values (for example, $4236$). The mean number of values that show is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Compute the number of positive four-digit multiples of $11$ whose sum of digits (in base ten) is divisible by $11$.

Given a polygon with $n$ sides, we assign the numbers $0,1,...,n-1$ to the vertices, and to each side is assigned the sum of the numbers assigned to its ends. The figure shows an example for $n = 5$. Notice that the numbers assigned to the sides are still in arithmetic progression. [img]https://cdn.artofproblemsolving.com/attachments/c/0/975969e29a7953dcb3e440884461169557f9a7.png[/img] $\bullet$ Make the respective assignment for a $9$-sided polygon, and generalize for odd $n$. $\bullet$ Prove that this is not possible if $n$ is even.

Given a triangle $ABC$ with symmedians $AD,BE,CF$ concurrent at [i]Lemoine[/i] point $L(D,E,F$ are on the sides $BC,CA,AB,$ respectively$).$ Prove that: $LA+LB+LC\ge 2(LD+LE+LF).$

Let $x_0, x_1, \ldots$ be a sequence of real numbers such that $x_n = \frac{1 + x_{n -1}}{x_{n - 2}}$ for $n \geq 2$. Find the number of ordered pairs of positive integers $(x_0, x_1)$ such that the sequence gives $x_{2018} = \frac{1}{1000}$.

Given an endless supply of white, blue and red cubes. In a circle arrange any $N$ of them. The robot, standing in any place of the circle, goes clockwise and, until one cube remains, constantly repeats this operation: destroys the two closest cubes in front of him and puts a new one behind him a cube of the same color if the destroyed ones are the same, and the third color if the destroyed two are different colors. We will call the arrangement of the cubes [i]good [/i] if the color of the cube remaining at the very end does not depends on where the robot started. We call $N$ [i]successful [/i] if for any choice of $N$ cubes all their arrangements are good. Find all successful $N$. I. Bogdanov

We consider the nonzero matrices $A_0, A_1, \ldots, A_n \in \mathcal{M}_2(\mathbb{R}),$ $n \ge 2,$ with the properties: $A_0 \neq aI_2$ for any $a \in \mathbb{R}$ and $A_0A_k=A_kA_0$ for $k= \overline{1,n}.$ Prove that a) $\det \left(\sum\limits_{k=1}^n A_k^2 \right) \ge 0$; b) If $\det \left(\sum\limits_{k=1}^n A_k^2 \right) = 0$ and $A_2 \ne aA_1$ for any $a \in \mathbb{R},$ then $\sum\limits_{k=1}^n A_k^2=O_2.$