Let $s (n)$ denote the sum of digits of a positive integer $n$. Using six different digits, we formed three 2-digits $p, q, r$ such that $$p \cdot q \cdot s(r) = p\cdot s(q) \cdot r = s (p) \cdot q \cdot r.$$ Find all such numbers $p, q, r$.

Prove that there are do not exist natural numbers $k, m$ such that numbers $k^2+2m$, $m^2+2k$ to be squares of integers.

Prove that there aren't any positive integrer numbers $x,y,z$ such that $x^2+y^2=3z^2$.

Jeff writes down the two-digit base-$10$ prime $\overline{ab_{10}}$. He realizes that if he misinterprets the number as the base $11$ number $\overline{ab_{11}}$ or the base $12$ number $\overline{ab_{12}}$, it is still a prime. What is the least possible value of Jeff’s number (in base $10$)? [i]Proposed byMuztaba Syed[/i]

$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are  given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree  $\le n$ that satisfies the following conditions? a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $ b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $ [i]Proposed by Mojtaba Zare[/i]

Find all positive integers $n>1$ such that \[\tau(n)+\phi(n)=n+1\] Which in this case, $\tau(n)$ represents the amount of positive divisors of $n$, and $\phi(n)$ represents the amount of positive integers which are less than $n$ and relatively prime with $n$. [i]Raja Oktovin, Pekanbaru[/i]

[u]Round 5[/u] [b]p13.[/b] In coordinate space, a lattice point is a point all of whose coordinates are integers. The lattice points $(x, y, z)$ in three-dimensional space satisfying $0 \le x, y, z \le 5$ are colored in n colors such that any two points that are $\sqrt3$ units apart have different colors. Determine the minimum possible value of $n$. [b]p14.[/b] Determine the number of ways to express $121$ as a sum of strictly increasing positive Fibonacci numbers. [b]p15.[/b] Let $ABCD$ be a rectangle with $AB = 7$ and $BC = 15$. Equilateral triangles $ABP$, $BCQ$, $CDR$, and $DAS$ are constructed outside the rectangle. Compute the area of quadrilateral $P QRS$. [u] Round 6[/u] Each of the three problems in this round depends on the answer to one of the other problems. There is only one set of correct answers to these problems; however, each problem will be scored independently, regardless of whether the answers to the other problems are correct. [b]p16.[/b] Let $C$ be the answer to problem $18$. Suppose that $x$ and $y$ are real numbers with $y > 0$ and $$x + y = C$$ $$x +\frac{1}{y} = -2.$$ Compute $y +\frac{1}{y}$. [b]p17.[/b] Let $A$ be the answer to problem $16$. Let $P QR$ be a triangle with $\angle P QR = 90^o$, and let $X$ be the foot of the perpendicular from point $Q$ to segment $P R$. Given that $QX = A$, determine the minimum possible area of triangle $PQR$. [b]p18.[/b] Let $B$ be the answer to problem $17$ and let $K = 36B$. Alice, Betty, and Charlize are identical triplets, only distinguishable by their hats. Every day, two of them decide to exchange hats. Given that they each have their own hat today, compute the probability that Alice will have her own hat in $K$ days. [u]Round 7[/u] [b]p19.[/b] Find the number of positive integers a such that all roots of $x^2 + ax + 100$ are real and the sum of their squares is at most $2013$. [b]p20.[/b] Determine all values of $k$ such that the system of equations $$y = x^2 - kx + 1$$ $$x = y^2 - ky + 1$$ has a real solution. [b]p21.[/b] Determine the minimum number of cuts needed to divide an $11 \times 5 \times 3$ block of chocolate into $1\times 1\times 1$ pieces. (When a block is broken into pieces, it is permitted to rotate some of the pieces, stack some of the pieces, and break any set of pieces along a vertical plane simultaneously.) [u]Round 8[/u] [b]p22.[/b] A sequence that contains the numbers $1, 2, 3, ... , n$ exactly once each is said to be a permutation of length $n$. A permutation $w_1w_2w_3... w_n$ is said to be sad if there are indices $i < j < k$ such that $w_j > w_k$ and $w_j > w_i$. For example, the permutation $3142756$ is sad because $7 > 6$ and $7 > 1$. Compute the number of permutations of length $11$ that are not sad. [b]p23.[/b] Let $ABC$ be a triangle with $AB = 39$, $BC = 56$, and $CA = 35$. Compute $\angle CAB - \angle ABC$ in degrees. [b]p24.[/b] On a strange planet, there are $n$ cities. Between any pair of cities, there can either be a one-way road, two one-way roads in different directions, or no road at all. Every city has a name, and at the source of every one-way road, there is a signpost with the name of the destination city. In addition, the one-way roads only intersect at cities, but there can be bridges to prevent intersections at non-cities. Fresh Mann has been abducted by one of the aliens, but Sophy Moore knows that he is in Rome, a city that has no roads leading out of it. Also, there is a direct one-way road leading from each other city to Rome. However, Rome is the secret police’s name for the so-described city; its official name, the name appearing on the labels of the one-way roads, is unknown to Sophy Moore. Sophy Moore is currently in Athens and she wants to head to Rome in order to rescue Fresh Mann, but she does not know the value of $n$. Assuming that she tries to minimize the number of roads on which she needs to travel, determine the maximum possible number of roads that she could be forced to travel in order to find Rome. Express your answer as a function of $n$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2809419p24782489]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A set of five-digit numbers $\{N_1, ...,N_k\}$ is such that any five-digit number, all of whose digits are in non-decreasing order, coincides in at least one digit with at least one of the numbers $N_1$, $...$ , $N_k$. Find the smallest possible value of $k$.

