Determine all triplets of real numbers $(x, y, z)$ that satisfy the equation $4xyz = x^4 + y^4 + z^4 + 1$.

Is it possible to arrange on a circle all composite positive integers not exceeding $ 10^6$, so that no two neighbouring numbers are coprime? [i]Author: L. Emelyanov[/i] [hide="Tuymaada 2008, Junior League, First Day, Problem 2."]Prove that all composite positive integers not exceeding $ 10^6$ may be arranged on a circle so that no two neighbouring numbers are coprime. [/hide]

Let $N$ be the number of ordered 5-tuples $(a_{1}, a_{2}, a_{3}, a_{4}, a_{5})$ of positive integers satisfying $\frac{1}{a_{1}}+\frac{1}{a_{2}}+\frac{1}{a_{3}}+\frac{1}{a_{4}}+\frac{1}{a_{5}}=1$ Is $N$ even or odd? Oh and [b]HINTS ONLY[/b], please do not give full solutions. Thanks.

Call a positive integer [b]good[/b] if either $N=1$ or $N$ can be written as product of [i]even[/i] number of prime numbers, not necessarily distinct. Let $P(x)=(x-a)(x-b),$ where $a,b$ are positive integers. (a) Show that there exist distinct positive integers $a,b$ such that $P(1),P(2),\cdots ,P(2010)$ are all good numbers. (b) Suppose $a,b$ are such that $P(n)$ is a good number for all positive integers $n$. Prove that $a=b$.

The number $1234567890$ is written on the blackboard. Two players $A$ and $B$ play the following game taking alternate moves. In one move, a player erases the number which is written on the blackboard, say, $m$, subtracts from $m$ any positive integer not exceeding the sum of the digits of $m$ and writes the obtained result instead of $m$. The first player who reduces the number written on the blackboard to $0$ wins. Determine which of the players has the winning strategy if the player $A$ makes the first move.

We say that a string of digits from $0$ to $9$ is valid if the following conditions hold: First, for $2 \le k \le 4$, no consecutive run of $k$ digits sums to a multiple of $10$. Second, between any two $0$s, there are at least $3$ other digits. Find the last four digits of the number of valid strings of length $2020$.

A subset of $\{1, 2, 3, ... ... , 2015\}$ is called good if the following condition is fulfilled: for any element $x$ of the subset, the sum of all the other elements in the subset has the same last digit as $x$. For example, $\{10, 20, 30\}$ is a good subset since $10$ has the same last digit as $20 + 30 = 50$, $20$ has the same last digit as $10 + 30 = 40$, and $30$ has the same last digit as $10 + 20 = 30$. (a) Find an example of a good subset with 400 elements. (b) Prove that there is no good subset with 405 elements.

Let $A$ be a finite set made up of prime numbers. Determine if there exists an infinite set $B$ that satisfies the following conditions: $(i)$ the prime factors of any element of $B$ are in $A$; $(ii)$ no term of $B$ divides another element of this set.

Let the lengths of three sides of a triangle be $l, m, n(l>m>n)$. If $\left\{\frac{3^l}{10^4}\right\}=\left\{\frac{3^m}{10^4}\right\}=\left\{\frac{3^n}{10^4}\right\}$, find the minimum value of the perimeter of the triangle. Note: $\{x\}=x-[x]$ and $[x]$ denotes the integral part of number $x$.

Prove that for any positive real number $\lambda$,there are $n$ positive numbers $a_1,a_2,\cdots,a_n(n\geq 2)$,so that $a_1<a_2<\cdots<a_n<2^n\lambda$ and for any $k=1,2,\cdots,n$ we have \[\gcd(a_1,a_k)+\gcd(a_2,a_k)+\cdots+\gcd(a_n,a_k)\equiv 0\pmod{a_k}\]

How many ordered pairs of integers $(a, b)$ satisfy all of the following inequalities? $$a^2 + b^2 < 16$$ $$a^2 + b^2 < 8a$$ $$a^2 + b^2 < 8b$$

Find the largest positive integer $n>10$ such that the residue of $n$ when divided by each perfect square between $2$ and $\dfrac n2$ is an odd number.

Let $\mathbb{N}$ be the set of all positive integers. Find all functions $f\colon \mathbb{N}\to \mathbb{N}$ such that $mf(m)+(f(f(m))+n)^2$ divides $4m^4+n^2f(f(n))^2$ for all positive integers $m$ and $n$.

Given distinct positive integer $ a_1,a_2,…,a_{2020} $. For $ n \ge 2021 $, $a_n$ is the smallest number different from $a_1,a_2,…,a_{n-1}$ which doesn't divide $a_{n-2020}...a_{n-2}a_{n-1}$. Proof that every number large enough appears in the sequence.

By dividing the integer $m$ by the integer $n, 22$ is the quotient and $5$ the remainder. As the division of the remainder with $n$ continues, the new quotient is $0.4$ and the new remainder is $0.2$. Find $m$ and $n$.

A positive integer is a [i]palindrome [/i] if it is written identically forwards and backwards. For example, $285582$ is a palindrome. A six digit number $ABCDEF$, where $A, B, C, D, E, F$ are digits, is called [i]cozy [/i] if $AB$ divides $CD$ and $CD$ divides $EF$. For example, $164896$ is cozy. Determine all cozy palindromes.

Find all pairs of positive integers \( n \) and \( x \) such that \[ 1^n + 2^n + 3^n + \cdots + n^n = x! \] [i](Petko Lazarov, Bulgaria)[/i]

Compute the number of ordered triples of positive integers $(a,b,c)$ such that $a + b + c + ab + bc + ac = abc + 1$.

[color=darkred]Let $ m$ and $ n$ be two nonzero natural numbers. In every cell $ 1 \times 1$ of the rectangular table $ 2m \times 2n$ are put signs $ \plus{}$ or $ \minus{}$. We call [i]cross[/i] an union of all cells which are situated in a line and in a column of the table. Cell, which is situated at the intersection of these line and column is called [i]center of the cross[/i]. A transformation is defined in the following way: firstly we mark all points with the sign $ \minus{}$. Then consecutively, for every marked cell we change the signs in the cross, whose center is the choosen cell. We call a table [i]accesible[/i] if it can be obtained from another table after one transformation. Find the number of all [i]accesible[/i] tables.[/color]

Let $a$ be an integer and $p$ a prime number that divides both $5a-1$ and $a-10$. Show that $p$ also divides $a-3$.

Let $n$ be a positive integer. Is it possible to express $n^2+3n+3$ into the form $ab$ with $a$ and $b$ being positive integers, and such that the difference between $a$ and $b$ is smaller than $2\sqrt{n+1}$?

Compute the number of sequences of five positive integers $a_1,..., a_5$ where all $a_i \le 5$ and the greatest common divisor of all five integers is $1$.

Let $p$ be a prime number. Prove that from a $p^2\times p^2$ array of squares, we can select $p^3$ of the squares such that the centers of any four of the selected squares are not the vertices of a rectangle with sides parallel to the edges of the array.

Find all natural numbers which can be written in the form $\frac{(a+b+c)^2}{abc}$ , where $a,b,c \in N$.

For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$. Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer. [i]Dan Schwarz, Romania[/i]