Evaluate $$\sum^{17}_{n=2} \frac{n^2+n+1}{n^4+2n^3-n^2-2n}.$$

Let $\mathbb{Q}_{>1}$ be the set of rational numbers greater than $1$. Let $f:\mathbb{Q}_{>1}\to \mathbb{Z}$ be a function that satisfies \[f(q)=\begin{cases} q-3&\textup{ if }q\textup{ is an integer,}\\ \lceil q\rceil-3+f\left(\frac{1}{\lceil q\rceil-q}\right)&\textup{ otherwise.} \end{cases}\] Show that for any $a,b\in\mathbb{Q}_{>1}$ with $\frac{1}{a}+\frac{1}{b}=1$, we have $f(a)+f(b)=-2$. [i]Proposed by usjl[/i]

Let $P(x)=ax^3+bx^2+cx+d$ be a polynomial with real coefficients such that \[\min\{d,b+d\}> \max\{|{c}|,|{a+c}|\}\] Prove that $P(x)$ do not have a real root in $[-1,1]$.

Three real numbers $ a,b,c$ satisfy the equations $ a\plus{}b\plus{}c\equal{}3, a^2\plus{}b^2\plus{}c^2\equal{}9, a^3\plus{}b^3\plus{}c^3\equal{}24.$ Find $ a^4\plus{}b^4\plus{}c^4$.

Find the sum of all real numbers $x$ such that $x^2 = 5x + 6\sqrt{x} - 3$.

Let $ a$ be the greatest positive root of the equation $ x^3 \minus{} 3 \cdot x^2 \plus{} 1 \equal{} 0.$ Show that $ \left[a^{1788} \right]$ and $ \left[a^{1988} \right]$ are both divisible by 17. Here $ [x]$ denotes the integer part of $ x.$

Given a positive integer $ n$, for all positive integers $ a_1, a_2, \cdots, a_n$ that satisfy $ a_1 \equal{} 1$, $ a_{i \plus{} 1} \leq a_i \plus{} 1$, find $ \displaystyle \sum_{i \equal{} 1}^{n} a_1a_2 \cdots a_i$.

How many pairs of positive integers $(a,b)$ are there such that the roots of polynomial $x^2-ax-b$ are not greater than $5$? $ \textbf{(A)}\ 40 \qquad\textbf{(B)}\ 50 \qquad\textbf{(C)}\ 65 \qquad\textbf{(D)}\ 75 \qquad\textbf{(E)}\ \text{None of the preceding} $

Let $q$ be a real number. Gugu has a napkin with ten distinct real numbers written on it, and he writes the following three lines of real numbers on the blackboard: [list] [*]In the first line, Gugu writes down every number of the form $a-b$, where $a$ and $b$ are two (not necessarily distinct) numbers on his napkin. [*]In the second line, Gugu writes down every number of the form $qab$, where $a$ and $b$ are two (not necessarily distinct) numbers from the first line. [*]In the third line, Gugu writes down every number of the form $a^2+b^2-c^2-d^2$, where $a, b, c, d$ are four (not necessarily distinct) numbers from the first line. [/list] Determine all values of $q$ such that, regardless of the numbers on Gugu's napkin, every number in the second line is also a number in the third line.

Let a polynomial $p(x)$ with integer coefficients take the value $5$ for five different integer values of $x.$ Prove that $p(x)$ does not take the value $8$ for any integer $x.$

Let be a natural number $ n\ge 2 $ and an expression of $ n $ variables $$ E\left( x_1,x_2,...,x_n\right) =x_1^2+x_2^2+\cdots +x_n^2-x_1x_2-x_2x_3-\cdots -x_{n-1}x_n -x_nx_1. $$ Determine $ \sup_{x_1,...,x_n\in [0,1]} E\left( x_1,x_2,...,x_n\right) $ and the specific values at which this supremum is attained.

Let $k\geq 2$,$n_1,n_2,\cdots ,n_k\in \mathbb{N}_+$,satisfied $n_2|2^{n_1}-1,n_3|2^{n_2}-1,\cdots ,n_k|2^{n_{k-1}}-1,n_1|2^{n_k}-1$. Prove:$n_ 1=n_ 2=\cdots=n_k=1$.

