You know that the binary function $\diamond$ takes in two non-negative integers and has the following properties: \begin{align*}0\diamond a&=1\\ a\diamond a&=0\end{align*} $\text{If } a<b, \text{ then } a\diamond b\&=(b-a)[(a-1)\diamond (b-1)].$ Find a general formula for $x\diamond y$, assuming that $y\gex>0$.

Find $0/1 + 1/1 + 0/2 + 1/2 + 2/2 + 0/3 + 1/3 + 2/3 + 3/3 + 0/4 + 1/4 + 2/4 + 3/4 + 4/4 + 0/5 + 1/5 + 2/5 + 3/5 + 4/5 + 5/5 + 0/6 + 1/6 + 2/6 + 3/6 + 4/6 + 5/6 + 6/6$

Let $A=\{ x\in \mathbb{N},x=a^2+2b^2,a,b\in \mathbb{Z},ab\neq 0 \}$ and $p$ is a prime number. Prove that if $p^2\in A$, then $p\in A$.

Consider a sequence $(a_k)_{k \ge 1}$ of natural numbers defined as follows: $a_1=a$ and $a_2=b$ with $a,b>1$ and $\gcd(a,b)=1$ and for all $k>0$, $a_{k+2}=a_{k+1}+a_k$. Prove that for all natural numbers $n$ and $k$, $\gcd(a_n,a_{n+k}) <\frac{a_k}{2}$.

A grocer makes a display of cans in which the top row has one can and each lower row has two more cans than the row above it. If the display contains $ 100$ cans, how many rows does it contain? $ \textbf{(A)}\ 5\qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 9\qquad \textbf{(D)}\ 10\qquad \textbf{(E)}\ 11$

There are 20 buns with jam and 20 buns with treacle arranged in a row in random order. Alice and Bob take in turn a bun from any end of the row. Alice starts, and wants to finally obtain 10 buns of each type; Bob tries to prevent this. Is it true for any order of the buns that Alice can win no matter what are the actions of Bob? [i]Alexandr Gribalko[/i]

Circles $\mathcal{C}_{1}$ and $\mathcal{C}_{2}$ intersect at two points, one of which is $(9,6),$ and the product of the radii is $68.$ The x-axis and the line $y=mx$, where $m>0,$ are tangent to both circles. It is given that $m$ can be written in the form $a\sqrt{b}/c,$ where $a,$ $b,$ and $c$ are positive integers, $b$ is not divisible by the square of any prime, and $a$ and $c$ are relatively prime. Find $a+b+c.$

On a circle $2018$ points are marked. Each of these points is labeled with an integer. Let each number be larger than the sum of the preceding two numbers in clockwise order. Determine the maximal number of positive integers that can occur in such a configuration of $2018$ integers. [i](Proposed by Walther Janous)[/i]

Let $ p_0,p_1,\ldots$ be a probability distribution on the set of nonnegative integers. Select a number according to this distribution and repeat the selection independently until either a zero or an already selected number is obtained. Write the selected numbers in a row in order of selection without the last one. Below this line, write the numbers again in increasing order. Let $ A_i$ denote the event that the number $ i$ has been selected and that it is in the same place in both lines. Prove that the events $ A_i \;(i\equal{}1,2,\ldots)$ are mutually independent, and $ P(A_i)\equal{}p_i$. [i]T. F. Mori[/i]

Let $Z$ be the set of all integers. Find all the function $f: Z->Z$ such that $f(4x+3y)=f(3x+y)+f(x+2y)$ For all integers $x,y$

