This question is both combinatorics and Number Theory : a ) Prove that we can color edges of $K_{p}$ with $p$ colors which is proper, ($p$ is an odd prime) and $K_{p}$ can be partitioned to $\frac{p-1}2$ rainbow Hamiltonian cycles. (A Hamiltonian cycle is a cycle that passes from all of verteces, and a rainbow is a subgraph that all of its edges have different colors.) b) Find all answers of $x^{2}+y^{2}+z^{2}=1$ is $\mathbb Z_{p}$

(a) Positive rational numbers $a, b,$ and $c$ have the property that $\frac{a}{b} + \frac{b}{c} + \frac{c}{a}$ is an integer. Is it possible for $\frac{a}{c} + \frac{c}{b} + \frac{b}{a}$ to also be an integer except for the trivial solution? (b) Positive real numbers $a, b,$ and $c$ have the property that $\frac{a}{b} + \frac{b}{c} + \frac{c}{a}$ is an integer. Is it possible for $\frac{a}{c} + \frac{c}{b} + \frac{b}{a}$ to also be an integer except for the trivial solution? [i](Andrew Brahms, USA)[/i]

Given natural number $a>1$ and different odd prime numbers $p_1,p_2,...,p_n$ with $a^{p_1}\equiv 1$ (mod $p_2$), $a^{p_2}\equiv 1$ (mod $p_3$), ..., $a^{p_n}\equiv 1$(mod $p_1$). Prove that a) $(a-1)\vdots p_i$ for some $i=1,..,n$ b) Can $(a-1)$ be divisible by $p_i $for exactly one $i$ of $i=1,...,n$? I. Bliznets

Let $a_1,\ldots a_{11}$ be distinct positive integers, all at least $2$ and with sum $407$. Does there exist an integer $n$ such that the sum of the $22$ remainders after the division of $n$ by $a_1,a_2,\ldots ,a_{11},4a_1,4a_2,\ldots ,4a_{11}$ is $2012$?

In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.

A number is said to be [i]triangular [/i] if it can be expressed in the form $1 + 2 +...+n$ for some positive integer $n$. We call a positive integer $a$ [i]retriangular [/i] if there exists a fixed positive integer $ b$ such that $aT +b$ is a triangular number whenever $T$ is a triangular number. Determine all retriangular numbers.

Find all positive integers $n$ such that it is possible to split the numbers from $1$ to $2n$ in two groups $(a_1,a_2,..,a_n)$, $(b_1,b_2,...,b_n)$ in such a way that $2n\mid a_1a_2\cdots a_n+b_1b_2\cdots b_n-1$. [i]Proposed by Alef Pineda[/i]

Show that, for each integer $z \ge 3$, there exist two two-digit numbers $A$ and $B$ in base $z$, one equal to the other one read in reverse order, such that the equation $x^2 -Ax+B$ has one double root. Prove that this pair is unique for a given $z$. For instance, in base $10$ these numbers are $A = 18, B = 81$.

A set S consisting of $2019$ (different) positive integers has the following property: [i]the product of every 100 elements of $S$ is a divisor of the product of the remaining $1919$ elements[/i]. What is the maximum number of prime numbers that $S$ can contain?

Find all right triangles with integer sides and inradius 6.

Let $n \ge 3$ be an integer such that $4n+1$ is a prime number. Prove that $4n+1$ divides $n^{2n}-1$.

Let $S$ be a sequence $n_1, n_2,..., n_{1995}$ of positive integers such that $n_1 +...+ n_{1995 }=m < 3990$. Prove that for each integer $q$ with $1 \le q \le m$, there is a sequence $n_{i_1} , n_{i_2} , ... , n_{i_k}$ , where $1 \le i_1 < i_2 < ...< i_k \le 1995$, $n_{i_1} + ...+ n_{i_k} = q$ and $k$ depends on $q$.

Prove that every positive rational number can be expressed uniquely as a finite sum of the form $$a_1+\frac{a_2}{2!}+\frac{a_3}{3!}+\dots+\frac{a_n}{n!},$$ where $a_n$ are integers such that $0 \leq a_n \leq n-1$ for all $n > 1$.

Find the largest positive integer $n \le 2004$ such that $3^{3n+3} - 27$ is divisible by $169$.

a) Factorize $A= x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2$ b) Prove that there are no integers $x,y,z$ such that $x^4+y^4+z^4-2x^2y^2-2y^2z^2-2z^2x^2=2000 $

Farmer Boso has a busy farm with lots of animals. He tends to $5b$ cows, $5a +7$ chickens, and $b^{a-5}$ insects. Note that each insect has $6$ legs. The number of cows is equal to the number of insects. The total number of legs present amongst his animals can be expressed as $\overline{LLL }+1$, where $L$ stands for a digit. Find $L$.

Writing $1989$ in base $b$, we obtain a three-digit number: $xyz$. It is known that the sum of the digits is the same in base $10$ and in base $b$, that is, $1 + 9 + 8 + 9 = x + y + z$. Determine $x,y,z,b.$

Find all pairs of positive integers $(x, y)$ such that $(xy+1)(xy+x+2)$ be a perfect square .

Which natural numbers can be expressed as the difference of squares of two integers?

Determine for how many positive integers $n\in\{1, 2, \ldots, 2022\}$ it holds that $402$ divides at least one of \[n^2-1, n^3-1, n^4-1\]

[b]p4.[/b] For how many three-digit multiples of $11$ in the form $\underline{abc}$ does the quadratic $ax^2 + bx + c$ have real roots? [b]p5.[/b] William draws a triangle $\vartriangle ABC$ with $AB =\sqrt3$, $BC = 1$, and $AC = 2$ on a piece of paper and cuts out $\vartriangle ABC$. Let the angle bisector of $\angle ABC$ meet $AC$ at point $D$. He folds $\vartriangle ABD$ over $BD$. Denote the new location of point $A$ as $A'$. After William folds $\vartriangle A'CD$ over $CD$, what area of the resulting figure is covered by three layers of paper? [b]p6.[/b] Compute $(1)(2)(3) + (2)(3)(4) + ... + (18)(19)(20)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that the equation $x^2 + y^2 + z^2 = ( x-y)(y-z)(z-x)$ has infintely many solutions in integers $x,y,z$.

Find all pairs of prime numbers $(p,q)$ such that for each pair $(p,q)$, there is a positive integer m satisfying $\frac{pq}{p + q}=\frac{m^2 + 6}{m + 1}$.

Let $ m_1$, $ m_2$, $ \cdots$, $ m_r$ (may not distinct) and $ n_1$, $ n_2$ $ \cdots$, $ n_s$ (may not distinct) be two groups of positive integers such that for any positive integer $ d$ larger than $ 1$, the numbers of which can be divided by $ d$ in group $ m_1$, $ m_2$, $ \cdots$, $ m_r$ (including repeated numbers) are no less than that in group $ n_1$, $ n_2$ $ \cdots$, $ n_s$ (including repeated numbers). Prove that $ \displaystyle \frac{m_1 \cdot m_2 \cdots m_r}{n_1 \cdot n_2 \cdots n_s}$ is integer.

Given positive integer $n$. Prove that for any integers $a_1,a_2,\cdots,a_n,$ at least $\lceil \tfrac{n(n-6)}{19} \rceil$ numbers from the set $\{ 1,2, \cdots, \tfrac{n(n-1)}{2} \}$ cannot be represented as $a_i-a_j (1 \le i, j \le n)$.