Compute $\sum_{k=0}^{2n} (-1)^k a_k^2$ where $a_k$ are the coefficients in the expansion \[(1- \sqrt 2 x +x^2)^n =\sum_{k=0}^{2n} a_k x^k.\]

Square ABCD has side length 7. Let $A_1$, $B_1$, $C_1$, and $D_1$ be points on rays $\overrightarrow{AB}$, $\overrightarrow{BC}$, $\overrightarrow{CD}$, and $\overrightarrow{DA}$, respectively, where each point is $3$ units from the end of the ray so that $A_1B_1C_1D_1$ forms a second square as shown. SImilarly, let $A_2$, $B_2$, $C_2$, and $D_2$ be points on segments $A_1B_1$, $B_1C_1$, $C_1D_1$, and $D_1A_1$, respectively, forming another square where $A_2$ divides segment $A_1B_1$ into two pieces whose lengths are in the same ratio as $AA_1$ is to $A_1B$. Continue this process to construct square $A_nB_nC_nD_n$ for each positive integer $n$. Find the total of all the perimeters of all the squares. [asy] size(180); pair[] A={(-1,-1),(-1,1),(1,1),(1,-1),(-1,-1)}; string[] X={"A","B","C","D"}; for(int k=0;k<10;++k) { for(int m=0;m<4;++m) { if(k==0) label("$"+X[m]+"$",A[m],A[m]); if(k==1) label("$"+X[m]+"_1$",A[m],A[m]); draw(A[m]--A[m+1]); A[m]+=3/7*(A[m+1]-A[m]); } A[4]=A[0]; }[/asy]

You are given \( 11 \) numbers with an arithmetic mean of \( 10 \). Each of the first \( 4 \) numbers is increased by \( 20 \), and each of the last \( 7 \) numbers is decreased by \( 24 \). What is the arithmetic mean of the new \( 11 \) numbers?

The angle bisectors $AA_1$ and $BB_1$ of the triangle ABC intersect at point $O$. Prove that when the angle $C$ is equal to $60^0$, then $OA_1=OB_1$

The square \[ \begin{tabular}{|c|c|c|} \hline 50&\textit{b}&\textit{c}\\ \hline \textit{d}&\textit{e}&\textit{f}\\ \hline \textit{g}&\textit{h}&2\\ \hline \end{tabular} \]is a multiplicative magic square. That is, the product of the numbers in each row, column, and diagonal is the same. If all the entries are positive integers, what is the sum of the possible values of $ g$? $ \textbf{(A)}\ 10 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 35 \qquad \textbf{(D)}\ 62 \qquad \textbf{(E)}\ 136$

Denote by $\mathbb Z^2$ the set of all points $(x,y)$ in the plane with integer coordinates.  For each integer $n\geq 0$, let $P_n$ be the subset of $\mathbb Z^2$ consisting of the point $(0,0)$ together with all points $(x,y)$ such that $x^2+y^2=2^k$ for some integer $k\leq n$.  Determine, as a function of $n$, the number of four-point subsets of $P_n$ whose elements are the vertices of a square.

Integers $x_0,x_1,...,x_{n-1}, x_n = x_0, x_{n+1} = x_1$ satisfy the inequality $(-1)^{x_k} x_{k-1}x_{k+1} >0$ for $k = 1,2,...,n$. Prove that the difference $\sum_{k=0}^{n-1}x_k -\sum_{k=0}^{n-1}|x_k|$ is divisible by $4$.

This sequence lists the perfect squares in increasing order: \[0,1,4,9,16,\cdots ,a,10^8,b,\cdots\] Determine the value of $b-a$.

Given a real number $\alpha$, find all pairs $(f,g)$ of functions $f,g :\mathbb{R} \to \mathbb{R}$ such that $$xf(x+y)+\alpha \cdot yf(x-y)=g(x)+g(y) \;\;\;\;\;\;\;\;\;\;\; ,\forall x,y \in \mathbb{R}.$$

Each day John's mother sends him to the store with $\$1$ to buy widgets and gadgets, each of which cost a whole number of cents. On the first day John comes back with $4$ widgets, $5$ gadgets, and $35$ cents in change. On the second day, John comes back with $5$ widgets, $4$ gadgets, and $39$ cents in change. On the third day, John comes back with only $c$ cents in change. He hands his mother the change, telling her that he had tripped coming home and broken all the widgets and gadgets. His mother, thinking for a moment, begins yelling at him for lying, as she noticed that there was no way he could have received exactly $c$ cents in change given the price of widgets and gadgets. What is the sum of the digits of the least possible value of $c$? $\textbf{(A) }10\qquad\textbf{(B) }13\qquad\textbf{(C) }15\qquad\textbf{(D) }18\qquad\textbf{(E) }\text{impossible to determine}$

The triangle $ABC$ satisfies $0\le AB\le 1\le BC\le 2\le CA\le 3$. What is the maximum area it can have?

The real numbers $a, b, c, d$ satisfy $a > b > c > d$ and $$a + b + c + d = 2004 \,\,\, and \,\,\, a^2 - b^2 + c^2 - d^2 = 2004.$$ Answer, with proof, to the following questions: a) What is the smallest possible value of $a$? b) What is the number of possible values of $a$?

There are $2n$ points on the plane, no three of which lie on the same line. Some segments are drawn between them so that they do not intersect at internal points and any segment with ends among the given points intersects some of the drawn segments at an internal point. Is it true that it is always possible to choose $n$ drawn segments having no common ends?

Find all pairs of primes $(p, q)$ for which $p-q$ and $pq-q$ are both perfect squares.