$G$ is a set of non-constant functions $f$. Each $f$ is defined on the real line and has the form $f(x)=ax+b$ for some real $a,b$. If $f$ and $g$ are in $G$, then so is $fg$, where $fg$ is defined by $fg(x)=f(g(x))$. If $f$ is in $G$, then so is the inverse $f^{-1}$. If $f(x)=ax+b$, then $f^{-1}(x)= \frac{x-b}{a}$. Every $f$ in $G$ has a fixed point (in other words we can find $x_f$ such that $f(x_f)=x_f$. Prove that all the functions in $G$ have a common fixed point.

Let ${\cal C}_1$ and ${\cal C}_2$ be concentric circles, with ${\cal C}_2$ in the interior of ${\cal C}_1$. From a point $A$ on ${\cal C}_1$ one draws the tangent $AB$ to ${\cal C}_2$ ($B\in {\cal C}_2$). Let $C$ be the second point of intersection of $AB$ and ${\cal C}_1$, and let $D$ be the midpoint of $AB$. A line passing through $A$ intersects ${\cal C}_2$ at $E$ and $F$ in such a way that the perpendicular bisectors of $DE$ and $CF$ intersect at a point $M$ on $AB$. Find, with proof, the ratio $AM/MC$.

Let $A$, $M$, and $C$ be nonnegative integers such that $A+M+C=10$. What is the maximum value of $A\cdot M\cdot C+A\cdot M+M\cdot C+C\cdot A$? $\text{(A)}\ 49 \qquad\text{(B)}\ 59 \qquad\text{(C)}\ 69 \qquad\text{(D)}\ 79\qquad\text{(E)}\ 89$

The natural numbers from $1$ up to $300$ are evenly located around a circle. We say that such an ordering is [i]alternate [/i ]if each number is less than its two neighbors or is greater than its two neighbors. We will call a pair of neighboring numbers a [i]good [/i] pair if, by removing that pair from the circumference, the remaining numbers form an alternate ordering. Determine the least possible number of good pairs in which there can be an alternate ordering of the numbers from $1$ at $300$ inclusive.

A line passing through $(20,21)$ intersects the curve $y = x^3-2x^2-3x+5$ at three distinct points $A, B,$ and $C,$ such that $B$ is the midpoint of $\overline{AC}$. The slope of this line is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find all triples of positive integers $(a,b,p)$ with $a,b$ positive integers and $p$ a prime number such that $2^a+p^b=19^a$

Let $n \ge 2$ be a positive integer. A grasshopper is moving along the sides of an $n \times n$ square net, which is divided on $n^2$ unit squares. It moves so that а) in every $1 \times 1$ unit square of the net, it passes only through one side b) when it passes one side of $1 \times1$ unit square of the net, it jumps on a vertex on another arbitrary $1 \times 1$ unit square of the net, which does not have a side on which the grasshopper moved along. The grasshopper moves until the conditions can be fulfilled. What is the shortest and the longest path that the grasshopper can go through if it moves according to the condition of the problem? Calculate its length and draw it on the net.

$ (a)$ The rectangle $ PQRS$ with $ PQ\equal{}l$ and $ QR\equal{}m$ $ (l,m \in \mathbb{N})$ is divided into $ lm$ unit squares. Prove that the diagonal $ PR$ intersects exactly $ l\plus{}m\minus{}d$ of these squares, where $ d\equal{}(l,m)$. $ (b)$ A box with edge lengths $ l,m,n \in \mathbb{N}$ is divided into $ lmn$ unit cubes. How many of the cubes does a main diagonal of the box intersect?

Suppose a grid with $2m$ rows and $2n$ columns is given, where $m$ and $n$ are positive integers. You may place one pawn on any square of this grid, except the bottom left one or the top right one. After placing the pawn, a snail wants to undertake a journey on the grid. Starting from the bottom left square, it wants to visit every square exactly once, except the one with the pawn on it, which the snail wants to avoid. Moreover, it wants to finish in the top right square. It can only move horizontally or vertically on the grid. On which squares can you put the pawn for the snail to be able to finish its journey?

Given a finite set $S$, $P(S)$ denotes the set of all the subsets of $S$. For any $f:P(S)\rightarrow \mathbb{R}$ ,prove the following inequality:$$\sum_{A\in P(S)}\sum_{B\in P(S)}f(A)f(B)2^{\left| A\cap B \right|}\geq 0.$$

How many ordered pairs $(x,y)$ of real numbers satisfy the following system of equations? \begin{align*} x^2+3y&=9\\ (|x|+|y|-4)^2&=1\\ \end{align*} $\textbf{(A)}\: 1\qquad\textbf{(B)} \: 2\qquad\textbf{(C)} \: 3\qquad\textbf{(D)} \: 5\qquad\textbf{(E)} \: 7$

Flasks A, B, and C each have a circular base with a radius of 2 cm. An equal volume of water is poured into each flask, and none overflow. Rank the force of water F on the base of the flask from greatest to least. A) $F_A > F_B > F_C$ B) $F_A > F_C > F_B$ C) $F_B > F_C > F_A$ D) $F_C > F_A > F_B$ E) $F_A = F_B = F_C$

Let $z_1 = 18 + 83i$, $z_2 = 18 + 39i, $ and $z_3 = 78 + 99i,$ where $i = \sqrt{-1}$. Let $z$ be the unique complex number with the properties that $\frac{z_3 - z_1}{z_2 - z_1} \cdot \frac{z - z_2}{z - z_3}$ is a real number and the imaginary part of $z$ is the greatest possible. Find the real part of $z$.

Let $p$ be a prime number such that $p\mid (2^{2019}-1) .$ The sequence $a_1,a_2,...,a_n$ satisfies the following conditions: $a_0=2, a_1=1 ,a_{n+1}=a_n+\frac{p^2-1}{4}a_{n-1}$ $(n\geq 1).$ Prove that $p\nmid (a_n+1),$ for any $n\geq 0.$

Let $a,b,c,d>0$ . Prove that $a^4+b^4+c^4+d^4 \geq 4abcd+4(a-b)^2 \sqrt{abcd}$