Find all integer solutions $(x,y,z)$ of the equation $xy+yz+zx-xyz = 2$.

For a positive integer $n$ let $S(n)$ be the sum of digits in the decimal representation of $n$. Any positive integer obtained by removing several (at least one) digits from the right-hand end of the decimal representation of $n$ is called a [i]stump[/i] of $n$. Let $T(n)$ be the sum of all stumps of $n$. Prove that $n=S(n)+9T(n)$.

Let $S$ be the set of all rational numbers whose denominators are powers of 3. Let $a$, $b$ and $c$ be given non-zero real numbers. Determine all real-valued functions $f$ that are defined for $x \in S$, satisfy \[ f(x) = af(3x) + bf(3x - 1) + cf(3x - 2) \textrm{ if }0 \leq x \leq 1, \] and are zero elsewhere.

Find the rational roots (if any) of the equation $$abx^2 + (a^2 + b^2 )x +1 = 0 , \,\,\,\, (a, b \in Z).$$

Let be two natural numbers $ n $ and $ a. $ [b]a)[/b] Prove that there exists an $ n\text{-tuplet} $ of natural numbers $ \left( a_1,a_2,\ldots ,a_n\right) $ that satisfy the following equality. $$ 1+\frac{1}{a} =\prod_{i=1}^n \left( 1+\frac{1}{a_i} \right) $$ [b]b)[/b] Show that there exist only finitely such $ n\text{-tuplets} . $

Let $T$ the set of the infinite sequences of integers. For two given elements in $T$: $(a_{1},a_{2},a_{3},...)$ and $(b_{1},b_{2},b_{3},...)$, define the sum $(a_{1},a_{2},a_{3},...)+(b_{1},b_{2},b_{3},...)=(a_{1}+b_{1},a_{2}+b_{2},a_{3}+b_{3},...)$. Let $f: T\rightarrow$ $\mathbb{Z}$ a function such that: i) If $x\in T$ has exactly one of your terms equal $1$ and all the others equal $0$, then $f(x)=0$. ii)$f(x+y)=f(x)+f(y)$, for all $x,y\in T$. Prove that $f(x)=0$ for all $x\in T$

Consider the numbers $x_1, x_2,...,x_n$ that satisfy: $\bullet$ $x_i \in \{-1,1\}$, with $i = 1, 2,...,n$ $\bullet$ $x_1x_2x_3x_4 + x_2x_3x_4x_5 +...+ x_nx_1x_2x_3 = 0$ Prove that $n$ is a multiple of $4$.

let $x_1$, $x_2$ .... $x_6$ be non-negative reals such that $x_1+x_2+x_3+x_4+x_5+x_6=1$ and $x_1x_3x_5$ + $x_2x_4x_6$ $\geq$ $\frac{1}{540}$. Let $p$ and $q$ be relatively prime integers such that $\frac{p}{q}$ is the maximum value of $x_1x_2x_3+x_2x_3x_4+x_3x_4x_5+x_4x_5x_6+x_5x_6x_1+x_6x_1x_2$. Find $p+q$

