Find all positive integers $n$ such that for any positive integer $a$ relatively prime to $n$, $2n^2 \mid a^n - 1$.

In the adjacent figure, can the numbers $1,2,3, 4,..., 18$ be placed, one on each line segment, such that the sum of the numbers on the three line segments meeting at each point is divisible by $3$?

Palmer correctly computes the product of the first $1,001$ prime numbers. Which of the following is NOT a factor of Palmer's product? $\text{(A) }2,002\qquad\text{(B) }3,003\qquad\text{(C) }5,005\qquad\text{(D) }6,006\qquad\text{(E) }7,007$

Let $C$ be the circle with center $O(0,0)$ and radius $1$, and $A(1,0), B(0,1)$ be points on the circle. Distinct points $A_1,A_2, ....,A_{n-1}$ on $C$ divide the smaller arc $AB$ into $n$ equal parts ($n \ge 2$). If $P_i$ is the orthogonal projection of $A_i$ on $OA$ ($i =1, ... ,n-1$), find all values of $n$ such that $P_1A^{2p}_1 +P_2A^{2p}_2 +...+P_{n-1}A^{2p}_{n-1}$ is an integer for every positive integer $p$.

Find all primes $p$ such that $\frac{2^{p-1}-1}{p}$ is a perfect square.

Prove without using modulo that there are no integers $a,b,c$ such that $$a^2+b^2-8c = 6$$ [i](Metamorphosis)[/i]

Given a list of integers $2^1+1, 2^2+1, \ldots, 2^{2019}+1$, Adam chooses two different integers from the list and computes their greatest common divisor. Find the sum of all possible values of this greatest common divisor.

Let $a, b, c $and $d$ be integers such that for all integers m and n, there exist integers $x$ and $y$ such that $ax + by = m$, and $cx + dy = n$. Prove that $ad - bc = \pm 1$.

Does there exist natural numbers $a,b,c$ all greater than $10^{10}$ such that their product is divisible by each of these numbers increased by $2012$?

Let the integers $a, b, c, d$ be relatively prime to $$m = ad - bc.$$ Prove that the pairs of integers $(x,y)$ for which $ax+by$ is a multiple of $m$ are identical with those for which $cx + dy$ is a multiple of $m$.

1. (a) For which positive integers n, does 2n divide the sum of the first n positive integers? (b) Determine, with proof, those positive integers n (if any) which have the property that 2n + 1 divides the sum of the first n positive integers.

Let $p$ be a prime number. The natural numbers $m$ and $n$ are written in the system with the base $p$ as $n = a_0 + a_1p +...+ a_kp^k$ and $m = b_0 + b_1p +..+ b_kp^k$. Prove that $${n \choose m} \equiv \prod_{i=0}^{k}{a_i \choose b_i} (mod p)$$

There exist $4$ positive integers $a,b,c,d$ such that $abcd \neq 1$ and each pair of them have a GCD of $1$. Two functions $f,g : \mathbb{N} \rightarrow \{0,1\}$ are multiplicative functions such that for each positive integer $n$ we have : $$f(an+b)=g(cn+d)$$ Prove that at least one of the followings hold. $i)$ for each positive integer $n$ we have $f(an+b)=g(cn+d)=0$ $ii)$ There exists a positive integer $k$ such that for all $n$ where $(n,k)=1$ we have $g(n)=f(n)=1$ (Function $f$ is multiplicative if for any natural numbers $a,b$ we have $f(ab)=f(a)f(b)$) Proposed by [i]Navid Safaii[/i]

Let $A=\{1,2,3,\ldots,40\}$. Find the least positive integer $k$ for which it is possible to partition $A$ into $k$ disjoint subsets with the property that if $a,b,c$ (not necessarily distinct) are in the same subset, then $a\ne b+c$.

Let $a_n$ be the least positive integer the sum of whose digits is $n$. Find $a_1 + a_2 + a_3 + \dots + a_{20}$.

Let $ A$ be a set of positive integers such that no positive integer greater than 1 divides all the elements of $ A.$ Prove that any sufficiently large positive integer can be written as a sum of elements of $ A.$ (Elements may occur several times in the sum.)

