For some $99$-digit number $k$, there exist two different $100$-digit numbers $n$ such that the sum of all natural numbers from $1$ to $n$ ends in the same $100$ digits as the number $kn$, but is not equal to it. Prove that $k-3$ is divisible by $5$.

Given $26$ different positive integers , in any six numbers of the $26$ integers , there are at least two numbers , one can be devided by another. Then prove : There exists six numbers , one of them can be devided by the other five numbers .

Let $(a,b,c)$ be a Pythagorean triple, i.e. a triplet of positive integers with $ a^2\plus{}b^2\equal{}c^2$. $a)$ Prove that $\left(\frac{c}{a}\plus{}\frac{c}{b}\right)^2>8$. $b)$ Prove that there are no integer $n$ and Pythagorean triple $(a,b,c)$ satisfying $\left(\frac{c}{a}\plus{}\frac{c}{b}\right)^2\equal{}n$.

Compute the remainder when $2^{3^5}+ 3^{5^2}+ 5^{2^3}$ is divided by $30$.

Suppose that $m,n\ge2$ are integers such that $m+n-1$ divides $m^2+n^2-1$. Prove that the number $m+n-1$ is not prime.

A positive integer will be called [i]typical[/i] if the sum of its decimal digits is a multiple of $2011$. a) Show that there are infinitely many [i]typical[/i] numbers, each having at least $2011$ multiples which are also typical numbers. b) Does there exist a positive integer such that each of its multiples is typical?

Find the smallest natural number $n$ for which the number $n^2-n+11$ has exactly four prime factors (not necessarily distinct).

a) Prove that for each positive integer $n$ there is a unique positive integer $a_n$ such that $$(1 + \sqrt5)^n =\sqrt{a_n} + \sqrt{a_n+4^n} . $$ b) Prove that $a_{2010}$ is divisible by $5\cdot 4^{2009}$ and find the quotient

Find all integers $\,a,b,c\,$ with $\,1<a<b<c\,$ such that \[ (a-1)(b-1)(c-1) \] is a divisor of $abc-1.$

For every non-negative integer $n$ , let $s_n$ be the sum of digits in the decimal expansion of $2^n$. Is the sequence $(s_n)_{n \in \mathbb{N}}$ eventually increasing ?

If in a $3$-digit number we replace with each other it's last two digits, and add the resulting number to the starting one, we find sum a $4$-digit number that starts with $173$. Which is the starting number?

Let us call "fine" the $2n$-digit number if it is exact square itself and the two numbers represented by its first $n$ digits (first digit may not be zero) and last $n$ digits (first digit may be zero, but it may not be zero itself) are exact squares also. a) Find all two- and four-digit fine numbers. b) Is there any six-digit fine number? c) Prove that there exists $20$-digit fine number. d) Prove that there exist at least ten $100$-digit fine numbers. e) Prove that there exists $30$-digit fine number.

Find the number of positive integer solutions to the equation $(x_1+x_2+x_3)^2(y_1+y_2) = 2548$.

Let $S$ be a set of integers (not necessarily positive) such that (a) there exist $a,b \in S$ with $\gcd(a,b)=\gcd(a-2,b-2)=1$; (b) if $x$ and $y$ are elements of $S$ (possibly equal), then $x^2-y$ also belongs to $S$. Prove that $S$ is the set of all integers.

Let $n{}$ be a natural number and $f{}$ be polynomial with integer coefficients. It is known that for any integer $m{}$ there is an integer $k{}$ such that $f(k)-m$ is divisible by $n{}$. Prove that there exists a polynomial $g{}$ with integer coefficients such that $f(g(m))-m$ is divisible by $n{}$ for any integer $m{}$. [i]From the folklore[/i]

An integer $a$ is called friendly if the equation $(m^2+n)(n^2+m)=a(m-n)^3$ has a solution over the positive integers. [b]a)[/b] Prove that there are at least $500$ friendly integers in the set $\{ 1,2,\ldots ,2012\}$. [b]b)[/b] Decide whether $a=2$ is friendly.

