Peter picked a positive integer, multiplied it by 5, multiplied the result by 5,then multiplied the result by 5 again and so on. Altogether $k$ multiplications were made. It so happened that the decimal representations of the original number and of all $k$ resulting numbers in this sequence do not contain digit $7$. Prove that there exists a positive integer such that it can be multiplied $k$ times by $2$ so that no number in this sequence contains digit $7$.

Does there exist a finite set $A$ of positive integers of at least two elements and an infinite set $B$ of positive integers, such that any two distinct elements in $A+B$ are coprime, and for any coprime positive integers $m,n$, there exists an element $x$ in $A+B$ satisfying $x\equiv n \pmod m$ ? Here $A+B=\{a+b|a\in A, b\in B\}$.

Find all pairs $(p,q)$ of prime numbers which $p>q$ and $$\frac{(p+q)^{p+q}(p-q)^{p-q}-1}{(p+q)^{p-q}(p-q)^{p+q}-1}$$ is an integer.

Find all integers $x,y,z$ such that \[x^3+y^3+z^3=x+y+z=8\]

Prove that $ n $ must be prime in order to have only one solution to the equation $\frac{1}{x}-\frac{1}{y}=\frac{1}{n}$, $x,y\in\mathbb{N}$.

Find all pairs $(a, b)$ of positive integers such that $a \le b$ and $$ \gcd(x, a) \gcd(x, b) = \gcd(x, 20) \gcd(x, 22) $$ holds for every positive integer $x$.

Joe and Kathryn are both on the school math team, which practices every Wednesday after school until $4$ PM for competitions. The team was preparing for the $ 2005$ iTest when Joe realized how crazy he was for not asking Kathryn out – the way she worked those iTest problems, solving question after question, almost made him go insane sitting there that day. He never felt the same way when she worked on preparing for other competitions – they just aren’t the same. Kathryn always beat Joe at competitions, too. Joe admired her resolve and unwillingness to make herself look stupid, when so many other girls he knew at school tried to pretend they were stupid in order to attract guys. So as time ticked away and that afternoon’s Wednesday practice neared an end, Joe was determined to strike up a conversation with Kathryn and ask her out. He really wanted to impress her, so he thought he’d ask her a really hard history of math question that she didn’t know. Naturally, she’d want the answer, and be so impressed with Joe’s brilliance that she’d go out with him on Friday night. Great plan. Seriously. When Joe asked Kathryn after class, “Who was the mathematician that died in approximately $200$ B.C. that developed a method for calculating all prime numbers?” Kathryn gave the correct response. What name did she say?

Find the remainder when $2024^{2023^{2022^{2021...^{3^{2}}}}} + 2025^{2021^{2017^{2013...^{5^{1}}}}}$ is divided by $19$.

Prove that if $m$ and $n$ are positive integers such that $m^2 + n^2 - m$ is divisible by $2mn$, then $m$ is a perfect square.

Determine the number of pairs of natural numbers $(a,b)$ that simultaneously verify that $4620$ is a multiple of $a$, $4620$ is a multiple of $b$ and $b$ is a multiple of $a$.

Beter Pai wants to tell you his fastest $40$-line clear time in Tetris, but since he does not want Qep to realize she is better at Tetris than he is, he does not tell you the time directly. Instead, he gives you the following requirements, given that the correct time is t seconds: $\bullet$ $t < 100$. $\bullet$ $t$ is prime. $\bullet$ $t -1$ has 5 proper factors. $\bullet$ all prime factors of $t +1$ are single digits. $\bullet$ $t -2$ is a multiple of $3$. $\bullet$ $t +2$ has $2$ factors. Find t.

Let $ m$ be a positive integer and define $ f(m)$ to be the number of factors of $ 2$ in $ m!$ (that is, the greatest positive integer $ k$ such that $ 2^k|m!$). Prove that there are infinitely many positive integers $ m$ such that $ m \minus{} f(m) \equal{} 1989.$

You are given a positive integer $n > 1$. What is the largest possible number of integers that can be chosen from the set $\{1, 2, 3, \ldots, 2^n\}$ so that for any two different chosen integers $a, b$, the value $a^k + b^k$ is not divisible by $2^n$ for any positive integer $k$? [i]Proposed by Oleksii Masalitin[/i]

Let $a,b,c$ be positive integers such that $a|b^2, b|c^2$ and $c|a^2$. Prove that $abc|(a+b+c)^{7}$

Prove that any integer greater than or equal to $7$ can be written as a sum of two relatively prime integers, both greater than 1. (Two integers are relatively prime if they share no common positive divisor other than $1$. For example, $22$ and 15 are relatively prime, and thus $37 = 22+15$ represents the number 37 in the desired way.)

Given positive integers $m$, $a$, $b$, $(a,b)=1$. $A$ is a non-empty subset of the set of all positive integers, so that for every positive integer $n$ there is $an \in A$ and $bn \in A$. For all $A$ that satisfy the above condition, find the minimum of the value of $\left| A \cap \{ 1,2, \cdots,m \} \right|$