Let the function $f:N^*\to N^*$ such that [b](1)[/b] $(f(m),f(n))\le (m,n)^{2014} , \forall m,n\in N^*$; [b](2)[/b] $n\le f(n)\le n+2014 , \forall n\in N^*$ Show that: there exists the positive integers $N$ such that $ f(n)=n $, for each integer $n \ge N$. (High School Affiliated to Nanjing Normal University )

[u]Round 1[/u] [b]p1.[/b] Goldilocks enters the home of the three bears – Papa Bear, Mama Bear, and Baby Bear. Each bear is wearing a different-colored shirt – red, green, or blue. All the bears look the same to Goldilocks, so she cannot otherwise tell them apart. The bears in the red and blue shirts each make one true statement and one false statement. The bear in the red shirt says: “I'm Blue's dad. I'm Green's daughter.” The bear in the blue shirt says: “Red and Green are of opposite gender. Red and Green are my parents.” Help Goldilocks find out which bear is wearing which shirt. [b]p2.[/b] The University of Washington is holding a talent competition. The competition has five contests: math, physics, chemistry, biology, and ballroom dancing. Any student can enter into any number of the contests but only once for each one. For example, a student may participate in math, biology, and ballroom. It turned out that each student participated in an odd number of contests. Also, each contest had an odd number of participants. Was the total number of contestants odd or even? [b]p3.[/b] The $99$ greatest scientists of Mars and Venus are seated evenly around a circular table. If any scientist sees two colleagues from her own planet sitting an equal number of seats to her left and right, she waves to them. For example, if you are from Mars and the scientists sitting two seats to your left and right are also from Mars, you will wave to them. Prove that at least one of the $99$ scientists will be waving, no matter how they are seated around the table. [b]p4.[/b] One hundred boys participated in a tennis tournament in which every player played each other player exactly once and there were no ties. Prove that after the tournament, it is possible for the boys to line up for pizza so that each boy defeated the boy standing right behind him in line. [b]p5.[/b] To celebrate space exploration, the Science Fiction Museum is going to read Star Wars and Star Trek stories for $24$ hours straight. A different story will be read each hour for a total of $12$ Star Wars stories and $12$ Star Trek stories. George and Gene want to listen to exactly $6$ Star Wars and $6$ Star Trek stories. Show that no matter how the readings are scheduled, the friends can find a block of $12$ consecutive hours to listen to the stories together. [u]Round 2[/u] [b]p6.[/b] $2013$ people attended Cinderella's ball. Some of the guests were friends with each other. At midnight, the guests started turning into mice. After the first minute, everyone who had no friends at the ball turned into a mouse. After the second minute, everyone who had exactly one friend among the remaining people turned into a mouse. After the third minute, everyone who had two human friends left in the room turned into a mouse, and so on. What is the maximal number of people that could have been left at the ball after $2013$ minutes? [b]p7.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In this problem, we consider integers consisting of $5$ digits, of which the rst and last one are nonzero. We say that such an integer is a palindromic product if it satises the following two conditions: - the integer is a palindrome, (i.e. it doesn't matter if you read it from left to right, or the other way around); - the integer is a product of two positive integers, of which the first, when read from left to right, is equal to the second, when read from right to left, like $4831$ and $1384$. For example, $20502$ is a palindromic product, since $102 \cdot 201 = 20502$, and $20502$ itself is a palindrome. Determine all palindromic products of $5$ digits.

Let $ x_1 , x_2, x_3 ...$ a succession of positive integers such that for every couple of positive integers $(m,n)$ we have $ x_{mn} \neq x_{m(n+1)}$ . Prove that there exists a positive integer $i$ such that $x_i \ge 2017 $.

Determine all functions $f:\mathbb{Z}^+\to \mathbb{Z}$ which satisfy the following condition for all pairs $(x,y)$ of [i]relatively prime[/i] positive integers: \[f(x+y) = f(x+1) + f(y+1).\]

Prove that $(n!)!$ is a multiple of $(n!)^{(n-1)!}$

Let $p$ be an odd prime. Determine the positive integers $x$ and $y$ with $x\leq y$ for which the number $\sqrt{2p}-\sqrt{x}-\sqrt{y}$ is non-negative and as small as possible.

Find all pairs of natural numbers $(m,n)$ bigger than $1$ for which $2^m+3^n$ is the square of whole number. [i]I. Tonov[/i]

Let $a,b, c,d$ be four integers. Prove that the product of the six differences $$b - a,c - a,d - a,d - c,d - b, c - b$$ is divisible by $12$.