You are traveling in a foreign country whose currency consists of five different-looking kinds of coins. You have several of each coin in your pocket. You remember that the coins are worth $1, 2, 5, 10$, and $20$ florins, but you have no idea which coin is which and you don’t speak the local language. You find a vending machine where a single candy can be bought for $1$ florin: you insert any kind of coin, and receive $1$ candy plus any change owed. You can only buy one candy at a time, but you can buy as many as you want, one after the other. What is the least number of candies that you must buy to ensure that you can determine the values of all the coins? Prove that your answer is correct.

A positive integer $ m$ is called [i]good[/i] if there is a positive integer $ n$ such that $ m$ is the quotient of $ n$ by the number of positive integer divisors of $ n$ (including $ 1$ and $ n$ itself). Prove that $ 1, 2, \ldots, 17$ are good numbers and that $ 18$ is not a good number.

There are nonzero real numbers $a$ and $b$ so that the roots of $x^2 + ax + b$ are $3a$ and $3b$. There are relatively prime positive integers $m$ and $n$ so that $a - b = \tfrac{m}{n}$. Find $m + n$.

Prove that the set of all divisors of a positive integer which is not a perfect square can be divided into pairs so that in each pair, one number is divided by another.

Call admissible a set $A$ of integers that has the following property: If $x,y \in A$ (possibly $x=y$) then $x^2+kxy+y^2 \in A$ for every integer $k$. Determine all pairs $m,n$ of nonzero integers such that the only admissible set containing both $m$ and $n$ is the set of all integers. [i]Proposed by Warut Suksompong, Thailand[/i]

We consider the sum of the digits of a positive integer. For example, the sum of the digits of $2007$ is equal to $9$, since $2 + 0 + 0 + 7 = 9$. (a) How many integers $n$, where $0 < n < 100 000$, have an even sum of digits? (b) How many integers $n$, where $0 < n < 100 000$, have a sum of digits that is less than or equal to $22$?

Solve the equation in positive integers: $2^x-3^y 5^z=1009$.

A positive integer $k$ is called [i]powerful [/i] if there are distinct positive integers $p, q, r, s, t$ such that $p^2$, $q^3$, $r^5$, $s^7$, $t^{11}$ all divide k. Find the smallest powerful integer.

Solve the equation in postive integers $$x^2+y^2+1998=1997x-1999y.$$

Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?

Initially, a natural number $n$ is written on the blackboard. Then, at each minute, Esmeralda chooses a divisor $d>1$ of $n$, erases $n$, and writes $n+d$. If the initial number on the board is $2022$, what is the largest composite number that Esmeralda will never be able to write on the blackboard?

Write a positive integer in each box so that: All six numbers are different. The sum of the six numbers is $100$. If each number is multiplied by its neighbor (in a clockwise direction) and the six results of those six multiplications are added, the smallest possible value is obtained. Explain why a lower value cannot be obtained. [img]https://cdn.artofproblemsolving.com/attachments/7/1/6fdadd6618f91aa03cdd6720cc2d6ee296f82b.gif[/img]

Let $f(n) = \sum^n_{i=1}\frac{gcd(i,n)}{n}$. Find the sum of all positive integers $ n$ for which $f(n) = 6$.

The set of all $10$-digit numbers may be represented as a union of two subsets: the subset $M$ consisting of all $10$-digit numbers, each of which may be represented as a product of two $5$-digit numbers, and the subset $N$ , containing the remaining $10$-digit numbers . Which of the sets $M$ and $N$ contains more elements? (S. Fomin , Leningrad)

Let $n$ be a non-negative integer. Find all non-negative integers $a,b,c,d$ such that \[a^2+b^2+c^2+d^2=7\cdot 4^n\]

Suppose $a_{1} < a_{2}< \cdots < a_{2024}$ is an arithmetic sequence of positive integers, and $b_{1} <b_{2} < \cdots <b_{2024}$ is a geometric sequence of positive integers. Find the maximum possible number of integers that could appear in both sequences, over all possible choices of the two sequences. [i]Ray Li[/i]

Find all functions $f:\mathbb N\to\mathbb N$ satisfying $$x+f^{f(x)}(y)\mid2(x+y)$$for all $x,y\in\mathbb N$.

Determine all the positive integers with more than one digit, all distinct, such that the sum of its digits is equal to the product of its digits.

In boxes labeled $0$, $1$, $2$, $\dots$, we place integers according to the following rules: $\bullet$ If $p$ is a prime number, we place it in box $1$. $\bullet$ If $a$ is placed in box $m_a$ and $b$ is placed in box $m_b$, then $ab$ is placed in the box labeled $am_b+bm_a$. Find all positive integers $n$ that are placed in the box labeled $n$.

