Let $a,b,c,d \ge 0$ real numbers so that $a+b+c+d=1$.Prove that $\sqrt{a+\frac{(b-c)^2}{6}+\frac{(c-d)^2}{6}+\frac{(d-b)^2}{6}} +\sqrt{b}+\sqrt{c}+\sqrt{d} \le 2.$

Determine whether there exist distinct real numbers $a, b, c, t$ for which: [i](i)[/i] the equation $ax^2 + btx + c = 0$ has two distinct real roots $x_1, x_2,$ [i](ii)[/i] the equation $bx^2 + ctx + a = 0$ has two distinct real roots $x_2, x_3,$ [i](iii)[/i] the equation $cx^2 + atx + b = 0$ has two distinct real roots $x_3, x_1.$

The sequence of $a_n$ is determined by the relation $$a_{n+1}=\frac{k+a_n}{1-a_n}$$ where $k > 0$. It is known that $a_{13} = a_1$. What values can $k$ take?

Find the maximum value of an integer $B$ such that for every 9 distinct natural number with the sum of $2023$, there must exist a sum of 4 of the number that is greater than or equal to $B$

Let $n\geq 2$ be a positive integer and let $a_1,a_2,...,a_n\in[0,1]$ be real numbers. Find the maximum value of the smallest of the numbers: \[a_1-a_1a_2, \ a_2-a_2a_3,...,a_n-a_na_1.\]

Today was the 5th Kettering Olympiad - and here are the problems, which are very good intermediate problems. 1. Find all real $x$ so that $(1+x^2)(1+x^4)=4x^3$ 2. Mark and John play a game. They have $100$ pebbles on a table. They take turns taking at least one at at most eight pebbles away. The person to claim the last pebble wins. Mark goes first. Can you find a way for Mark to always win? What about John? 3. Prove that $\sin x + \sin 3x + \sin 5x + ... + \sin 11 x = (1-\cos 12 x)/(2 \sin x)$ 4. Mark has $7$ pieces of paper. He takes some of them and splits each into $7$ pieces of paper. He repeats this process some number of times. He then tells John he has $2000$ pieces of paper. John tells him he is wrong. Why is John right? 5. In a triangle $ABC$, the altitude, angle bisector, and median split angle $A$ into four equal angles. Find the angles of $ABC.$ 6. There are $100$ cities. There exist airlines connecting pairs of cities. a) Find the minimal number of airlines such that with at most $k$ plane changes, one can go from any city to any other city. b) Given that there are $4852$ airlines, show that, given any schematic, one can go from any city to any other city.

Let $A$ be the set of all functions $f:\mathbb{R} \to \mathbb{R}$ such that $f(xy)=xf(y)$ for all $x,y \in \mathbb{R}$. (a) If $f \in A$ then show that $f(x+y)=f(x)+f(y)$ for all $x,y \in \mathbb{R}$ (b) For $g,h \in A$, define a function $g\circ h$ by $(g \circ h)(x)=g(h(x))$ for $x \in \mathbb{R}$. Prove that $g \circ h$ is in $A$ and is equal to $h \circ g$.

Allen and Alan play a game. A nonconstant polynomial $P(x,y)$ with real coefficients and a positive integer $d$ greater than the degree of $P$ are known to both Allen and Alan. Alan thinks of a polynomial $Q(x,y)$ with real coefficients and degree at most $d$ and keeps it secret. Allen can make queries of the form $(s,t)$, where $s$ and $t$ are real numbers such that $P(s,t)\neq0$. Alan must respond with the value $Q(s,t)$. Allen's goal is to determine whether $P$ divides $Q$. Find (in terms of $P$ and $d$) the smallest positive integer, $g$, such that Allen can always achieve this goal making no more than $g$ queries. [i]Linus Tang[/i]

