Let $n$ be a positive integer. Solve the system of equations \begin{align*}x_{1}+2x_{2}+\cdots+nx_{n}&= \frac{n(n+1)}{2}\\ x_{1}+x_{2}^{2}+\cdots+x_{n}^{n}&= n\end{align*} for $n$-tuples $(x_{1},x_{2},\ldots,x_{n})$ of nonnegative real numbers.

$(FRA 6)$ Consider the integer $d = \frac{a^b-1}{c}$, where $a, b$, and $c$ are positive integers and $c \le a.$ Prove that the set $G$ of integers that are between $1$ and $d$ and relatively prime to $d$ (the number of such integers is denoted by $\phi(d)$) can be partitioned into $n$ subsets, each of which consists of $b$ elements. What can be said about the rational number $\frac{\phi(d)}{b}?$

Twenty cubical blocks are arranged as shown. First, $10$ are arranged in a triangular pattern; then a layer of $6$, arranged in a triangular pattern, is centered on the $10$; then a layer of $3$, arranged in a triangular pattern, is centered on the $6$; and finally one block is centered on top of the third layer. The blocks in the bottom layer are numbered $1$ through $10$ in some order. Each block in layers $2, 3$ and $4$ is assigned the number which is the sum of the numbers assigned to the three blocks on which it rests. Find the smallest possible number which could be assigned to the top block. [asy] size((400)); draw((0,0)--(5,0)--(5,5)--(0,5)--(0,0), linewidth(1)); draw((5,0)--(10,0)--(15,0)--(20,0)--(20,5)--(15,5)--(10,5)--(5,5)--(6,7)--(11,7)--(16,7)--(21,7)--(21,2)--(20,0), linewidth(1)); draw((10,0)--(10,5)--(11,7), linewidth(1)); draw((15,0)--(15,5)--(16,7), linewidth(1)); draw((20,0)--(20,5)--(21,7), linewidth(1)); draw((0,5)--(1,7)--(6,7), linewidth(1)); draw((3.5,7)--(4.5,9)--(9.5,9)--(14.5,9)--(19.5,9)--(18.5,7)--(19.5,9)--(19.5,7), linewidth(1)); draw((8.5,7)--(9.5,9), linewidth(1)); draw((13.5,7)--(14.5,9), linewidth(1)); draw((7,9)--(8,11)--(13,11)--(18,11)--(17,9)--(18,11)--(18,9), linewidth(1)); draw((12,9)--(13,11), linewidth(1)); draw((10.5,11)--(11.5,13)--(16.5,13)--(16.5,11)--(16.5,13)--(15.5,11), linewidth(1)); draw((25,0)--(30,0)--(30,5)--(25,5)--(25,0), dashed); draw((30,0)--(35,0)--(40,0)--(45,0)--(45,5)--(40,5)--(35,5)--(30,5)--(31,7)--(36,7)--(41,7)--(46,7)--(46,2)--(45,0), dashed); draw((35,0)--(35,5)--(36,7), dashed); draw((40,0)--(40,5)--(41,7), dashed); draw((45,0)--(45,5)--(46,7), dashed); draw((25,5)--(26,7)--(31,7), dashed); draw((28.5,7)--(29.5,9)--(34.5,9)--(39.5,9)--(44.5,9)--(43.5,7)--(44.5,9)--(44.5,7), dashed); draw((33.5,7)--(34.5,9), dashed); draw((38.5,7)--(39.5,9), dashed); draw((32,9)--(33,11)--(38,11)--(43,11)--(42,9)--(43,11)--(43,9), dashed); draw((37,9)--(38,11), dashed); draw((35.5,11)--(36.5,13)--(41.5,13)--(41.5,11)--(41.5,13)--(40.5,11), dashed); draw((50,0)--(55,0)--(55,5)--(50,5)--(50,0), dashed); draw((55,0)--(60,0)--(65,0)--(70,0)--(70,5)--(65,5)--(60,5)--(55,5)--(56,7)--(61,7)--(66,7)--(71,7)--(71,2)--(70,0), dashed); draw((60,0)--(60,5)--(61,7), dashed); draw((65,0)--(65,5)--(66,7), dashed); draw((70,0)--(70,5)--(71,7), dashed); draw((50,5)--(51,7)--(56,7), dashed); draw((53.5,7)--(54.5,9)--(59.5,9)--(64.5,9)--(69.5,9)--(68.5,7)--(69.5,9)--(69.5,7), dashed); draw((58.5,7)--(59.5,9), dashed); draw((63.5,7)--(64.5,9), dashed); draw((57,9)--(58,11)--(63,11)--(68,11)--(67,9)--(68,11)--(68,9), dashed); draw((62,9)--(63,11), dashed); draw((60.5,11)--(61.5,13)--(66.5,13)--(66.5,11)--(66.5,13)--(65.5,11), dashed); draw((75,0)--(80,0)--(80,5)--(75,5)--(75,0), dashed); draw((80,0)--(85,0)--(90,0)--(95,0)--(95,5)--(90,5)--(85,5)--(80,5)--(81,7)--(86,7)--(91,7)--(96,7)--(96,2)--(95,0), dashed); draw((85,0)--(85,5)--(86,7), dashed); draw((90,0)--(90,5)--(91,7), dashed); draw((95,0)--(95,5)--(96,7), dashed); draw((75,5)--(76,7)--(81,7), dashed); draw((78.5,7)--(79.5,9)--(84.5,9)--(89.5,9)--(94.5,9)--(93.5,7)--(94.5,9)--(94.5,7), dashed); draw((83.5,7)--(84.5,9), dashed); draw((88.5,7)--(89.5,9), dashed); draw((82,9)--(83,11)--(88,11)--(93,11)--(92,9)--(93,11)--(93,9), dashed); draw((87,9)--(88,11), dashed); draw((85.5,11)--(86.5,13)--(91.5,13)--(91.5,11)--(91.5,13)--(90.5,11), dashed); draw((28,6)--(33,6)--(38,6)--(43,6)--(43,11)--(38,11)--(33,11)--(28,11)--(28,6), linewidth(1)); draw((28,11)--(29,13)--(34,13)--(39,13)--(44,13)--(43,11)--(44,13)--(44,8)--(43,6), linewidth(1)); draw((33,6)--(33,11)--(34,13)--(39,13)--(38,11)--(38,6), linewidth(1)); draw((31,13)--(32,15)--(37,15)--(36,13)--(37,15)--(42,15)--(41,13)--(42,15)--(42,13), linewidth(1)); draw((34.5,15)--(35.5,17)--(40.5,17)--(39.5,15)--(40.5,17)--(40.5,15), linewidth(1)); draw((53,6)--(58,6)--(63,6)--(68,6)--(68,11)--(63,11)--(58,11)--(53,11)--(53,6), dashed); draw((53,11)--(54,13)--(59,13)--(64,13)--(69,13)--(68,11)--(69,13)--(69,8)--(68,6), dashed); draw((58,6)--(58,11)--(59,13)--(64,13)--(63,11)--(63,6), dashed); draw((56,13)--(57,15)--(62,15)--(61,13)--(62,15)--(67,15)--(66,13)--(67,15)--(67,13), dashed); draw((59.5,15)--(60.5,17)--(65.5,17)--(64.5,15)--(65.5,17)--(65.5,15), dashed); draw((78,6)--(83,6)--(88,6)--(93,6)--(93,11)--(88,11)--(83,11)--(78,11)--(78,6), dashed); draw((78,11)--(79,13)--(84,13)--(89,13)--(94,13)--(93,11)--(94,13)--(94,8)--(93,6), dashed); draw((83,6)--(83,11)--(84,13)--(89,13)--(88,11)--(88,6), dashed); draw((81,13)--(82,15)--(87,15)--(86,13)--(87,15)--(92,15)--(91,13)--(92,15)--(92,13), dashed); draw((84.5,15)--(85.5,17)--(90.5,17)--(89.5,15)--(90.5,17)--(90.5,15), dashed); draw((56,12)--(61,12)--(66,12)--(66,17)--(61,17)--(56,17)--(56,12), linewidth(1)); draw((61,12)--(61,17)--(62,19)--(57,19)--(56,17)--(57,19)--(67,19)--(66,17)--(67,19)--(67,14)--(66,12), linewidth(1)); draw((59.5,19)--(60.5,21)--(65.5,21)--(64.5,19)--(65.5,21)--(65.5,19), linewidth(1)); draw((81,12)--(86,12)--(91,12)--(91,17)--(86,17)--(81,17)--(81,12), dashed); draw((86,12)--(86,17)--(87,19)--(82,19)--(81,17)--(82,19)--(92,19)--(91,17)--(92,19)--(92,14)--(91,12), dashed); draw((84.5,19)--(85.5,21)--(90.5,21)--(89.5,19)--(90.5,21)--(90.5,19), dashed); draw((84,18)--(89,18)--(89,23)--(84,23)--(84,18)--(84,23)--(85,25)--(90,25)--(89,23)--(90,25)--(90,20)--(89,18), linewidth(1));[/asy] $ \textbf{(A)}\ 55 \qquad\textbf{(B)}\ 83 \qquad\textbf{(C)}\ 114 \qquad\textbf{(D)}\ 137 \qquad\textbf{(E)}\ 144 $

