The sequence $a_1,a_2,\dots$ of positive integers obeys the following two conditions: [list] [*] For all positive integers $m,n$, it happens that $a_m\cdot a_n=a_{mn}$ [*] There exist infinite positive integers $n$ such that $(a_1,a_2,\dots,a_n)$ is a permutation of $(1,2,\dots,n)$ [/list] Prove that $a_n=n$ for all positive integers $n$. [i]Proposed by José Alejandro Reyes González[/i]

For each $r\in\mathbb{R}$ let $T_r$ be the transformation of the plane that takes the point $(x, y)$ into the point $(2^r x; r2^r x+2^r y)$. Let $F$ be the family of all such transformations (i.e. $F = \{T_r : r\in\mathbb{R}\}$). Find all curves $y = f(x)$ whose graphs remain unchanged by every transformation in $F$.

Let $ a,b,c,d$ be four distinct positive integers in arithmetic progression. Prove that $ abcd$ is not a perfect square.

Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$

It is known that $2018(2019^{39}+2019^{37}+...+2019)+1$ is prime. How many positive factors does $2019^{41}+1$ have?

Let $P(X) = a_n X^n + a_{n-1} X^{n-1} + \cdots + a_1 X + a_0$ be a polynomial with real coefficients such that $0 \leqslant a_i \leqslant a_0$ for $i = 1, 2, \ldots, n$. Prove that, if $P(X)^2 = b_{2n} X^{2n} + b_{2n-1} X^{2n-1} + \cdots + b_{n+1} X^{n+1} + \cdots + b_1 X + b_0$, then $4 b_{n+1} \leqslant P(1)^2$.

The remainder on dividing the polynomial $p(x)$ by $x^2 - (a+b)x + ab$ (where $a \not = b$) is $mx + n$. Find the coefficients $m, n$ in terms of $a, b$. Find $m, n$ for the case $p(x) = x^{200}$ divided by $x^2 - x - 2$ and show that they are integral.

Find all values of the parameter $a$ for which there are exactly $1998$ integers $x$ satisfying the inequality $$x^2 -\pi x +a < 0.$$

Maximum value of $\sin^4\theta +\cos^6\theta $ will be ? [list=1] [*] $\frac{1}{2\sqrt{2}}$ [*] $\frac{1}{2}$ [*] $\frac{1}{\sqrt{2}}$ [*] 1 [/list]

For three sequences $(x_n),(y_n),(z_n)$ with positive starting elements $x_1,y_1,z_1$ we have the following formulae: \[ x_{n+1} = y_n + \frac{1}{z_n} \quad y_{n+1} = z_n + \frac{1}{x_n} \quad z_{n+1} = x_n + \frac{1}{y_n} \quad (n = 1,2,3, \ldots)\] a.) Prove that none of the three sequences is bounded from above. b.) At least one of the numbers $x_{200},y_{200},z_{200}$ is greater than 20.

Find the sum of the four least positive integers each of whose digits add to $12$.

Which triangles satisfy the equation $\frac{c^2-a^2}{b}+\frac{b^2-c^2}{a}=b-a$ when $a, b$ and $c$ are sides of a triangle?

It is known that, having $6$ weighs, it is possible to balance the scales with loads, which weights are successing natural numbers from $1$ to $63$. Find all such sets of weighs.

Let $k$ be a positive even integer. Show that $$\sum_{n=0}^{k/2}(-1)^n\binom{k+2}n\binom{2(k-n)+1}{k+1}=\frac{(k+1)(k+2)}2.$$

Show that \[\cos(56^{\circ}) \cdot \cos(2 \cdot 56^{\circ}) \cdot \cos(2^2\cdot 56^{\circ})\cdot . . . \cdot \cos(2^{23}\cdot 56^{\circ}) = \frac{1}{2^{24}} .\]

Two cyclists leave simultaneously a point $P$ in a circular runway with constant velocities $v_1, v_2 (v_1 > v_2)$ and in the same sense. A pedestrian leaves $P$ at the same time, moving with velocity $v_3 = \frac{v_1+v_2}{12}$ . If the pedestrian and the cyclists move in opposite directions, the pedestrian meets the second cyclist $91$ seconds after he meets the first. If the pedestrian moves in the same direction as the cyclists, the first cyclist overtakes him $187$ seconds before the second does. Find the point where the first cyclist overtakes the second cyclist the first time.

Let $k$ be an odd number that is greater than or equal to $3$. Prove that there exists a $k^{th}$-degree integer-valued polynomial with non-integer-coefficients that has the following properties: (1) $f(0)=0$ and $f(1)=1$; and. (2) There exist infinitely many positive integers $n$ so that if the following equation: \[ n= f(x_1)+\cdots+f(x_s), \] has integer solutions $x_1, x_2, \dots, x_s$, then $s \geq 2^k-1$.

Prove that if for natural numbers $ a, b $ the number $ \sqrt[3]{a} + \sqrt[3]{b} $ is rational, then $ a, b $ are cubes of natural numbers.

Let $a_1,a_2, \cdots$ be a sequence of integers that satisfies: $a_1=1$ and $a_{n+1}=a_n+a_{\lfloor \sqrt{n} \rfloor} , \forall n\geq 1 $. Prove that for all positive $k$, there is $m \geq 1$ such that $k \mid a_m$.

