[b]p29.[/b] Consider pentagon $ABCDE$. How many paths are there from vertex $A$ to vertex $E$ where no edge is repeated and does not go through $E$. [b]p30.[/b] Let $a_1, a_2, ...$ be a sequence of positive real numbers such that $\sum^{\infty}_{n=1} a_n = 4$. Compute the maximum possible value of $\sum^{\infty}_{n=1}\frac{\sqrt{a_n}}{2^n}$ (assume this always converges). [b]p31.[/b] Define function $f(x) = x^4 + 4$. Let $$P =\prod^{2021}_{k=1} \frac{f(4k - 1)}{f(4k - 3)}.$$ Find the remainder when $P$ is divided by $1000$. [b]p32.[/b] Reduce the following expression to a simplified rational: $\cos^7 \frac{\pi}{9} + \cos^7 \frac{5\pi}{9}+ \cos^7 \frac{7\pi}{9}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\alpha$ be a real number with $\alpha>1$. Let the sequence $(a_n)$ be defined as $$a_n=1+\sqrt[\alpha]{2+\sqrt[\alpha]{3+\ldots+\sqrt[\alpha]{n+\sqrt[\alpha]{n+1}}}}$$ for all positive integers $n$. Show that there exists a positive real constant $C$ such that $a_n<C$ for all positive integers $n$.

Given a set $S \subset R^+$, $S \ne \emptyset$ such that for all $a, b, c \in S$ (not necessarily distinct) then $a^3 + b^3 + c^3 - 3abc$ is rational number. Prove that for all $a, b \in S$ then $\frac{a - b}{a + b}$ is also rational.

Find all triples $(a,b,c)$ of real numbers such that the following system holds: $$\begin{cases} a+b+c=\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \\a^2+b^2+c^2=\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2}\end{cases}$$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

We call a pair $(a,b)$ of positive integers, $a<391$, [i]pupusa[/i] if $$\textup{lcm}(a,b)>\textup{lcm}(a,391)$$ Find the minimum value of $b$ across all [i]pupusa[/i] pairs. Fun Fact: OMCC 2017 was held in El Salvador. [i]Pupusa[/i] is their national dish. It is a corn tortilla filled with cheese, meat, etc.

For any positive integer $k$ consider the sequence $$a_n=\sqrt{k+\sqrt{k+\dots+\sqrt k}},$$ where there are $n$ square-root signs on the right-hand side. (a) Show that the sequence converges, for every fixed integer $k\ge 1$. (b) Find $k$ such that the limit is an integer. Furthermore, prove that if $k$ is odd, then the limit is irrational.

For all reals $a, b, c,d $ prove the following inequality: $$\frac{a + b + c + d}{(1 + a^2)(1 + b^2)(1 + c^2)(1 + d^2)}< 1$$

Prove that the number \[ 3 \underbrace{99\ldots9}_{2025} \underbrace{60\ldots01}_{2025} \] is a square of a positive integer.

Solve in the set $R$ the equation $$2 \cdot [x] \cdot \{x\} = x^2 - \frac32 \cdot x - \frac{11}{16}$$ where $[x]$ and $\{x\}$ represent the integer part and the fractional part of the real number $x$, respectively.

Problem: Find all polynomials satisfying the equation $ f(x^2) = (f(x))^2 $ for all real numbers x. I'm not exactly sure where to start though it doesn't look too difficult. Thanks!

Prove that there exist infinitely many positive integers $d$ such that we can find a polynomial $P\in\mathbb{Z}[x]$ of degree $d$ and $N\in\mathbb{N}$ such that for all integers $x>N$ and any prime $p$, we have $$\nu_p(P(x)^3+3P(x)^2-3)<\frac{d\cdot\log(x)}{2024^{2024}}.$$ [i]Proposed by Marius Cerlat[/i]

Euler is selling Mathematician cards to Gauss. Three Fermat cards plus $5$ Newton cards costs $95$ Euros, while $5$ Fermat cards plus $2$ Newton cards also costs $95$ Euros. How many Euroes does one Fermat card cost? $$ \mathrm a. ~ 10\qquad \mathrm b.~15\qquad \mathrm c. ~20 \qquad \mathrm d. ~30 \qquad \mathrm e. ~35 $$