Moor and Samantha are drinking tea at a constant rate. If Moor starts drinking tea at $8:00$ am, he will finish drinking $7$ cups of tea by $12:00$ pm. If Samantha joins Moor at $10:00$ am, they will finish drinking the $7$ cups of tea by $11:15$ am. How many hours would it take Samantha to drink $1$ cup of tea?

Let $S$ be the set of degree $4$ polynomials $f$ with complex number coefficients satisfying $f(1)=f(2)^2=f(3)^3$ $=$ $f(4)^4=f(5)^5=1.$ Find the mean of the fifth powers of the constant terms of all the members of $S.$

Find all functions $f: \mathbb{Q}\to \mathbb{Q}$ such that for all $x,y,z \in \mathbb{Q}$: \[f(x+y+z)+f(x-y)+f(y-z)+f(z-x)=3f(x)+3f(y)+3f(z).\]

Knowing that $1 < y < 2$ and $x - y + 1 = 0,$ calculate the value of the expression: $$E = \sqrt{4x^2 +4y-3} + 2\sqrt{y^2 - 6x - 2y +10}.$$

Let $ x,y\in \mathbb{R} $. Show that if the set $ A_{x,y}=\{ \cos {(n\pi x)}+\cos {(n\pi y)} \mid n\in \mathbb{N}\} $ is finite then $ x,y \in \mathbb{Q} $. [i]Vasile Pop[/i]

Carson and Emily attend different schools. Emily’s school has four times as many students as Carson’s school. The total number of students in both schools combined is $10105$. How many students go to Carson’s school?

Knowing that the system \[x + y + z = 3,\]\[x^3 + y^3 + z^3 = 15,\]\[x^4 + y^4 + z^4 = 35,\] has a real solution $x, y, z$ for which $x^2 + y^2 + z^2 < 10$, find the value of $x^5 + y^5 + z^5$ for that solution.

[b]p1.[/b] The number $100$ is written as a sum of distinct positive integers. Determine, with proof, the maximum number of terms that can occur in the sum. [b]p2.[/b] Inside an equilateral triangle of side length $s$ are three mutually tangent circles of radius $1$, each one of which is also tangent to two sides of the triangle, as depicted below. Find $s$. [img]https://cdn.artofproblemsolving.com/attachments/4/3/3b68d42e96717c83bd7fa64a2c3b0bf47301d4.png[/img] [b]p3.[/b] Color a $4\times 7$ rectangle so that each of its $28$ unit squares is either red or green. Show that no matter how this is done, there will be two columns and two rows, so that the four squares occurring at the intersection of a selected row with a selected column all have the same color. [b]p4.[/b] (a) Show that the $y$-intercept of the line through any two distinct points of the graph of $f(x) = x^2$ is $-1$ times the product of the $x$-coordinates of the two points. (b) Find all real valued functions with the property that the $y$-intercept of the line through any two distinct points of its graph is $-1$ times the product of the $x$-coordinates. Prove that you have found all such functions and that all functions you have found have this property. [b]p5.[/b] Let $n$ be a positive integer. We consider sets $A \subseteq \{1, 2,..., n\}$ with the property that the equation $x+y=z$ has no solution with $x\in A$, $y \in A$, $z \in A$. (a) Show that there is a set $A$ as described above that contains $[(n + l)/2]$ members where $[x]$ denotes the largest integer less than or equal to $x$. (b) Show that if $A$ has the property described above, then the number of members of $A$ is less than or equal to $[(n + l)/2]$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Prove that no matter what digits are placed in the four empty boxes, the eight-digit number $9999\Box\Box\Box\Box$ is not a perfect square. [b]p2.[/b] Prove that the number $m/3+m^2/2+m^3/6$ is integral for all integral values of $m$. [b]p3.[/b] An elevator in a $100$ store building has only two buttons: UP and DOWN. The UP button makes the elevator go $13$ floors up, and the DOWN button makes it go $8$ floors down. Is it possible to go from the $13$th floor to the $8$th floor? [b]p4.[/b] Cut the triangle shown in the picture into three pieces and rearrange them into a rectangle. (Pieces can not overlap.) [img]https://cdn.artofproblemsolving.com/attachments/4/b/ca707bf274ed54c1b22c4f65d3d0b0a5cfdc56.png[/img] [b]p5.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $7$ rocks in the first pile and $9$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p6.[/b] In the next long multiplication example each letter encodes its own digit. Find these digits. $\begin{tabular}{ccccc} & & & a & b \\ * & & & c & d \\ \hline & & c & e & f \\ + & & a & b & \\ \hline & c & f & d & f \\ \end{tabular}$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ T$ denote the set of all ordered triples $ (p,q,r)$ of nonnegative integers. Find all functions $ f: T \rightarrow \mathbb{R}$ satisfying \[ f(p,q,r) = \begin{cases} 0 & \text{if} \; pqr = 0, \\ 1 + \frac{1}{6}(f(p + 1,q - 1,r) + f(p - 1,q + 1,r) & \\ + f(p - 1,q,r + 1) + f(p + 1,q,r - 1) & \\ + f(p,q + 1,r - 1) + f(p,q - 1,r + 1)) & \text{otherwise} \end{cases} \] for all nonnegative integers $ p$, $ q$, $ r$.

