Let's call a function $f:\mathbb R\to\mathbb R$[i] weakly periodic[/i] if it is continuous and $f(x+1)=f(f(x))+1$ for all $x\in\mathbb R$. a) Does there exist a weakly periodic function such that $f(x)>x$ for all $x\in\mathbb R$? b) Does there exist a weakly periodic function such that $f(x)<x$ for all $x\in\mathbb R$? [i]Proposed by: András Imolay, Budapest[/i]

On the plane are given unit vectors $\overrightarrow{a_1},\overrightarrow{a_2},\overrightarrow{a_3}$. Show that one can choose numbers $c_1,c_2,c_3 \in \{-1,1\}$ such that the length of the vector $c_1\overrightarrow{a_1}+c_2\overrightarrow{a_2}+c_3\overrightarrow{a_3}$ is at least $2$.

Define the function $f(n)$ for positive integers $n$ as follows: if $n$ is prime, then $f(n) = 1$; and $f(ab) = a \cdot f(b)+f(a)\cdot b$ for all positive integers $a$ and $b$. How many positive integers $n$ less than $5^{50}$ have the property that $f(n) = n$?

[b]p1.[/b] To convert between Fahrenheit, $F$, and Celsius, $C$, the formula is $F = \frac95 C + 32$. Jennifer, having no time to be this precise, instead approximates the temperature of Fahrenheit, $\widehat F$, as $\widehat F = 2C + 30$. There is a range of temperatures $C_1 \le C \le C_2$ such that for any $C$ in this range, $| \widehat F - F| \le 5$. Compute the ordered pair $(C_1,C_2)$. [b]p2.[/b] Compute integer $x$ such that $x^{23} = 27368747340080916343$. [b]p3.[/b] The number of ways to flip $n$ fair coins such that there are no three heads in a row can be expressed with the recurrence relation $$ S(n + 1) = a_0 S(n) + a_1 S(n - 1) + ... + a_k S(n - k) $$ for sufficiently large $n$ and $k$ where $S(n)$ is the number of valid sequences of length $n$. What is $\sum^k_{n=0}|a_n|$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a polynomial$$P(x)=x^n+a_{n-1}x^{n-1}+...+a_1x+a_0\in \mathbb{Z}[x]$$ with degree $n\ge 2$ and $a_o\ne 0.$ Prove that if $|a_{n-1}|>1+|a_{n-2}|+...+|a_1|+|a_0|$, then $P(x)$ is irreducible in $\mathbb{Z}[x].$

Let $\mathcal{A}$ denote the set of all polynomials in three variables $x, y, z$ with integer coefficients. Let $\mathcal{B}$ denote the subset of $\mathcal{A}$ formed by all polynomials which can be expressed as \begin{align*} (x + y + z)P(x, y, z) + (xy + yz + zx)Q(x, y, z) + xyzR(x, y, z) \end{align*} with $P, Q, R \in \mathcal{A}$. Find the smallest non-negative integer $n$ such that $x^i y^j z^k \in \mathcal{B}$ for all non-negative integers $i, j, k$ satisfying $i + j + k \geq n$.

Let $a, b, c$ be three real numbers which are roots of a cubic polynomial, and satisfy $a+b+c=6$ and $ab+bc+ca=9$. Suppose $a<b<c$. Show that $$0<a<1<b<3<c<4.$$

Find, with proof, all real numbers $ x \in \lbrack 0, \frac {\pi}{2} \rbrack$, such that $ (2 \minus{} \sin 2x)\sin (x \plus{} \frac {\pi}{4}) \equal{} 1$.

Find all square roots of integers, namely $ p, $ such that $ \left(\frac{p}{2}\right)^2 <3<\left(\frac{p+1}{2}\right)^2. $

