a) The fields of the square table $4\times 4$ are filled with the "+" or "-" signs. You are allowed to change the signs simultaneously in the whole row, column, or diagonal to the opposite sign. That means, for example, that You can change the sign in the corner square, because it makes a diagonal itself. Prove that you will never manage to obtain a table containing pluses only. b) The fields of the square table $8\times 8$ are filled with the "+" or signs except one non-corner field with "-". You are allowed to change the signs simultaneously in the whole row, column, or diagonal to the opposite sign. That means, for example, that You can change the sign in the corner field, because it makes a diagonal itself. Prove that you will never manage to obtain a table containing pluses only.

Consider the sequence $(x_n)_{n\ge 1}$ where $x_1=1,x_2=2011$ and $x_{n+2}=4022x_{n+1}-x_n$ for all $n\in\mathbb{N}$. Prove that $\frac{x_{2012}+1}{2012}$ is a perfect square.

Let $A$ be the area of the largest semicircle that can be inscribed in a quarter-circle of radius $ 1$. Compute$ \frac{120A}{\pi}$. .

Given is an acute angled triangle $ABC$ with orthocenter $H$ and circumcircle $k$. Let $\omega$ be the circle with diameter $AH$ and $P$ be the point of intersection of $\omega$ and $k$ other than $A$. Assume that $BP$ and $CP$ intersect $\omega$ for the second time at points $Q$ and $R$, respectively. If $D$ is the foot of the altitude from $A$ to $BC$ and $S$ is the point of the intersection of $\omega$ and $QD$, prove that $HR = HS$.

$AB$ is a diameter of the circle $O$, the point $C$ lies on the line $AB$ produced. A line passing though $C$ intersects with the circle $O$ at the point $D$ and $E$. $OF$ is a diameter of circumcircle $O_{1}$ of $\triangle BOD$. Join $CF$ and produce, cutting the circle $O_{1}$ at $G$. Prove that points $O,A,E,G$ are concyclic.

Determine an equation of third degree with integral coefficients having roots $\sin \frac{\pi}{14}, \sin \frac{5 \pi}{14}$ and $\sin \frac{-3 \pi}{14}.$

There are $20$ balls in a bag. $a$ of them are red, $b$ of them are white, and $c$ of them are black. It is known that $ \bullet$ if we double the white balls, the probability of drawing one red ball is $\dfrac 1{25}$ less than the probability of drawing one red ball at the beginning, and $ \bullet$ if we remove all red balls, the probability of drawing one white ball is $\dfrac 1{16}$ more than the probability of drawing one white ball at the beginning. Find $a,b,c$.

Let $a_0$ be an arbitrary positive integer. Let $(a_n)$ be infinite sequence of positive integers such that for every positive integer $n$, the term $a_n$ is the smallest positive integer such that $a_0 + a_1 +... + a_n$ is divisible by $n$. Prove that there exist $N$ such that $a_{n+1} = a_n$ for all $n \ge N$

Let $s < t$ be positive integers. Define a sequence by: $a_1 = s, a_2 = t$; $a_3$ is the smallest integer that's greater than $a_2$ and divisible by $a_1$; in general, $a_{n + 1}$ is the smallest integer greater than $a_n$ that's divisible by $a_1, a_2, ..., a_{n - 2}, a_{n - 1}$. [b]a)[/b] What is the maximum number of odd integers that can appear in such a sequence? (Justify your answer) [b]b)[/b] Prove that $a_{2025}$ is divisible by $2^{808}$, regardless of the choice of $s$ and $t$. Proposed by [i]Ilija Jovcevski[/i]

Nora drove $82$ miles in $90$ minutes. She averaged $50$ miles per hour for the first half-hour and averaged $55$ miles per hour for the last half-hour. What was her average speed in miles per hour over the middle half-hour (during the $30$ minutes beginning after the first half-hour)?

Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number $n$ on the blackboard with a number of the form $n-a^2$, where $a$ is a positive integer. On any move of hers, Amy replaces the number $n$ on the blackboard with a number of the form $n^k$, where $k$ is a positive integer. Bob wins if the number on the board becomes zero. Can Amy prevent Bob’s win? [i]Maxim Didin, Russia[/i]