There are $3$ clubs $A,B,C$ with non-empty members. For any triplet of members $(a, b, c)$ with $a \in A, b \in B, c \in C$, two of them are friend and two of them are not friend (here the friend relationship is bidirectional). Prove that one of these statements must be true 1. There exist one student from $A$ that knows all students from $B$ 2. There exist one student from $B$ that knows all students from $C$ 3. There exist one student from $C$ that knows all students from $A$

Let $\tau(n)$ be the number of positive divisors of $n$. Let $\tau_1(n)$ be the number of positive divisors of $n$ which have remainders $1$ when divided by $3$. Find all positive integral values of the fraction $\frac{\tau(10n)}{\tau_1(10n)}$.

Let $ABC$ be a triangle with $AB = 3$, $BC = 4$, and $AC =5$. If $D$ is the projection from $B$ onto $AC$, $E$ is the projection from $D$ onto $BC$, and $F$ is the projection from $E$ onto $AC$, compute the length of the segment $DF$. [i]2016 CCA Math Bonanza Individual #5[/i]

Let $ABC$ be an equilateral triangle of sidelength 2 and let $\omega$ be its incircle. a) Show that for every point $P$ on $\omega$ the sum of the squares of its distances to $A$, $B$, $C$ is 5. b) Show that for every point $P$ on $\omega$ it is possible to construct a triangle of sidelengths $AP$, $BP$, $CP$. Also, the area of such triangle is $\frac{\sqrt{3}}{4}$.