Given the positive numbers $a$ and $b$ and the natural number $n$, find the greatest among the $n + 1$ monomials in the binomial expansion of $\left(a+b\right)^n$.

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying \[f(x+f(y))=x+f(f(y))\] for all real numbers $x$ and $y$, with the additional constraint $f(2004)=2005$.

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [b]L.10[/b] Given the following system of equations where $x, y, z$ are nonzero, find $x^2 + y^2 + z^2$. $$x + 2y = xy$$ $$3y + z = yz$$ $$3x + 2z = xz$$ [u]Set 4[/u] [b]L.16 / D.23[/b] Anson, Billiam, and Connor are looking at a $3D$ figure. The figure is made of unit cubes and is sitting on the ground. No cubes are floating; in other words, each unit cube must either have another unit cube or the ground directly under it. Anson looks from the left side and says, “I see a $5 \times 5$ square.” Billiam looks from the front and says the same thing. Connor looks from the top and says the same thing. Find the absolute difference between the minimum and maximum volume of the figure. [b]L.17[/b] The repeating decimal $0.\overline{MBMT}$ is equal to $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers, and $M, B, T$ are distinct digits. Find the minimum value of $q$. [b]L.18[/b] Annie, Bob, and Claire have a bag containing the numbers $1, 2, 3, . . . , 9$. Annie randomly chooses three numbers without replacement, then Bob chooses, then Claire gets the remaining three numbers. Find the probability that everyone is holding an arithmetic sequence. (Order does not matter, so $123$, $213$, and $321$ all count as arithmetic sequences.) [b]L.19[/b] Consider a set $S$ of positive integers. Define the operation $f(S)$ to be the smallest integer $n > 1$ such that the base $2^k$ representation of $n$ consists only of ones and zeros for all $k \in S$. Find the size of the largest set $S$ such that $f(S) < 2^{2019}$. [b]L.20 / D.25[/b] Find the largest solution to the equation $$2019(x^{2019x^{2019}-2019^2+2019})^{2019} = 2019^{x^{2019}+1}.$$ [u]Set 5[/u] [b]L.21[/b] Steven is concerned about his artistic abilities. To make himself feel better, he creates a $100 \times 100$ square grid and randomly paints each square either white or black, each with probability $\frac12$. Then, he divides the white squares into connected components, groups of white squares that are connected to each other, possibly using corners. (For example, there are three connected components in the following diagram.) What is the expected number of connected components with 1 square, to the nearest integer? [img]https://cdn.artofproblemsolving.com/attachments/e/d/c76e81cd44c3e1e818f6cf89877e56da2fc42f.png[/img] [b]L.22[/b] Let x be chosen uniformly at random from $[0, 1]$. Let n be the smallest positive integer such that $3^n x$ is at most $\frac14$ away from an integer. What is the expected value of $n$? [b]L.23[/b] Let $A$ and $B$ be two points in the plane with $AB = 1$. Let $\ell$ be a variable line through $A$. Let $\ell'$ be a line through $B$ perpendicular to $\ell$. Let X be on $\ell$ and $Y$ be on $\ell'$ with $AX = BY = 1$. Find the length of the locus of the midpoint of $XY$ . [b]L.24[/b] Each of the numbers $a_i$, where $1 \le i \le n$, is either $-1$ or $1$. Also, $$a_1a_2a_3a_4+a_2a_3a_4a_5+...+a_{n-3}a_{n-2}a_{n-1}a_n+a_{n-2}a_{n-1}a_na_1+a_{n-1}a_na_1a_2+a_na_1a_2a_3 = 0.$$ Find the number of possible values for $n$ between $4$ and $100$, inclusive. [b]L.25[/b] Let $S$ be the set of positive integers less than $3^{2019}$ that have only zeros and ones in their base $3$ representation. Find the sum of the squares of the elements of $S$. Express your answer in the form $a^b(c^d - 1)(e^f - 1)$, where $a, b, c, d, e, f$ are positive integers and $a, c, e$ are not perfect powers. PS. You should use hide for answers. D.1-15 / L1-9 problems have been collected [url=https://artofproblemsolving.com/community/c3h2790795p24541357]here [/url] and D.16-30/ L10-15 [url=https://artofproblemsolving.com/community/c3h2790818p24541688]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all solutions of $2^n + 7 = x^2$ in which n and x are both integers . Prove that there are no other solutions.

Given $n$ integers $a_1, a_2, ..., a_n$, which $a_1 = 1$ and $a_i \le a_{i + 1} \le 2a_i$ for each $i \in \{1,2,...,n-1\}$ . Prove that if $a_1 + a_2 +... + a_n$ is even, you do select some of the numbers so that their sum equals $\frac{a_1 + a_2 +... + a_n}{2}$ .

Find the real number $k$ such that $a$, $b$, $c$, and $d$ are real numbers that satisfy the system of equations \begin{align*} abcd &= 2007,\\ a &= \sqrt{55 + \sqrt{k+a}},\\ b &= \sqrt{55 - \sqrt{k+b}},\\ c &= \sqrt{55 + \sqrt{k-c}},\\ d &= \sqrt{55 - \sqrt{k-d}}. \end{align*}

Let $\left(a_k\right)_{k=1}^\infty$ be a sequence of real numbers such that \[a_{k-1}+a_{k+1}\ge2a_k\] for all $k>1.$ For $n\ge1$ denote \[A_n=\frac1n\left(a_1+\cdots+a_n\right).\] Show that also the inequality \[A_{n-1}+A_{n+1}\ge2A_n\] holds for every $n>1.$

Let $S_r(n)=1^r+2^r+\cdots+n^r$ where $n$ is a positive integer and $r$ is a rational number. If $S_a(n)=(S_b(n))^c$ for all positive integers $n$ where $a, b$ are positive rationals and $c$ is positive integer then we call $(a,b,c)$ as [i]nice triple.[/i] Find all nice triples.

For every positive integer $m$ prove the inquality $|\{\sqrt{m}\} - \frac{1}{2}| \geq \frac{1}{8(\sqrt m+1)} $ (The integer part $[x]$ of the number $x$ is the largest integer not exceeding $x$. The fractional part of the number $x$ is a number $\{x\}$ such that $[x]+\{x\}=x$.) A. Golovanov

Prove that every positive integer can be written as a finite sum of distinct integral powers of the golden ratio.

Two sums, each consisting of $n$ addends , are shown below: $S = 1 + 2 + 3 + 4 + ...$ $T = 100 + 98 + 96 + 94 +...$ . For what value of $n$ is it true that $S = T$ ?

Find $$\sum^{k=672}_{k=0} { 2018\choose {3k+2}} \,\, (mod \, 3)$$

Find all positive numbers $x$ such that:$$\frac{1}{[x]}-\frac{1}{[2x]}=\frac{1}{6\{x\}}$$ where $[x]$ represents the integer part of $x$ and $\{x\}=x-[x]$.