a) Let $(a_n)$ be the sequence defined by $a_n=\ln (2n^2+1)-\ln (n^2+n+1)\,\,\forall n\geq 1.$ Prove that the set $\{n\in\mathbb{N}|\,\{a_n\}<\dfrac{1}{2}\}$ is a finite set; b) Let $(b_n)$ be the sequence defined by $a_n=\ln (2n^2+1)+\ln (n^2+n+1)\,\,\forall n\geq 1$. Prove that the set $\{n\in\mathbb{N}|\,\{b_n\}<\dfrac{1}{2016}\}$ is an infinite set.

Three speed skaters have a friendly "race" on a skating oval. They all start from the same point and skate in the same direction, but with different speeds that they maintain throughout the race. The slowest skater does $1$ lap per minute, the fastest one does $3.14$ laps per minute, and the middle one does $L$ laps a minute for some $1 < L < 3.14$. The race ends at the moment when all three skaters again come together to the same point on the oval (which may differ from the starting point.) Determine the number of different choices for $L$ such that exactly $117$ passings occur before the end of the race. Note: A passing is defined as when one skater passes another one. The beginning and the end of the race when all three skaters are together are not counted as passings.

Let $P(x)$ be a polynomial with real coefficients. Prove that not all roots of $x^3P(x)+1$ are real.

Find all functions $f : \mathbb{N}\rightarrow \mathbb{N}$ satisfying following condition: \[f(n+1)>f(f(n)), \quad \forall n \in \mathbb{N}.\]

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. The coordinates of all vertices of a given rectangle are Fibonacci numbers. Suppose that the rectangle is not such that one of its vertices is on the $x$-axis and another on the $y$-axis. Prove that either the sides of the rectangle are parallel to the axes, or make an angle of $45^{\circ}$ with the axes.

Suppose $p''(x) = 4x^2 + 4x + 2$ where $$p(x) = a_0 + a_1(x - 1) + a_2(x -2)^2 + a_3(x- 3)^4 + a_4(x-4)^4.$$ We have $p'(-3) = -24$ and $p(x)$ has the unique property that the sum of the third powers of the roots of $p(x)$ is equal to the sum of the fourth powers of the roots of $p(x)$ . Find $a_0$.

Prove that $4x^3-3x+1=2y^2$ has at least $31$ solutions in positive integers $x,y$ with $x\le 1980$. [i] Variant: [/i] Prove the equation $4x^3-3x+1=2y^2$ has infinitely many solutions in positive integers x,y.

Let $P \in \mathbb{R}[x]$. Suppose that the multiset of real roots (where roots are counted with multiplicity) of $P(x)-x$ and $P^3(x)-x$ are distinct. Prove that for all $n\in \mathbb{N}$, $P^n(x)-x$ has at least $\sigma(n)-2$ distinct real roots. (Here $P^n(x):=P(P^{n-1}(x))$ with $P^1(x) = P(x)$, and $\sigma(n)$ is the sum of all positive divisors of $n$). [i]Proposed by Malay Mahajan[/i]

Let $P(x)$ and $Q(x)$ be two polynomials with integer coefficients, such that no nonconstant polynomial with rational coefficients divides both $P(x)$ and $Q(x).$ Suppose that for every positive integer $n$ the integers $P(n)$ and $Q(n)$ are positive, and $2^{Q(n)}-1$ divides $3^{P(n)}-1.$ Prove that $Q(x)$ is a constant polynomial. [i]Proposed by Oleksiy Klurman, Ukraine[/i]

Carol was given three numbers and was asked to add the largest of the three to the product of the other two. Instead, she multiplied the largest with the sum of the other two, but still got the right answer. What is the sum of the three numbers?

Let $\{x_n\}_n$ be a sequence of positive rational numbers, such that $x_1$ is a positive integer, and for all positive integers $n$. $x_n = \frac{2(n - 1)}{n} x_{n-1}$, if $x_{n_1} \le 1$ $x_n = \frac{(n - 1)x_{n-1} - 1}{n}$ , if $x_{n_1} > 1$. Prove that there exists a constant subsequence of $\{x_n\}_n$.