The incircle of the triangle $\triangle{ABC}$ has center at $O$ and it is tangent to the sides $BC$, $AC$ and $AB$ at the points $X$, $Y$ and $Z$, respectively. The lines $BO$ and $CO$ intersect the line $YZ$ at the points $P$ and $Q$, respectively. Show that if the segments $XP$ and $XQ$ has the same length, then the triangle $\triangle ABC$ is isosceles.

Show that real numbers, $p, q, r$ satisfy the condition $p^4(q-r)^2 + 2p^2(q+r) + 1 = p^4$ if and only if the quadratic equations $x^2 + px + q = 0$ and $y^2 - py + r = 0$ have real roots (not necessarily distinct) which can be labeled by $x_1,x_2$ and $y_1,y_2$, respectively, in such a way that $x_1y_1 - x_2y_2 = 1$.

The expression $ x^3 \plus{} . . . x^2 \plus{} . . . x \plus{} ... \equal{} 0$ is written on the blackboard. Two pupils alternately replace the dots by real numbers. The first pupil attempts to obtain an equation having exactly one real root. Can his opponent spoil his efforts?

Arnav is placing three rectangles into a $3 \times 3$ grid of unit squares. He has a $1\times 3$ rectangle, a $1\times 2$ rectangle, and a $1\times 1$ rectangle. He must place the rectangles onto the grid such that the edges of the rectangles align with the gridlines of the grid. If he is allowed to rotate the rectangles, how many ways can he place the three rectangles into the grid, without overlap? [i]Proposed by William Yue[/i]

Prove that the intersection of a plane and a regular tetrahedron can be an obtuse-angled triangle and that the obtuse angle in any such triangle is always smaller than $ 120^{\circ}.$

Determine all functions $f: \mathbb N\to \mathbb N$ such that for every positive integer $n$ we have: \[ 2n+2001\leq f(f(n))+f(n)\leq 2n+2002. \]

Positive reals $p$ and $q$ are such that the graph of $y = x^2 - 2px + q$ does not intersect the $x$-axis. Find $q$ if there is a unique pair of points $A, B$ on the graph with $AB$ parallel to the $x$-axis and $\angle AOB = \frac{\pi}{2}$, where $O$ is the origin.

A positive integer $M$ has been represented as a product of primes. Each of these primes is increased by 1 . The product $N$ of the new multipliers is divisible by $M$ . Prove that if we represent $N$ as a product of primes and increase each of them by 1 then the product of the new multipliers will be divisible by $N$ . Alexandr Gribalko

Prove that there exist infinitely many positive integer triples $(a,b,c)$ such that $a ,b,c$ are pairwise relatively prime ,and $ab+c ,bc+a ,ca+b$ are pairwise relatively prime .

