For every positive integer $ n$, let $ \phi(n)$ denotes the number of positive integers less than $ n$ that is relatively prime to $ n$ and $ \tau(n)$ denote the sum of all positive divisors of $ n$. Let $ n$ be a positive integer such that $ \phi(n)|n\minus{}1$ and that $ n$ is not a prime number. Prove that $ \tau(n)>2009$.

If the polynomials $f(x)$ and $g(x)$ are written on a blackboard then we can also write down the polynomials $f(x)\pm g(x)$, $f(x)g(x)$, $f(g(x))$ and $cf(x)$, where $c$ is an arbitrary real constant. The polynomials $x^3-3x^2+5$ and $x^2-4x$ are written on the blackboard. Can we write a nonzero polynomial of form $x^n-1$ after a finite number of steps?

A spaceman of mass $\text{80 kg}$ is sitting in a spacecraft near the surface of the Earth. The spacecraft is accelerating upward at five times the acceleration due to gravity. What is the force of the spaceman on the spacecraft? (A) $\text{4800 N}$ (B) $\text{4000 N}$ (C) $\text{3200 N}$ (D) $\text{800 N}$ (E) $\text{400 N}$

The lengths of the two legs of a right triangle are the two distinct roots of the quadratic $x^2 - 36x + 70$. What is the length of the triangle’s hypotenuse?

Let $N$ be the number of subsets $B$ of the set $\{1,2,\dots,2018\}$ such that the sum of the elements of $B$ is congruent to $2018$ modulo $2048$. Find the remainder when $N$ is divided by $1000$.

Let $ f,g:[0,1]\longrightarrow{R} $ be two continuous functions such that $ f(x)g(x)\ge 4x^2, $ for all $ x\in [0,1] . $ Prove that $$ \left| \int_0^1 f(x)dx \right| \ge 1\text{ or } \left| \int_0^1 g(x)dx \right| \ge 1. $$

Chords $AB$ and $CD$ of a circle are perpendicular and intersect at a point $P$. If $AP = 6, BP = 12$, and $CD = 22$, find the area of the circle.

Consider a circle and a point $P$ outside the circle. The angle of given measure with vertex at $P$ subtends a diameter of the circle. Construct the circle’s diameter with ruler and compass.

For all natural numbers $n$, let $$A_n=\sqrt{2-\sqrt{2+\sqrt{2+\cdots+\sqrt{2}}}}\quad\text{(n many radicals)}$$ [b](a)[/b] Show that for $n\geqslant 2$, $$A_n=2\sin\frac{\pi}{2^{n+1}}$$ [b](b)[/b] Hence or otherwise, evaluate the limit $$\lim_{n\to\infty} 2^nA_n$$

Brenda and Sally run in opposite directions on a circular track, starting at diametrically opposite points. They first meet after Brenda has run $ 100$ meters. They next meet after Sally has run $ 150$ meters past their first meeting point. Each girl runs at a constant speed. What is the length of the track in meters? $ \textbf{(A)}\ 250\qquad \textbf{(B)}\ 300\qquad \textbf{(C)}\ 350\qquad \textbf{(D)}\ 400\qquad \textbf{(E)}\ 500$

Have you ever found it strange that “almost the same” numbers can look very different? For example, in the decimal system $29$ and $30$ only differ by one unit but do not contain any common digits. The ALPHABETA numbering system uses only the digits$ 0$ and $1$ and avoids this situation: [img]https://cdn.artofproblemsolving.com/attachments/d/f/dcdf284b3baeea8775de56ece091c80d3449a8.png[/img] In it, the rule for constructing the successor of a number is as follows: without repeating a previous number in the list, change the digit as far to the right as possible, otherwise a 1 is placed to the left. (a) What number in the decimal system is represented in the ALPHABETA code by the number $111111$? (b) What is the next number in this code? (c) Describe an algorithm to find, given any number in the ALPHABETA code, the next number in this code.

Determine all triples $(x,y, p)$ with $x$, $y$ positive integers and $p$ a prime number verifying the equation $p^x -y^p = 1$.

Let $ABCD$ be a trapezoid with $AB$ parallel to $CD$ and perpendicular to $BC$. Let $M$ be a point on $BC$ such that $\angle AMB = \angle DMC$. If $AB = 3$, $BC = 24$, and $CD = 4$, what is the value of $AM + MD$?

$E$ and $F$ are the midpoints of the sides $BC$ and $AD$ of the convex quadrilateral $ABCD$. Prove that the segment $EF$ divides the diagonals $AC$ and $BD$ in the same ratio.