We define $A, B, C$ as a [i]partition[/i] of $\mathbb{N}$ if $A,B,C$ satisfies the following. (i) $A, B, C \not= \phi$ (ii) $A \cap B = B \cap C = C \cap A = \phi$ (iii) $A \cup B \cup C = \mathbb{N}$. Prove that the partition of $\mathbb{N}$ satisfying the following does not exist. (i) $\forall$ $a \in A, b \in B$, we have $a+b+2008 \in C$ (ii) $\forall$ $b \in B, c \in C$, we have $b+c+2008 \in A$ (iii) $\forall$ $c \in C, a \in A$, we have $c+a+2008 \in B$

We say that a positive integer $n$ is circular if it is possible to place the numbers $1, 2, \cdots , n$ in a circumference so that there are no three adjacent numbers whose sum is a multiple of 3. a) Show that 9 is not circular b) Show that any integer greater than 9 is circular.

[b]p1.[/b] Consider a normal $8 \times 8$ chessboard, where each square is labelled with either $1$ or $-1$. Let $a_k$ be the product of the numbers in the $k$th row, and let $b_k$ be the product of the numbers in the $k$th column. Find, with proof, all possible values of $\sum^8_{k=1}(a_kb_k)$. [b]p2.[/b] Let $\overline{AB}$ be a line segment with $AB = 1$, and $P$ be a point on $\overline{AB}$ with $AP = x$, for some $0 < x < 1$. Draw circles $C_1$ and $C_2$ with $\overline{AP}$, $\overline{PB}$ as diameters, respectively. Let $\overline{AB_1}$, $\overline{AB_2}$ be tangent to $C_2$ at $B_1$ and $B_2$, and let $\overline{BA_1}$;$\overline{BA_2}$ be tangent to $C_1$ at $A_1$ and $A_2$. Now $C_3$ is a circle tangent to $C_2$, $\overline{AB_1}$, and $\overline{AB_2}$; $C_4$ is a circle tangent to $C_1$, $\overline{BA_1}$, and $\overline{BA_2}$. (a) Express the radius of $C_3$ as a function of $x$. (b) Prove that $C_3$ and $C_4$ are congruent. [img]https://cdn.artofproblemsolving.com/attachments/c/a/fd28ad91ed0a4893608b92f5ccbd01088ae424.png[/img] [b]p3.[/b] Suppose that the graphs of $y = (x + a)^2$ and $x = (y + a)^2$ are tangent to one another at a point on the line $y = x$. Find all possible values of $a$. [b]p4.[/b] You may assume without proof or justification that the infinite radical expressions $\sqrt{a-\sqrt{a-\sqrt{a-\sqrt{a-...}}}}$ and $\sqrt{a-\sqrt{a+\sqrt{a-\sqrt{a+...}}}}$ represent unique values for $a > 2$. (a) Find a real number $a$ such that $$\sqrt{a-\sqrt{a-\sqrt{a-\sqrt{a+...}}}}= 2017$$ (b) Show that $$\sqrt{2018-\sqrt{2018+\sqrt{2018-\sqrt{2018+...}}}}=\sqrt{2017-\sqrt{2017-\sqrt{2017-\sqrt{2017-...}}}}$$ [b]p5.[/b] (a) Suppose that $m, n$ are positive integers such that $7n^2 - m^2 > 0$. Prove that, in fact, $7n^2 - m^2 \ge 3$. (b) Suppose that $m, n$ are positive integers such that $\frac{m}{n} <\sqrt7$. Prove that, in fact, $\frac{m}{n}+\frac{1}{mn} <\sqrt7$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Two coprime positive integers $ a, b $ are given. Integer sequence $ \{ a_n \}, \{b_n \} $ satisties \[ (a+b \sqrt2 )^{2n} = a_n + b_n \sqrt2 \] Find all prime numbers $ p $ such that there exist positive integer $ n \le p $ satisfying $ p | b_n $.

Prove that if $N{}$ is a large enough positive integer, then for any permutation $\pi_1,\ldots,\pi_N$ of $1,\ldots, N$ at least $11\%$ of the pairs $(i,j)$ of indices from $1{}$ to $N{}$ satisfy $\gcd(i,j)=1=\gcd(\pi_i,\pi_j).$ [i]Proposed by Vlad Spătaru[/i]

Find all pairs $(p, q)$ of prime numbers satisfying \[ p^3+7q=q^9+5p^2+18p. \]