Find all strictly increasing functions $f:\mathbb{N}\rightarrow\mathbb{N}$ that satisfy \[f(n+f(n))=2f(n)\quad\text{for all}\ n\in\mathbb{N} \]

Let $a, b, c, d, e,$ and $f$ be real numbers. Define the polynomials \[ P(x) = 2x^4 - 26x^3 + ax^2 + bx + c \quad\text{ and }\quad Q(x) = 5x^4 - 80x^3 + dx^2 + ex + f. \] Let $S$ be the set of all complex numbers which are a root of [i]either[/i] $P$ or $Q$ (or both). Given that $S = \{1,2,3,4,5\}$, compute $P(6) \cdot Q(6).$ [i]Proposed by Michael Tang[/i]

Let $\mathbb R$ be the set of real numbers. Determine all functions $f:\mathbb R\to\mathbb R$ that satisfy the equation\[f(x+f(x+y))+f(xy)=x+f(x+y)+yf(x)\]for all real numbers $x$ and $y$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Prove that for every natural number $ n $ the inequality holds $$ 1 + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + \ldots + \frac{1}{\sqrt{n}} > \sqrt{n-1}.$$

Determine the number of $8$-tuples $(\epsilon_1, \epsilon_2,...,\epsilon_8)$ such that $\epsilon_1, \epsilon_2, ..., 8 \in \{1,-1\}$ and $\epsilon_1 + 2\epsilon_2 + 3\epsilon_3 +...+ 8\epsilon_8$ is a multiple of $3$.

For real numbers $a$ and $b$, define the sequence $\{x_{a,b}(n)\}$ as follows: $x_{a,b}(1)=a$, $x_{a,b}(2)=b$, and for $n>1$, $x_{a,b}(n+1)=(x_{a+b}(n-1))^2+(x_{a,b}(n))^2$. For real numbers $c$ and $d$, define the sequence $\{y_{c,d}(n)\}$ as follows: $y_{c,d}(1)=c$, $y_{c,d}(2)=d$, and for $n>1$, $y_{c,d}(n+1)=(y_{c,d}(n-1)+y_{c,d}(n))^2$. Call $(a,b,c)$ a good triple if there exists $d$ such that for all $n$ sufficiently large, $y_{c,d}(n)=(x_{a,b}(n))^2$. For some $(a,b)$ there are exactly three values of $c$ that make $(a,b,c)$ a good triple. Among these pairs $(a,b)$, compute the maximum value of $\lfloor 100(a+b)\rfloor$.

The points that satisfy the system $ x \plus{} y \equal{} 1,\, x^2 \plus{} y^2 < 25,$ constitute the following set: $ \textbf{(A)}\ \text{only two points} \qquad \\ \textbf{(B)}\ \text{an arc of a circle}\qquad \\ \textbf{(C)}\ \text{a straight line segment not including the end\minus{}points}\qquad \\ \textbf{(D)}\ \text{a straight line segment including the end\minus{}points}\qquad \\ \textbf{(E)}\ \text{a single point}$

Find the maximal value of $c>0$ such that for any $n\ge 1$, and for any $n$ real numbers $x_1, \cdots, x_n$ there exists real numbers $a ,b$ such that $$\{x_i-a\}+\{x_{i+1}-b\}\le \frac{1}{2024}$$ for at least $cn$ indices $i$. Here, $x_{n+1}=x_1$ and $\{x\}$ denotes the fractional part of $x$. [i]Proposed by Wong Jer Ren[/i]

Let \(x\) and \(y\) be positive real numbers satisfying the following system of equations: \[ \begin{cases} \sqrt{x}\left(2 + \dfrac{5}{x+y}\right) = 3 \\\\ \sqrt{y}\left(2 - \dfrac{5}{x+y}\right) = 2 \end{cases} \] Find the maximum value of \(x + y\).

find all polynomials with integer coefficients that $P(\mathbb{Z})= ${$p(a):a\in \mathbb{Z}$} has a Geometric progression.

