a) Calculate the product $$\left(1+\frac{1}{2}\right) \left(1+\frac{1}{3}\right) \left(1+\frac{1}{4}\right)... \left(1+\frac{1}{2006}\right) \left(1+\frac{1}{2007}\right)$$ b) Let the set $$A =\left\{\frac{1}{2}, \frac{1}{3},\frac{1}{4}, ...,\frac{1}{2006}, \frac{1}{2007}\right\}$$ Determine the sum of all products of $2$, of $4$, of $6$,... , of $2004$ ¸and of $ 2006$ different elements of the set $A$.

[i](8 pts)[/i] Let $n$ be a positive integer, and let $a, b, c$ be real numbers. (a) [i](2 pts)[/i] Given that $a\cos x+b\cos 2x +c\cos 3x \geq -1$ for all reals $x$, find, with proof, the maximum possible value of $a+b+c$. (b) [i](6 pts)[/i] Let $f$ be a degree $n$ polynomial with real coefficients. Suppose that $|f(z)| \leq \left|f(z)+\frac{2}{z}\right|$ for all complex $z$ lying on the unit circle. Find, with proof, the maximum possible value of $f(1)$.

Find all polynomials $ p(x)$ satisfying the equation: $ (x\minus{}16)p(2x)\equal{}16(x\minus{}1)p(x)$ for all $ x$.

A sequence $(a_n)$ is defined by means of the recursion \[a_1 = 1, a_{n+1} = \frac{1 + 4a_n +\sqrt{1+ 24a_n}}{16}.\] Find an explicit formula for $a_n.$

Find all functions $f:\mathbb R^+ \to \mathbb R^+$ satisfying \begin{align*} f\left(\frac{1}{x}\right) \geq 1 - \frac{\sqrt{f(x)f\left(\frac{1}{x}\right)}}{x} \geq x^2 f(x), \end{align*} for all positive real numbers $x$.

Let $a$ and $b$ satisfy $a \ge b >0, a + b = 1$. i) Prove that if $m$ and $n$ are positive integers with $m < n$, then $a^m - a^n \ge b^m- b^n > 0$. ii) For each positive integer $n$, consider a quadratic function $f_n(x) = x^2 - b^nx- a^n$. Show that $f(x)$ has two roots that are in between $-1$ and $1$.

Show that for any $n\geq 2$, $2^{2^n}+1$ ends with 7

[b]p1.[/b] Sujay sees a shooting star go across the night sky, and took a picture of it. The shooting star consists of a star body, which is bounded by four quarter-circle arcs, and a triangular tail. Suppose $AB = 2$, $AC = 4$. Let the area of the shooting star be $X$. If $6X = a-b\pi$ for positive integers $a, b$, find $a + b$. [img]https://cdn.artofproblemsolving.com/attachments/0/f/f9c9ff23416565760df225c133330e795b9076.png[/img] [b]p2.[/b] Assuming that each distinct arrangement of the letters in $DISCUSSIONS$ is equally likely to occur, what is the probability that a random arrangement of the letters in $DISCUSSIONS$ has all the $S$’s together? [b]p3.[/b] Evaluate $$\frac{(1 + 2022)(1 + 2022^2)(1 + 2022^4) ... (1 + 2022^{2^{2022}})}{1 + 2022 + 2022^2 + ... + 2022^{2^{2023}-1}} .$$ [b]p4.[/b] Dr. Kraines has $27$ unit cubes, each of which has one side painted red while the other five are white. If he assembles his cubes into one $3 \times 3 \times 3$ cube by placing each unit cube in a random orientation, what is the probability that the entire surface of the cube will be white, with no red faces visible? If the answer is $2^a3^b5^c$ for integers $a$, $b$, $c$, find $|a + b + c|$. [b]p5.[/b] Let S be a subset of $\{1, 2, 3, ... , 1000, 1001\}$ such that no two elements of $S$ have a difference of $4$ or $7$. What is the largest number of elements $S$ can have? [b]p6.[/b] George writes the number $1$. At each iteration, he removes the number $x$ written and instead writes either $4x+1$ or $8x+1$. He does this until $x > 1000$, after which the game ends. What is the minimum possible value of the last number George writes? [b]p7.[/b] List all positive integer ordered pairs $(a, b)$ satisfying $a^4 + 4b^4 = 281 \cdot 61$. [b]p8.[/b] Karthik the farmer is trying to protect his crops from a wildfire. Karthik’s land is a $5 \times 6$ rectangle divided into $30$ smaller square plots. The $5$ plots on the left edge contain fire, the $5$ plots on the right edge contain blueberry trees, and the other $5 \times 4$ plots of land contain banana bushes. Fire will repeatedly spread to all squares with bushes or trees that share a side with a square with fire. How many ways can Karthik replace $5$ of his $20$ plots of banana bushes with firebreaks so that fire will not consume any of his prized blueberry trees? [b]p9.[/b] Find $a_0 \in R$ such that the sequence $\{a_n\}^{\infty}_{n=0}$ defined by $a_{n+1} = -3a_n + 2^n$ is strictly increasing. [b]p10.[/b] Jonathan is playing with his life savings. He lines up a penny, nickel, dime, quarter, and half-dollar from left to right. At each step, Jonathan takes the leftmost coin at position $1$ and uniformly chooses a position $2 \le k \le 5$. He then moves the coin to position $k$, shifting all coins at positions $2$ through $k$ leftward. What is the expected number of steps it takes for the half-dollar to leave and subsequently return to position $5$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f:R^{*} \rightarrow R$ such that $f(x)\not = x$ and $$ f(y(f(x)-x))=\frac{f(x)}{y}-\frac{f(y)}{x} $$ for any $x,y \not = 0$.