Prove that if the polynomial $ f(x) = ax^3 + bx^2 + cx + d $ with integer coefficients takes odd values for $ x = 0 $ and $ x = 1 $, then the equation $ f(x) = 0 $ has no integer roots.

Let $x$ be a complex number such that $x^{2011}=1$ and $x\neq 1$. Compute the sum \[\dfrac{x^2}{x-1}+\dfrac{x^4}{x^2-1}+\dfrac{x^6}{x^3-1}+\cdots+\dfrac{x^{4020}}{x^{2010}-1}.\]

Find the number of positive integers $n$, such that $\sqrt{n} + \sqrt{n + 1} < 11$.

Let $n \geq 2, n \in \mathbb{N}$, $a,b,c,d \in \mathbb{N}$, $\frac{a}{b} + \frac{c}{d} < 1$ and $a + c \leq n,$ find the maximum value of $\frac{a}{b} + \frac{c}{d}$ for fixed $n.$

[b]p1. [/b] At Duke, $1/2$ of the students like lacrosse, $3/4$ like football, and $7/8$ like basketball. Let $p$ be the proportion of students who like at least all three of these sports and let $q$ be the difference between the maximum and minimum possible values of $p$. If $q$ is written as $m/n$ in lowest terms, find the value of $m + n$. [b]p2.[/b] A [i]dukie [/i]word is a $10$-letter word, each letter is one of the four $D, U, K, E$ such that there are four consecutive letters in that word forming the letter $DUKE$ in this order. For example, $DUDKDUKEEK$ is a dukie word, but $DUEDKUKEDE$ is not. How many different dukie words can we construct in total? [b]p3.[/b] Rectangle $ABCD$ has sides $AB = 8$, $BC = 6$. $\vartriangle AEC$ is an isosceles right triangle with hypotenuse $AC$ and $E$ above $AC$. $\vartriangle BFD$ is an isosceles right triangle with hypotenuse $BD$ and $F$ below $BD$. Find the area of $BCFE$. [b]p4.[/b] Chris is playing with $6$ pumpkins. He decides to cut each pumpkin in half horizontally into a top half and a bottom half. He then pairs each top-half pumpkin with a bottom-half pumpkin, so that he ends up having six “recombinant pumpkins”. In how many ways can he pair them so that only one of the six top-half pumpkins is paired with its original bottom-half pumpkin? [b]p5.[/b] Matt comes to a pumpkin farm to pick $3$ pumpkins. He picks the pumpkins randomly from a total of $30$ pumpkins. Every pumpkin weighs an integer value between $7$ to $16$ (including $7$ and $16$) pounds, and there’re $3$ pumpkins for each integer weight between $7$ to $16$. Matt hopes the weight of the $3$ pumpkins he picks to form the length of the sides of a triangle. Let $m/n$ be the probability, in lowest terms, that Matt will get what he hopes for. Find the value of $m + n$ [b]p6.[/b] Let $a, b, c, d$ be distinct complex numbers such that $|a| = |b| = |c| = |d| = 3$ and $|a + b + c + d| = 8$. Find $|abc + abd + acd + bcd|$. [b]p7.[/b] A board contains the integers $1, 2, ..., 10$. Anna repeatedly erases two numbers $a$ and $b$ and replaces it with $a + b$, gaining $ab(a + b)$ lollipops in the process. She stops when there is only one number left in the board. Assuming Anna uses the best strategy to get the maximum number of lollipops, how many lollipops will she have? [b]p8.[/b] Ajay and Joey are playing a card game. Ajay has cards labelled $2, 4, 6, 8$, and $10$, and Joey has cards labelled $1, 3, 5, 7, 9$. Each of them takes a hand of $4$ random cards and picks one to play. If one of the cards is at least twice as big as the other, whoever played the smaller card wins. Otherwise, the larger card wins. Ajay and Joey have big brains, so they play perfectly. If $m/n$ is the probability, in lowest terms, that Joey wins, find $m + n$. [b]p9.[/b] Let $ABCDEFGHI$ be a regular nonagon with circumcircle $\omega$ and center $O$. Let $M$ be the midpoint of the shorter arc $AB$ of $\omega$, $P$ be the midpoint of $MO$, and $N$ be the midpoint of $BC$. Let lines $OC$ and $PN$ intersect at $Q$. Find the measure of $\angle NQC$ in degrees. [b]p10.[/b] In a $30 \times 30$ square table, every square contains either a kit-kat or an oreo. Let $T$ be the number of triples ($s_1, s_2, s_3$) of squares such that $s_1$ and $s_2$ are in the same row, and $s_2$ and $s_3$ are in the same column, with $s_1$ and $s_3$ containing kit-kats and $s_2$ containing an oreo. Find the maximum value of $T$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given are two distinct monic cubics $F(x)$ and $G(x)$. All roots of the equations $F(x)=0$, $G(x)=0$ and $F(x)=G(x)$ are written down. There are eight numbers written. Prove that the greatest of them and the least of them cannot be both roots of the polynomial $F(x)$.