[b]p1.[/b] Martin’s car insurance costed $\$6000$ before he switched to Geico, when he saved $15\%$ on car insurance. When Mayhem switched to Allstate, he, a safe driver, saved $40\%$ on car insurance. If Mayhem and Martin are now paying the same amount for car insurance, how much was Mayhem paying before he switched to Allstate? [b]p2.[/b] The $7$-digit number $N$ can be written as $\underline{A} \,\, \underline{2} \,\,\underline{0} \,\,\underline{B} \,\,\underline{2} \,\, \underline{1} \,\,\underline{5}$. How many values of $N$ are divisible by $9$? [b]p3.[/b] The solutions to the equation $x^2-18x-115 = 0$ can be represented as $a$ and $b$. What is $a^2+2ab+b^2$? [b]p4.[/b] The exterior angles of a regular polygon measure to $4$ degrees. What is a third of the number of sides of this polygon? [b]p5.[/b] Charlie Brown is having a thanksgiving party. $\bullet$ He wants one turkey, with three different sizes to choose from. $\bullet$ He wants to have two or three vegetable dishes, when he can pick from Mashed Potatoes, Saut´eed Brussels Sprouts, Roasted Butternut Squash, Buttery Green Beans, and Sweet Yams; $\bullet$ He wants two desserts out of Pumpkin Pie, Apple Pie, Carrot Cake, and Cheesecake. How many different combinations of menus are there? [b]p6.[/b] In the diagram below, $\overline{AD} \cong \overline{CD}$ and $\vartriangle DAB$ is a right triangle with $\angle DAB = 90^o$. Given that the radius of the circle is $6$ and $m \angle ADC = 30^o$, if the length of minor arc $AB$ is written as $a\pi$, what is $a$? [img]https://cdn.artofproblemsolving.com/attachments/d/9/ea57032a30c16f4402886af086064261d6828b.png[/img] [b]p7.[/b] This Halloween, Owen and his two friends dressed up as guards from Squid Game. They needed to make three masks, which were black circles with a white equilateral triangle, circle, or square inscribed in their upper halves. Resourcefully, they used black paper circles with a radius of $5$ inches and white tape to create these masks. Ignoring the width of the tape, how much tape did they use? If the length can be expressed $a\sqrt{b}+c\sqrt{d}+ \frac{e}{f} \pi$ such that $b$ and $d$ are not divisible by the square of any prime, and $e$ and $f$ are relatively prime, find $a + b + c + d + e + f$. [img]https://cdn.artofproblemsolving.com/attachments/0/c/bafe3f9939bd5767ba5cf77a51031dd32bbbec.png[/img] [b]p8.[/b] Given $LCM (10^8, 8^{10}, n) = 20^{15}$, where $n$ is a positive integer, find the total number of possible values of $n$. [b]p9.[/b] If one can represent the infinite progression $\frac{1}{11} + \frac{2}{13} + \frac{3}{121} + \frac{4}{169} + \frac{5}{1331} + \frac{6}{2197}+ ...$ as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers, what is $a$? [b]p10.[/b] Consider a tiled $3\times 3$ square without a center tile. How many ways are there to color the squares such that no two colored squares are adjacent (vertically or horizontally)? Consider rotations of an configuration to be the same, and consider the no-color configuration to be a coloring. [b]p11.[/b] Let $ABC$ be a triangle with $AB = 4$ and $AC = 7$. Let $AD$ be an angle bisector of triangle $ABC$. Point $M$ is on $AC$ such that $AD$ intersects $BM$ at point $P$, and $AP : PD = 3 : 1$. If the ratio $AM : MC$ can be expressed as $\frac{a}{b}$ such that $a$, $b$ are relatively prime positive integers, find $a + b$. [b]p12.[/b] For a positive integer $n$, define $f(n)$ as the number of positive integers less than or equal to $n$ that are coprime with $n$. For example, $f(9) = 6$ because $9$ does not have any common divisors with $1$, $2$, $4$, $5$, $7$, or $8$. Calculate: $$\sum^{100}_{i=2} \left( 29^{f(i)}\,\,\, mod \,\,i \right).$$ [b]p13.[/b] Let $ABC$ be an equilateral triangle. Let $P$ be a randomly selected point in the incircle of $ABC$. Find $a+b+c+d$ if the probability that $\angle BPC$ is acute can be expressed as $\frac{a\sqrt{b} -c\pi}{d\pi }$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c, d) = 1$ and $b$ is not divisible by the square of any prime. [b]p14.[/b] When the following expression is simplified by expanding then combining like terms, how many terms are in the resulting expression? $$(a + b + c + d)^{100} + (a + b - c - d)^{100}$$ [b]p15.[/b] Jerry has a rectangular box with integral side lengths. If $3$ units are added to each side of the box, the volume of the box is tripled. What is the largest possible volume of this box? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$a,b,c$ are positive reals satisfying $\frac{2}{5} \leq c \leq \min{a,b}$ ; $ac \geq \frac{4}{15}$ and $bc \geq \frac{1}{5}$ Find the maximum value of $\left(\frac{1}{a}+\frac{2}{b}+\frac{3}{c}\right)$.