Find all non-constant functions $f : Q^+ \to Q^+$ satisfying the equation $$f(ab + bc + ca) =f(a)f(b) +f(b)f(c)+f(c)f(a)$$ for all $a, b,c \in Q^+$ .

Prove that $\sqrt[3]{5}$ is irrational.

The set of all positive real numbers is partitioned into three mutually disjoint non-empty subsets: $\mathbb R^+ = A \cup B\cup C$ and $A \cap B = B \cap C = C \cap A = \emptyset$ whereas none of $A, B, C$ is empty. [list=a][*] Show that one can choose $a \in A, b \in B$ and $c \in C$ such that $a,b, c$ are the sides of a triangle. [*] Is it always possible to choose three numbers from three different sets $A,B,C$ such that these three numbers are the sides of a right-angled triangle?[/list]

Find all pairs of solutions $(x,y)$: \[ x^3 + x^2y + xy^2 + y^3 = 8(x^2 + xy + y^2 + 1). \]

Let $r>0$ be a real number. We call a monic polynomial with complex coefficients $r$-[i]good[/i] if all of its roots have absolute value at most $r$. We call a monic polynomial with complex coefficients [i]primordial[/i] if all of its coefficients have absolute value at most $1$. a) Prove that any $1$-good polynomial has a primordial multiple. b) If $r>1$, prove that there exists an $r$-good polynomial that does not have a primordial multiple. [i]Proposed by Pranjal Srivastava[/i]

A train traveling at $ 80$ mph begins to cross a $ 1$ mile long bridge. At this moment, a man begins to walk from the front of the train to the back of the train at a speed of $5$ mph. The man reaches the back of the train as soon as the train is completely off the bridge. What is the length of the train (as a fraction of a mile)?