Given a polynomial $P\in \mathbb{Z}[X]$ of degree $k$, show that there always exist $2d$ distinct integers $x_1, x_2, \cdots x_{2d}$ such that $$P(x_1)+P(x_2)+\cdots P(x_{d})=P(x_{d+1})+P(x_{d+2})+\cdots + P(x_{2d})$$ for some $d\le k+1$. [Extra: Is this still true if $d\le k$? (Of course false for linear polynomials, but what about higher degree?)]

Let $ABC$ be a triangle with $CA \neq CB$. Let $D$, $F$, and $G$ be the midpoints of the sides $AB$, $AC$, and $BC$ respectively. A circle $\Gamma$ passing through $C$ and tangent to $AB$ at $D$ meets the segments $AF$ and $BG$ at $H$ and $I$, respectively. The points $H'$ and $I'$ are symmetric to $H$ and $I$ about $F$ and $G$, respectively. The line $H'I'$ meets $CD$ and $FG$ at $Q$ and $M$, respectively. The line $CM$ meets $\Gamma$ again at $P$. Prove that $CQ = QP$. [i]Proposed by El Salvador[/i]

Let $s(n)$ denote the smallest prime divisor and $d(n)$ denote the number of positive divisors of a positive integer $n>1$. Is it possible to choose $2023$ positive integers $a_{1},a_{2},...,a_{2023}$ with $a_{1}<a_{2}-1<...<a_{2023}-2022$ such that for all $k=1,...,2022$ we have $d(a_{k+1}-a_{k}-1)>2023^{k}$ and $s(a_{k+1}-a_{k}) > 2023^{k}$? [i]Authored by Nikola Velov[/i]

Pebbles are placed on the squares of a $2021\times 2021$ board in such a way that each square contains at most one pebble. The pebble set of a square of the board is the collection of all pebbles which are in the same row or column as this square. (A pebble belongs to the pebble set of the square in which it is placed.) What is the least possible number of pebbles on the board if no two squares have the same pebble set?

Call a tuple $(b_m, b_{m+1},..., b_n)$ of integers perfect if both following conditions are fulfilled: 1. There exists an integer $a > 1$ such that $b_k = a^k + 1$ for all $k = m, m + 1,..., n$ 2. For all $k = m, m + 1,..., n,$ there exists a prime number $q$ and a non-negative integer $t$ such that $b_k = q^t$. Prove that if $n - m$ is large enough then there is no perfect tuples, and find all perfect tuples with the maximal number of components.

Determine all positive integers $A= \overline{a_n a_{n-1} \ldots a_1 a_0}$ such that not all of its digits are equal and no digit is $0$, and $A$ divides all numbers of the following form: $A_1 = \overline{a_0 a_n a_{n-1} \ldots a_2 a_1}, A_2 = \overline{a_1 a_0 a_{n} \ldots a_3 a_2}, \ldots ,$ $ A_{n-1} = \overline{a_{n-2} a_{n-3} \ldots a_0 a_n a_{n-1}}, A_n = \overline{a_{n-1} a_{n-2} \ldots a_1 a_0 a_n}$.

A figure on a computer screen shows $n$ points on a sphere, no four coplanar. Some pairs of points are joined by segments. Each segment is colored red or blue. For each point there is a key that switches the colors of all segments with that point as endpoint. For every three points there is a sequence of key presses that makes the three segments between them red. Show that it is possible to make all the segments on the screen red. Find the smallest number of key presses that can turn all the segments red, starting from the worst case.

Does there exist a ten-digit number such that all its digits are different and after removing any six digits we get a composite four-digit number?

Let $ABC$ be an equilateral triangle and let $P$ be a point in its interior. Let the lines $AP$, $BP$, $CP$ meet the sides $BC$, $CA$, $AB$ at the points $A_1$, $B_1$, $C_1$, respectively. Prove that $A_1B_1 \cdot B_1C_1 \cdot C_1A_1 \ge A_1B \cdot B_1C \cdot C_1A$.

Compute the greatest $4$-digit number $\underline{ABCD}$ such that $(A^3+B^2)(C^3+D^2)=2015$. [i]2015 CCA Math Bonanza Tiebreaker Round #1[/i]

\[\int_0^2 |\sin(\pi x)|+|\cos(\pi x)|\mathrm dx\] [i]Proposed by Anagh Sangavarapu[/i]