[b]p1.[/b] The total cost of $1$ football, $3$ tennis balls and $7$ golf balls is $\$14$ , while that of $1$ football, $4$ tennis balls and $10$ golf balls is $\$17$.If one has $\$20$ to spend, is this sufficient to buy a) $3$ footballs and $2$ tennis balls? b) $2$ footballs and $3$ tennis balls? [b]p2.[/b] Let $\overline{AB}$ and $\overline{CD}$ be two chords in a circle intersecting at a point $P$ (inside the circle). a) Prove that $AP \cdot PB = CP\cdot PD$. b) If $\overline{AB}$ is perpendicular to $\overline{CD}$ and the length of $\overline{AP}$ is $2$, the length of $\overline{PB}$ is $6$, and the length of $\overline{PD}$ is $3$, find the radius of the circle. [b]p3.[/b] A polynomial $P(x)$ of degree greater than one has the remainder $2$ when divided by $x-2$ and the remainder $3$ when divided by $x-3$. Find the remainder when $P(x)$ is divided by $x^2-5x+6$. [b]p4.[/b] Let $x_1= 2$ and $x_{n+1}=x_n+ (3n+2)$ for all $n$ greater than or equal to one. a) Find a formula expressing $x_n$ as a function of$ n$. b) Prove your result. [b]p5.[/b] The point $M$ is the midpoint of side $\overline{BC}$ of a triangle $ABC$. a) Prove that $AM \le \frac12 AB + \frac12 AC$. b) A fly takes off from a certain point and flies a total distance of $4$ meters, returning to the starting point. Explain why the fly never gets outside of some sphere with a radius of one meter. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ q_{0}, q_{1}, \cdots$ be a sequence of integers such that a) for any $ m > n$, $ m \minus{} n$ is a factor of $ q_{m} \minus{} q_{n}$, b) item $ |q_n| \le n^{10}$ for all integers $ n \ge 0$. Show that there exists a polynomial $ Q(x)$ satisfying $ q_{n} \equal{} Q(n)$ for all $ n$.

Let $n$ be a fixed natural number. Find all $n$ tuples of natural pairwise distinct and coprime numbers like $a_1,a_2,\ldots,a_n$ such that for $1\leq i\leq n$ we have \[ a_1+a_2+\ldots+a_n|a_1^i+a_2^i+\ldots+a_n^i \]

Suppose the polynomial $ x^{n} \plus{} a_{n \minus{} 1}x^{n \minus{} 1} \plus{} ... \plus{} a_{1} \plus{} a_{0}$ can be factorized as $ (x \plus{} r_{1})(x \plus{} r_{2})...(x \plus{} r_{n})$, with $ r_{1}, r_{2}, ..., r_{n}$ real numbers. Show that $ (n \minus{} 1)a_{n \minus{} 1}^{2}\geq\ 2na_{n \minus{} 2}$

Show that $\tan \left( \frac{\pi}{m} \right)$ is irrational for all positive integers $m \ge 5$.

Find all pairs of integers $(c, d)$, both greater than 1, such that the following holds: For any monic polynomial $Q$ of degree $d$ with integer coefficients and for any prime $p > c(2c+1)$, there exists a set $S$ of at most $\big(\tfrac{2c-1}{2c+1}\big)p$ integers, such that \[\bigcup_{s \in S} \{s,\; Q(s),\; Q(Q(s)),\; Q(Q(Q(s))),\; \dots\}\] contains a complete residue system modulo $p$ (i.e., intersects with every residue class modulo $p$).

How many positive roots does polynomial $x^{2002} + a_{2001}x^{2001} + a_{2000}x^{2000} + \cdots + a_1x + a_0$ have such that $a_{2001} = 2002$ and $a_k = -k - 1$ for $0\leq k \leq 2000$? $ \textbf{a)}\ 0 \qquad\textbf{b)}\ 1 \qquad\textbf{c)}\ 2 \qquad\textbf{d)}\ 1001 \qquad\textbf{e)}\ 2002 $

Determine the polynomial P(X) satisfying simoultaneously the conditions: a) The remainder obtained when dividing P(X) to the polynomial X^3 −2 is equal to the fourth power of quotient. b) P(−2) + P(2) = −34.

Let $ n$ be a positive integer. Find the number of odd coefficients of the polynomial \[ u_n(x) \equal{} (x^2 \plus{} x \plus{} 1)^n. \]

Let $\langle a_n\rangle $ and $ \langle b_n\rangle$ be two arithmetic sequences of numbers, and let $m$ be an integer greater than $2.$ Define $P_k(x)=x^2+a_kx+b_k,\ k=1,2,\cdots, m.$ Prove that if the quadratic expressions $P_1(x), P_m(x)$ do not have any real roots, then all the remaining polynomials also don't have real roots.

What is the maximal possible number of roots on the interval (0,1) for a polynomial of degree 2022 with integer coefficients and with the leading coefficient equal to 1?

For a nonnegative integer $n$ define $\operatorname{rad}(n)=1$ if $n=0$ or $n=1$, and $\operatorname{rad}(n)=p_1p_2\cdots p_k$ where $p_1<p_2<\cdots <p_k$ are all prime factors of $n$. Find all polynomials $f(x)$ with nonnegative integer coefficients such that $\operatorname{rad}(f(n))$ divides $\operatorname{rad}(f(n^{\operatorname{rad}(n)}))$ for every nonnegative integer $n$.

Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.

Let $f(x)=\sum_{i=0}^{n}a_ix^i$ and $g(x)=\sum_{i=0}^{n}b_ix^i$, where $a_n$,$b_n$ can be zero. Called $f(x)\ge g(x)$ if exist $r$ such that $\forall i>r,a_i=b_i,a_r>b_r$ or $f(x)=g(x)$. Prove that: if the leading coefficients of $f$ and $g$ are positive, then $f(f(x))+g(g(x))\ge f(g(x))+g(f(x))$