A natural number $n$ is given. Prove that $$\sum_{n \le p \le n^2} \frac{1}{p} < 2$$ where the sum is across all primes $p$ in the range $[n, n^2]$

The increasing sequence of natural numbers $a_1,a_2,\ldots$ is such that for every $n>100$ the number $a_n$ is equal to the smallest natural number greater than $a_{n-1}$ and not divisible by any of the numbers $a_1,\ldots,a_{n-1}$. Prove that there is only a finite number of composite numbers in such a sequence. [i]Proposed by P. Kozhevnikov[/i]

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

For positive integers $n,a,b$, if $n=a^2 +b^2$, and $a$ and $b$ are coprime, then the number pair $(a,b)$ is called a [i]square split[/i] of $n$ (the order of $a, b$ does not count). Prove that for any positive $k$, there are only two square splits of the integer $13^k$.

Every officially published book used to have an ISBN code (International Standard Book Number) which consisted of $10$ symbols. Such code looked like this: $$a_1a_2 . . . a_9a_{10}$$ with $a_1, . . . , a_9 \in \{0, 1, . . . , 9\}$ and $a_{10} \in \{0, 1, . . . , 9, X\}$. The symbol $X$ stood for the number $10$. With a valid ISBN code was $$a_1 + 2a2 + . . . + 9a_9 + 10a_{10}$$ a multiple of $11$. Prove the following statements. (a) If one symbol is changed in a valid ISBN code, the result is no valid ISBN code. (b) When two different symbols swap places in a valid ISBN code then the result is not a valid ISBN.

Arnaldo and Bernaldo play the following game: given a fixed finite set of positive integers $A$ known by both players, Arnaldo picks a number $a \in A$ but doesn't tell it to anyone. Bernaldo thens pick an arbitrary positive integer $b$ (not necessarily in $A$). Then Arnaldo tells the number of divisors of $ab$. Show that Bernaldo can choose $b$ in a way that he can find out the number $a$ chosen by Arnaldo.

Let $\mathbb{Z^+}$ and $\mathbb{P}$ denote the set of positive integers and the set of prime numbers, respectively. A set $A$ is called $S-\text{proper}$ where $A, S \subset \mathbb{Z^+}$ if there exists a positive integer $N$ such that for all $a \in A$ and for all $0 \leq b <a$ there exist $s_1, s_2, \ldots, s_n \in S$ satisfying $ b \equiv s_1+s_2+\cdots+s_n \pmod a$ and $1 \leq n \leq N.$ Find a subset $S$ of $\mathbb{Z^+}$ for which $\mathbb{P}$ is $S-\text{proper}$ but $\mathbb{Z^+}$ is not.

Find all $3$-digit numbers $\overline {abc}$ such that $\overline {abc} = a! + b! + c! $.

Let's call a natural number [i] interesting[/i] if any of its two digits consecutive forms a number that is a multiple of $19$ or $21$. For example, The number $7638$ is interesting, because $76$ is a multiple of $19$, $63$ is multiple of $21$, and $38$ is a multiple of $19$. How many interesting numbers of $2022$ digits exist?

