Five mathematicians find a bag of $100$ gold coins in a room. They agree to split up the coins according to the following plan: • The oldest person in the room proposes a division of the coins among those present. (No coin may be split.) Then all present, including the proposer, vote on the proposal. • If at least $50\%$ of those present vote in favor of the proposal, the coins are distributed accordingly and everyone goes home. (In particular, a proposal wins on a tie vote.) • If fewer than $50\%$ of those present vote in favor of the proposal, the proposer must leave the room, receiving no coins. Then the process is repeated: the oldest person remaining proposes a division, and so on. • There is no communication or discussion of any kind allowed, other than what is needed for the proposer to state his or her proposal, and the voters to cast their vote. Assume that each person is equally intelligent and each behaves optimally to maximize his or her share. How much will each person get?

Find all functions $ f:\mathbb{N} \rightarrow \mathbb{ N }_0 $ satisfy the following conditions: i) $ f(ab)=f(a)+f(b)-f(\gcd(a,b)), \forall a,b \in \mathbb{N} $ ii) For all primes $ p $ and natural numbers $ a $, $ f(a)\ge f(ap) \Rightarrow f(a)+f(p) \ge f(a)f(p)+1 $

Find all positive integers $ k$ with the following property: There exists an integer $ a$ so that $ (a\plus{}k)^{3}\minus{}a^{3}$ is a multiple of $ 2007$.

Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have? $\textbf{(A) }110 \qquad \textbf{(B) } 191 \qquad \textbf{(C) } 261 \qquad \textbf{(D) } 325 \qquad \textbf{(E) } 425$

