Let $f$ be a function on defined on $|x|<1$ such that $f\left (\tfrac1{10}\right )$ is rational and $f(x)= \sum_{i=1}^{\infty} a_i x^i $ where $a_i\in{\{0,1,2,3,4,5,6,7,8,9\}}$. Prove that $f$ can be written as $f(x)= \frac{p(x)}{q(x)}$ where $p(x)$ and $q(x)$ are polynomials with integer coefficients.

An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have: $$a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.$$ [i]Proposed by John Berman, United States[/i]

Let $n$ be a positive integer. Show that there exist a polynomial $P(x)$ with integer coefficient that satisfy the following [list] [*]Degree of $P(x)$ is at most $2^n - n -1$ [*]$|P(k)| = (k-1)!(2^n-k)!$ for each $k \in \{1,2,3,\dots,2^n\}$ [/list]

Numbers $ a,b,c$ are such that the equation $ x^3 \plus{} ax^2 \plus{} bx \plus{} c$ has three real roots.Prove that if $ \minus{} 2\leq a \plus{} b \plus{} c\leq 0$,then at least one of these roots belongs to the segment $ [0,2]$

[b]p1.[/b] In a $3$-person race, how many different results are possible if ties are allowed? [b]p2.[/b] An isosceles trapezoid has lengths $5$, $5$, $5$, and $8$. What is the sum of the lengths of its diagonals? [b]p3.[/b] Let $f(x) = (1 + x + x^2)(1 + x^3 + x^6)(1 + x^9 + x^{18})...$. Compute $f(4/5)$. [b]p4.[/b] Compute the largest prime factor of $3^{12} - 1$. [b]p5.[/b] Taren wants to throw a frisbee to David, who starts running perpendicular to the initial line between them at rate $1$ m/s. Taren throws the frisbee at rate $2$ m/s at the same instant David begins to run. At what angle should Taren throw the frisbee? [b]p6.[/b] The polynomial $p(x)$ leaves remainder $6$ when divided by $x-5$, and $5$ when divided by $x-6$. What is the remainder when $p(x)$ is divided by $(x - 5)(x - 6)$? [b]p7.[/b] Find the sum of the cubes of the roots of $x^{10} + x^9 + ... + x + 1 = 0$. [b]p8.[/b] A circle of radius $1$ is inscribed in a the parabola $y = x^2$. What is the $x$-coordinate of the intersection in the first quadrant? [b]p9.[/b] You are stuck in a cave with $3$ tunnels. The first tunnel leads you back to your starting point in $5$ hours, and the second tunnel leads you back there in $7$ hours. The third tunnel leads you out of the cave in $4$ hours. What is the expected number of hours for you to exit the cave, assuming you choose a tunnel randomly each time you come across your point of origin? [b]p10.[/b] What is the minimum distance between the line $y = 4x/7 + 1/5$ and any lattice point in the plane? (lattice points are points with integer coordinates) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Club Truncator is in a soccer league with six other teams, each of which it plays once. In any of its 6 matches, the probabilities that Club Truncator will win, lose, or tie are each $\frac{1}{3}$. The probability that Club Truncator will finish the season with more wins than losses is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $p(x) = x^7 +x^6 + b_5 x^5 + \cdots +b_0 $ and $q(x) = x^5 + c_4 x^4 + \cdots +c_0$ . If $p(i)=q(i)$ for $i=1,2,3,\cdots,6$ . Show that there exists a negative integer r such that $p(r)=q(r)$ .

