There are relatively prime positive integers $s$ and $t$ such that $$\sum_{n=2}^{100}\left(\frac{n}{n^2-1}- \frac{1}{n}\right)=\frac{s}{t}$$ Find $s + t$.

a) The numbers $1, 2, . . . , 49$ are arranged in a square table as follows: [img]https://cdn.artofproblemsolving.com/attachments/5/0/c2e350a6ad0ebb8c728affe0ebb70783baf913.png[/img] Among these numbers we select an arbitrary number and delete from the table the row and the column which contain this number. We do the same with the remaining table of $36$ numbers, etc., $7$ times. Find the sum of the numbers selected. b) The numbers $1, 2, . . . , k^2$ are arranged in a square table as follows: [img]https://cdn.artofproblemsolving.com/attachments/2/d/28d60518952c3acddc303e427483211c42cd4a.png[/img] Among these numbers we select an arbitrary number and delete from the table the row and the column which contain this number. We do the same with the remaining table of $(k - 1)^2$ numbers, etc., $k$ times. Find the sum of the numbers selected.

Let $a_1$ , $\ldots$ , $a_n$ be positive integers and $a$ a positive integer that is greater than $1$ and is divisible by the product $a_1a_2\ldots a_n$. Prove that $a^{n+1}+a-1$ is not divisible by the product $(a+a_1-1)(a+a_2-1)\ldots(a+a_n-1)$.

Let $ k \equal{} \sqrt[3]{3}$. a, Find all polynomials $ p(x)$ with rationl coefficients whose degree are as least as possible such that $ p(k \plus{} k^2) \equal{} 3 \plus{} k$. b, Does there exist a polynomial $ p(x)$ with integer coefficients satisfying $ p(k \plus{} k^2) \equal{} 3 \plus{} k$

Let $n$ ($n \ge 1$) be an integer. Consider the equation $2\cdot \lfloor{\frac{1}{2x}}\rfloor - n + 1 = (n + 1)(1 - nx)$, where $x$ is the unknown real variable. (a) Solve the equation for $n = 8$. (b) Prove that there exists an integer $n$ for which the equation has at least $2021$ solutions. (For any real number $y$ by $\lfloor{y} \rfloor$ we denote the largest integer $m$ such that $m \le y$.)

Complex numbers ${x_i},{y_i}$ satisfy $\left| {{x_i}} \right| = \left| {{y_i}} \right| = 1$ for $i=1,2,\ldots ,n$. Let $x=\frac{1}{n}\sum\limits_{i=1}^n{{x_i}}$, $y=\frac{1}{n}\sum\limits_{i=1}^n{{y_i}}$ and $z_i=x{y_i}+y{x_i}-{x_i}{y_i}$. Prove that $\sum\limits_{i=1}^n{\left| {{z_i}}\right|}\leqslant n$.

For each prime $p$ of the form $4k+3$ with $k \in \mathbb{Z}^+$, consider the polynomial $$Q(x)=px^{2p} - x^{2p-1} + p^2x^{\frac{3p+1}{2}} - px^{p+1} +2(p^2+1)x^p -px^{p-1}+ p^2 x^{\frac{p-1}{2}} -x + p.$$ Determine all ordered pairs of polynomials $f, g$ with integer coefficients such that $Q(x)=f(x)g(x)$.

Let $S_n = 1 + 2 + ,,, + n$. Define $$T_n =\frac{S_2}{S_2- 1}\cdot \frac{S_3}{S_3 - 1}\cdot ... \cdot \frac{S_n}{S_n - 1}.$$ Find $T_{2015}.$

Let $A$ be a set of functions $f : R\to R$. For all $f_1, f_2 \in A$ there exists a $f_3 \in A$ such that $f_1(f_2(y) - x)+ 2x = f_3(x + y)$ for all $x, y \in R$. Prove that for all $f \in A$, we have $f(x - f(x))= 0$ for all $x \in R$.

Show that \[ \cos x^2 + \cos y^2 - \cos xy < 3 \] for reals $x$, $y$.

