Prove that the equation $x^6 - 100x+1 = 0$ has two roots, and both of these roots are positive. a) Find the first non-zero digit in the decimal notation of the lesser root of this equation. b) Find the first two non-zero digits in the decimal notation of the lesser root of this equation.

Let $x, y, z \in R$, find all triples $(x, y, z)$ that satisfy the following system of equations: $2x^2 - 3xy + 2y^2 = 1$ $y^2 - 3yz + 4z^2 = 2$ $z^2 + 3zx - x^2 = 3$

[b]p1.[/b] You are given three buckets with a capacity to hold $8$, $5$, and $3$ quarts of water, respectively. Initially, the first bucket is filled with $8$ quarts of water, while the remaining two buckets are empty. There are no markings on the buckets, so you are only allowed to empty a bucket into another one or to fill a bucket to its capacity using the water from one of the other buckets. (a) Describe a procedure by which we can obtain exactly $6$ quarts of water in the first bucket. (b) Describe a procedure by which we can obtain exactly $4$ quarts of water in the first bucket. [b]p2.[/b] A point in the plane is called a lattice point if its coordinates are both integers. A triangle whose vertices are all lattice points is called a lattice triangle. In each case below, give explicitly the coordinates of the vertices of a lattice triangle $T$ that satisfies the stated properties. (a) The area of $T$ is $1/2$ and two sides of $T$ have length greater than $2011$. (b) The area of $T$ is $1/2$ and the three sides of $T$ each have length greater than $2011$. [b]p3.[/b] Alice and Bob play several rounds of a game. In the $n$-th round, where $n = 1, 2, 3, ...$, the loser pays the winner $2^{n-1}$ dollars (there are no ties). After $40$ rounds, Alice has a profit of $\$2011$ (and Bob has lost $\$2011$). How many rounds of the game did Alice win, and which rounds were they? Justify your answer. [b]p4.[/b] Each student in a school is assigned a $15$-digit ID number consisting of a string of $3$’s and $7$’s. Whenever $x$ and $y$ are two distinct ID numbers, then $x$ and $y$ differ in at least three entries. Show that the number of students in the school is less than or equal to $2048$. [b]p5.[/b] A triangle $ABC$ has the following property: there is a point $P$ in the plane of $ABC$ such that the triangles $PAB$, $PBC$ and $PCA$ all have the same perimeter and the same area. Prove that: (a) If $P$ is not inside the triangle $ABC$, then $ABC$ is a right-angled triangle. (b) If $P$ is inside the triangle $ABC$, then $ABC$ is an equilateral triangle. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all pairs of real numbers $x, y$ that satisfy the following system of equations $$\begin{cases} x^2 + 3y = 10 \\ 3 + y = \frac{10}{ x} \end{cases}$$

Find the smallest value of a function $$y = \cos 8x + 3\cos 4x +3\cos2x + 2\cos x.$$

Do there exist two reals whose sum is rational, but the sum of their $n$ th powers is irrational for all $n > 1$? Do there exist two reals whose sum is irrational, but the sum of whose $n$ th powers is rational for all $n > 1$?

Let $Q$ be a quadratic polynomial. If the sum of the roots of $Q^{100}(x)$ (where $Q^i(x)$ is defined by $Q^1(x)=Q(x)$, $Q^i(x)=Q(Q^{i-1}(x))$ for integers $i\geq 2$) is $8$ and the sum of the roots of $Q$ is $S$, compute $|\log_2(S)|$.

For an integer $n$, let $f_9(n)$ denote the number of positive integers $d\leq 9$ dividing $n$. Suppose that $m$ is a positive integer and $b_1,b_2,\ldots,b_m$ are real numbers such that $f_9(n)=\textstyle\sum_{j=1}^mb_jf_9(n-j)$ for all $n>m$. Find the smallest possible value of $m$.

Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $(x,y)$ such that $(\text{i})$ $x$ and $y$ are relatively prime; $(\text{ii})$ $x$ divides $y^2+m;$ $(\text{iii})$ $y$ divides $x^2+m.$

Does there exist a second-degree polynomial $p(x, y)$ in two variables such that every non-negative integer $ n $ equals $p(k,m)$ for one and only one ordered pair $(k,m)$ of non-negative integers? [i]Proposed by Finland.[/i]

A standard parabola is the graph of a quadratic polynomial $y = x^2 + ax + b$ with leading co\"efficient 1. Three standard parabolas with vertices $V1, V2, V3$ intersect pairwise at points $A1, A2, A3$. Let $A \mapsto s(A)$ be the reflection of the plane with respect to the $x$-axis. Prove that standard parabolas with vertices $s (A1), s (A2), s (A3)$ intersect pairwise at the points $s (V1), s (V2), s (V3)$.