Let $n$ be an integer greater than two, and let $A_1,A_2, \cdots , A_{2n}$ be pairwise distinct subsets of $\{1, 2, ,n\}$. Determine the maximum value of \[\sum_{i=1}^{2n} \dfrac{|A_i \cap A_{i+1}|}{|A_i| \cdot |A_{i+1}|}\] Where $A_{2n+1}=A_1$ and $|X|$ denote the number of elements in $X.$

What is the maximal number of solutions can the equation have $$\max \{a_1x+b_1, a_2x+b_2, \ldots, a_{10}x+b_{10}\}=0$$ where $a_1,b_1, a_2, b_2, \ldots , a_{10},b_{10}$ are real numbers, all $a_i$ not equal to $0$.

Vanya has chosen two positive numbers, x and y. He wrote the numbers x+y, x-y, x/y, and xy, and has shown these numbers to Petya. However, he didn't say which of the numbers was obtained from which operation. Show that Petya can uniquely recover x and y.

Let $f(x)$ be a cubic polynomial with rational coefficients. If the graph of $f(x)$ is tangent to the $x$ axis, prove that the roots of $f(x)$ are all rational.

The players Alfred and Bertrand put together a polynomial $x^n + a_{n-1}x^{n- 1} +... + a_0$ with the given degree $n \ge 2$. To do this, they alternately choose the value in $n$ moves one coefficient each, whereby all coefficients must be integers and $a_0 \ne 0$ must apply. Alfred's starts first . Alfred wins if the polynomial has an integer zero at the end. (a) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the right to the left, i.e. for $j = 0, 1,. . . , n - 1$, be determined? (b) For which $n$ can Alfred force victory if the coefficients $a_j$ are from the left to the right, i.e. for $j = n -1, n - 2,. . . , 0$, be determined? (Theresia Eisenkölbl, Clemens Heuberger)

Solve the system $\begin{cases} x^2y^2+|xy|=\frac{4}{9}\\ xy+1=x+y^2\\ \end{cases}$

Let $a,b$ and $c$ be real numbers such that $| (a-b) (b-c) (c-a) | = 1$. Find the smallest value of the expression $| a | + | b | + | c |$. (K.Satylhanov )

Let $f(x)=\frac{ax+b}{cx+d}$ $F_n(x)=f(f(f...f(x)...))$ (with $n\ f's$) Suppose that $f(0) \not =0$, $f(f(0)) \not = 0$, and for some $n$ we have $F_n(0)=0$, show that $F_n(x)=x$ (for any valid x).

Given a pair $(a_0, b_0)$ of real numbers, we define two sequences $a_0, a_1, a_2,...$ and $b_0, b_1, b_2, ...$ of real numbers by $a_{n+1}= a_n + b_n$ and $b_{n+1}=a_nb_n$ for all $n = 0, 1, 2,...$. Find all pairs $(a_0, b_0)$ of real numbers such that $a_{2022}= a_0$ and $b_{2022}= b_0$.

A line with negative slope passing through the point $(18,8)$ intersects the $x$ and $y$ axes at $(a,0)$ and $(0,b)$, respectively. What is the smallest possible value of $a+b$?

Let $k \le n$ be positive integers and $x$ be a real number with $0 \le x < 1/n$. Prove that $${n \choose 0} - {n \choose 1} x +{n \choose 2} x^2 - ... + (-1)^k {n \choose k} x^k > 0$$

Let $\mathbb{Q}$ be the set of rational numbers. A function $f: \mathbb{Q} \to \mathbb{Q}$ is called aquaesulian if the following property holds: for every $x,y \in \mathbb{Q}$, \[ f(x+f(y)) = f(x) + y \quad \text{or} \quad f(f(x)+y) = x + f(y). \] Show that there exists an integer $c$ such that for any aquaesulian function $f$ there are at most $c$ different rational numbers of the form $f(r) + f(-r)$ for some rational number $r$, and find the smallest possible value of $c$.

Find all functions $f,g,h: \mathbb{R} \mapsto \mathbb{R}$ such that $f(x) - g(y) = (x-y) \cdot h(x+y)$ for $x,y \in \mathbb{R}.$