Find all integers x,y,z with $2\leq x\leq y\leq z$ st $xy \equiv 1 $(mod z) $xz\equiv 1$(mod y) $yz \equiv 1$ (mod x)

Let $p$ and $q$ be two distinct integers. The square trinomial $x^2 + px + q$ is written on the board. At each step, a number is deleted: or the coefficient next to $x$, or the free term, and instead of the deleted number, a number is written, which is obtained from the deleted number by adding or subtracting the number $1$. After several such steps on the board, the square trinomial $x^2 + qx + p$ appeared. Show that at one stage a square trinomial was written on the board, both roots of which are integers.

Given an integer number $n \ge 3$, show that the number of lists of jointly coprime positive integer numbers that sum to $n$ is divisible by $3$. (For instance, if $n = 4$, there are six such lists: $(3, 1), (1, 3), (2, 1, 1), (1, 2, 1), (1, 1, 2)$ and $(1, 1, 1, 1)$.)

A sequence $a_1,\ldots,a_n$ of positive integers is given. For each $l$ from $1$ to $n-1$ the array $(gcd(a_1,a_{1+l}),\ldots,gcd(a_n,a_{n+l}))$ is considered, where indices are taken modulo $n$. It turned out that all this arrays consist of the same $n$ pairwise distinct numbers and differ only,possibly, by their order. Can $n$ be a) $21$ b) $2021$

p1. One day, a researcher placed two groups of species that were different, namely amoeba and bacteria in the same medium, each in a certain amount (in unit cells). The researcher observed that on the next day, which is the second day, it turns out that every cell species divide into two cells. On the same day every cell amoeba prey on exactly one bacterial cell. The next observation carried out every day shows the same pattern, that is, each cell species divides into two cells and then each cell amoeba prey on exactly one bacterial cell. Observation on day $100$ shows that after each species divides and then each amoeba cell preys on exactly one bacterial cell, it turns out kill bacteria. Determine the ratio of the number of amoeba to the number of bacteria on the first day. p2. It is known that $n$ is a positive integer. Let $f(n)=\frac{4n+\sqrt{4n^2-1}}{\sqrt{2n+1}+\sqrt{2n-1}}$. Find $f(13) + f(14) + f(15) + ...+ f(112).$ p3. Budi arranges fourteen balls, each with a radius of $10$ cm. The first nine balls are placed on the table so that form a square and touch each other. The next four balls placed on top of the first nine balls so that they touch each other. The fourteenth ball is placed on top of the four balls, so that it touches the four balls. If Bambang has fifty five balls each also has a radius of $10$ cm and all the balls are arranged following the pattern of the arrangement of the balls made by Budi, calculate the height of the center of the topmost ball is measured from the table surface in the arrangement of the balls done by Bambang. p4. Given a triangle $ABC$ whose sides are $5$ cm, $ 8$ cm, and $\sqrt{41}$ cm. Find the maximum possible area of ​​the rectangle can be made in the triangle $ABC$. p5. There are $12$ people waiting in line to buy tickets to a show with the price of one ticket is $5,000.00$ Rp.. Known $5$ of them they only have $10,000$ Rp. in banknotes and the rest is only has a banknote of $5,000.00$ Rp. If the ticket seller initially only has $5,000.00$ Rp., what is the probability that the ticket seller have enough change to serve everyone according to their order in the queue?

A box contains 900 cards numbered from 100 to 999. Cards are drawn randomly, one at a time, without replacement, and the sum of their digits is recorded. What is the minimum number of cards that must be drawn to guarantee that at least three of these sums are the same?

Find all positive integers $a,b$ with $a>1$ such that, $b$ is a divisor of $a-1$ and $2a+1$ is a divisor of $5b-3$.

An integer $n > 1$ has the following property: for every (positive) divisor $d$ of $n, d + 1$ is a divisor of $n + 1$. Prove that $n$ is prime.

Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.

Given an integer $n\ge 4$. $S=\{1,2,\ldots,n\}$. $A,B$ are two subsets of $S$ such that for every pair of $(a,b),a\in A,b\in B, ab+1$ is a perfect square. Prove that \[\min \{|A|,|B|\}\le\log _2n.\]

Alice and Bob play a game involving a circle whose circumference is divided by 12 equally-spaced points. The points are numbered clockwise, from 1 to 12. Both start on point 12. Alice moves clockwise and Bob, counterclockwise. In a turn of the game, Alice moves 5 points clockwise and Bob moves 9 points counterclockwise. The game ends when they stop on the same point. How many turns will this take? $ \textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 24 $

Find all natural numbers $n$ the product of whose decimal digits is $n^2-10n-22$.

Let $n > 1$ and $x_i \in \mathbb{R}$ for $i = 1,\cdots, n$. Set \[S_k = x_1^k+ x^k_2+\cdots+ x^k_n\] for $k \ge 1$. If $S_1 = S_2 =\cdots= S_{n+1}$, show that $x_i \in \{0, 1\}$ for every $i = 1, 2,\cdots, n.$

