The number of sets of two or more consecutive positive integers whose sum is 100 is $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Given two positive integers $n$ and $k$, we say that $k$ is [i]$n$-ergetic[/i] if: However the elements of $M=\{1,2,\ldots, k\}$ are coloured in red and green, there exist $n$ not necessarily distinct integers of the same colour whose sum is again an element of $M$ of the same colour. For each positive integer $n$, determine the least $n$-ergetic integer, if it exists.

Eight pawns are placed on a chessboard, so that there is one in each row and column. Show that an even number of the pawns are on black squares.

The rectangle is cut into $10$ squares as shown in the figure on the right. Find its sides if the side of the smallest square is $3$.[img]https://cdn.artofproblemsolving.com/attachments/e/5/1fe3a0e41b2d3182338a557d3d44ff5ef9385d.png[/img]

Let $n$ be a positive integer, and let $x_1, x_2, \dots, x_n$ be distinct positive integers with $x_1 = 1$. Construct an $n \times 3$ table where the entries of the $k$-th row are $x_k, 2x_k, 3x_k$ for $k = 1, 2, \dots, n$. Now follow a procedure where, in each step, two identical entries are removed from the table. This continues until there are no more identical entries in the table. [list=a] [*] Prove that at least three entries remain at the end of the procedure. [*] Prove that there are infinitely many possible choices for $n$ and $x_1, x_2, \dots, x_n$ such that only three entries remain. [/list]

Define a quadratic trinomial to be "good", if it has two distinct real roots and all of its coefficients are distinct. Do there exist 10 positive integers such that there exist 500 good quadratic trinomials coefficients of which are among these numbers? [I]Proposed by F. Petrov[/i]

The game Battleship is played on a $10\times10$ grid. A [i]fleet[/i] consists of 10 ships: one occupying $4$ cells, two occupying $3$ cells each, three occupying $2$ cells each and four occupying $1$ cell each (see figure). [asy] size(10cm); // Function to draw a square centered at a given position void drawSquare(pair center, real sideLength) { real halfSide = sideLength / 2; draw(shift(center) * box((-halfSide, -halfSide), (halfSide, halfSide))); } // Side length of each square real sideLength = 1; // Coordinates for the squares pair[] positions = { // Top row remains the same (0, 0), (1, 0), (3, 0), (4, 0), (6, 0), (7, 0), (9, 0), (11, 0), (13, 0), (15, 0), // Bottom row moved one square (1 unit) to the right (2, 2), (3, 2), (4, 2), (5, 2), (7, 2), (8, 2), (9, 2), (11, 2), (12, 2), (13, 2) }; // Draw all squares for (pair pos : positions) { drawSquare(pos, sideLength); } [/asy] Ships can be placed either horizontally or vertically, but they must not touch each other, not even at a vertex. Is it possible to place two fleets on the same board according to these rules?

At least how many non-zero real numbers do we have to select such that every one of them can be written as a sum of $2019$ other selected numbers and a) the selected numbers are not necessarily different? b) the selected numbers are pairwise different?

Are there different mutually prime natural numbers $a$, $b$ and $c$, greater than $1$, such that $2a + 1$ is divisible by $b$, $2b + 1$ is divisible by $c$ and $2c + 1$ is divisible by $a$?

Let $ a,\ b,\ c$ be positive real numbers. Prove the following inequality. \[ \int_1^e \frac {x^{a \plus{} b \plus{} c \minus{} 1}[2(a \plus{} b \plus{} c) \plus{} (c \plus{} 2a)x^{a \minus{} b} \plus{} (a \plus{} 2b)x^{b \minus{} c} \plus{} (b \plus{} 2c)x^{c \minus{} a} \plus{}(2a \plus{} b)x^{a \minus{} c} \plus{} (2b \plus{} c)x^{b \minus{} a} \plus{} (2c \plus{} a)x^{c \minus{} b}]}{(x^a \plus{} x^b)(x^b \plus{} x^c)(x^c \plus{} x^a)}\geq a \plus{} b \plus{} c.\] I have just posted 500 th post. [color=blue]Thank you for your cooperations, mathLinkers and AOPS users.[/color] I will keep posting afterwards. Japanese Communities Modeartor kunny

Let $n \geq 4$ be a natural number. The polynomials $x^{n+1} + x$, $x^n$, and $x^{n-3}$ are written on the board. In one move, you can choose two polynomials $f(x)$ and $g(x)$ (not necessarily distinct) and add the polynomials $f(x)g(x)$, $f(x) + g(x)$, and $f(x) - g(x)$ to the board. Find all $n$ such that after a finite number of operations, the polynomial $x$ can be written on the board.

