$f$ and $g$ are real-valued functions defined on the real line. For all $x$ and $y, f(x+y)+f(x-y)=2f(x)g(y)$. $f$ is not identically zero and $|f(x)|\le1$ for all $x$. Prove that $|g(x)|\le1$ for all $x$.

For every positive integer $k$ let $a_{k,1},a_{k,2},\ldots$ be a sequence of positive integers. For every positive integer $k$ let sequence $\{a_{k+1,i}\}$ be the difference sequence of $\{a_{k,i}\}$, i.e. for all positive integers $k$ and $i$ the following holds: $a_{k,i+1}-a_{k,i}=a_{k+1,i}$. Is it possible that every positive integer appears exactly once among numbers $a_{k,i}$? [i]Proposed by Dávid Matolcsi, Berkeley[/i]

The figure shows a square and three circles of equal radius tangent to each other and square passes. Find the radius of the circles if the square length is $1$. [img]http://3.bp.blogspot.com/-iIjwupkz7DQ/XnrIRhKIJnI/AAAAAAAALhA/clERrIDqEtcujzvZk_qu975wsTjKaxCLQCK4BGAYYCw/s400/97%2Bestonia%2Bopen%2Bs2.3.png[/img]

For real numbers $a,b,c,d$ not all equal to $0$ , define a real function $f(x) = a +b\cos{2x} + c\sin{5x} +d \cos{8x}$. Suppose $f(t) = 4a$ for some real $t$. prove that there exist a real number $s$ s.t. $f(s)<0$

In a square $ABCD$ of diagonals $AC$ and $BD$, we call $O$ at the center of the square. A square $PQRS$ is constructed with sides parallel to those of $ABCD$ with $P$ in segment $AO, Q$ in segment $BO, R$ in segment $CO, S$ in segment $DO$. If area of $ABCD$ equals two times the area of $PQRS$, and $M$ is the midpoint of the $AB$ side, calculate the measure of the angle $\angle AMP$.

Let $\alpha \geq 1$ be a real number. Hephaestus and Poseidon play a turn-based game on an infinite grid of unit squares. Before the game starts, Poseidon chooses a finite number of cells to be [i]flooded[/i]. Hephaestus is building a [i]levee[/i], which is a subset of unit edges of the grid (called [i]walls[/i]) forming a connected, non-self-intersecting path or loop*. The game then begins with Hephaestus moving first. On each of Hephaestus’s turns, he adds one or more walls to the levee, as long as the total length of the levee is at most $\alpha n$ after his $n$th turn. On each of Poseidon’s turns, every cell which is adjacent to an already flooded cell and with no wall between them becomes flooded as well. Hephaestus wins if the levee forms a closed loop such that all flooded cells are contained in the interior of the loop — hence stopping the flood and saving the world. For which $\alpha$ can Hephaestus guarantee victory in a finite number of turns no matter how Poseidon chooses the initial cells to flood? ----- [size=75]*More formally, there must exist lattice points $\mbox{\footnotesize \(A_0, A_1, \dotsc, A_k\)}$, pairwise distinct except possibly $\mbox{\footnotesize \(A_0 = A_k\)}$, such that the set of walls is exactly $\mbox{\footnotesize \(\{A_0A_1, A_1A_2, \dotsc , A_{k-1}A_k\}\)}$. Once a wall is built it cannot be destroyed; in particular, if the levee is a closed loop (i.e. $\mbox{\footnotesize \(A_0 = A_k\)}$) then Hephaestus cannot add more walls. Since each wall has length $\mbox{\footnotesize \(1\)}$, the length of the levee is $\mbox{\footnotesize \(k\)}$.[/size] [i]Nikolai Beluhov[/i]

Anna and Bob are playing the following game: The number $2$ is initially written on the blackboard. With Anna playing first, they alternately double the number currently written on the blackboard or square it. The person who first writes on the blackboard a number greater than $2023^{10}$ is the winner. Determine which player has a winning strategy.

Let $c_1,c_2,\ldots,c_n$ be real numbers such that $$c_1^k+c_2^k+\ldots+c_n^k>0\qquad\text{for all }k=1,2,\ldots$$Let us put $$f(x)=\frac1{(1-c_1x)(1-c_2x)\cdots(1-c_nx)}.$$$z\in\mathbb C$ Show that $f^{(k)}(0)>0$ for all $k=1,2,\ldots$.

