An arithmetic sequence of five terms is considered $good$ if it contains 19 and 20. For example, $18.5,19.0,19.5,20.0,20.5$ is a $good$ sequence. For every $good$ sequence, the sum of its terms is totalled. What is the total sum of all $good$ sequences?

Let $m \leq n$ be natural numbers. Starting with the product $t=m\cdot (m+1) \cdot (m+2) \cdot \cdots \cdot n$, let $T_{m, n}$ be the sum of products that can be obtained from deleting from $t$ pairs of consecutive integers (this includes $t$ itself). In the case where all the numbers are deleted, we assume the number $1$. For example, $T_{2, 7} = 2 \cdot 3 \cdot 4 \cdot 5 \cdot 6 \cdot 7 + 2 \cdot 3 \cdot 4 \cdot 5 + 2 \cdot 3 \cdot 4 \cdot 7 + 2 \cdot 3 \cdot 6 \cdot 7 + 2 \cdot 5 \cdot 6 \cdot 7 + 4 \cdot 5 \cdot 6 \cdot 7 + 2 \cdot 3 + 2 \cdot 5 + 2 \cdot 7 + 4 \cdot 7 + 6 \cdot 7 + 1 = 5040 + 120 + 168 + 252 + 420 + 840 + 6 + 10 + 14 + 20 + 28 + 42 + 1 = 6961$. Taking $T_{n+1, n} = 1$. Show that $T_{m, n+1}=T_{m, k-1} \cdot T_{k+2, n+1} + T_{m, k} \cdot T_{k+1, n+1}$ for all $1 \leq m \leq k \leq n$.

Do there exist non-zero reals $a$, $b$, $c$ such that, for any $n>3$, there exists a polynomial $P_{n}(x) = x^{n}+\dots+a x^{2}+bx+c$, which has exactly $n$ (not necessary distinct) integral roots? [i]N. Agakhanov, I. Bogdanov[/i]

Determine all sequences of real numbers $a_1$, $a_2$, $\ldots$, $a_{1995}$ which satisfy: \[ 2\sqrt{a_n - (n - 1)} \geq a_{n+1} - (n - 1), \ \mbox{for} \ n = 1, 2, \ldots 1994, \] and \[ 2\sqrt{a_{1995} - 1994} \geq a_1 + 1. \]

Let $I$ be an open interval of length $\frac{1}{n}$, where $n$ is a positive integer. Find the maximum possible number of rational numbers of the form $\frac{a}{b}$ where $1 \le b \le n$ that lie in $I$.

Find all functions $f :\Bbb{ R}\to \Bbb{Z}$ such that $$\left( f(f(y) - x) \right)^2+ f(x)^2 + f(y)^2 = f(y) \cdot \left( 1 + 2f(f(y)) \right),$$ for all $x, y \in \Bbb{R}.$

Prove the inequality $$\frac{1}{1!}+\frac{1}{2!}+\frac{1}{3!}+\ldots+\frac{1}{2022!}>\frac{1^2}{2!}+\frac{2^2}{3!}+\frac{3^2}{4!}+\ldots+\frac{2022^2}{2023!}$$.

Let $f(n) = n + \lfloor \sqrt{n} \rfloor$. Prove that for every positive integer $m$, the integer sequence $m, f(m), f(f(m)), \dots$ contains at least one square of an integer.

Does there exist an infinite sequence $a_1,a_2,\dotsc$ of real numbers which is bounded, not periodic, and satisfies the recursion $a_{n+1}=a_na_{n-1}+1$?

Prove that in any set of $2000$ distinct real numbers there exist two pairs $a>b$ and $c>d$ with $a \neq c$ or $b \neq d $, such that \[ \left| \frac{a-b}{c-d} - 1 \right|< \frac{1}{100000}. \]

Find the value of the following expression: $\frac{1}{2} + (\frac{1}{3} + \frac{2}{3}) + (\frac{1}{4} + \frac{2}{4} + \frac{3}{4}) + \ldots + (\frac{1}{1000} + \frac{2}{1000} + \ldots + \frac{999}{1000})$

Let $\mathbb{Q^+}$ denote the set of positive rational numbers. Determine all functions $f: \mathbb{Q^+} \to \mathbb{Q^+}$ that satisfy the conditions \[ f \left( \frac{x}{x+1}\right) = \frac{f(x)}{x+1} \qquad \text{and} \qquad f \left(\frac{1}{x}\right)=\frac{f(x)}{x^3}\] for all $x \in \mathbb{Q^+}.$