Let $r_1=2$ and $r_n = \prod^{n-1}_{k=1} r_i + 1$, $n \geq 2.$ Prove that among all sets of positive integers such that $\sum^{n}_{k=1} \frac{1}{a_i} < 1,$ the partial sequences $r_1,r_2, ... , r_n$ are the one that gets nearer to 1.

Find all real polynomials $P(x)$ such that for every four distinct natural numbers $a, b, c, d$ such that $a^2 + b^2 + c^2 = 2d^2$ with $gcd(a, b, c, d) = 1$ the following equality holds: $$2(P(d))^2 + 2P(ab + bc + ca) = (P(a + b + c))^2$$ .

Let an odd prime $p$ be a given number satisfying $2^h \neq 1 \pmod{p}$ for all $h < p-1, h \in \mathbb{N}^{*},$ and an even integer $a \in \left(\frac{p}{2},p \right).$ Let us consider the sequence $\{a_n\}^{\infty}_{n=0}$ defined by $a_0 = a$ and $a_{n+1} = p - b_n$ for $n = 0, 1, 2, \ldots$, where $b_n$ is the greatest odd divisor of $a_n.$ Show that $\{a_n\}$ is periodical and find its least positive period.

Find all real functions $f$ defined on the real numbers except zero, satisfying $f(2019) = 1$ and $f(x)f(y)+ f\left(\frac{2019}{x}\right) f\left(\frac{2019}{y}\right) =2f(xy)$ for all $x,y \ne 0$

Find all functions $f$ from the set of real numbers into the set of real numbers which satisfy for all $x$, $y$ the identity \[ f\left(xf(x+y)\right) = f\left(yf(x)\right) +x^2\] [i]Proposed by Japan[/i]

Let $ g: \mathbb{C} \rightarrow \mathbb{C}$, $ \omega \in \mathbb{C}$, $ a \in \mathbb{C}$, $ \omega^3 \equal{} 1$, and $ \omega \ne 1$. Show that there is one and only one function $ f: \mathbb{C} \rightarrow \mathbb{C}$ such that \[ f(z) \plus{} f(\omega z \plus{} a) \equal{} g(z),z\in \mathbb{C} \]

Let $W$ be a fixed positive integer. Let $S$ be the set of all pairs $(a, b)$ of positive integers such that $a \neq b$. For each $(a, b) \in S$, let $m(a,b)$ be the largest integer satisfying \[ m(a, b) \leq \frac{1 + na}{1 + nb} \] for all integers $n \geq 1$. (a) For each $(a, b) \in S$, prove that there exists a positive integer $k$ such that \[ m(a,b) \leq \frac{1 + na}{W + nb} \] for all $n \geq k$. (b) For each $(a, b) \in S$, let $k(a,b)$ be the smallest value of $k$ that satisfies the condition of part (a). Determine $\max \{k(a,b) \mid (a,b) \in S \}$ or prove that it does not exist.

Given are real numbers $a_1, a_2,..., a_{2020}$, not necessarily different. For every $n \ge 2020$, define $a_{n + 1}$ as the smallest real zero of the polynomial $$P_n (x) = x^{2n} + a_1x^{2n - 2} + a_2x^{2n - 4} +... + a_{n -1}x^2 + a_n$$, if it exists. Assume that $a_{n + 1}$ exists for all $n \ge 2020$. Prove that $a_{n + 1} \le a_n$ for all $n \ge 2021$.

Point $P$ is inside $\triangle ABC$. Line segments $APD$, $BPE$, and $CPF$ are drawn with $D$ on $BC$, $E$ on $AC$, and $F$ on $AB$ (see the figure at right). Given that $AP=6$, $BP=9$, $PD=6$, $PE=3$, and $CF=20$, find the area of $\triangle ABC$. [asy] size(200); pair A=origin, B=(7,0), C=(3.2,15), D=midpoint(B--C), F=(3,0), P=intersectionpoint(C--F, A--D), ex=B+40*dir(B--P), E=intersectionpoint(B--ex, A--C); draw(A--B--C--A--D^^C--F^^B--E); pair point=P; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$P$", P, dir(0));[/asy]