Let $P$ and $Q$ be polynomials with integer coefficients. Suppose that the integers $a$ and $a+1997$ are roots of $P$, and that $Q(1998)=2000$. Prove that the equation $Q(P(x))=1$ has no integer solutions.

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $$f\left(x^3+f(y)\right)=x^2f(x)+y,$$for all $x,y\in\mathbb{R}.$ (Here $\mathbb{R}$ denotes the set of all real numbers.)

$P(x)$ is polynomial with degree $n>5$ and integer coefficients have $n$ different integer roots. Prove that $P(x)+3$ have $n$ different real roots.

[u]Round 1[/u] [b]p1.[/b] Alice and Bob played $25$ games of rock-paper-scissors. Alice played rock $12$ times, scissors $6$ times, and paper $7$ times. Bob played rock $13$ times, scissors $9$ times, and paper $3$ times. If there were no ties, who won the most games? (Remember, in each game each player picks one of rock, paper, or scissors. Rock beats scissors, scissors beat paper, and paper beats rock. If they choose the same object, the result is a tie.) [b]p2.[/b] On the planet Vulcan there are eight big volcanoes and six small volcanoes. Big volcanoes erupt every three years and small volcanoes erupt every two years. In the past five years, there were $30$ eruptions. How many volcanoes could erupt this year? [b]p3.[/b] A tangle is a sequence of digits constructed by picking a number $N\ge 0$ and writing the integers from $0$ to $N$ in some order, with no spaces. For example, $010123459876$ is a tangle with $N = 10$. A palindromic sequence reads the same forward or backward, such as $878$ or $6226$. The shortest palindromic tangle is $0$. How long is the second-shortest palindromic tangle? [b]p4.[/b] Balls numbered $1$ to $N$ have been randomly arranged in a long input tube that feeds into the upper left square of an $8 \times 8$ board. An empty exit tube leads out of the lower right square of the board. Your goal is to arrange the balls in order from $1$ to $N$ in the exit tube. As a move, you may 1. move the next ball in line from the input tube into the upper left square of the board, 2. move a ball already on the board to an adjacent square to its right or below, or 3. move a ball from the lower right square into the exit tube. No square may ever hold more than one ball. What is the largest number $N$ for which you can achieve your goal, no matter how the balls are initially arranged? You can see the order of the balls in the input tube before you start. [img]https://cdn.artofproblemsolving.com/attachments/1/8/bbce92750b01052db82d58b96584a36fb5ca5b.png[/img] [b]p5.[/b] A $2018 \times 2018$ board is covered by non-overlapping $2 \times 1$ dominoes, with each domino covering two squares of the board. From a given square, a robot takes one step to the other square of the domino it is on and then takes one more step in the same direction. Could the robot continue moving this way forever without falling off the board? [img]https://cdn.artofproblemsolving.com/attachments/9/c/da86ca4ff0300eca8e625dff891ed1769d44a8.png[/img] [u]Round 2[/u] [b]p6.[/b] Seventeen teams participated in a soccer tournament where a win is worth $1$ point, a tie is worth $0$ points, and a loss is worth $-1$ point. Each team played each other team exactly once. At least $\frac34$ of all games ended in a tie. Show that there must be two teams with the same number of points at the end of the tournament. [b]p7.[/b] The city of Old Haven is known for having a large number of secret societies. Any person may be a member of multiple societies. A secret society is called influential if its membership includes at least half the population of Old Haven. Today, there are $2018$ influential secret societies. Show that it is possible to form a council of at most $11$ people such that each influential secret society has at least one member on the council. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$a,b,c$ - different natural numbers. Can we build quadratic polynomial $P(x)=kx^2+lx+m$, with $k,l,m$ are integer, $k>0$ that for some integer points it get values $a^3,b^3,c^3$ ?

Let $n$ be a natural number and the polynomial, $P(x)=x^n+n$. $(a)$ Is it possible that for some odd number $n$ , the polynomial $P(x)$ is composite for all natural numbers $x$. $(b)$ Is it possible that for some even number $n$ , the polynomial $P(x)$ is composite for all natural numbers $x$. Reason your answers.