A polynomial $p(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$ with integer coefficients is said to be divisible by an integer $m$ if $p(x)$ is divisible by m for all integers $x$. Prove that if $p(x)$ is divisible by $m$, then $k!a_0$ is also divisible by $m$. Also prove that if $a_0, k,m$ are non-negative integers for which $k!a_0$ is divisible by $m$, there exists a polynomial $p(x) = a_0x^k+\cdots+ a_k$ divisible by $m.$

Find all natural two digit numbers such that when you substract by seven times the sum of its digit from the number you get a prime number.

Determine all pairs $(x, y)$ of positive integers satisfying $x + y + 1 | 2xy$ and $ x + y - 1 | x^2 + y^2 - 1$.

On a table, we have ten thousand matches, two of which are inside a bowl. Anna and Bernd play the following game: They alternate taking turns and Anna begins. A turn consists of counting the matches in the bowl, choosing a proper divisor $d$ of this number and adding $d$ matches to the bowl. The game ends when more than $2024$ matches are in the bowl. The person who played the last turn wins. Prove that Anna can win independently of how Bernd plays. [i](Richard Henner)[/i]

Let $ n$ be a natural number such that $ n \equal{} a^2 \plus{} b^2 \plus{}c^2$ for some natural numbers $ a,b,c$. Prove that \[ 9n \equal{} (p_1a\plus{}q_1b\plus{}r_1c)^2 \plus{} (p_2a\plus{}q_2b\plus{}r_2c)^2 \plus{} (p_3a\plus{}q_3b\plus{}r_3c)^2\] where $ p_j$'s , $ q_j$'s , $ r_j$'s are all [b]nonzero[/b] integers. Further, if $ 3$ does [b]not[/b] divide at least one of $ a,b,c,$ prove that $ 9n$ can be expressed in the form $ x^2\plus{}y^2\plus{}z^2$, where $ x,y,z$ are natural numbers [b]none[/b] of which is divisible by $ 3$.

Find all pairs of integers $(m, n)$ such that \[ \left| (m^2 + 2000m+ 999999)- (3n^3 + 9n^2 + 27n) \right|= 1.\]

Let $x$ be an irrational number. Show that there are integers $m$ and $n$ such that $\frac{1}{2555}< mx + n <\frac{1}{2012}$

Let $m,n$ and $a_1,a_2,\dots,a_m$ be arbitrary positive integers. Ali and Mohammad Play the following game. At each step, Ali chooses $b_1,b_2,\dots,b_m \in \mathbb{N}$ and then Mohammad chosses a positive integers $s$ and obtains a new sequence $\{c_i=a_i+b_{i+s}\}_{i=1}^m$, where $$b_{m+1}=b_1,\ b_{m+2}=b_2, \dots,\ b_{m+s}=b_s$$ The goal of Ali is to make all the numbers divisible by $n$ in a finite number of steps. FInd all positive integers $m$ and $n$ such that Ali has a winning strategy, no matter how the initial values $a_1, a_2,\dots,a_m$ are. [hide=clarification] after we create the $c_i$ s, this sequence becomes the sequence that we continue playing on, as in it is our 'new' $a_i$[/hide] Proposed by Shayan Gholami

Show that \[A_n=\prod_{j=0}^{n-1}\cfrac{(3j+1)!}{(n+j)!}\] is an integer, for any positive integer \(n\).

Decide if there exists any number of $10$ digits such that rearranging $10,000$ times its digits results in $10,000$ different numbers that are multiples of $7$.

Ralph is standing along a road which heads straight east. If you go nine miles east, make a left turn, and travel seven miles north, you will find Pamela with her mountain bike. At exactly the same time that Ralph begins running eastward along the road at 6 miles per hour, Pamela begins biking in a straight line at 10 miles per hour. Pamela’s direction is chosen so that she will reach a point on the road where Ralph is running at exactly the same time Ralph reaches that same point. Let $M$ and $N$ be relatively prime positive integers such that $\frac{M}{N}$ is the number of hours that it takes Pamela and Ralph to meet. Find $M+N$.

Let be two natural numbers $ m,n\ge 2, $ two increasing finite sequences of real numbers $ \left( a_i \right)_{1\le i\le n} ,\left( b_j \right)_{1\le j\le m} , $ and the set $$ \left\{ a_i+b_j| 1\le i\le n,1\le j\le m \right\} . $$ Show that the set above has $ n+m-1 $ elements if and only if the two sequences above are arithmetic progressions and these have the same ratio.

Let $d(n)$ denote the number of positive divisors of the natural number $n$. Find all the natural numbers $n$ such that $$d(n) = \frac{n}{5}$$.

Prove that if the numbers $ x_1 $ and $ x_2 $ are roots of the equation $ x^2 + px - 1 = 0 $, where $ p $ is an odd number, then for every natural $n$number $ x_1^n + x_2^n $ and $ x_1^{n+1} + x_2^{n+1} $ are integer and coprime.

Find the triple of positive integers $(x,y,z)$ with $z$ least possible for which there are positive integers $a, b, c, d$ with the following properties: (i) $x^y = a^b = c^d$ and $x > a > c$ (ii) $z = ab = cd$ (iii) $x + y = a + b$.

For which natural numbers $n\ge 2$ can the numbers from $1$ to $16$ be lined up in a square scheme so that the four row sums and the four column sums are all mutually different and divisible by $n$?

Find all positive integers, such that there exist positive integers $a, b, c$, satisfying $\gcd(a, b, c)=1$ and $n=\gcd(ab+c, ac-b)=a+b+c$.

[b]p1.[/b] An airplane travels between two cities. The first half of the distance between the cities is traveled at a constant speed of $600$ mi/hour, and the second half of the distance is traveled at a a constant speed of $900$ mi/hour. Find the average speed of the plane. [b]p2.[/b] The figure below shows two egg cartons, $A$ and $B$. Carton $A$ has $6$ spaces (cell) and has $3$ eggs. Carton $B$ has $12$ cells and $3$ eggs. Tow cells from the total of $18$ cells are selected at random and the contents of the selected cells are interchanged. (Not that one or both of the selected cells may be empty.) [img]https://cdn.artofproblemsolving.com/attachments/6/7/2f7f9089aed4d636dab31a0885bfd7952f4a06.png[/img] (a) Find the number of selections/interchanges that produce a decrease in the number of eggs in cartoon $A$- leaving carton $A$ with $2$ eggs. (b) Assume that the total number of eggs in cartons $A$ and $B$ is $6$. How many eggs must initially be in carton $A$ and in carton $B$ so that the number of selections/interchanges that lead to an increase in the number of eggs in $A$ equals the number of selections/interchanges that lead to an increase in the number of eggs in $B$. $\bullet$ In other words, find the initial distribution of $6$ eggs between $A$ and $B$ so that the likelihood of an increase in A equals the likelihood of an increase in $B$ as the result of a selection/interchange. Prove your answer. [b]p3.[/b] Divide the following figure into four equal parts (parts should be of the same shape and of the same size, they may be rotated by different angles however they may not be disjoint and reconnected). [img]https://cdn.artofproblemsolving.com/attachments/f/b/faf0adbf6b09b5aaec04c4cfd7ab1d6397ad5d.png[/img] [b]p4.[/b] Find the exact numerical value of $\sqrt[3]{5\sqrt2 + 7}- \sqrt[3]{5\sqrt2 - 7}$ (do not use a calculator and do not use approximations). [b]p5.[/b] The medians of a triangle have length $9$, $12$ and $15$ cm respectively. Find the area of the triangle. [b]p6. [/b]The numbers $1, 2, 3, . . . , 82$ are written in an arbitrary order. Prove that it is possible to cross out $72$ numbers in such a sway the remaining number will be either in increasing order or in decreasing order. PS. You should use hide for answers.

Prove that there are no distinct positive integers $x$ and $y$ such that $x^{2007} + y! = y^{2007} + x! $

For all positive integers $n$, prove that there are integers $x, y$ relatively prime to $5$ such that $x^2 + y^2 = 5^n$.