Find all pairs $(a,b)$ of positive integers such that $a^{2017}+b$ is a multiple of $ab$.

We define $ f: \mathbb{N} \rightarrow \mathbb{N}$, $ f(n) \equal{} \sum_{k \equal{} 1}^{n}(k,n)$. a) Show that if $ \gcd(m,n)\equal{}1$ then we have $ f(mn)\equal{}f(m)\cdot f(n)$; b) Show that $ \sum_{d|n}f(d) \equal{} nd(n)$.

[u]Round 1 [/u] [b]p1.[/b] In the convex quadrilateral $ABCD$ with diagonals $AC$ and $BD$, you know that angle $BAC$ is congruent to angle $CBD$, and that angle $ACD$ is congruent to angle $ADB$. Show that angle $ABC$ is congruent to angle $ADC$. [img]https://cdn.artofproblemsolving.com/attachments/5/d/41cd120813d5541dc73c5d4a6c86cc82747fcc.png[/img] [b]p2.[/b] In how many different ways can you place $12$ chips in the squares of a $4 \times 4$ chessboard so that (a) there is at most one chip in each square, and (b) every row and every column contains exactly three chips. [b]p3.[/b] Students from Hufflepuff and Ravenclaw were split into pairs consisting of one student from each house. The pairs of students were sent to Honeydukes to get candy for Father's Day. For each pair of students, either the Hufflepuff student brought back twice as many pieces of candy as the Ravenclaw student or the Ravenclaw student brought back twice as many pieces of candy as the Hufflepuff student. When they returned, Professor Trelawney determined that the students had brought back a total of $1000$ pieces of candy. Could she have possibly been right? Why or why not? Assume that candy only comes in whole pieces (cannot be divided into parts). [b]p4.[/b] While you are on a hike across Deception Pass, you encounter an evil troll, who will not let you across the bridge until you solve the following puzzle. There are six stones, two colored red, two colored yellow, and two colored green. Aside from their colors, all six stones look and feel exactly the same. Unfortunately, in each colored pair, one stone is slightly heavier than the other. Each of the lighter stones has the same weight, and each of the heavier stones has the same weight. Using a balance scale to make TWO measurements, decide which stone of each color is the lighter one. [b]p5.[/b] Alex, Bob and Chad are playing a table tennis tournament. During each game, two boys are playing each other and one is resting. In the next game the boy who lost a game goes to rest, and the boy who was resting plays the winner. By the end of tournament, Alex played a total of $10$ games, Bob played $15$ games, and Chad played $17$ games. Who lost the second game? [u]Round 2 [/u] [b]p6.[/b] Consider a set of finitely many points on the plane such that if we choose any three points $A,B,C$ from the set, then the area of the triangle $ABC$ is less than $1$. Show that all of these points can be covered by a triangle whose area is less than $4$. [b]p7.[/b] A palindrome is a number that is the same when read forward and backward. For example, $1771$ and $23903030932$ are palindromes. Can the number obtained by writing the numbers from $1$ to $n$ in order be a palindrome for some $n > 1$ ? (For example, if $n = 11$, the number obtained is $1234567891011$, which is not a palindrome.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer and $f(x)=a_mx^m+\ldots + a_1X+a_0$, with $m\ge 2$, a polynomial with integer coefficients such that: a) $a_2,a_3\ldots a_m$ are divisible by all prime factors of $n$, b) $a_1$ and $n$ are relatively prime. Prove that for any positive integer $k$, there exists a positive integer $c$, such that $f(c)$ is divisible by $n^k$.

a) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers \[g^n - n\quad\text{ and }\quad g^{n+1} - (n + 1).\] b) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers \[g^n - n^2\quad\text{ and }g^{n+1} - (n + 1)^2.\]

Suppose that $y$ is a positive integer written only with digit $1$, in base $9$ system. Prove that $y$ is a triangular number, that is, exists positive integer $n$ such that the number $y$ is the sum of the $n$ natural numbers from $1$ to $n$.

Find all prime numbers $p$ and $q$ such that\[p^3-3^q=10.\] [i]Proposed by Md. Fuad Al Alam[/i]

Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ . [i]Proposed by Serbia[/i]

Find all pairs of positive integers \((a, b)\) such that \[ \frac{a+1}{b} , \frac{b+1}{a} \] are both positive integers.