Determine all polynomials $P(x)$ with integer coefficients such that $P(n)$ is divisible by $\sigma(n)$ for all positive integers $n$. (As usual, $\sigma(n)$ denotes the sum of all positive divisors of $n$.)

(a) Find all positive integers $ n$ for which $ 2^n\minus{}1$ is divisible by $ 7$. (b) Prove that there is no positive integer $ n$ for which $ 2^n\plus{}1$ is divisible by $ 7$.

Let $\{a_n\}_{n=1}^{\infty}$ be a sequence of positive integers such that $a_1=1$. For each $n \geq 1$, $a_{n+1}$ is the smallest positive integer, distinct from $a_1,a_2,...,a_n$, such that $\gcd(a_{n+1}a_n+1,a_i)=1$ for each $i=1,2,...,n$. Prove that every positive integer appears in $\{a_n\}_{n=1}^{\infty}$.

Let $n$ and $p$ be positive integers, with $p>3$ prime, such that: i) $n\mid p-3;$ ii) $p\mid (n+1)^3-1.$ Show that $pn+1$ is the cube of an integer.

Prove that for every integer $n \ge 1$ there exists a real number $a$ such that for any integer $m \ge 1$ the number $[a^m] + 1$ is divisible by $n$ ($[x]$ denotes the largest integer that does not exceed $x$).

[b]6.1[/b] The student bought a briefcase, a fountain pen and a book. If the briefcase cost 5 times cheaper, the fountain pen was 2 times cheaper, and the book was 2 1/2 times cheaper cheaper, then the entire purchase would cost 2 rubles. If the briefcase was worth 2 times cheaper, a fountain pen is 4 times cheaper, and a book is 3 times cheaper, then the whole the purchase would cost 3 rubles. How much does it really cost? ´ [b]6.2.[/b] Which number is greater: $$\underbrace{888...88}_{19 \, digits} \cdot \underbrace{333...33}_{68 \, digits} \,\,\, or \,\,\, \underbrace{444...44}_{19 \, digits} \cdot \underbrace{666...67}_{68 \, digits} \, ?$$ [b]6.3[/b] Distance between Luga and Volkhov 194 km, between Volkhov and Lodeynoye Pole 116 km, between Lodeynoye Pole and Pskov 451 km, between Pskov and Luga 141 km. What is the distance between Pskov and Volkhov? [b]6.4 [/b] There are $4$ objects in pairs of different weights. How to use a pan scale without weights Using five weighings, arrange all these objects in order of increasing weights? [b]6.5 [/b]. Several teams took part in the volleyball tournament. Team A is considered stronger than team B if either A beat B or there is a team C such that A beat C, and C beat B. Prove that if team T is the winner of the tournament, then it is the strongest the rest of the teams. [b]6.6 [/b] In task 6.1, determine what is more expensive: a briefcase or a fountain pen. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988084_1968_leningrad_math_olympiad]here[/url].

a) Prove that there doesn't exist sequence $a_1,a_2,a_3,... \in \mathbb{N}$ such that: $\forall i<j: gcd(a_i+j,a_j+i)=1$ b) Let $p$ be an odd prime number. Prove that there exist sequence $a_1,a_2,a_3,... \in \mathbb{N}$ such that: $\forall i<j: p \not | gcd(a_i+j,a_j+i)$

Given natural $a,b,n$. It is known, that for every natural $k$ ($k\ne b$) the number $a-k^n$ is divisible by $b-k$. Prove that $$a=b^n$$

Given an integer $ n > 3.$ Prove that there exists a set $ S$ consisting of $ n$ pairwisely distinct positive integers such that for any two different non-empty subset of $ S$:$ A,B, \frac {\sum_{x\in A}x}{|A|}$ and $ \frac {\sum_{x\in B}x}{|B|}$ are two composites which share no common divisors.