The natural numbers $a$ and $b$ are such that $a^a$ is divisible by $b^b$. Can we say that then $a$ is divisible by $b$?

What is the smallest positive integer $n$ which cannot be written in any of the following forms? $\bullet$ $n = 1 + 2 +... + k$ for a positive integer $k$. $\bullet$ $n = p^k$ for a prime number $p$ and integer $k$. $\bullet$ $n = p + 1$ for a prime number $p$.

Find the least positive integer that cannot be represented as $\frac{2^a-2^b}{2^c-2^d}$ for some positive integers $a, b, c, d$.

Denote by $(a, b)$ the greatest common divisor of $a$ and $b$. Let $n$ be a positive integer such that $(n, n + 1) < (n, n + 2) <... < (n,n + 35)$. Prove that $(n, n + 35) < (n,n + 36)$.

A positive integer \( n \) satisfies the following conditions: [list] [*] The number \( n \) has exactly \( 60 \) divisors: \( 1 = a_1 < a_2 < \cdots < a_{60} = n \); [*] The number \( n+1 \) also has exactly \( 60 \) divisors: \( 1 = b_1 < b_2 < \cdots < b_{60} = n+1 \). [/list] Let \( k \) be the number of indices \( i \) such that \( a_i < b_i \). Find all possible values of \( k \). [i]Note: Such numbers exist, for example, the numbers \( 4388175 \) and \( 4388176 \) both have \( 60 \) divisors.[/i] [i]Proposed by Anton Trygub[/i]

Call a positive integer [i]emphatic[/i] if it can be written in the form $a^2+b!$, where $a$ and $b$ are positive integers. Prove that there are infinitely many positive integers $n$ such that $n$, $n+1$, and $n+2$ are all [i]emphatic[/i]. [i]Allen Wang[/i]

Prove that there are infinitely many positive integers $n$ such that $n^2$ written in base $4$ contains only digits $1$ and $2$.

Consider the sequence $a(n)$ defined by the following conditions: $$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$ Prove that the sequence contains an infinite number of perfect squares. (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.) (A Andjans)

Consider the following equation in $x$: $$ax (x^2 + ax + 1) = b (x^2 + b + 1).$$ It is known that $a, b$ are real such that $ab <0$ and furthermore the equation has exactly two integer roots positive. Prove that under these conditions $a^2 + b^2$ is not a prime number.

Let $a$, $b$, and $c$ be positive integers for which the number \[\frac{a\sqrt2+b}{b\sqrt2+c}\] is rational. Show that the number $ab+bc+ca$ is divisible by $a+b+c$.

Let $\mathbb{N} = \{1, 2, 3, \dots \}$ be the set of positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$, such that for all positive integers $n$ and prime numbers $p$: $$p \mid f(n)f(p-1)!+n^{f(p)}.$$ [i]Proposed by Dorlir Ahmeti[/i]

Find the smallest positive prime that divides $n^2 + 5n + 23$ for some integer $n$.

Let $ABCD$ be a convex quadrilateral with $\angle ABC = 120^{\circ}$ and $\angle BCD = 90^{\circ}$, and let $M$ and $N$ denote the midpoints of $\overline{BC}$ and $\overline{CD}$. Suppose there exists a point $P$ on the circumcircle of $\triangle CMN$ such that ray $MP$ bisects $\overline{AD}$ and ray $NP$ bisects $\overline{AB}$. If $AB + BC = 444$, $CD = 256$ and $BC = \frac mn$ for some relatively prime positive integers $m$ and $n$, compute $100m+n$. [i]Proposed by Michael Ren[/i]

Given three distinct positive integers such that one of them is the average of the two others. Can the product of these three integers be the perfect 2008th power of a positive integer?

There exists an infinite set of triangles with the following properties: (a) the lengths of the sides are integers with no common factors, and (b) one and only one angle is $60^\circ$. One such triangle has side lengths $5,7,8$. Find two more.

Find the triplets of primes $(a,\ b,\ c)$ such that $a-b-8$ and $b-c-8$ are primes.

Let $p$ be a prime number and $k,r$ are positive integers such that $p>r$. If $pk+r$ divides $p^p+1$ then prove that $r$ divides $k$.

Let $a_1, a_2, a_3, \ldots$ a sequence of positive integers that satisfy the following conditions: $$a_1=1, a_{n+1}=a_n+a_{\lfloor \sqrt{n} \rfloor}, \forall n\ge 1$$ Prove that for every positive integer $k$ there exists a term $a_i$ that is divisible by $k$

Determine all integer $n > 1$ such that \[\gcd \left( n, \dfrac{n-m}{\gcd(n,m)} \right) = 1\] for all integer $1 \le m < n$.