For any two positive integers $n>m$ prove the following inequality: $$[m,n]+[m+1,n+1]\geq \dfrac{2nm}{\sqrt{m-n}}$$ As always, $[x,y]$ means the least common multiply of $x,y$. [I]Proposed by A. Golovanov[/i]

[b]p1.[/b] What is the smallest positive integer $x$ such that $\frac{1}{x} <\sqrt{12011} - \sqrt{12006}$? [b]p2. [/b] Two soccer players run a drill on a $100$ foot by $300$ foot rectangular soccer eld. The two players start on two different corners of the rectangle separated by $100$ feet, then run parallel along the long edges of the eld, passing a soccer ball back and forth between them. Assume that the ball travels at a constant speed of $50$ feet per second, both players run at a constant speed of $30$ feet per second, and the players lead each other perfectly and pass the ball as soon as they receive it, how far has the ball travelled by the time it reaches the other end of the eld? [b]p3.[/b] A trapezoid $ABCD$ has $AB$ and $CD$ both perpendicular to $AD$ and $BC =AB + AD$. If $AB = 26$, what is $\frac{CD^2}{AD+CD}$ ? [b]p4.[/b] A hydrophobic, hungry, and lazy mouse is at $(0, 0)$, a piece of cheese at $(26, 26)$, and a circular lake of radius $5\sqrt2$ is centered at $(13, 13)$. What is the length of the shortest path that the mouse can take to reach the cheese that also does not also pass through the lake? [b]p5.[/b] Let $a, b$, and $c$ be real numbers such that $a + b + c = 0$ and $a^2 + b^2 + c^2 = 3$. If $a^5 + b^5 + c^5\ne 0$, compute $\frac{(a^3+b^3+c^3)(a^4+b^4+c^4)}{a^5+b^5+c^5}$. [b]p6. [/b] Let $S$ be the number of points with integer coordinates that lie on the line segment with endpoints $\left( 2^{2^2}, 4^{4^4}\right)$ and $\left(4^{4^4}, 0\right)$. Compute $\log_2 (S - 1)$. [b]p7.[/b] For a positive integer $n$ let $f(n)$ be the sum of the digits of $n$. Calculate $$f(f(f(2^{2006})))$$ [b]p8.[/b] If $a_1, a_2, a_3, a_4$ are roots of $x^4 - 2006x^3 + 11x + 11 = 0$, find $|a^3_1 + a^3_2 + a^3_3 + a^3_4|$. [b]p9.[/b] A triangle $ABC$ has $M$ and $N$ on sides $BC$ and $AC$, respectively, such that $AM$ and $BN$ intersect at $P$ and the areas of triangles $ANP$, $APB$, and $PMB$ are $5$, $10$, and $8$ respectively. If $R$ and $S$ are the midpoints of $MC$ and $NC$, respectively, compute the area of triangle $CRS$. [b]p10.[/b] Jack's calculator has a strange button labelled ''PS.'' If Jack's calculator is displaying the positive integer $n$, pressing PS will cause the calculator to divide $n$ by the largest power of $2$ that evenly divides $n$, and then adding 1 to the result and displaying that number. If Jack randomly chooses an integer $k$ between $ 1$ and $1023$, inclusive, and enters it on his calculator, then presses the PS button twice, what is the probability that the number that is displayed is a power of $2$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $\mathbb{N}=\{1, 2, 3, \dots\}$ be the set of all positive integers. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for any positive integers $a$ and $b$, the following two conditions hold: (1) $f(ab) = f(a)f(b)$, and (2) at least two of the numbers $f(a)$, $f(b)$, and $f(a+b)$ are equal.

Solve the equation $m^{gcd(m,n)} = n^{lcm(m,n)}$ in positive integers, where gcd($m, n$) – greatest common divisor of $m,n$, and lcm($m, n$) – least common multiple of $m,n$.

a) Is it possible to arrange numbers $1,2,...,13$ in a circumference such that the sum of any two neighbouring numbers to be a prime number? b) Is the same problem possible for the numbers $1,2,...,16$?

The Fibonacci sequence is defined by \[ a_{n+1} = a_n + a_{n-1}, n \geq 1, a_0 = 0, a_1 = a_2 = 1. \] Find the greatest common divisor of the 1960-th and 1988-th terms of the Fibonacci sequence.

Let $n$ be a positive integer with $n>1$. Prove that \[\frac{1}{2}+\cdots+\frac{1}{n}\] is not an integer.

Let $S = \{0, 1, 2, .., 1994\}$. Let $a$ and $b$ be two positive numbers in $S$ which are relatively prime. Prove that the elements of $S$ can be arranged into a sequence $s_1, s_2, s_3,... , s_{1995}$ such that $s_{i+1} - s_i \equiv \pm a$ or $\pm b$ (mod $1995$) for $i = 1, 2, ... , 1994$

Prove that for any positive integers $a$ and $b$ we have $$a+(-1)^b \sum^a_{m=0} (-1)^{\lfloor{\frac{bm}{a}\rfloor}} \equiv b+(-1)^a \sum^b_{n=0} (-1)^{\lfloor{\frac{an}{b}\rfloor}} \pmod{4}.$$