Find the largest value of n, such that there exists a polygon with n sides, 2 adjacent sides of length 1, and all his diagonals have an integer length.

Can the set of positive rationals be split into two nonempty disjoint subsets $\mathbb Q_1$ and $\mathbb Q_2$, such that both are closed under addition, i.e. $p+q\in\mathbb Q_k$ for every $p,q\in\mathbb Q_k$, $k=1,2$? Can it be done when addition is exchanged for multiplication, i.e. $p\cdot q\in\mathbb Q_k$ for every $p,q\in\mathbb Q_k$, $k=1,2$?

Determine whether or not two polynomials $P, Q$ with degree no less than 2018 and with integer coefficients exist such that $$P(Q(x))=3Q(P(x))+1$$ for all real numbers $x$.

Let $ABC$ be a triangle, $H$ its orthocenter, $O$ its circumcenter, and $R$ its circumradius. Let $D$ be the reflection of the point $A$ across the line $BC$, let $E$ be the reflection of the point $B$ across the line $CA$, and let $F$ be the reflection of the point $C$ across the line $AB$. Prove that the points $D$, $E$ and $F$ are collinear if and only if $OH=2R$.

Inside the parallelogram $ABCD$, choose a point $P$ such that $\angle APB+ \angle CPD= \angle BPC+ \angle APD$. Prove that there exists a circle tangent to each of the circles circumscribed around the triangles $APB$, $BPC$, $CPD$ and $APD$.

Find, with proof, all ordered pairs of positive integers $(a, b)$ with the following property: there exist positive integers $r$, $s$, and $t$ such that for all $n$ for which both sides are defined, [center]${{n\choose{a}}\choose{b}}=r {{n+s}\choose{t}}$ .[/center]

The graph shows the number of minutes studied by both Asha (black bar) and Sasha (grey bar) in one week. On the average, how many more minutes per day did Sasha study than Asha? [asy] size(300); real i; defaultpen(linewidth(0.8)); draw((0,140)--origin--(220,0)); for(i=1;i<13;i=i+1) { draw((0,10*i)--(220,10*i)); } label("$0$",origin,W); label("$20$",(0,20),W); label("$40$",(0,40),W); label("$60$",(0,60),W); label("$80$",(0,80),W); label("$100$",(0,100),W); label("$120$",(0,120),W); path MonD=(20,0)--(20,60)--(30,60)--(30,0)--cycle,MonL=(30,0)--(30,70)--(40,70)--(40,0)--cycle,TuesD=(60,0)--(60,90)--(70,90)--(70,0)--cycle,TuesL=(70,0)--(70,80)--(80,80)--(80,0)--cycle,WedD=(100,0)--(100,100)--(110,100)--(110,0)--cycle,WedL=(110,0)--(110,120)--(120,120)--(120,0)--cycle,ThurD=(140,0)--(140,80)--(150,80)--(150,0)--cycle,ThurL=(150,0)--(150,110)--(160,110)--(160,0)--cycle,FriD=(180,0)--(180,70)--(190,70)--(190,0)--cycle,FriL=(190,0)--(190,50)--(200,50)--(200,0)--cycle; fill(MonD,grey); fill(MonL,lightgrey); fill(TuesD,grey); fill(TuesL,lightgrey); fill(WedD,grey); fill(WedL,lightgrey); fill(ThurD,grey); fill(ThurL,lightgrey); fill(FriD,grey); fill(FriL,lightgrey); draw(MonD^^MonL^^TuesD^^TuesL^^WedD^^WedL^^ThurD^^ThurL^^FriD^^FriL); label("M",(30,-5),S); label("Tu",(70,-5),S); label("W",(110,-5),S); label("Th",(150,-5),S); label("F",(190,-5),S); label("M",(-25,85),W); label("I",(-27,75),W); label("N",(-25,65),W); label("U",(-25,55),W); label("T",(-25,45),W); label("E",(-25,35),W); label("S",(-26,25),W);[/asy] $ \textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12 $

Let $VA_1A_2A_3A_4$ be a pyramid with the vertex at $V$. Let $M,\, N,\, P$ be the midpoints of the segments $VA_1$, $VA_3$, and $A_2A_4$. Show that the plane $(MNP)$ cuts the pyramid into two parts with the same volume. [i]Radu Gologan[/i]