Find all the possible values of a positive integer $n$ for which the expression $S_n=x^n+y^n+z^n$ is constant for all real $x,y,z$ with $xyz=1$ and $x+y+z=0$.

Luke chose a set of three different dates $a,b,c$ in the month of May, where in any year, if one makes a calendar with a sheet of grid paper the centers of the cells with dates $a,b,c$ would form an isosceles right triangle or a straight line. How many sets can be chosen? [img]https://cdn.artofproblemsolving.com/attachments/7/3/dbf90fdc81fc0f0d14c32020b69df53b67b397.png[/img]

An $\textit{access pattern}$ $\pi$ is a permutation of $\{1,2,\dots,50\}$ describing the order in which some $50$ memory addresses are accessed. We define the $\textit{locality}$ of $\pi$ to be how much the program jumps around the memory, or numerically, \[\sum_{i=2}^{50}\left\lvert\pi(i)-\pi(i-1)\right\rvert.\] If $\pi$ is a uniformly randomly chosen access pattern, what is the expected value of its locality?

Given a set of $n$ positive numbers. For each its nonempty subset consider the sum of all the subset's numbers. Prove that you can divide those sums onto $n$ groups in such a way, that the least sum in every group is not less than a half of the greatest sum in the same group.

Let $s$ and $t$ be the solutions to $x^2-10x+10=0$. Compute $\tfrac{1}{s^5}+\tfrac{1}{t^5}$.

Find with proof all solutions in nonnegative integers $a,b,c,d$ of the equation $$11^a5^b-3^c2^d=1$$

You have $100$ equal rods. It is allowed to split each rod into two or three shorter rods, not necessarily the same. The objective is that by rearranging the pieces (and using them all) $q>200$ can be assembled new rods, all of equal length. Find the values ​​of $q$ for whom this can be done.

The nonnegative integer $n$ and $ (2n + 1) \times (2n + 1)$ chessboard with squares colored alternatively black and white are given. For every natural number $m$ with $1 < m < 2n+1$, an $m \times m$ square of the given chessboard that has more than half of its area colored in black, is called a $B$-square. If the given chessboard is a $B$-square, find in terms of $n$ the total number of $B$-squares of this chessboard.

If $a \diamondsuit b = \vert a - b \vert \cdot \vert b - a \vert$ then find the value of $1 \diamondsuit (2 \diamondsuit (3 \diamondsuit (4 \diamondsuit 5)))$. [i]Proposed by Muztaba Syed[/i] [hide=Solution] [i]Solution.[/i] $\boxed{9}$ $a\diamondsuit b = (a-b)^2$. This gives us an answer of $\boxed{9}$. [/hide]

What is the greatest integer less than or equal to $$\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?$$ $ \textbf{(A) }80\qquad \textbf{(B) }81 \qquad \textbf{(C) }96 \qquad \textbf{(D) }97 \qquad \textbf{(E) }625\qquad $

There is a football championship with $6$ teams involved, such that for any $2$ teams $A$ and $B$, $A$ plays with $B$ and $B$ plays with $A$ ($2$ such games are distinct). After every match, the winning teams gains $3$ points, the loosing team gains $0$ points and if there is a draw, both teams gain $1$ point each.\\ \\ In the end, the team standing on the last place has $12$ points and there are no $2$ teams that scored the same amount of points.\\ \\ For all the remaining teams, find their final scores and provide an example with the outcomes of all matches for at least one of the possible final situations. $\textit{(Andrei Bâra)}$

Sketch the phase portrait and investigate its variation under variation of the small complex parameter $\epsilon$: \[\dot{z}=\epsilon z-(1+i)z|z|^2+\overline{z}^4\]

Let $\alpha$ and $\beta$ be nonnegative integers. Suppose the number of strictly increasing sequences of integers $a_0,a_1,\dots,a_{2014}$ satisfying $0 \leq a_m \leq 3m$ is $2^\alpha (2\beta + 1)$. Find $\alpha$. [i]Proposed by Lewis Chen[/i]

In $\vartriangle ABC, AB=AC=14 \sqrt2 , D$ is the midpoint of $CA$ and $E$ is the midpoint of $BD$. Suppose $\vartriangle CDE$ is similar to $\vartriangle ABC$. Find the length of $BD$.