[b]p1.[/b] If $A = 0$, $B = 1$, $C = 2$, $...$, $Z = 25$, then what is the sum of $A + B + M+ C$? [b]p2.[/b] Eric is playing Tetris against Bryan. If Eric wins one-fifth of the games he plays and he plays $15$ games, find the expected number of games Eric will win. [b]p3.[/b] What is the sum of the measures of the exterior angles of a regular $2023$-gon in degrees? [b]p4.[/b] If $N$ is a base $10$ digit of $90N3$, what value of $N$ makes this number divisible by $477$? [b]p5.[/b] What is the rightmost non-zero digit of the decimal expansion of $\frac{1}{2^{2023}}$ ? [b]p6.[/b] if graphs of $y = \frac54 x + m$ and $y = \frac32 x + n$ intersect at $(16, 27)$, what is the value of $m + n$? [b]p7.[/b] Bryan is hitting the alphabet keys on his keyboard at random. If the probability he spells out ABMC at least once after hitting $6$ keys is $\frac{a}{b^c}$ , for positive integers $a$, $b$, $c$ where $b$, $c$ are both as small as possible, find $a+b+c$. Note that the letters ABMC must be adjacent for it to count: AEBMCC should not be considered as correctly spelling out ABMC. [b]p8.[/b] It takes a Daniel twenty minutes to change a light bulb. It takes a Raymond thirty minutes to change a light bulb. It takes a Bryan forty-five minutes to change a light bulb. In the time that it takes two Daniels, three Raymonds, and one and a half Bryans to change $42$ light bulbs, how many light bulbs could half a Raymond change? Assume half a person can work half as productively as a whole person. [b]p9.[/b] Find the value of $5a + 4b + 3c + 2d + e$ given $a, b, c, d, e$ are real numbers satisfying the following equations: $$a^2 = 2e + 23$$ $$b^2 = 10a - 34$$ $$c^2 = 8b - 23$$ $$d^2 = 6c - 14$$ $$e^2 = 4d - 7.$$ [b]p10.[/b] How many integers between $1$ and $1000$ contain exactly two $1$’s when written in base $2$? [b]p11.[/b] Joe has lost his $2$ sets of keys. However, he knows that he placed his keys in one of his $12$ mailboxes, each labeled with a different positive integer from $1$ to $12$. Joe plans on opening the $2$ mailbox labeled $1$ to see if any of his keys are there. However, a strong gust of wind blows by, opening mailboxes $11$ and $12$, revealing that they are empty. If Joe decides to open one of the mailboxes labeled $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$ , or $10$, the probability that he finds at least one of his sets of keys can be expressed as $\frac{a}{b}$, where a and b are relatively prime positive integers. Find the sum $a + b$. Note that a single mailbox can contain $0$, $1$, or $2$ sets of keys, and the mailboxes his sets of keys were placed in are determined independently at random. [b]p12.[/b] As we all know, the top scientists have recently proved that the Earth is a flat disc. Bob is standing on Earth. If he takes the shortest path to the edge, he will fall off after walking $1$ meter. If he instead turns $90$ degrees away from the shortest path and walks towards the edge, he will fall off after $3$ meters. Compute the radius of the Earth. [b]p13.[/b] There are $999$ numbers that are repeating decimals of the form $0.abcabcabc...$ . The sum of all of the numbers of this form that do not have a $1$ or $2$ in their decimal representation can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Find $a + b$. [b]p14.[/b] An ant is crawling along the edges of a sugar cube. Every second, it travels along an edge to another adjacent vertex randomly, interested in the sugar it notices. Unfortunately, the cube is about to be added to some scalding coffee! In $10$ seconds, it must return to its initial vertex, so it can get off and escape. If the probability the ant will avoid a tragic doom can be expressed as $\frac{a}{3^{10}}$ , where $a$ is a positive integer, find $a$. Clarification: The ant needs to be on its initial vertex in exactly $10$ seconds, no more or less. [b]p15.[/b] Raymond’s new My Little Pony: Friendship is Magic Collector’s book arrived in the mail! The book’s pages measure $4\sqrt3$ inches by $12$ inches, and are bound on the longer side. If Raymond keeps one corner in the same plane as the book, what is the total area one of the corners can travel without ripping the page? If the desired area in square inches is $a\pi+b\sqrt{c}$ where $a$, $b$, and $c$ are integers and $c$ is squarefree, find $a + b + c$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $k$ be a positive integer congruent to $1$ modulo $4$ which is not a perfect square and let $a=\frac{1+\sqrt{k}}{2}$. Show that $\{\left \lfloor{a^2n}\right \rfloor-\left \lfloor{a\left \lfloor{an}\right \rfloor}\right \rfloor : n \in \mathbb{N}_{>0}\}=\{1 , 2 , \ldots ,\left \lfloor{a}\right \rfloor\}$.