The state income tax where Kristin lives is levied at the rate of $ p \%$ of the first $ \$28000$ of annual income plus $ (p \plus{} 2) \%$ of any amount above $ \$28000$. Kristin noticed that the state income tax she paid amounted to $ (p \plus{} 0.25) \%$ of her annual income. What was her annual income? $ \textbf{(A)} \ \$28000 \qquad \textbf{(B)} \ \$32000 \qquad \textbf{(C)} \ \$35000 \qquad \textbf{(D)} \ \$42000 \qquad \textbf{(E)} \ \$56000$

Let $ \mathcal P$ be a parabola, and let $ V_1$ and $ F_1$ be its vertex and focus, respectively. Let $ A$ and $ B$ be points on $ \mathcal P$ so that $ \angle AV_1 B \equal{} 90^\circ$. Let $ \mathcal Q$ be the locus of the midpoint of $ AB$. It turns out that $ \mathcal Q$ is also a parabola, and let $ V_2$ and $ F_2$ denote its vertex and focus, respectively. Determine the ratio $ F_1F_2/V_1V_2$.

Given is an obtuse isosceles triangle $ABC$ with $CA=CB$ and circumcenter $O$. The point $P$ on $AB$ is such that $AP<\frac{AB} {2}$ and $Q$ on $AB$ is such that $BQ=AP$. The circle with diameter $CQ$ meets $(ABC)$ at $E$ and the lines $CE, AB$ meet at $F$. If $N$ is the midpoint of $CP$ and $ON, AB$ meet at $D$, show that $ODCF$ is cyclic.

On a board 12 × 12 are placed some knights in such a way that in each 2 × 2 square there is at least one knight. Find the maximum number of squares that are not attacked by knights. (A knight does not attack the square in which it is located.)

Find all injective functions$f:\mathbb{Z}\to \mathbb{Z}$ that satisfy: $\left| f\left( x \right)-f\left( y \right) \right|\le \left| x-y \right|$ ,for any $x,y\in \mathbb{Z}$.

Let $ABC$ be a right triangle with a right angle in $C$ and a circumcenter $U$. On the sides $AC$ and $BC$, the points $D$ and $E$ lie in such a way that $\angle EUD = 90 ^o$. Let $F$ and $G$ be the projection of $D$ and $E$ on $AB$, respectively. Prove that $FG$ is half as long as $AB$. (Walther Janous)

Each of $N$ people have chosen some $5$ elements from a $23$-element set so that any two people share at most $3$ chosen elements. Does this mean that $N \le 2020$? Answer the same question with $25$ instead of $23$.

The sequence of positive integers $a_1,a_2,a_3,\dots$ is [i]brazilian[/i] if $a_1=1$ and $a_n$ is the least integer greater than $a_{n-1}$ and $a_n$ is [b]coprime[/b] with at least half elements of the set $\{a_1,a_2,\dots, a_{n-1}\}$. Is there any odd number which does [b]not[/b] belong to the brazilian sequence?

For any positive integer $x$, we set $$ g(x) = \text{ largest odd divisor of } x, $$ $$ f(x) = \begin{cases} \frac{x}{2} + \frac{x}{g(x)} & \text{ if } x \text{ is even;} \\ 2^{\frac{x+1}{2}} & \text{ if } x \text{ is odd.} \end{cases} $$ Consider the sequence $(x_n)_{n \in \mathbb{N}}$ defined by $x_1 = 1$, $x_{n + 1} = f(x_n)$. Show that the integer $2018$ appears in this sequence, determine the least integer $n$ such that $x_n = 2018$, and determine whether $n$ is unique or not.

How many different compounds have the formula $\text{C}_3\text{H}_8\text{O}$? $ \textbf{(A)}\ \text{one} \qquad\textbf{(B)}\ \text{two}\qquad\textbf{(C)}\ \text{three} \qquad\textbf{(D)}\ \text{four} \qquad$

Find all functions $f:\mathbb{Z}^+\rightarrow \mathbb{Z}^+$ satisfying $$m!!+n!!\mid f(m)!!+f(n)!!$$for each $m,n\in \mathbb{Z}^+$, where $n!!=(n!)!$ for all $n\in \mathbb{Z}^+$. [i]Proposed by DVDthe1st[/i]

Let $AK$ and $AT$ be the bisector and the median of an acute-angled triangle $ABC$ with $AC > AB$. The line $AT$ meets the circumcircle of $ABC$ at point $D$. Point $F$ is the reflection of $K$ about $T$. If the angles of $ABC$ are known, find the value of angle $FDA$.

A closed self-intersecting broken line intersects each of its segments once. Prove that the number of its segments is even.

Given a cube with edge $ AB = a $ cm. Point $ M $ of segment $ AB $ is distant from the diagonal of the cube, which is oblique to $ AB $, by $ k $ cm. Find the distance of point $ M $ from the midpoint $ S $ of segment $ AB $.