[b]p1.[/b] Function $f$ is defined by $f (x) = ax+b$ for some real values $a, b > 0$. If $f (f (x)) = 9x + 5$ for all $x$, find $b$. [b]p2.[/b] At some point during a game, Will Avery has made $1/3$ of his shots. When he shoots once and makes a basket, his average increases to $2/5$. Find his average (expressed as a fraction) after a second additional basket. [b]p3.[/b] A dealer has a deck of $1999$ cards. He takes the top card off and “ducks” it, that is, places it on the bottom of the deck. He deals the second card onto the table. He ducks the third card, deals the fourth card, ducks the fifth card, deals the sixth card, and so forth, continuing until he has only one card left; he then ducks the last card with itself and deals it. Some of the cards (like the second and fourth cards) are not ducked at all before being dealt, while others are ducked multiple times. The question is: what is the average number of ducks per card? [b]p4.[/b] Point $P$ lies outside circle $O$. Perpendicular lines $\ell$ and m intersect at $P$. Line $\ell$ is tangent to circle $O$ at a point $6$ units from $P$. Line $m$ crosses circle $O$ at a point $4$ units from $P$. Find the radius of circle $O$. [b]p5.[/b] Define $f(n)$ by $$f(n) = \begin{cases} n/2 \,\,\,\text{if} \,\,\, n\,\,\,is\,\,\, even \\ (n + 1023)/2\,\,\, \text{if} \,\,\, n\,\,\,is\,\,\, odd \end{cases}$$ Find the least positive integer $n$ such that $f(f(f(f(f(n))))) = n.$ [b]p6.[/b] Write $\sqrt{10001}$ to the sixth decimal place, rounding down. [b]p7.[/b] Define $(a_n)$ recursively by $a_1 = 1$, $a_n = 20 \cos (a_{n-1}^o)$. As $n$ tends to infinity, $(a_n)$ tends to $18.9195...$. Define $(b_n)$ recursively by $b_1 = 1$, $b_n =\sqrt{800 + 800 \cos (b_{n-1}^o)}$. As $n$ tends to infinity, $(b_n)$ tends to $x$. Calculate $x$ to three decimal places. [b]p8.[/b] Let $mod_d (k)$ be the remainder of $k$ when divided by $d$. Find the number of positive integers $n$ satisfying $$mod_n(1999) = n^2 - 89n + 1999$$ [b]p9.[/b] Let $f(x) = x^3 + x$. Compute $$\sum^{10}_{k=1} \frac{1}{1 + f^{-1}(k - 1)^2 + f^{-1}(k - 1)f^{-1}(k) + f^{-1}(k)^2}$$ ($f^{-1}$ is the inverse of $f$: $f (f^{-1}1 (x)) = f^{-1}1 (f (x)) = x$ for all $x$.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

What is the sum of the squares of the roots of the equation $x^2 -7 \lfloor x\rfloor +5=0$ ?

Let $a, b$, and $c$ be distinct positive integers such that $a + 2b + 3c < 12$. Which of the following inequalities must be true? A. $a + b + c < 7$ B. $a- b + c < 4$ C. $b + c- a < 3$ D. $a + b- c <5 $ E. $5a + 3b + c < 27$

Prove that if the numbers $ a, b, c $, are the lengths of the sides of a triangle and the sum of the numbers $x,y,z$ is zero, then $$a^2yz + b^2zx + c^2xy \leq 0.$$

Ali Barber, the carpet merchant, has a rectangular piece of carpet whose dimensions are unknown. Unfortunately, his tape measure is broken and he has no other measuring instruments. However, he finds that if he lays it flat on the floor of either of his storerooms, then each corner of the carpet touches a different wall of that room. If the two rooms have dimensions of 38 feet by 55 feet and 50 feet by 55 feet, what are the carpet dimensions?

Find all functions $f : \mathbb{R}\to\mathbb{R}$ such that $f(0) = 0$ and for any real numbers $x, y$ the following equality holds \[f(x^2+yf(x))+f(y^2+xf(y))=f(x+y)^2.\]