A positive integer is [i]totally square[/i] is the sum of its digits (written in base $10$) is a square number. For example, $13$ is totally square because $1 + 3 = 2^2$, but $16$ is not totally square. Show that there are infinitely many positive integers that are not the sum of two totally square integers.

In a multiplication table, the entry in the $i$-th row and the $j$-th column is the product $ij$ From an $m\times n$ subtable with both $m$ and $n$ odd, the interior $(m-2) (n-2)$ rectangle is removed, leaving behind a frame of width $1$. The squares of the frame are painted alternately black and white. Prove that the sum of the numbers in the black squares is equal to the sum of the numbers in the white squares.

Find all nonegative integers $ x,y,z$ such that $ 12^x\plus{}y^4\equal{}2008^z$

Let $x, y$ be two integers. Prove that if $2013$ divides $x^{1433} + y^{1433}$ then $2013$ divides $x^7 + y^7$.

Find all pairs of integers $(x,y)$ satisfying $x^2 +3y^2 = 1998x$.

Determine all pairs ($m,n$) of natural numbers for which $4^m + 5^n$ is a perfect square.

$A$ is a non-empty subset of positive integers. Let $$f(A)=\{abc-b-c+2\vert a,b,c\in A\}$$ Determine all integers $n$ greater than $1$ so that we can divide the set of positive integers into $A_1, A_2, \dots, A_n$ ($A_i\neq \emptyset (i=1, 2, \dots , n)$, $\forall 1\le i < j \le n, A_i\cap A_j = \emptyset$ and $\bigcup_{i=1}^{n} A_i=\mathbb{N}^*$) satisfy that $\forall 1\le i\le n, f(A_i) \subseteq A_i$.

Given an integer $n > 1$, let $1 = a_1 < a_2 < \cdots < a_t = n - 1$ be all positive integers less than $n$ that are coprime to $n$. Find all $n$ such that there is no $i \in \{1, 2, \ldots , t - 1\}$ satisfying $3 | a_i + a_{i+1}$.

[list=a] [*] Find an example of three positive integers $a,b,c$ satisfying $31a+30b+28c=365$. [*] Prove that any triplet $a,b,c$ satisfying the above condition, also satisfies $a+b+c=12$. [/list]

Prove that if $ n $ is a natural number greater than $ 2 $, then $$\sqrt[n + 1]{n+1} < \sqrt[n]{n}.$$

Determine all integer values of n for which the number $\frac{14n+25}{2n+1}$ 'is a perfect square.

Find the smallest positive integer $n$ such that $2n+1$ and $3n+1$ are both squares

[u]Round 1[/u] [b]p1.[/b] Ash is running around town catching Pokémon. Each day, he may add $3, 4$, or $5$ Pokémon to his collection, but he can never add the same number of Pokémon on two consecutive days. What is the smallest number of days it could take for him to collect exactly $100$ Pokémon? [b]p2.[/b] Jack and Jill have ten buckets. One bucket can hold up to $1$ gallon of water, another can hold up to $2$ gallons, and so on, with the largest able to hold up to $10$ gallons. The ten buckets are arranged in a line as shown below. Jack and Jill can pour some amount of water into each bucket, but no bucket can have less water than the one to its left. Is it possible that together, the ten buckets can hold 36 gallons of water? [img]https://cdn.artofproblemsolving.com/attachments/f/8/0b6524bebe8fe859fe7b1bc887ac786106fc17.png[/img] [b]p3.[/b] There are $2023$ knights and liars standing in a row. Knights always tell the truth and liars always lie. Each of them says, “the number of liars to the left of me is greater than the number of knights to the right.” How many liars are there? [b]p4.[/b] Camila has a deck of $101$ cards numbered $1, 2, ..., 101$. She starts with $50$ random cards in her hand and the rest on a table with the numbers visible. In an exchange, she replaces all $50$ cards in her hand with her choice of $50$ of the $51$ cards from the table. Show that Camila can make at most 50 exchanges and end up with cards $1, 2, ..., 50$. [img]https://cdn.artofproblemsolving.com/attachments/0/6/c89e65118764f3b593da45264bfd0d89e95067.png[/img] [b]p5.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [u]Round 2[/u] [b]p6.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company will lay lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses. The Edison lighting company will hang strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [b]p7.[/b] You are given a sequence of $16$ digits. Is it always possible to select one or more digits in a row, so that multiplying them results in a square number? [img]https://cdn.artofproblemsolving.com/attachments/d/1/f4fcda2e1e6d4a1f3a56cd1a04029dffcd3529.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions: [list] [*] $(i)$ $f(n) \neq 0$ for at least one $n$; [*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$; [*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$. [/list]

Bob chose six of the nine digits from $1$ to $9$ and wrote the list, ordered from smallest to largest, of all three-digit numbers that can be formed using the digits you chose. At Bob's list, the number $317$ appears at position $22$. What number appears at position $60$ in the list from Bob? Find all possibilities.

For any set $A = \{x_1, x_2, x_3, x_4, x_5\}$ of five distinct positive integers denote by $S_A$ the sum of its elements, and denote by $T_A$ the number of triples $(i, j, k)$ with $1 \le i < j < k \le 5$ for which $x_i + x_j + x_k$ divides $S_A$. Find the largest possible value of $T_A$.

Given positive integers $ a,b,$ find all positive integers $ x,y$ satisfying the equation: $ x^{a\plus{}b}\plus{}y\equal{}x^a y^b$.