Let $f(x)$ be a function such that every straight line has the same number of intersection points with the graph $y = f(x)$ and with the graph $y = x^2$. Prove that $f(x) = x^2.$

Sequence of positive integers $\{x_k\}_{k\geq 1}$ is given such that $x_1=1$ and for all $n\geq 1$ we have $$x_{n+1}^2+P(n)=x_n x_{n+2}$$ where $P(x)$ is a polynomial with non-negative integer coefficients. Prove that $P(x)$ is the constant polynomial. Proposed by [i]Navid Safaei[/i]

For any positive real numbers $a, b, c, d$, prove the following inequality: $$(a^2+b^2)(b^2+c^2)(c^2+d^2)(d^2+a^2) \geq 64abcd|(a-b)(b-c)(c-d)(d-a)|$$ [i]Proposed by Anton Trygub[/i]

Let $(a_1, a_2,..., a_n)$ and $(b_1, b_2, ..., b_n)$ be two sequences of positive real numbers. Let $\pi$ be a permutation of the set $\{1, 2, ..., n\}$, for which the sum $a_{\pi(1)}(b_{\pi(1)}+b_{\pi(2)}+...+b_{\pi(n)})+a_{\pi(2)}(b_{\pi(3)}+b_{\pi(3)}+...+b_{\pi(n)})+...+a_{\pi(n)}b_{\pi(n)}$ is minimal. Proce for this permutation $\pi$, that $$ \frac{a_{\pi(1)}}{b_{\pi(1)}}\le \frac{a_{\pi(2})}{b_{\pi(2)}}\le ... \le \frac{a_{\pi(n)}}{b_{\pi(n)}}$$ Application: In an idealized role-playing game you fight against $n$ opponents at the same time. In order to minimize the damage you suffer yourself, you should first take care of your opponent for the ratio of the time it takes to defeat him (if you only focus on him), and the damage it does per second is minimal; next, one should fight the opponent with the second smallest such ratio, and so on.

Determine all polynomials $f$ with integer coefficients with the property that for any two distinct primes $p$ and $q$, $f(p)$ and $f(q)$ are relatively prime.

Write two ones, then a $2$ between them, then a $3$ between the numbers whose sum is $3$, then a $4$ between the numbers whose sum is $4$, as shown below: $$(1, 1), (1, 2, 1),(1, 3, 2, 3, 1), (1, 4, 3, 2, 3, 4, 1)$$ and so on. Prove that the number of times $n$ appears, ($n\ge 2$), is equal to the number of positive integers less than $n$ and relative prime with $n$..

Let $p$ be a prime number such that $p\mid (2^{2019}-1) .$ The sequence $a_1,a_2,...,a_n$ satisfies the following conditions: $a_0=2, a_1=1 ,a_{n+1}=a_n+\frac{p^2-1}{4}a_{n-1}$ $(n\geq 1).$ Prove that $p\nmid (a_n+1),$ for any $n\geq 0.$

The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$. [i]Proposed by Mariusz Skalba, Poland[/i]

Find all functions $f:\mathbb R\rightarrow \mathbb R$ such that for all real numbers $x,y$: $f(x)f(y)+f(xy)\leq x+y$.

Prove that if $a+b+c=0$ then $a^3+b^3+c^3=3abc$

Does there exist a polynomial $P(x)$ with integral coefficients such that a) $P(\sqrt[3]{25 }+ \sqrt[3]{5}) = 220\sqrt[3]{25} + 284\sqrt[3]{5}$ ? b) $P(\sqrt[3]{25 }+ \sqrt[3]{5}) = 1184\sqrt[3]{25} + 1210\sqrt[3]{5}$ ?

Let $f(x_{1}, x_{2}, . . . , x_{n})$ be a polynomial with integer coefficients of degree less than $n$. Prove that if $N$ is the number of $n$-tuples $(x_{1}, . . . , x_{n})$ with $0 \leq x_{i} < 13$ and $f(x_{1}, . . . , x_{n}) = 0 (mod 13)$, then $N$ is divisible by 13.

Within an arithmetic progression of length $ 2005, $ find the number of arithmetic subprogressions of length $ 501 $ that don't contain the $ \text{1000-th} $ term of the progression.

A function $f : R \to R$ has $f(1) < 0$, and satisfy the functional equation $$f(\cos (x + y)) = (\cos x)f(\cos y) + 2f(\sin x)f(\sin y)$$ for all reals $x, y$. Compute $f \left(\frac{2006}{2549 }\right)$