The $n$-factorial of a positive integer $x$ is the product of all positive integers less than or equal to $z$ that are congruent to $z$ modulo $n$. For example, for the number 16, its 2-factorial is $16 \times 14 \times 12 \times 10 \times 8 \times 6 \times 4 \times 2$, its 3-factorial is $16 \times 13 \times 10 \times 7 \times 4 \times 1$ and its 18-factorial is 16. A positive integer is called [i]olympic[/i] if it has $n$ digits, all different than zero, and if it is equal to the sum of the $n$-factorials of its digits. Find all positive olympic integers.

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

For $n\ne 0$, let f(n) be the largest $k$ such that $3^k$ divides $n$. If $M$ is a set of $n > 1$ integers, show that the number of possible values for $f(m-n)$, where $m, n$ belong to $M$ cannot exceed $n-1$.

Let $p$ be a prime number, and let $n$ be a positive integer. Find the number of quadruples $(a_1, a_2, a_3, a_4)$ with $a_i\in \{0, 1, \ldots, p^n - 1\}$ for $i = 1, 2, 3, 4$, such that \[p^n \mid (a_1a_2 + a_3a_4 + 1).\]

Solve the following system of equations in positive integers \[\left\{\begin{array}{cc}a^3-b^3-c^3=3abc\\ \\ a^2=2(b+c)\end{array}\right.\]

Determine all nonempty finite sets of positive integers $\{a_1, \dots, a_n\}$ such that $a_1 \cdots a_n$ divides $(x + a_1) \cdots (x + a_n)$ for every positive integer $x$. [i]Proposed by Ankan Bhattacharya[/i]

To unlock his cell phone, Joao slides his finger horizontally or vertically across a numerical box, similar to the one represented in the figure, describing a $7$-digit code, without ever passing through the same digit twice. For example, to indicate the code $1452369$, Joao follows the path indicated in the figure. [img]https://cdn.artofproblemsolving.com/attachments/8/a/511018ba4e43c2c6f0be350d57161eb5ea7c2b.png[/img] João forgot his code, but he remembers that it is divisible by $9$. How many codes are there under these conditions?

$\text{Prove that each integer}$ $n\ge3$ can be written as a sum of some consecutive natural numbers only and only if it isn't a power of 2

Find all pairs $(x, y)$ of positive integers satisfying the equation $(x + y)^x = x^y$.

Let $p$ and $n$ be a natural numbers such that $p$ is a prime and $1+np$ is a perfect square. Prove that the number $n+1$ is sum of $p$ perfect squares.

For which $ p$ prime numbers, there is an integer root of the polynominal $ 1 \plus{} p \plus{} Q(x^1)\cdot\ Q(x^2)\ldots\ Q(x^{2p \minus{} 2})$ such that $ Q(x)$ is a polynominal with integer coefficients?

Prove that there are infinitely many quadruples of integers $(a,b,c,d)$ such that \begin{align*} a^2 + b^2 + 3 &= 4ab\\ c^2 + d^2 + 3 &= 4cd\\ 4c^3 - 3c &= a \end{align*} [i]Travis Hance.[/i]

A positive integer is a good number, if its base $10$ representation can be split into at least $5$ sections, each section with a non-zero digit, and after interpreting each section as a positive integer (omitting leading zero digits), they can be split into two groups, such that each group can be reordered to form a geometric sequence (if a group has $1$ or $2$ numbers, it is also a geometric sequence), for example $20240327$ is a good number, since after splitting it as $2|02|403|2|7$, $2|02|2$ and $403|7$ form two groups of geometric sequences. If $a>1$, $m>2$, $p=1+a+a^2+\dots+a^m$ is a prime, prove that $\frac{10^{p-1}-1}{p}$ is a good number.

Now Wendy wanders over and joins Dr. Lisi and her younger siblings. Thinking she knows everything there is about how to work with arithmetic series, she nearly turns right around to walk back home when Dr. Lisi poses a more challenging problem. "Suppose I select two distinct terms at random from the $2008$ term sequence. What's the probability that their product is positive?" If $a$ and $b$ are relatively prime positive integers such that $a/b$ is the probability that the product of the two terms is positive, find the value of $a+b$.

How many different ways are there to write 2004 as a sum of one or more positive integers which are all "aproximately equal" to each other? Two numbers are called aproximately equal if their difference is at most 1. The order of terms does not matter: two ways which only differ in the order of terms are not considered different.

Prove that for every $ n \in \mathbb{N}^*$ exists a multiple of $ n$, having sum of digits equal to $ n$.