Let $P$ be an arbitrary interior point of the equilateral triangle $ABC$. From $P$ draw parallel to the sides: $A'_1A_1 \parallel AB$, $B' _1B_1 \parallel BC$ and $C'_1C_1 \parallel CA$. Prove that the sum of legths $| AC_1 | + | BA_1 | + | CB_1 |$ is independent of the choice of point $P$. [img]https://cdn.artofproblemsolving.com/attachments/5/a/15b06706c09e2458fb5938807b9f3833ffb62e.png[/img]

Let a,b,c>0 with ab+bc+ca=1. Prove that: $\frac{b^3c}{a^2+b^2}+\frac{c^3a}{b^2+c^2}+\frac{a^3b}{c^2+a^2}\ge\frac{1}{2}.$

Six numbers are placed on a circle. For every number $A$ we have: $A$ equals the absolute value of $(B- C)$, where $B$ and $C$ follow $A$ clockwise. The total sum of the numbers equals $1$. Find all the numbers. (Folklore)

Is there an infinite sequence of prime numbers $p_1, p_2, ..., p_n, ...,$ such that for every $i \in \mathbb{N}, p_{i + 1} \in \{2p_i - 1, 2p_i + 1\}$ is satisfied? Explain the answer.

You plan to organize your birthday party, which will be attended either by exactly $m$ persons or by exactly $n$ persons (you are not sure at the moment). You have a big birthday cake and you want to divide it into several parts (not necessarily equal), so that you are able to distribute the whole cake among the people attending the party with everybody getting cake of equal mass (however, one may get one big slice, while others several small slices - the sizes of slices may differ). What is the minimal number of parts you need to divide the cake, so that it is possible, regardless of the number of guests.

Find all primes $p \ge 3$ such that $p- \lfloor p/q \rfloor q$ is a square-free integer for any prime $q<p$.