For $n>1$ consider an $n\times n$ chessboard and place identical pieces at the centers of different squares. [list=i] [*] Show that no matter how $2n$ identical pieces are placed on the board, that one can always find $4$ pieces among them that are the vertices of a parallelogram. [*] Show that there is a way to place $(2n-1)$ identical chess pieces so that no $4$ of them are the vertices of a parallelogram. [/list]

Let $ a,b,c$ and $ d$ be any four real numbers, not all equal to zero. Prove that the roots of the polynomial $ f(x) \equal{} x^{6} \plus{} ax^{3} \plus{} bx^{2} \plus{} cx \plus{} d$ can't all be real.

Find the area enclosed by the graph of $|x|+|2y|=12$. [i]Proposed by Nathan Ramesh

For the function $$ g(a) = \underbrace{\max}_{x\in R} \left\{ \cos x + \cos \left(x + \frac{\pi}{6} \right)+ \cos \left(x + \frac{\pi}{4} \right) + cos(x + a) \right\},$$ let $b \in R$ be the input that maximizes $g$. If $\cos^2 b = \frac{m+\sqrt{n}+\sqrt{p}-\sqrt{q}}{24}$ for positive integers $m, n, p, q$, find $m + n + p + q$.

Four unit squares form a $2 \times 2$ grid. Each of the $12$ unit line segments forming the sides of the squares is colored either red or blue in such way that each square has $2$ red sides and blue sides. One example is shown below (red is solid, blue is dashed). Find the number of such colorings. [asy] size(4cm); defaultpen(linewidth(1.2)); draw((0, 0) -- (2, 0) -- (2, 1)); draw((0, 1) -- (1, 1) -- (1, 2) -- (2,2)); draw((0, 0) -- (0, 1), dotted); draw((1, 0) -- (1, 1) -- (2, 1) -- (2, 2), dotted); draw((0, 1) -- (0, 2) -- (1, 2), dotted); [/asy]

Let $f,g$ are defined in $(a,b)$ such that $f(x),g(x)\in\mathcal{C}^2$ and non-decreasing in an interval $(a,b)$ . Also suppose $f^{\prime \prime}(x)=g(x),g^{\prime \prime}(x)=f(x)$. Also it is given that $f(x)g(x)$ is linear in $(a,b)$. Show that $f\equiv 0 \text{ and } g\equiv 0$ in $(a,b)$.

Let $P$ be a point inside a regular tetrahedron ABCD with edge length $1$. Show that $$d(P,AB)+d(P,AC)+d(P,AD)+d(P,BC)+d(P,BD)+d(P,CD) \ge \frac{3}{2} \sqrt2$$ , with equality only when $P$ is the centroid of $ABCD$. Here $d(P,XY)$ denotes the distance from point $P$ to line $XY$.

Original in Hungarian; translated with Google translate; polished by myself. Let $f: [0, \infty) \to [0, \infty)$ be a function that is linear between adjacent integers, and for $n = 0, 1, \dots$ satisfies $$f(n) = \begin{cases} 0, & \textrm{if }2\mid n,\\4^l + 1, & \textrm{if }2 \nmid n, 4^{l - 1} \leq n < 4^l(l = 1, 2, \dots).\end{cases}$$ Let $f^1(x) = f(x)$, and $f^k(x) = f(f^{k - 1}(x))$ for all integers $k \geq 2$. Determine the values of $\liminf\nolimits_{k\to\infty}f^k(x)$ and $\limsup\nolimits_{k\to\infty}f^k(x)$ for almost all $x \in [0, \infty)$ under Lebesgue measure. (Not sure whether the last sentence translates correctly; the original: Határozzuk meg Lebesgue majdnem minden $x\in [0, \infty)$-re a $\liminf\nolimits_{k\to\infty}f^k(x)$ és $\limsup\nolimits_{k\to\infty}f^k(x)$ értékét.)

Given a finite set $X$, let $f$ be a rule such that $f$ maps every [i]even-element-subset[/i] $E$ of $X$ (i.e. $E \subseteq X$, $|E|$ is even) into a real number $f(E)$. Suppose that $f$ satisfies the following conditions: (I) there exists an [i]even-element-subset[/i] $D$ of $X$ such that $f(D)>1990$; (II) for any two disjoint [i]even-element-subsets [/i]$A,B$ of $X$, equation $f(A\cup B)=f(A)+f(B)-1990$ holds. Prove that there exist two subsets $P,Q$ of $X$ satisfying: (1) $P\cap Q=\emptyset$, $P\cup Q=X$; (2) for any [i]non-even-element-subset [/i]$S$ of $P$ (i.e. $S\subseteq P$, $|S|$ is odd), we have $f(S)>1990$; (3) for any [i]even-element-subset[/i] $T$ of $Q$, we have $f(T)\le 1990$.

Points $A_1$ and $C_1$ are on $BC$ and $AB$ of acute-angled triangle $ABC$ . $AA_1$ and $CC_1$ intersect in $K$. Circumcircles of $AA_1B,CC_1B$ intersect in $P$ - incenter of $AKC$. Prove, that $P$ - orthocenter of $ABC$

On a standard die one of the dots is removed at random with each dot equally likely to be chosen. The die is then rolled. What is the probability that the top face has an odd number of dots? $ \textbf{(A)}\ \frac {5}{11} \qquad \textbf{(B)} \ \frac {10}{21} \qquad \textbf{(C)}\ \frac {1}{2} \qquad \textbf{(D)} \ \frac {11}{21} \qquad \textbf{(E)}\ \frac {6}{11}$