Let $f(x,y)$ be a function from ordered pairs of positive integers to real numbers such that \[ f(1,x) = f(x,1) = \frac{1}{x} \quad\text{and}\quad f(x+1,y+1)f(x,y)-f(x,y+1)f(x+1,y) = 1 \] for all ordered pairs of positive integers $(x,y)$. If $f(100,100) = \frac{m}{n}$ for two relatively prime positive integers $m,n$, compute $m+n$. [i]David Yang[/i]

Find all natural numbers $n < 1978$ with the following property: If $m$ is a natural number, $1 < m < n$, and $(m, n) = 1$ (i.e., $m$ and $n$ are relatively prime), then $m$ is a prime number.

Show that the numbers $\tan \left(\frac{r \pi }{15}\right)$, where $r$ is a positive integer less than $15$ and relatively prime to $15$, satisfy \[x^8 - 92x^6 + 134x^4 - 28x^2 + 1 = 0.\]

A pair of integers $ (m,n)$ is called [i]good[/i] if \[ m\mid n^2 \plus{} n \ \text{and} \ n\mid m^2 \plus{} m\] Given 2 positive integers $ a,b > 1$ which are relatively prime, prove that there exists a [i]good[/i] pair $ (m,n)$ with $ a\mid m$ and $ b\mid n$, but $ a\nmid n$ and $ b\nmid m$.

Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.

Alpha and Beta both took part in a two-day problem-solving competition. At the end of the second day, each had attempted questions worth a total of 500 points. Alpha scored 160 points out of 300 points attempted on the first day, and scored 140 points out of 200 points attempted on the second day. Beta who did not attempt 300 points on the first day, had a positive integer score on each of the two days, and Beta's daily success rate (points scored divided by points attempted) on each day was less than Alpha's on that day. Alpha's two-day success ratio was 300/500 = 3/5. The largest possible two-day success ratio that Beta could achieve is $m/n$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?

What is the smallest integer $n$, greater than one, for which the root-mean-square of the first $n$ positive integers is an integer? $\mathbf{Note.}$ The root-mean-square of $n$ numbers $a_1, a_2, \cdots, a_n$ is defined to be \[\left[\frac{a_1^2 + a_2^2 + \cdots + a_n^2}n\right]^{1/2}\]

Denote by $\phi(n)$ for all $n\in\mathbb{N}$ the number of positive integer smaller than $n$ and relatively prime to $n$. Also, denote by $\omega(n)$ for all $n\in\mathbb{N}$ the number of prime divisors of $n$. Given that $\phi(n)|n-1$ and $\omega(n)\leq 3$. Prove that $n$ is a prime number.

Find all polynomials $ p$ of one variable with integer coefficients such that if $ a$ and $ b$ are natural numbers such that $ a \plus{} b$ is a perfect square, then $ p\left(a\right) \plus{} p\left(b\right)$ is also a perfect square.

For positive integers $a>b>1$, define \[x_n = \frac {a^n-1}{b^n-1}\] Find the least $d$ such that for any $a,b$, the sequence $x_n$ does not contain $d$ consecutive prime numbers. [i]V. Senderov[/i]

There are nonzero real numbers $a$ and $b$ so that the roots of $x^2 + ax + b$ are $3a$ and $3b$. There are relatively prime positive integers $m$ and $n$ so that $a - b = \tfrac{m}{n}$. Find $m + n$.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

Steve needed to address a letter to $2743$ Becker Road. He remembered the digits of the address, but he forgot the correct order of the digits, so he wrote them down in random order. The probability that Steve got exactly two of the four digits in their correct positions is $\tfrac m n$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find all pairs $(a, b)$ of positive integers for which $a + b = \phi (a) + \phi (b) + gcd (a, b)$. Here $ \phi (n)$ is the number of numbers $k$ from $\{1, 2,. . . , n\}$ with $gcd (n, k) = 1$.

Find all pairs of positive integers $(x,y)$ with the following property: If $a,b$ are relative prime and positive divisors of $ x^3 + y^3$, then $a+b - 1$ is divisor of $x^3+y^3$. (Cyprus)