[b]p1.[/b] Can a number ending in $1999$ be the square of a natural number? [b]p2.[/b] The Three-Headed Snake Gorynych celebrated his birthday. His heads took turns feasting on birthday cakes and ate two identical cakes in $15$ minutes. It is known that each head ate as much time as it would take the other two to eat the same pie together. In how many minutes would the three heads of the Serpent Gorynych eat one pie together? [b]p3.[/b] Find the sum of the coefficients of the polynomial obtained after opening the brackets and bringing similar terms into the expression: a) $(7x - 6)^4 - 1$ b) $(7x - 6)^{1999}-1$ [b]p4.[/b] The general wants to arrange seven anti-aircraft installations so that among any three of them there are two installations, the distance between which is exactly $10$ kilometers. Help the general solve this problem. [b]p5.[/b] Gulliver, whose height is $999$ millimeters, is building a tower of cubes. The first cube has a height of $1/2$ a lilikilometer, the second - $1/4$ a lilikilometer, the third - $1/8$ a lilikilometer, etc. How many cubes will be in the tower when its height exceeds Gulliver's height. ($1$ lilikilometer is equal to $1000$ lilimeters). [b]p6.[/b] It is known that in any pentagon you can choose three diagonals from which you can form a triangle. Is there a pentagon in which such diagonals can be chosen in a unique way? [b]p7.[/b] It is known that for natural numbers $a$ and $b$ the equality $19a = 99b$ holds. Can $a + b$ be a prime number? [b]p8.[/b] Vitya thought of $5$ integers and told Vanya all their pairwise sums: $$0, 1, 5, 7, 11, 12, 18, 24, 25, 29.$$ Help Vanya guess the numbers he has in mind. [b]p9.[/b] In a $3 \times 3$ square, numbers are arranged so that the sum of the numbers in each row, in each column and on each major diagonal is equal to $0$. It is known that the sum of the squares of the numbers in the top row is $n$. What can be the sum of the squares of the numbers in the bottom line? [b]p10.[/b] $N$ points are marked on a circle. Two players play this game: the first player connects two of these points with a chord, from the end of which the second player draws a chord to one of the remaining points so as not to intersect the already drawn chord. Then the first player makes the same “move” - draws a new chord from the end of the second chord to one of the remaining points so that it does not intersect any of the already drawn ones. The one who cannot make such a “move” loses. Who wins when played correctly? (A chord is a segment whose ends lie on a given circle) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here[/url].

a) Show that you can divide an angle $\theta$ to three equal parts using compass and ruler if and only if the polynomial $4t^3-3t-\cos (\theta)$ is reducible over $\mathbb{Q}(\cos (\theta))$. b) Is it always possible to divide an angle into five equal parts?

Given a polynomial with integer coefficents$$P(x)=x^n+a_{n-1}x^{n-1}+...+a_1x+a_0,n\ge 1$$satisfying these conditions: i) $|a_0|$ is not a perfect square. ii) $P(x)$ is irreducible in $\mathbb{Q}[x].$ Prove that: $P(x^2)$ is irreducible in $\mathbb{Q}[x].$

Let $f,g$ be polynomials with complex coefficients such that $\gcd(\deg f,\deg g)=1$. Suppose that there exist polynomials $P(x,y)$ and $Q(x,y)$ with complex coefficients such that $f(x)+g(y)=P(x,y)Q(x,y)$. Show that one of $P$ and $Q$ must be constant. [i]Victor Wang.[/i]

Suppose that $ f$ is a real-valued function for which \[ f(xy)+f(y-x)\geq f(y+x)\] for all real numbers $ x$ and $ y$. a) Give a non-constant polynomial that satisfies the condition. b) Prove that $ f(x)\geq 0$ for all real $ x$.

Suppose that $4^{n}+2^{n}+1$ is prime for some positive integer $n$. Show that $n$ must be a power of $3$.

Let $\alpha_1, \alpha_2, \dots, \alpha_n$, and $\beta_1, \beta_2, \ldots, \beta_n$, where $n \geq 4$, be 2 sets of real numbers such that \[\sum_{i=1}^{n} \alpha_i^2 < 1 \qquad \text{and} \qquad \sum_{i=1}^{n} \beta_i^2 < 1.\] Define \begin{align*} A^2 &= 1 - \sum_{i=1}^{n} \alpha_i^2,\\ B^2 &= 1 - \sum_{i=1}^{n} \beta_i^2,\\ W &= \frac{1}{2} (1 - \sum_{i=1}^{n} \alpha_i \beta_i)^2. \end{align*} Find all real numbers $\lambda$ such that the polynomial \[x^n + \lambda (x^{n-1} + \cdots + x^3 + Wx^2 + ABx + 1) = 0,\] only has real roots.