Billy is standing at $(1,0)$ in the coordinate plane as he watches his Aunt Sydney go for her morning jog starting at the origin. If Aunt Sydney runs into the First Quadrant at a constant speed of $1$ meter per second along the graph of $x=\frac25y^2$, find the rate, in radians per second, at which Billy’s head is turning clockwise when Aunt Sydney passes through $x=1$.

[b]p1.[/b] Let $a$ be an integer. How many fractions $\frac{a}{100}$ are greater than $\frac17$ and less than $\frac13$ ?. [b]p2.[/b] Justin Bieber invited Justin Timberlake and Justin Shan to eat sushi. There were $5$ different kinds of fish, $3$ different rice colors, and $11$ different sauces. Justin Shan insisted on a spicy sauce. If the probability of a sushi combination that pleased Justin Shan is $6/11$, then how many non-spicy sauces were there? [b]p3.[/b] A palindrome is any number that reads the same forward and backward (for example, $99$ and $50505$ are palindromes but $2020$ is not). Find the sum of all three-digit palindromes whose tens digit is $5$. [b]p4.[/b] Isaac is given an online quiz for his chemistry class in which he gets multiple tries. The quiz has $64$ multiple choice questions with $4$ choices each. For each of his previous attempts, the computer displays Isaac's answer to that question and whether it was correct or not. Given that Isaac is too lazy to actually read the questions, the maximum number of times he needs to attempt the quiz to guarantee a $100\%$ can be expressed as $2^{2^k}$. Find $k$. [b]p5.[/b] Consider a three-way Venn Diagram composed of three circles of radius $1$. The area of the entire Venn Diagram is of the form $\frac{a}{b}\pi +\sqrt{c}$ for positive integers $a$, $b$, $c$ where $a$, $b$ are relatively prime. Find $a+b+c$. (Each of the circles passes through the center of the other two circles) [b]p6.[/b] The sum of two four-digit numbers is $11044$. None of the digits are repeated and none of the digits are $0$s. Eight of the digits from $1-9$ are represented in these two numbers. Which one is not? [b]p7.[/b] Al wants to buy cookies. He can buy cookies in packs of $13$, $15$, or $17$. What is the maximum number of cookies he can not buy if he must buy a whole number of packs of each size? [b]p8.[/b] Let $\vartriangle ABC$ be a right triangle with base $AB = 2$ and hypotenuse $AC = 4$ and let $AD$ be a median of $\vartriangle ABC$. Now, let $BE$ be an altitude in $\vartriangle ABD$ and let $DF$ be an altitude in $\vartriangle ADC$. The quantity $(BE)^2 - (DF)^2$ can be expressed as a common fraction $\frac{a}{b}$ in lowest terms. Find $a + b$. [b]p9.[/b] Let $P(x)$ be a monic cubic polynomial with roots $r$, $s$, $t$, where $t$ is real. Suppose that $r + s + 2t = 8$, $2rs + rt + st = 12$ and $rst = 9$. Find $|P(2)|$. [b]p10.[/b] Let S be the set $\{1, 2,..., 21\}$. How many $11$-element subsets $T$ of $S$ are there such that there does not exist two distinct elements of $T$ such that one divides the other? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine the integral part of $A$, where $A =\frac{1}{672}+\frac{1}{673}+... +\frac{1}{2014}$

There is a sequence with $a(2)=0$, $a(3)=1$ and $a(n)=a\left(\left\lfloor\dfrac n2\right\rfloor\right)+a\left(\left\lceil\dfrac n2\right\rceil\right)$ for $n\geq 4$. Find $a(2014)$. [Note that $\left\lfloor\dfrac n2\right\rfloor$ and $\left\lceil\dfrac n2\right\rceil$ denote the floor function (largest integer $\leq\tfrac n2$) and the ceiling function (smallest integer $\geq\tfrac n2$), respectively.]

A bus that moves along a 100 km route is equipped with a computer, which predicts how much more time is needed to arrive at its final destination. This prediction is made on the assumption that the average speed of the bus in the remaining part of the route is the same as that in the part already covered. Forty minutes after the departure of the bus, the computer predicts that the remaining travelling time will be 1 hour. And this predicted time remains the same for the next 5 hours. Could this possibly occur? If so, how many kilometers did the bus cover when these 5 hours passed? (Average speed is the number of kilometers covered divided by the time it took to cover them.)

Find all possible pairs of real numbers $ (x, y) $ that satisfy the equalities $ y ^ 2- [x] ^ 2 = 2001 $ and $ x ^ 2 + [y] ^ 2 = 2001 $.