One of the two Purple Comet! question writers is an adult whose age is the same as the last two digits of the year he was born. His birthday is in August. What is his age today?

Determine all pairs $(x,y)$ of positive integers satisfying the equation \[(x+y)^{2}-2(xy)^{2}=1.\]

Mariana plays with an $8\times 8$ board with all its squares blank. She says that two houses are [i]neighbors [/i] if they have a common side or vertex, that is, two houses can be neighbors vertically, horizontally or diagonally. The game consists of filling the $64$ squares on the board, one after the other, each with a number according to the following rule: she always chooses a house blank and fill it with an integer equal to the number of neighboring houses that are still in White. Once this is done, the house is no longer considered blank. Show that the value of the sum of all $64$ numbers written on the board at the end of the game does not depend in the order of filling. Also, calculate the value of this sum. Note: A house is not neighbor to itself. [hide=original wording]Mariana brinca com um tabuleiro 8 x 8 com todas as suas casas em branco. Ela diz que duas casas s˜ao vizinhas se elas possu´ırem um lado ou um v´ertice em comum, ou seja, duas casas podem ser vizinhas verticalmente, horizontalmente ou diagonalmente. A brincadeira consiste em preencher as 64 casas do tabuleiro, uma ap´os a outra, cada uma com um n´umero de acordo com a seguinte regra: ela escolhe sempre uma casa em branco e a preenche com o n´umero inteiro igual `a quantidade de casas vizinhas desta que ainda estejam em branco. Feito isso, a casa n˜ao ´e mais considerada em branco. Demonstre que o valor da soma de todos os 64 n´umeros escritos no tabuleiro ao final da brincadeira n˜ao depende da ordem do preenchimento. Al´em disso, calcule o valor dessa soma. Observa¸c˜ao: Uma casa n˜ao ´e vizinha a si mesma[/hide]

Six lines are drawn in the plane. Determine the maximum number of points, through which at least $3$ lines pass.

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

Let $\{a_n\}$ be a sequence of integers such that $a_1=2016$ and \[\dfrac{a_{n-1}+a_n}2=n^2-n+1\] for all $n\geq 1$. Compute $a_{100}$. [i]Proposed by David Altizio[/i]

Prove that $m^7- m$ is divisible by $42$ for any positive integer $m$.

Ben Y's favorite number $p$ is prime, and his second favorite number is some integer $n$. Given that $p$ divides $n$ and $n$ divides $3p+91$, find the maximum possible value of $n$.

Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.

Prove that every positive integer can be written as a finite sum of distinct integral powers of the golden ratio.

XOY is angle in the plane.A,B are variable point on OX,OY such that 1/OA+1/OB=1/K (k is constant).draw two circles with diameter OA and OB.prove that common external tangent to these circles is tangent to the constant circle( ditermine the radius and the locus of its center).

Let $n$ be a natural number, for which we define $S(n)=\{1+g+g^2+...+g^{n-1}|g\in{\mathbb{N}},g\geq2\}$ $a)$ Prove that: $S(3)\cap S(4)=\varnothing$ $b)$ Determine: $S(3)\cap S(5)$

Prove that for all positive real numbers $x, y$ and $z$, the double inequality $$0 < \frac{1}{x + y + z + 1} -\frac{1}{(x + 1)(y + 1)(z + 1)} \le \frac18$$ holds. When does equality hold in the right inequality? [i](Walther Janous)[/i]

the code system of a new 'MO lock' is a regular $n$-gon,each vertex labelled a number $0$ or $1$ and coloured red or blue.it is known that for any two adjacent vertices,either their numbers or colours coincide. find the number of all possible codes(in terms of $n$).

Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)

Find the total number of different integers the function \[ f(x) = \left[x \right] + \left[2 \cdot x \right] + \left[\frac{5 \cdot x}{3} \right] + \left[3 \cdot x \right] + \left[4 \cdot x \right] \] takes for $0 \leq x \leq 100.$

We call polynomial $S(x)\in\mathbb{R}[x]$ sadeh whenever it's divisible by $x$ but not divisible by $x^2$. For the polynomial $P(x)\in\mathbb{R}[x]$ we know that there exists a sadeh polynomial $Q(x)$ such that $P(Q(x))-Q(2x)$ is divisible by $x^2$. Prove that there exists sadeh polynomial $R(x)$ such that $P(R(x))-R(2x)$ is divisible by $x^{1401}$.

Define a $ k$-[i]clique[/i] to be a set of $ k$ people such that every pair of them are acquainted with each other. At a certain party, every pair of 3-cliques has at least one person in common, and there are no 5-cliques. Prove that there are two or fewer people at the party whose departure leaves no 3-clique remaining.

The point $M$ belongs to the side $[AC]$ of the acute-angle triangle $ABC$. Two circles are circumscribed around triangles $ABM$ and $BCM$ . What $M$ position corresponds to the minimal area of those circles intersection?

a) One has a set of stones with weights $1, 2, \ldots, 20$ grams. Find all $k$ for which it is possible to place $k$ and the rest $20-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. b) One has a set of stones with weights $1, 2, \ldots, 51$ grams. Find all $k$ for which it is possible to place $k$ and the rest $51-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. c) One has a set of stones with weights $1, 2, \ldots, n$ grams ($n\in\mathbb{N}$). Find all $n$ and $k$ for which it is possible to place $k$ and the rest $n-k$ stones from the set respectively on the two pans of a balance so that equilibrium is achieved. [size=75] a) and b) were proposed at the festival, c) is a generalization[/size]

Farmer John ties his goat to a number of ropes of varying lengths in the Euclidean plane. If he ties the goat to $k$ ropes centered at $Q_1$, $Q_2$, ... $Q_k$ with lengths $\ell_1$, $\ell_2$, ... $\ell_k$ (respectively), the goat can reach any point $R$ such that $\ell_j \geq RQ_j$ for all $j \in \{1,2,3, \ldots k\}$. Suppose that Farmer John has planted grass at a finite set of points $P_1$, $P_2$, ... $P_n$, and sets the ropes such that the goat can reach all of these points. What is, in terms of the points, the largest possible lower bound on the area of the region that the goat can reach?

Let $A,B$ be two circles in the plane with $B$ inside $A$. Assume that $A$ has radius $3$, $B$ has radius $1$, $P$ is a point on $A$, $Q$ is a point on $B$, and $A$ and $B$ touch so that $P$ and $Q$ are the same point. Suppose that $A$ is kept fixed and $B$ is rolled once round the inside of $A$ so that $Q$ traces out a curve starting and finishing at $P$. What is the area enclosed by this curve? [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvOS84LzkwMDBjOTAwODk5M2QyM2IxMGUxZGE5OTI1NWU1ZDYwMDkyYTUwLnBuZw==&rn=VlRSTUMgMjAxMC5wbmc=[/img]

Given set $S = \{ xy\left( {x + y} \right)\; |\; x,y \in \mathbb{N}\}$.Let $a$ and $n$ natural numbers such that $a+2^k\in S$ for all $k=1,2,3,...,n$.Find the greatest value of $n$.

Let $A,B$ be points on a circle $k$ with center $S$ such that $\angle ASB = 90^o$ . Circles $k_1$ and $k_2$ are tangent to each other at $Z$ and touch $k$ at $A$ and $B$ respectively. Circle $k_3$ inside $\angle ASB$ is internally tangent to $k$ at $C$ and externally tangent to $k_1$ and $k_2$ at $X$ and $Y$, respectively. Prove that $\angle XCY = 45^o$

A set of $12$ tokens ---- $3$ red, $2$ white, $1$ blue, and $6$ black ---- is to be distributed at random to $3$ game players, $4$ tokens per player. The probability that some player gets all the red tokens, another gets all the white tokens, and the remaining player gets the blue token can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? $ \textbf{(A) }387 \qquad \textbf{(B) }388 \qquad \textbf{(C) }389 \qquad \textbf{(D) }390 \qquad \textbf{(E) }391 \qquad $