[u]Round 1 [/u] [b]p1.[/b] Ephram was born in May $2005$. How old will he turn in the first year where the product of the digits of the year number is a nonzero perfect square? [b]p2.[/b] Zhao is studying for his upcoming calculus test by reviewing each of the $13$ lectures, numbered Lecture $1$, Lecture $2$, ..., Lecture $13$. For each $n$, he spends $5n$ minutes on Lecture $n$. Which lecture is he reviewing after $4$ hours? [b]p3.[/b] Compute $$\dfrac{3^3 \div 3(3)+3}{\frac{3}{3}}+3!.$$ [u]Round 2 [/u] [b]p4.[/b] At Ingo’s shop, train tickets normally cost $\$2$, but every $5$th ticket costs only $\$1$. At Emmet’s shop, train tickets normally cost $\$3$, but every $5$th ticket is free. Both Ingo and Emmett sold $1000$ tickets. Find the absolute difference between their sales, in dollars. [b]p5.[/b] Ephram paddles his boat in a river with a $4$-mph current. Ephram travels at $10$ mph in still water. He paddles downstream and then turns around and paddles upstream back to his starting position. Find the proportion of time he spends traveling upstream, as a percentage. [b]p6.[/b] The average angle measure of a $13-14-15$ triangle is $m^o$ and the average angle measure of a $5-6-7$ triangle is $n^o$. Find $m-n$. [u]Round 3[/u] [b]p7.[/b] Let $p(x) = x^2 -10x +31$. Find the minimum value of $p(p(x))$ over all real $x$. [b]p8.[/b] Michael H. andMichael Y. are playing a game with $4$ jellybeans. Michael H starts with $3$ of the jellybeans, and Michael Y starts with the remaining $1$. Every minute, a Michael flips a coin, and if heads, Michael H takes a jellybean from Michael Y. If tails, Michael Y takes a jellybean from Michael H. WhicheverMichael gathers all $4$ jellybeans wins. The probability Michael H wins can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p9.[/b] Define the digit-product of a positive integer to be the product of its non-zero digits. Let $M$ denote the greatest five-digit number with a digit-product of $360$, and let $N$ denote the least five-digit number with a digit-product of $360$. Find the digit-product of $M-N$. [u]Round 4 [/u] [b]p10.[/b] Hannah is attending one of the three IdeaMath classes running at LHS, while Alex decides to randomly visit some combination of classes. He won’t visit all three classes, but he’s equally likely to visit any other combination. The probability Alex visits Hannah’s class can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p11.[/b] In rectangle $ABCD$, let $E$ be the intersection of diagonal $AC$ and the circle centered at $A$ passing through $D$. Angle $\angle ACD = 24^o$. Find the measure of $\angle CED$ in degrees. [b]p12.[/b] During his IdeaMath class, Zach writes the numbers $2, 3, 4, 5, 6, 7$, and $8$ on a whiteboard. Every minute, he chooses two numbers $a$ and $b$ from the board, erases them, and writes the number $ab +a +b$ on the board. He repeats this process until there’s only one number left. Find the sum of all possible remaining numbers. [u]Round 5[/u] [b]p13.[/b] In isosceles right $\vartriangle ABC$ with hypotenuse $AC$, Let $A'$ be the point on the extension of $AB$ past $A$ such that $AA' = 1$. Let $C'$ be the point on the extension of $BC$ past vertex $C$ such that $CC' = 2$. Given that the difference of the areas of triangle $A'BC'$ and $ABC$ is $10$, find the area of $ABC$. [b]p14.[/b] Compute the sumof the greatest and least values of $x$ such that $(x^2 -4x +4)^2 +x^2 -4x \le 16$. [b]p15.[/b] Ephram is starting a fan club. At the fan club’s first meeting, everyone shakes hands with everyone else exactly once, except for Ephram, who is extremely sociable and shakes hands with everyone else twice. Given that a total of $2015$ handshakes took place, how many people attended the club’s first meeting? PS. You should use hide for answers. Rounds 6-9 have been posted [url=https://artofproblemsolving.com/community/c3h3167139p28823346]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$ [i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]

Determine all integers $ n > 1$ such that \[ \frac {2^n \plus{} 1}{n^2} \] is an integer.

Let $d(k)$ denote the number of positive divisors of a positive integer $k$. Prove that there exist infinitely many positive integers $M$ that cannot be written as \[M=\left(\frac{2\sqrt{n}}{d(n)}\right)^2\] for any positive integer $n$.

Find the smallest positive integer $n$ for which there exist $n$ different positive integers $a_{1}, a_{2}, \cdots, a_{n}$ satisfying [list] [*] $\text{lcm}(a_1,a_2,\cdots,a_n)=1985$,[*] for each $i, j \in \{1, 2, \cdots, n \}$, $gcd(a_i,a_j)\not=1$, [*] the product $a_{1}a_{2} \cdots a_{n}$ is a perfect square and is divisible by $243$, [/list] and find all such $n$-tuples $(a_{1}, \cdots, a_{n})$.

Given a triangle, its midpoint triangle is obtained by joining the midpoints of its sides. A sequence of polyhedra $P_{i}$ is defined recursively as follows: $P_{0}$ is a regular tetrahedron whose volume is 1. To obtain $P_{i+1}$, replace the midpoint triangle of every face of $P_{i}$ by an outward-pointing regular tetrahedron that has the midpoint triangle as a face. The volume of $P_{3}$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $K$ be a number field which is neither $\mathbb{Q}$ nor a quadratic imaginary extension of $\mathbb{Q}$. Denote by $\mathcal{L}(K)$ the set of integers $n\ge 3$ for which we can find units $\varepsilon_1,\ldots,\varepsilon_n\in K$ for which $$\varepsilon_1+\dots+\varepsilon_n=0,$$but $\displaystyle\sum_{i\in I}\varepsilon_i\neq 0$ for any nonempty proper subset $I$ of $\{1,2,\dots,n\}$. Prove that $\mathcal{L}(K)$ is infinite, and that its smallest element can be bounded from above by a function of the degree and discriminant of $K$. Further, show that for infinitely many $K$, $\mathcal{L}(K)$ contains infinitely many even and infinitely many odd elements.

Let $n$ be a positive integer and $p$ a prime number $p > n + 1$. Prove that the following equation does not have integer solution $$1 + \frac{x}{n + 1} + \frac{x^2}{2n + 1} + ...+ \frac{x^p}{pn + 1} = 0$$ Luu Ba Thang, Department of Mathematics, College of Education

Is it true that every integer is a sum of finite number of cubes of distinct integers?

A four-digit positive integer is called [i]virtual[/i] if it has the form $\overline{abab}$, where $a$ and $b$ are digits and $a \neq 0$. For example 2020, 2121 and 2222 are virtual numbers, while 2002 and 0202 are not. Find all virtual numbers of the form $n^2+1$, for some positive integer $n$.

Define $d(n)$ as the number of positive divisors of $n\in\mathbb{Z_+^*}$. Let $a$ and $b$ be positive integers satisfying the equality $$a + d(a) = b^2 + 2$$ Prove that $a+b$ is even.

Let $M(n)$ and $m(n)$ are maximal and minimal proper divisors of $n$ Natural number $n>1000$ is on the board. Every minute we replace our number with $n+M(n)-m(n)$. If we get prime, then process is stopped. Prove that after some moves we will get number, that is not divisible by $17$

Find all primes $p,q$ and even $n>2$ such that $p^n+p^{n-1}+...+1=q^2+q+1$.

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

Find the sum of all positive integers n with the property that the digits of n add up to 2015−n.

Which positive integers cannot be represented as a sum of (two or more) consecutive integers?