Find all positive integers $n$ satisfying the following. $$2^n-1 \text{ doesn't have a prime factor larger than } 7$$

Let $a$ and $b$ be some rational numbers and there exist $n$, such that $\sqrt[n]{a}+\sqrt[b]{b}$ is also a rational number. Prove that $\sqrt[n]{a}$ is a rational number.

Let $n{}$ be a positive integer. What is the smallest sum of digits that $5^n + 6^n + 2022^n$ can take?

For each natural number $n$, determine the number $A(n)$ of all integer nonnegative solutions the equation $$5x + 2y + z = 10n.$$

The [i]height[/i] of a positive integer is defined as being the fraction $\frac{s(a)}{a}$, where $s(a)$ is the sum of all the positive divisors of $a$. Show that for every pair of positive integers $N,k$ there is a positive integer $b$ such that the [i]height[/i] of each of $b,b+1,\cdots,b+k$ is greater than $N$.

Let $S$ be the set of all ordered pairs $(a,b)$ of integers with $0<2a<2b<2017$ such that $a^2+b^2$ is a multiple of $2017$. Prove that \[\sum_{(a,b)\in S}a=\frac{1}{2}\sum_{(a,b)\in S}b.\] Proposed by Uwe Leck, Germany

The teacher had written on the board a positive integer consisting of a number of $4$s followed by the same number of $8$s followed . During the break, Juku stepped up to the board and added to the number one more $4$ at the start and a $9$ at the end. Prove that the resulting number is an a square. of an integer.

[b]p1.[/b] The three little pigs are learning about fractions. They particularly like the number x = $1/5$, because when they add the denominator to the numerator, add the denominator to the denominator, and form a new fraction, they obtain $6/10$, which equals $3x$ (so each little pig can have his own $x$). The $101$ Dalmatians hear about this and want their own fraction. Your job is to help them. (a) Find a fraction $y$ such that when the denominator is added to the numerator and also added to the denominator, the result is $101y$. (b) Prove that the fraction $y$ (put into lowest terms) in part (a) is the only fraction in lowest terms with this property. [b]p2.[/b] A small kingdom consists of five square miles. The king, who is not very good at math, wants to divide the kingdom among his $9$ sons. He tells each son to mark out a region of $1$ square mile. Prove that there are two sons whose regions overlap by at least $1/9$ square mile. [b]p3.[/b] Let $\pi (n)$ be the number of primes less than or equal to n. Sometimes $n$ is a multiple of $\pi (n)$. It is known that $\pi (4) = 2$ (because of the two primes $2, 3$) and $\pi (64540) = 6454$. Show that there exists an integer $n$, with $4 < n < 64540$, such that $\pi (n) = n/8$. [b]p4.[/b] Two circles of radii $R$ and $r$ are externally tangent at a point $A$. Their common external tangent is tangent to the circles at $B$ and $C$. Calculate the lengths of the sides of triangle $ABC$ in terms of $R$ and $r$. [img]https://cdn.artofproblemsolving.com/attachments/e/a/e5b79cb7c41e712602ec40edc037234468b991.png[/img] [b]p5.[/b] There are $2005$ people at a meeting. At the end of the meeting, each person who has shaken hands with at most $10$ people is given a red T-shirt with the message “I am unfriendly.” Then each person who has shaken hands only with people who received red T-shirts is given a blue T-shirt with the message “All of my friends are unfriendly.” (Some lucky people might get both red and blue T-shirts, for example, those who shook no one’s hand.) Prove that the number of people who received blue T-shirts is less than or equal to the number of people who received red T-shirts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that a sequence $(a_n)_{n=1}^{\infty}$ of integers has the following property: For all $n$ large enough (i.e. $n \ge N$ for some $N$ ), $a_n$ equals the number of indices $i$, $1 \le i < n$, such that $a_i + i \ge n$. Find the maximum possible number of integers which occur infinitely many times in the sequence.

find all the integer $n\geq1$ such that $\lfloor\sqrt{n}\rfloor \mid n$

Determine all positive integers that are equal to $300$ times the sum of their digits.

Given a prime number $p$, find all integer solutions of $p(x+y) = xy$.

Do there exist $100$ positive integers such that their sum is equal to their least common multiple? (S Tokarev)

Let $a_1 < a_2 < \cdots <a_n$ be pairwise coprime positive integers with $a_1$ being prime and $a_1 \ge n + 2$. On the segment $I = [0, a_1 a_2 \cdots a_n ]$ of the real line, mark all integers that are divisible by at least one of the numbers $a_1 , \ldots , a_n$ . These points split $I$ into a number of smaller segments. Prove that the sum of the squares of the lengths of these segments is divisible by $a_1$. [i]Proposed by Serbia[/i]

Let $p$ be a prime, and $n > p$ be an integer. Prove that \[ \binom{n+p-1}{p} - \binom{n}{p} \] is divisible by $n$.

Let $q$ be a fixed odd prime. A prime $p$ is said to be [i]orange [/i] if for every integer $a$ there exists an integer $r$ such that $r^q \equiv a$ (mod $p$). Prove that there are infinitely many [i]orange [/i] primes.

Prove that for any positive integer $n$ there exist infinitely many triples $(a,b,c)$ of pairwise distinct positive integers such that $ab+n,bc+n,ac+n$ are all perfect squares