We define an operation $\oplus$ on the set $\{0, 1\}$ by \[ 0 \oplus 0 = 0 \,, 0 \oplus 1 = 1 \,, 1 \oplus 0 = 1 \,, 1 \oplus 1 = 0 \,.\] For two natural numbers $a$ and $b$, which are written in base $2$ as $a = (a_1a_2 \ldots a_k)_2$ and $b = (b_1b_2 \ldots b_k)_2$ (possibly with leading 0's), we define $a \oplus b = c$ where $c$ written in base $2$ is $(c_1c_2 \ldots c_k)_2$ with $c_i = a_i \oplus b_i$, for $1 \le i \le k$. For example, we have $7 \oplus 3 = 4$ since $ 7 = (111)_2$ and $3 = (011)_2$. For a natural number $n$, let $f(n) = n \oplus \left[ n/2 \right]$, where $\left[ x \right]$ denotes the largest integer less than or equal to $x$. Prove that $f$ is a bijection on the set of natural numbers.

Let $P_1(x, y)$ and $P_2(x, y)$ be two relatively prime polynomials with complex coefficients. Let $Q(x, y)$ and $R(x, y)$ be polynomials with complex coefficients and each of degree not exceeding $d$. Prove that there exist two integers $A_1, A_2$ not simultaneously zero with $|A_i| \leq d + 1 \ (i = 1, 2)$ and such that the polynomial $A_1P_1(x, y) + A_2P_2(x, y)$ is coprime to $Q(x, y)$ and $R(x, y).$

Each side of an arbitrarly triangle is divided into $ 2002$ congruent segments. After that, each vertex is joined with all "division" points on the opposite side. Prove that the number of the regions formed, in which the triangle is divided, is divisible by $ 6$. [i]Proposer[/i]: [b]Dorian Croitoru[/b]

If $n$ is a natural number, prove that the number $(n+1)(n+2)\cdots(n+10)$ is not a perfect square.

Determine all functions $f:\mathbb{Z}^+\to \mathbb{Z}$ which satisfy the following condition for all pairs $(x,y)$ of [i]relatively prime[/i] positive integers: \[f(x+y) = f(x+1) + f(y+1).\]

$|5x^2-\tfrac25|\le|x-8|$ if and only if $x$ is in the interval $[a, b]$. There are relatively prime positive integers $m$ and $n$ so that $b -a =\tfrac{m}{n}$ . Find $m + n$.

For every pair of reals $0 < a < b < 1$, we define sequences $\{x_n\}_{n \ge 0}$ and $\{y_n\}_{n \ge 0}$ by $x_0 = 0$, $y_0 = 1$, and for each integer $n \ge 1$: \begin{align*} x_n & = (1 - a) x_{n - 1} + a y_{n - 1}, \\ y_n & = (1 - b) x_{n - 1} + b y_{n - 1}. \end{align*} The [i]supermean[/i] of $a$ and $b$ is the limit of $\{x_n\}$ as $n$ approaches infinity. Over all pairs of real numbers $(p, q)$ satisfying $\left (p - \textstyle\frac{1}{2} \right)^2 + \left (q - \textstyle\frac{1}{2} \right)^2 \le \left(\textstyle\frac{1}{10}\right)^2$, the minimum possible value of the supermean of $p$ and $q$ can be expressed as $\textstyle\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $100m + n$. [i]Proposed by Lewis Chen[/i]

Find the largest positive integer $k$ such that $\phi ( \sigma ( 2^k)) = 2^k$. ($\phi(n)$ denotes the number of positive integers that are smaller than $n$ and relatively prime to $n$, and $\sigma(n)$ denotes the sum of divisors of $n$). As a hint, you are given that $641|2^{32}+1$.

Four consecutive three-digit numbers are divided respectively by four consecutive two-digit numbers. What minimum number of different remainders can be obtained? [i](A. Golovanov)[/i]

Dave arrives at an airport which has twelve gates arranged in a straight line with exactly $ 100$ feet between adjacent gates. His departure gate is assigned at random. After waiting at that gate, Dave is told the departure gate has been changed to a different gate, again at random. Let the probability that Dave walks $ 400$ feet or less to the new gate be a fraction $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m\plus{}n$.