[b]p1.[/b] There exist real numbers $B$, $M$, and $T$ such that $B + M + T = 23$ and $B - M - T = 20$. Compute $M + T$. [b]p2.[/b] Kaity has a rectangular garden that measures $10$ yards by $12$ yards. Austin’s triangular garden has side lengths $6$ yards, $8$ yards, and $10$ yards. Compute the ratio of the area of Kaity’s garden to the area of Austin’s garden. [b]p3.[/b] Nikhil’s mom and brother both have ages under $100$ years that are perfect squares. His mom is $33$ years older than his brother. Compute the sum of their ages. [b]p4.[/b] Madison wants to arrange $3$ identical blue books and $2$ identical pink books on a shelf so that each book is next to at least one book of the other color. In how many ways can Madison arrange the books? [b]p5.[/b] Two friends, Anna and Bruno, are biking together at the same initial speed from school to the mall, which is $6$ miles away. Suddenly, $1$ mile in, Anna realizes that she forgot her calculator at school. If she bikes $4$ miles per hour faster than her initial speed, she could head back to school and still reach the mall at the same time as Bruno, assuming Bruno continues biking towards the mall at their initial speed. In miles per hour, what is Anna and Bruno’s initial speed, before Anna has changed her speed? (Assume that the rate at which Anna and Bruno bike is constant.) [b]p6.[/b] Let a number be “almost-perfect” if the sum of its digits is $28$. Compute the sum of the third smallest and third largest almost-perfect $4$-digit positive integers. [b]p7.[/b] Regular hexagon $ABCDEF$ is contained in rectangle $PQRS$ such that line $\overline{AB}$ lies on line $\overline{PQ}$, point $C$ lies on line $\overline{QR}$, line $\overline{DE}$ lies on line $\overline{RS}$, and point $F$ lies on line $\overline{SP}$. Given that $PQ = 4$, compute the perimeter of $AQCDSF$. [img]https://cdn.artofproblemsolving.com/attachments/6/7/5db3d5806eaefa00d7fc90fb786a41c0466a90.png[/img] [b]p8.[/b] Compute the number of ordered pairs $(m, n)$, where $m$ and $n$ are relatively prime positive integers and $mn = 2520$. (Note that positive integers $x$ and $y$ are relatively prime if they share no common divisors other than $1$. For example, this means that $1$ is relatively prime to every positive integer.) [b]p9.[/b] A geometric sequence with more than two terms has first term $x$, last term $2023$, and common ratio $y$, where $x$ and $y$ are both positive integers greater than $1$. An arithmetic sequence with a finite number of terms has first term $x$ and common difference $y$. Also, of all arithmetic sequences with first term $x$, common difference $y$, and no terms exceeding $2023$, this sequence is the longest. What is the last term of the arithmetic sequence? [b]p10.[/b] Andrew is playing a game where he must choose three slips, uniformly at random and without replacement, from a jar that has nine slips labeled $1$ through $9$. He wins if the sum of the three chosen numbers is divisible by $3$ and one of the numbers is $1$. What is the probability Andrew wins? [b]p11.[/b] Circle $O$ is inscribed in square $ABCD$. Let $E$ be the point where $O$ meets line segment $\overline{AB}$. Line segments $\overline{EC}$ and $\overline{ED}$ intersect $O$ at points $P$ and $Q$, respectively. Compute the ratio of the area of triangle $\vartriangle EPQ$ to the area of triangle $\vartriangle ECD$. [b]p12.[/b] Define a recursive sequence by $a_1 = \frac12$ and $a_2 = 1$, and $$a_n =\frac{1 + a_{n-1}}{a_{n-2}}$$ for n ≥ 3. The product $a_1a_2a_3 ... a_{2023}$ can be expressed in the form $a^b \cdot c^d \cdot e^f$ , where $a$, $b$, $c$, $d$, $e$, and $f$ are positive (not necessarily distinct) integers, and a, c, and e are prime. Compute $a + b + c + d + e + f$. [b]p13.[/b] An increasing sequence of $3$-digit positive integers satisfies the following properties: $\bullet$ Each number is a multiple of $2$, $3$, or $5$. $\bullet$ Adjacent numbers differ by only one digit and are relatively prime. (Note that positive integers x and y are relatively prime if they share no common divisors other than $1$.) What is the maximum possible length of the sequence? [b]p14.[/b] Circles $O_A$ and $O_B$ with centers $A$ and $B$, respectively, have radii $3$ and $8$, respectively, and are internally tangent to each other at point $P$. Point $C$ is on circle $O_A$ such that line $\overline{BC}$ is tangent to circle $OA$. Extend line $\overline{PC}$ to intersect circle $O_B$ at point $D \ne P$. Compute $CD$. [b]p15.[/b] Compute the product of all real solutions $x$ to the equation $x^2 + 20x - 23 = 2 \sqrt{x^2 + 20x + 1}$. [b]p16.[/b] Compute the number of divisors of $729, 000, 000$ that are perfect powers. (A perfect power is an integer that can be written in the form $a^b$, where $a$ and $b$ are positive integers and $b > 1$.) [b]p17.[/b] The arithmetic mean of two positive integers $x$ and $y$, each less than $100$, is $4$ more than their geometric mean. Given $x > y$, compute the sum of all possible values for $x + y$. (Note that the geometric mean of $x$ and $y$ is defined to be $\sqrt{xy}$.) [b]p18.[/b] Ankit and Richard are playing a game. Ankit repeatedly writes the digits $2$, $0$, $2$, $3$, in that order, from left to right on a board until Richard tells him to stop. Richard wins if the resulting number, interpreted as a base-$10$ integer, is divisible by as many positive integers less than or equal to $12$ as possible. For example, if Richard stops Ankit after $7$ digits have been written, the number would be $2023202$, which is divisible by $1$ and $2$. Richard wants to win the game as early as possible. Assuming Ankit must write at least one digit, after how many digits should Richard stop Ankit? [b]p19.[/b] Eight chairs are set around a circular table. Among these chairs, two are red, two are blue, two are green, and two are yellow. Chairs that are the same color are identical. If rotations and reflections of arrangements of chairs are considered distinct, how many arrangements of chairs satisfy the property that each pair of adjacent chairs are different colors? [b]p20.[/b] Four congruent spheres are placed inside a right-circular cone such that they are all tangent to the base and the lateral face of the cone, and each sphere is tangent to exactly two other spheres. If the radius of the cone is $1$ and the height of the cone is $2\sqrt2$, what is the radius of one of the spheres? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the sets $S{}$ of positive integers satisfying the following two conditions: [list=a] [*]For any positive integers $a, b, c{}$, if $ab + bc + ca{}$ is in $S$, then so are $a + b + c{}$ and $abc$; and [*]The set $S{}$ contains an integer $N \geqslant 160$ such that $N-2$ is not divisible by $4$. [/list] [i]Bogdan Blaga, United Kingdom[/i]

Two of the altitudes of the scalene triangle $ABC$ have length $4$ and $12$. If the length of the third altitude is also an integer, what is the biggest it can be? $ \textbf{(A)}\ 4\qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ \text{none of these} $