Let $x, y,$ and $z$ be positive real numbers such that $xy + yz + zx = 3$. Prove that $$\frac{x + 3}{y + z} + \frac{y + 3}{z + x} + \frac{z + 3}{x + y} + 3 \ge 27 \cdot \frac{(\sqrt{x} + \sqrt{y} + \sqrt{z})^2}{(x + y + z)^3}.$$ Proposed by [i]Petar Filipovski, Macedonia[/i]

Given an infinite sequence of numbers $a_1, a_2, a_3, ...$ such that for each positive integer $k$, there exists positive integer $t$ for which $a_k = a_{k+t} = a_{k+2t} = ....$ Does this sequences must be periodic?

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u] Set 1[/u] [b]R1.1 / P1.1[/b] Find $291 + 503 - 91 + 492 - 103 - 392$. [b]R1.2[/b] Let the operation $a$ & $b$ be defined to be $\frac{a-b}{a+b}$. What is $3$ & $-2$? [b]R1.3[/b]. Joe can trade $5$ apples for $3$ oranges, and trade $6$ oranges for $5$ bananas. If he has $20$ apples, what is the largest number of bananas he can trade for? [b]R1.4[/b] A cone has a base with radius $3$ and a height of $5$. What is its volume? Express your answer in terms of $\pi$. [b]R1.5[/b] Guang brought dumplings to school for lunch, but by the time his lunch period comes around, he only has two dumplings left! He tries to remember what happened to the dumplings. He first traded $\frac34$ of his dumplings for Arman’s samosas, then he gave $3$ dumplings to Anish, and lastly he gave David $\frac12$ of the dumplings he had left. How many dumplings did Guang bring to school? [u]Set 2[/u] [b]R2.6 / P1.3[/b] In the recording studio, Kanye has $10$ different beats, $9$ different manuscripts, and 8 different samples. If he must choose $1$ beat, $1$ manuscript, and $1$ sample for his new song, how many selections can he make? [b]R2.7[/b] How many lines of symmetry does a regular dodecagon (a polygon with $12$ sides) have? [b]R2.8[/b] Let there be numbers $a, b, c$ such that $ab = 3$ and $abc = 9$. What is the value of $c$? [b]R2.9[/b] How many odd composite numbers are there between $1$ and $20$? [b]R2.10[/b] Consider the line given by the equation $3x - 5y = 2$. David is looking at another line of the form ax - 15y = 5, where a is a real number. What is the value of a such that the two lines do not intersect at any point? [u]Set 3[/u] [b]R3.11[/b] Let $ABCD$ be a rectangle such that $AB = 4$ and $BC = 3$. What is the length of BD? [b]R3.12[/b] Daniel is walking at a constant rate on a $100$-meter long moving walkway. The walkway moves at $3$ m/s. If it takes Daniel $20$ seconds to traverse the walkway, find his walking speed (excluding the speed of the walkway) in m/s. [b]R3.13 / P1.3[/b] Pratik has a $6$ sided die with the numbers $1, 2, 3, 4, 6$, and $12$ on the faces. He rolls the die twice and records the two numbers that turn up on top. What is the probability that the product of the two numbers is less than or equal to $12$? [b]R3.14 / P1.5[/b] Find the two-digit number such that the sum of its digits is twice the product of its digits. [b]R3.15[/b] If $a^2 + 2a = 120$, what is the value of $2a^2 + 4a + 1$? PS. You should use hide for answers. R16-30 /P6-10/ P26-30 have been posted [url=https://artofproblemsolving.com/community/c3h2786837p24497019]here[/url], and P11-25 [url=https://artofproblemsolving.com/community/c3h2786880p24497350]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The Serpent Gorynych has $1976$ heads. The fabulous hero can cut down $33, 21, 17$ or $1$ head with one blow of the sword, but at the same time, the Serpent grows, respectively, $48, 0, 14$ or $349$ heads. If all the heads are cut off, then no new heads will grow. Will the hero be able to defeat the Serpent?