A two digit number $s$ is special if $s$ is the common two leading digits of the decimal expansion of $4^n$ and $5^n$, where $n$ is a certain positive integer. Given that there are two special number, find these two special numbers.

Determine all integers $a$ such that $a^k + 1$ is divisible by $12321$ for some $k$

[b]p1.[/b] An organization decides to raise funds by holding a $\$60$ a plate dinner. They get prices from two caterers. The first caterer charges $\$50$ a plate. The second caterer charges according to the following schedule: $\$500$ set-up fee plus $\$40$ a plate for up to and including $61$ plates, and $\$2500$ $\log_{10}\left(\frac{p}{4}\right)$ for $p > 61$ plates. a) For what number of plates $N$ does it become at least as cheap to use the second caterer as the first? b) Let $N$ be the number you found in a). For what number of plates $X$ is the second caterer's price exactly double the price for $N$ plates? c) Let $X$ be the number you found in b). When X people appear for the dinner, how much profit does the organization raise for itself by using the second caterer? [b]p2.[/b] Let $N$ be a positive integer. Prove the following: a) If $N$ is divisible by $4$, then $N$ can be expressed as the sum of two or more consecutive odd integers. b) If $N$ is a prime number, then $N$ cannot be expressed as the sum of two or more consecutive odd integers. c) If $N$ is twice some odd integer, then $N$ cannot be expressed as the sum of two or more consecutive odd integers. [b]p3.[/b] Let $S =\frac{1}{1^2} +\frac{1}{2^2}+\frac{1}{3^2}+\frac{1}{4^2}+...$ a) Find, in terms of $S$, the value of $S =\frac{1}{2^2} +\frac{1}{4^2}+\frac{1}{6^2}+\frac{1}{8^2}+...$ b) Find, in terms of $S$, the value of$S =\frac{1}{1^2} +\frac{1}{3^2}+\frac{1}{5^2}+\frac{1}{7^2}+...$ c) Find, in terms of $S$, the value of$S =\frac{1}{1^2} -\frac{1}{2^2}+\frac{1}{3^2}-\frac{1}{4^2}+...$ [b]p4.[/b] Let $\{P_1, P_2, P_3, ...\}$ be an infinite set of points on the $x$-axis having positive integer coordinates, and let $Q$ be an arbitrary point in the plane not on the $x$-axis. Prove that infinitely many of the distances $|P_iQ|$ are not integers. a) Draw a relevant picture. b) Provide a proof. [b]p5.[/b] Point $P$ is an arbitrary point inside triangle $ABC$. Points $X$, $Y$ , and $Z$ are constructed to make segments $PX$, $PY$ , and $PZ$ perpendicular to $AB$, $BC$, and $CA$, respectively. Let $x$, $y$, and $z$ denote the lengths of the segments $PX$, $PY$ , and $PZ$, respectively. a) If triangle $ABC$ is an equilateral triangle, prove that $x + y + z$ does not change regardless of the location of $P$ inside triangle ABC. b) If triangle $ABC$ is an isosceles triangle with $|BC| = |CA|$, prove that $x + y + z$ does not change when $P$ moves along a line parallel to $AB$. c) Now suppose that triangle $ABC$ is scalene (i.e., $|AB|$, $|BC|$, and $|CA|$ are all different). Prove that there exists a line for which $x+y+z$ does not change when $P$ moves along this line. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For all integers $n\geq 2$, let $f(n)$ denote the largest positive integer $m$ such that $\sqrt[m]{n}$ is an integer. Evaluate \[f(2)+f(3)+\cdots+f(100).\]

On a table near the sea, there are $N$ glass boxes where $N<2021$, each containing exactly $2021$ balls. Sowdha and Rafi play a game by taking turns on the boxes where Sowdha takes the first turn. In each turn, a player selects a non-empty box and throws out some of the balls from it into the sea. If a player wants, he can throw out all of the balls in the selected box. The player who throws out the last ball wins. Let $S$ be the sum of all values of $N$ for which Sowdha has a winning strategy and let $R$ be the sum of all values of $N$ for which Rafi has a winning strategy. What is the value of $\frac{R-S}{10}$?

The game Boddle uses eight cards numbered $6, 11, 12, 14, 24, 47, 54$, and $n$, where $0 \le n \le 56$. An integer D is announced, and players try to obtain two cards, which are not necessarily distinct, such that one of their differences (positive or negative) is congruent to $D$ modulo $57$. For example, if $D = 27$, then the pair $24$ and $54$ would work because $24 - 54 \equiv 27$ mod $57$. Compute $n$ such that this task is always possible for all $D$.