Find all natural numbers $n$ for which both $n^n + 1$ and $(2n)^{2n} + 1$ are prime numbers.

Find unequal integers $m, n$ such that $mn + n$ and $mn + m$ are both squares. Can you find such integers between $988$ and $1991$?

Find all functions $f : Z^+ \to Z^+$ satisfying $f (1) = 2, f (2) \ne 4$, and max $\{f (m) + f (n), m + n\} |$ min $\{2m + 2n, f (m + n) + 1\}$ for all $m, n \in Z^+$.

The digits $2,3,4,5,6,7,8,9$ are written down in some order. When read in that order, the digits form an $8$-digit, base $10$ positive integer. if this integer is divisible by $44$, how many ways could the digits have been initially ordered? [i]Proposed by Evan Chang (squareman), USA[/i]

Prove that a positive integer is a sum of at least two consecutive positive integers if and only if it is not a power of two.

Find the minimum number of perfect cubes such that their sum is equal to $ 346^{346} . $

[b]p1.[/b] Let $2^k$ be the largest power of $2$ dividing $30! = 30 \cdot 29 \cdot 28 ... 2 \cdot 1$. Find $k$. [b]p2.[/b] Let $d(n)$ be the total number of digits needed to write all the numbers from $1$ to $n$ in base $10$, for example, $d(5) = 5$ and $d(20) = 31$. Find $d(2012)$. [b]p3.[/b] Jim and TongTong play a game. Jim flips $10$ coins and TongTong flips $11$ coins, whoever gets the most heads wins. If they get the same number of heads, there is a tie. What is the probability that TongTong wins? [b]p4.[/b] There are a certain number of potatoes in a pile. When separated into mounds of three, two remain. When divided into mounds of four, three remain. When divided into mounds of five, one remain. It is clear there are at least $150$ potatoes in the pile. What is the least number of potatoes there can be in the pile? [b]p5.[/b] Call an ordered triple of sets $(A, B, C)$ nice if $|A \cap B| = |B \cap C| = |C \cap A| = 2$ and $|A \cap B \cap C| = 0$. How many ordered triples of subsets of $\{1, 2, · · · , 9\}$ are nice? [b]p6.[/b] Brett has an $ n \times n \times n$ cube (where $n$ is an integer) which he dips into blue paint. He then cuts the cube into a bunch of $ 1 \times 1 \times 1$ cubes, and notices that the number of un-painted cubes (which is positive) evenly divides the number of painted cubes. What is the largest possible side length of Brett’s original cube? Note that $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$. [b]p7.[/b] Choose two real numbers $x$ and $y$ uniformly at random from the interval $[0, 1]$. What is the probability that $x$ is closer to $1/4$ than $y$ is to $1/2$? [b]p8. [/b] In triangle $ABC$, we have $\angle BAC = 20^o$ and $AB = AC$. $D$ is a point on segment $AB$ such that $AD = BC$. What is $\angle ADC$, in degree. [b]p9.[/b] Let $a, b, c, d$ be real numbers such that $ab + c + d = 2012$, $bc + d + a = 2010$, $cd + a + b = 2013$, $da + b + c = 2009$. Find $d$. [b]p10. [/b]Let $\theta \in [0, 2\pi)$ such that $\cos \theta = 2/3$. Find $\sum_{n=0}^{\infty}\frac{1}{2^n}\cos(n \theta)$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a,m$ be positive integers such that $Ord_m (a)$ is odd and for any integers $x,y$ so that 1.$xy \equiv a \pmod m$ 2.$Ord_m(x) \le Ord_m(a)$ 3.$Ord_m(y) \le Ord_m(a)$ We have either $Ord_m(x)|Ord_m(a)$ or $Ord_m(y)|Ord_m(a)$.prove that $Ord_m(a)$ contains at most one prime factor.

The function $f: Z \to Z$ satisfies the following conditions: 1) $f(f(n))=n$ for all integers $n$ 2) $f(f(n+2)+2) = n$ for all integers $n$ 3) $f(0)=1$. Find the value of $f(1995)$ and $f(-1994)$.