Given a number $k\in \mathbb{N}$. $\{a_{n}\}_{n\geq 0}$ and $\{b_{n}\}_{n\geq 0}$ are two sequences of positive integers that $a_{i},b_{i}\in \{1,2,\cdots,9\}$. For all $n\geq 0$ $$\left.\overline{a_{n}\cdots a_{1}a_{0}}+k \ \middle| \ \overline{b_{n}\cdots b_{1}b_{0}}+k \right. .$$ Prove that there is a number $1\leq t \leq 9$ and $N\in \mathbb{N}$ such that $b_n=ta_n$ for all $n\geq N$.\\ (Note that $(\overline{x_nx_{n-1}\dots x_0}) = 10^n\times x_n + \dots + 10\times x_1 + x_0$)

Ben starts with an integer greater than $9$ and subtracts the sum of its digits from it to get a new integer. He repeats this process with each new integer he gets until he gets a positive $1$-digit integer. Find all possible $1$-digit integers Ben can end with from this process.

Find all triples of positive integers $(m,p,q)$ such that $2^mp^2 + 27 = q^3$ and $p$ is a prime.

Find all non negative integers $a{}$ and $b{}$ satisfying $5^a+6=31^b$ [i]Proposed by Erik Füredi, Budapest[/i]

[b]p1.[/b] Let $A(S)$ denote the average value of a set $S$. Let $T$ be the set of all subsets of the set $\{1, 2, 3, 4, ... , 2012\}$, and let $R$ be $\{A(K)|K \in T \}$. Compute $A(R)$. [b]p2.[/b] Consider the minute and hour hands of the Campanile, our clock tower. During one single day ($12:00$ AM - $12:00$ AM), how many times will the minute and hour hands form a right-angle at the center of the clock face? [b]p3.[/b] In a regular deck of $52$ face-down cards, Billy flips $18$ face-up and shuffles them back into the deck. Before giving the deck to Penny, Billy tells her how many cards he has flipped over, and blindfolds her so she can’t see the deck and determine where the face-up cards are. Once Penny is given the deck, it is her job to split the deck into two piles so that both piles contain the same number of face-up cards. Assuming that she knows how to do this, how many cards should be in each pile when he is done? [b]p4.[/b] The roots of the equation $x^3 + ax^2 + bx + c = 0$ are three consecutive integers. Find the maximum value of $\frac{a^2}{b+1}$. [b]p5.[/b] Oski has a bag initially filled with one blue ball and one gold ball. He plays the following game: first, he removes a ball from the bag. If the ball is blue, he will put another blue ball in the bag with probability $\frac{1}{437}$ and a gold ball in the bag the rest of the time. If the ball is gold, he will put another gold ball in the bag with probability $\frac{1}{437}$ and a blue ball in the bag the rest of the time. In both cases, he will put the ball he drew back into the bag. Calculate the expected number of blue balls after $525600$ iterations of this game. [b]p6.[/b] Circles $A$ and $B$ intersect at points $C$ and $D$. Line $AC$ and circle $B$ meet at $E$, line $BD$ and circle $A$ meet at $F$, and lines $EF$ and $AB$ meet at $G$. If $AB = 10$, $EF = 4$, $FG = 8$, find $BG$. PS. You had better use hide for answers.

For a certain real number $x$, the differences between $x^{1919}$, $x^{1960}$ and $x^{2001}$ are all integers. Prove that $x$ is an integer.

What is the smallest integer $a_0$ such that, for every positive integer $n$, there exists a sequence of positive integers $a_0, a_1, ..., a_{n-1}, a_n$ such that the first $n-1$ are all distinct, $a_0 = a_n$, and for $0 \le i \le n -1$, $a_i^{a_{i+1}}$ ends in the digits $\overline{0a_i}$ when expressed without leading zeros in base $10$.

For every nonempty set $M{}$ of integers denote $S(M)$ the sum of all its elements. Let $A=\{a_1,a_2,\ldots,a_{11}\}$ be a set of positive integers with the properties: 1) $a_1<a_2<\ldots<a_{11};$ 2) for every positive integer $n\leq 1500$ there is a subset $M{}$ of $A{}$ for which $S(M)=n.$ Find the smallest possible value of $a_{10}.$

Let $n$ be a positive integer and $a_1,a_2,...,a_{2n}$ be $2n$ distinct integers. Given that the equation $|x-a_1| |x-a_2| ... |x-a_{2n}| =(n!)^2$ has an integer solution $x = m$, find $m$ in terms of $a_1,a_2,...,a_{2n}$

The sequence $a_n (n\geq 1)$ of natural numbers is defined as $a_{n+1}=a_n+b_n,$ where $b_n$ is the number that has the same digits as $a_n$ but in the opposite order ($b_n$ can start with $0$). For example, if $a_1=180,$ then $a_2=261, a_3=423.$ a) Decide if $a_1$ can be chosen so that $a_7$ is prime. b) Decide if $a_1$ can be chosen so that $a_5$ is prime.

Find all positive integers $m$ such that there exist positive integers $a_1,a_2,\ldots,a_{1378}$ such that: \[ m=\sum_{k=1}^{1378}{\frac{k}{a_k}}. \]

A jar contains $2$ yellow candies, $4$ red candies, and $6$ blue candies. Candies are randomly drawn out of the jar one-by-one and eaten. The probability that the $2$ yellow candies will be eaten before any of the red candies are eaten is given by the fraction $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.