Each point $A$ in the plane is assigned a real number $f(A).$ It is known that $f(M)=f(A)+f(B)+f(C),$ whenever $M$ is the centroid of $\triangle ABC.$ Prove that $f(A)=0$ for all points $A.$

Determine if there exist non-constant polynomials $P(x)$, $Q(x)$ and $R(x)$ with real coefficients and leading coefficient $1$, such that each of the polynomials \[ P(Q(x)), \quad Q(R(x)), \quad R(P(x)) \] has at least one real root, while each of the polynomials \[ Q(P(x)), \quad R(Q(x)), \quad P(R(x)) \] has no real roots.

Let $\langle x_n\rangle$ be a sequence of real numbers defined as \[x_1=1; x_n=\dfrac{2n}{(n-1)^2}\sum_{i=1}^{n-1}x_i\] Show that the sequence $y_n=x_{n+1}-x_n$ has finite limits as $n\to \infty.$

Let $ n$ be the number of integer values of $ x$ such that $ P \equal{} x^4 \plus{} 6x^3 \plus{} 11x^2 \plus{} 3x \plus{} 31$ is the square of an integer. Then $ n$ is: $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 0$

Let $f(x, y) = \left\lfloor \frac{5x}{2y} \right\rfloor + \left\lceil \frac{5y}{2x} \right\rceil$. Suppose $x, y$ are chosen independently uniformly at random from the interval $(0, 1]$. Let $p$ be the probability that $f(x, y) < 6$. If $p$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$, compute $m + n$. (Note: $\lfloor x\rfloor $ is defined as the greatest integer less than or equal to $x$ and $\lceil x \rceil$ is defined as the least integer greater than or equal to$ x$.)

Solve the system $\begin{cases} 10x_1 + 3x_2 + 4x_3 + x_4 + x_5 = 0 \\ 11x_2 + 2x_3 + 2x_4 + 3x_5 + x_6 = 0 \\ 15x_3 + 4x_4 + 5x_5 + 4x_6 + x_7 = 0 \\ 2x_1 + x_2 - 3x_3 + 12x_4 - 3x_5 + x_6 + x_7 = 0 \\ 6x_1 - 5x_2 + 3x_3 - x_4 + 17x_5 + x_6 = 0 \\ 3x_1 + 2x_2 - 3x_3 + 4x_4 + x_5 - 16x_6 + 2x_7 = 0\\ 4x_1 - 8x_2 + x_3 + x_4 + 3x_5 + 19x_7 = 0 \end{cases}$

Find all function $ f: \mathbb{N}\rightarrow\mathbb{N}$ satisfy $ f(mn)\plus{}f(m\plus{}n)\equal{}f(m)f(n)\plus{}1$ for all natural number $ n$