Suppose that $ m$ and $ n$ are odd integers such that $ m^2\minus{}n^2\plus{}1$ divides $ n^2\minus{}1$. Prove that $ m^2\minus{}n^2\plus{}1$ is a perfect square.

Find all pairs of positive prime numbers $(p, q)$ such that $$p^5 + p^3 + 2 = q^2 - q.$$

For any positive integer $n$, we denote by $F(n)$ the number of ways in which $n$ can be expressed as the sum of three different positive integers, without regard to order. Thus, since $10 = 7+2+1 = 6+3+1 = 5+4+1 = 5+3+2$, we have $F(10) = 4$. Show that $F(n)$ is even if $n \equiv 2$ or $4 \pmod 6$, but odd if $n$ is divisible by $6$.

The fraction $\frac1{10}$ can be expressed as the sum of two unit fraction in many ways, for example, $\frac1{30}+\frac1{15}$ and $\frac1{60}+\frac1{12}$. Find the number of ways that $\frac1{2007}$ can be expressed as the sum of two distinct positive unit fractions.

(a) Determine a natural number $n$ such that $n(n+2022)+2$ is a perfect square. [hide=Spoiler]In case you didn't realize, $n=1$ works lol[/hide] (b) Determine all natural numbers $a$ such that for every natural number $n$, the number $n(n+a)+2$ is never a perfect square.

Show that any number of the form $$4444 ...44 88...8$$ where there are twice as many $4$s as $8$s is a square number.

A positive integer $n$ is called $\textit{good}$ if $2 \mid \tau(n)$ and if its divisors are $$1=d_1<d_2<\ldots<d_{2k-1}<d_{2k}=n, $$ then $d_{k+1}-d_k=2$ and $d_{k+2}-d_{k-1}=65$. Find the smallest $\textit{good}$ number.

Prove that the numbers from $1$ to $16$ can be written in a line, but cannot be written in a circle so that the sum of any two adjacent numbers is square of a natural number.

A Haiku is a Japanese poem of seventeen syllables, in three lines of five, seven, and five. A group of haikus Some have one syllable less Sixteen in total. The group of haikus Some have one syllable more Eighteen in total. What is the largest Total count of syllables That the group can’t have? (For instance, a group Sixteen, seventeen, eighteen Fifty-one total.) (Also, you can have No sixteen, no eighteen Syllable haikus) [i]Proposed by Jeff Lin[/i]

Let $n$ be a given positive integer. Determine all positive divisors $d$ of $3n^2$ such that $n^2 + d$ is the square of an integer.

For each positive integer $n$, let $\tau (n)$ be the number of positive divisors of $n$. a) Find all positive integers $n$ such that $\tau(n)+2023=n$. b) Prove that there exist infinitely many positive integers $k$ such that there are exactly two positive integers $n$ satisfying $\tau(kn)+2023=n$.

Let $p$ be an odd prime. Prove that \[1^{p-2}+2^{p-2}+\cdots+\left(\frac{p-1}{2}\right)^{p-2}\equiv\frac{2-2^p}{p}\pmod p.\]

Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$. (For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)

Let $a, b$ be integers, and let $P(x) = ax^3+bx.$ For any positive integer $n$ we say that the pair $(a,b)$ is $n$-good if $n | P(m)-P(k)$ implies $n | m - k$ for all integers $m, k.$ We say that $(a,b)$ is $very \ good$ if $(a,b)$ is $n$-good for infinitely many positive integers $n.$ [list][*][b](a)[/b] Find a pair $(a,b)$ which is 51-good, but not very good. [*][b](b)[/b] Show that all 2010-good pairs are very good.[/list] [i]Proposed by Okan Tekman, Turkey[/i]

Consider the set $D$ of all complex numbers of the form $a+b\sqrt{-13}$ with $a,b \in Z$. The number $14 = 14+0\sqrt{-13}$ can be written as a product of two elements of $D$: $14 = 2 \cdot 7$. Find all possible ways to express $14$ as a product of two elements of $D$.

Find all three digit numbers, for which the sum of squares of each digit is $90$ .