p1. Four kite-shaped shapes as shown below ($a > b$, $a$ and $b$ are natural numbers less than $10$) arranged in such a way so that it forms a square with holes in the middle. The square hole in the middle has a perimeter of $16$ units of length. What is the possible perimeter of the outermost square formed if it is also known that $a$ and $b$ are numbers coprime? [img]https://cdn.artofproblemsolving.com/attachments/4/1/fa95f5f557aa0ca5afb9584d5cee74743dcb10.png[/img] p2. If $a = 3^p$, $b = 3^q$, $c = 3^r$, and $d = 3^s$ and if $p, q, r$, and $s$ are natural numbers, what is the smallest value of $p\cdot q\cdot r\cdot s$ that satisfies $a^2 + b^3 + c^5 = d^7$ 3. Ucok intends to compose a key code (password) consisting of 8 numbers and meet the following conditions: i. The numbers used are $1, 2, 3, 4, 5, 6, 7, 8$, and $9$. ii. The first number used is at least $1$, the second number is at least $2$, third digit-at least $3$, and so on. iii. The same number can be used multiple times. a) How many different passwords can Ucok compose? b) How many different passwords can Ucok make, if provision (iii) is replaced with: no numbers may be used more than once. p 4. For any integer $a, b$, and $c$ applies $a\times (b + c) = (a\times b) + (a\times c)$. a) Look for examples that show that $a + (b\times c)\ne (a + b)\times (a + c)$. b) Is it always true that $a + (b\times c) = (a + b)\times(a + c)$? Justify your answer. p5. The results of a survey of $N$ people with the question whether they maintain dogs, birds, or cats at home are as follows: $50$ people keep birds, $61$ people don't have dogs, $13$ people don't keep a cat, and there are at least $74$ people who keep the most a little two kinds of animals in the house. What is the maximum value and minimum of possible value of $N$ ?

Determine all functions $ f: \mathbb{R} \mapsto \mathbb{R}$ such that \[ x f(x \plus{} xy) \equal{} x f(x) \plus{} f \left( x^2 \right) f(y) \quad \forall x,y \in \mathbb{R}.\]

Let $n$ be a positive integer and let $x_1,\dotsc,x_n$ be positive real numbers satisfying $\vert x_i-x_j\vert \le 1$ for all pairs $(i,j)$ with $1 \le i<j \le n$. Prove that \[\frac{x_1}{x_2}+\frac{x_2}{x_3}+\dots+\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1} \ge \frac{x_2+1}{x_1+1}+\frac{x_3+1}{x_2+1}+\dots+\frac{x_n+1}{x_{n-1}+1}+\frac{x_1+1}{x_n+1}.\]

The nonzero numbers $x{}$ and $y{}$ satisfy the inequalities $x^{2n}-y^{2n}>x$ and $y^{2n}-x^{2n}>y$ for some natural number $n{}$. Can the product $xy$ be a negative number? [i]Proposed by N. Agakhanov[/i]

Let the integer $n \ge 2$ , and $x_1,x_2,\cdots,x_n $ be real numbers such that $\sum_{k=1}^nx_k$ be integer . $d_k=\underset{m\in {Z}}{\min}\left|x_k-m\right| $, $1\leq k\leq n$ .Find the maximum value of $\sum_{k=1}^nd_k$.

Consider the addition problem: \begin{tabular}{ccccc} &C&A&S&H\\ +&&&M&E\\ \hline O&S&I&D&E \end{tabular} where each letter represents a base-ten digit, and $C,M,O \ne 0.$ (Distinct letters are allowed to represent the same digit.) How many ways are there to assign values to the letters so that the addition problem is true?

Find all positive integers $n$ with $n \ge 2$ such that the polynomial \[ P(a_1, a_2, ..., a_n) = a_1^n+a_2^n + ... + a_n^n - n a_1 a_2 ... a_n \] in the $n$ variables $a_1$, $a_2$, $\dots$, $a_n$ is irreducible over the real numbers, i.e. it cannot be factored as the product of two nonconstant polynomials with real coefficients. [i]Proposed by Yang Liu[/i]

The sequence $(u_n)$ is defined by $u_1 = 1, u_2 = 2$ and $u_{n+1} = 3u_n - u_{n-1}$ for $n \ge 2$. Set $v_n =\sum_{k=1}^n \text{arccot }u_k$. Compute $\lim_{n\to\infty} v_n$.

Let $A,B,C$ be real square matrices of order $n$ such that $A^3=-I$, $BA^2+BA=C^6+C+I$ and $C$ is symmetric. Is it possible that $n=2005$?

Let $\mathbb N_0$ be the set of non-negative integers. There is a triple $(f,a,b)$, where $f$ is a function from $\mathbb N_0$ to $\mathbb N_0$ and $a,b\in\mathbb N_0$ that satisfies the following conditions: [list] [*]$f(1)=2$ [*]$f(a)+f(b)\leq 2\sqrt{f(a)}$ [*]For all $n>0$, we have $f(n)=f(n-1)f(b)+2n-f(b)$ [/list] Find the sum of all possible values of $f(b+100)$.