[b]p1.[/b] Find the smallest whole number $n \ge 2$ such that the product $(2^2 - 1)(3^2 - 1) ... (n^2 - 1)$ is the square of a whole number. [b]p2.[/b] The figure below shows a $ 10 \times 10$ square with small $2 \times 2$ squares removed from the corners. What is the area of the shaded region? [img]https://cdn.artofproblemsolving.com/attachments/7/5/a829487cc5d937060e8965f6da3f4744ba5588.png[/img] [b]p3.[/b] Three cars are racing: a Ford $[F]$, a Toyota $[T]$, and a Honda $[H]$. They began the race with $F$ first, then $T$, and $H$ last. During the race, $F$ was passed a total of $3$ times, $T$ was passed $5$ times, and $H$ was passed $8$ times. In what order did the cars finish? [b]p4.[/b] There are $11$ big boxes. Each one is either empty or contains $8$ medium-sized boxes inside. Each medium box is either empty or contains $8$ small boxes inside. All small boxes are empty. Among all the boxes, there are a total of $102$ empty boxes. How many boxes are there altogether? [b]p5.[/b] Ann, Mary, Pete, and finally Vlad eat ice cream from a tub, in order, one after another. Each eats at a constant rate, each at his or her own rate. Each eats for exactly the period of time that it would take the three remaining people, eating together, to consume half of the tub. After Vlad eats his portion there is no more ice cream in the tube. How many times faster would it take them to consume the tub if they all ate together? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all the polynomials with real coefficients which satisfy $ (x^2-6x+8)P(x)=(x^2+2x)P(x-2)$ for all $x\in \mathbb{R}$.

The side lengths of a triangle are the roots of a cubic polynomial with rational coefficients. Prove that the altitudes of this triangle are roots of a polynomial of sixth degree with rational coefficients.

We define the recursive polynomial $T_n(x)$ as follows: $T_0(x)=1$ $T_1(x)=x$ $T_{n+1}(x)=2xT_n(x)+T_{n-1}(x)$ $\forall n \in \mathbb N$. [b]a)[/b] find $T_2(x),T_3(x),T_4(x)$ and $T_5(x)$. [b]b)[/b] find all the roots of the polynomial $T_n(x)$ $\forall n \in \mathbb N$. [i]Proposed by Morteza Saghafian[/i]

Suppose that $$\frac{(\sqrt2)^5 + 1}{\sqrt2 + 1} \times \frac{2^5 + 1}{2 + 1} \times \frac{4^5 + 1}{4 + 1} \times \frac{16^5 + 1}{16 + 1} =\frac{m}{7 + 3\sqrt2}$$ for some integer $m$. How many $0$’s are in the binary representation of $m$? (For example, the number $20 = 10100_2$ has three $0$’s in its binary representation.)

There are $n \ge 3$ distinct positive real numbers. Show that there are at most $n-2$ different integer power of three that can be written as the sum of three distinct elements from these $n$ numbers.

Let $f:\mathbb{R}^+\to \mathbb{R}^+$ be a function such that for all $x,y \in \mathbb{R}+,\, f(x)f(y)=f(xy)+f\left(\frac{x}{y}\right)$, where $\mathbb{R}^+$ represents the positive real numbers. Given that $f(2)=3$, compute the last two digits of $f\left(2^{2^{2020}}\right)$.

Find the number of dierent positive integer triples (x; y; z) satsfying the equations x+y-z=1 and $x^2+y^2-z^2=1$.

Find all polynomials $f$ with real coefficients such that for all reals $a,b,c$ such that $ab+bc+ca = 0$ we have the following relations \[ f(a-b) + f(b-c) + f(c-a) = 2f(a+b+c). \]

Let $ m$ and $ n$ be two positive integers. Let $ a_1$, $ a_2$, $ \ldots$, $ a_m$ be $ m$ different numbers from the set $ \{1, 2,\ldots, n\}$ such that for any two indices $ i$ and $ j$ with $ 1\leq i \leq j \leq m$ and $ a_i \plus{} a_j \leq n$, there exists an index $ k$ such that $ a_i \plus{} a_j \equal{} a_k$. Show that \[ \frac {a_1 \plus{} a_2 \plus{} ... \plus{} a_m}{m} \geq \frac {n \plus{} 1}{2}. \]

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

Find all $g:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x,y\in R$, \[(4x+g(x)^2)g(y)=4g(\frac{y}{2}g(x))+4xyg(x)\]

Let $\mathbb{R}_{>0}$ be the set of the positive real numbers. Find all functions $f:\mathbb{R}_{>0} \rightarrow \mathbb{R}_{>0}$ such that $$f(xy+f(x))=f(f(x)f(y))+x$$ for all positive real numbers $x$ and $y$.