Two positive integers $a$ and $b$ are prime-related if $a = pb$ or $b = pa$ for some prime $p$. Find all positive integers $n$, such that $n$ has at least three divisors, and all the divisors can be arranged without repetition in a circle so that any two adjacent divisors are prime-related. Note that $1$ and $n$ are included as divisors.

Find all positive integers $n$ for which the equation $$(x^2 + y^2)^n = (xy)^{2016}$$ has positive integer solutions.

Let $f(x) = 3x^2 + 1$. Prove that for any given positive integer $n$, the product $$f(1)\cdot f(2)\cdot\dots\cdot f(n)$$ has at most $n$ distinct prime divisors. [i]Proposed by Géza Kós[/i]

A prime number$ q $is called[b][i] 'Kowai' [/i][/b]number if $ q = p^2 + 10$ where $q$, $p$, $p^2-2$, $p^2-8$, $p^3+6$ are prime numbers. WE know that, at least one [b][i]'Kowai'[/i][/b] number can be found. Find the summation of all [b][i]'Kowai'[/i][/b] numbers.

If $a_1, a_2, \cdots, a_7$ are not necessarily distinct real numbers such that $1 < a_i < 13$ for all $i$, then show that we can choose three of them such that they are the lengths of the sides of a triangle.

Let $\{a_n\}$ be a sequence of integers satisfying $(n-1)a_{n+1}=(n+1)a_n-2(n-1) \forall n\ge 1$. If $2000|a_{1999}$, find the smallest $n\ge 2$ such that $2000|a_n$.

Given a set $X$ and a function $f: X \rightarrow X$, for each $x \in X$ we define $f^1(x)=f(x)$ and, for each $j \ge 1$, $f^{j+1}(x)=f(f^j(x))$. We say that $a \in X$ is a fixed point of $f$ if $f(a)=a$. For each $x \in \mathbb{R}$, let $\pi (x)$ be the quantity of positive primes lesser or equal to $x$. Given an positive integer $n$, we say that $f: \{1,2, \dots, n\} \rightarrow \{1,2, \dots, n\}$ is [i]catracha[/i] if $f^{f(k)}(k)=k$, for every $k=1, 2, \dots n$. Prove that: (a) If $f$ is catracha, $f$ has at least $\pi (n) -\pi (\sqrt{n}) +1$ fixed points. (b) If $n \ge 36$, there exists a catracha function $f$ with exactly $ \pi (n) -\pi (\sqrt{n}) + 1$ fixed points.

Define alternate sum of a set of real numbers $A =\{a_1,a_2,...,a_k\}$ with $a_1 < a_2 <...< a_k$, the number $S(A) = a_k - a_{k-1} + a_{k-2} - ... + (-1)^{k-1}a_1$ (for example if $A = \{1,2,5, 7\}$ then $S(A) = 7 - 5 + 2 - 1$) Consider the alternate sums, of every subsets of $A = \{1, 2, 3, 4, 5, 6, 7, 8,9, 10\}$ and sum them. What is the last digit of the sum obtained?

Let $p > 5$ be a prime. Suppose that $$\frac{1}{2^2} + \frac{1}{4^2}+ \frac{1}{6^2}+ ...+ \frac{1}{(p -1)^2} =\frac{a}{b}$$ where $a/b$ is a fraction in lowest terms. Show that $p | a$.

We observe that number $10001=73\cdot137$ is not prime. Show that every member of infinite sequence $10001, 100010001, 1000100010001,...$ is not prime

4. Find the biggest positive integer $n$, lesser thar $2012$, that has the following property: If $p$ is a prime divisor of $n$, then $p^2 - 1$ is a divisor of $n$.

How many divisors of $30^{2003}$ are there which do not divide $20^{2000}$?

Find all primes $p$ for which the quotient \[ \dfrac{2^{p-1} - 1 }{p} \] is a square.

Let us say, that a natural number has the property $P(k)$ if it can be represented as a product of $k$ succeeding natural numbers greater than $1$. a) Find k such that there exists n which has properties $P(k)$ and $P(k+2)$ simultaneously. b) Prove that there is no number having properties $P(2)$ and $P(4)$ simultaneously

Let $a\geq 2$ be a natural number. Prove that $\sum_{n=0}^\infty\frac1{a^{n^{2}}}$ is irrational.

Call a natural number $N$ [i]good [/i]if its base $3$ expansion has no consecutive digits that are the same. For example, $289$ is good since its base $3$ representation is $1012013$. Find the $2024$th smallest good number ($0$ is not considered to be a natural number). Your answer should be in base $10$.

[b]p1.[/b] Function $f$ is defined by $f (x) = ax+b$ for some real values $a, b > 0$. If $f (f (x)) = 9x + 5$ for all $x$, find $b$. [b]p2.[/b] At some point during a game, Will Avery has made $1/3$ of his shots. When he shoots once and makes a basket, his average increases to $2/5$. Find his average (expressed as a fraction) after a second additional basket. [b]p3.[/b] A dealer has a deck of $1999$ cards. He takes the top card off and “ducks” it, that is, places it on the bottom of the deck. He deals the second card onto the table. He ducks the third card, deals the fourth card, ducks the fifth card, deals the sixth card, and so forth, continuing until he has only one card left; he then ducks the last card with itself and deals it. Some of the cards (like the second and fourth cards) are not ducked at all before being dealt, while others are ducked multiple times. The question is: what is the average number of ducks per card? [b]p4.[/b] Point $P$ lies outside circle $O$. Perpendicular lines $\ell$ and m intersect at $P$. Line $\ell$ is tangent to circle $O$ at a point $6$ units from $P$. Line $m$ crosses circle $O$ at a point $4$ units from $P$. Find the radius of circle $O$. [b]p5.[/b] Define $f(n)$ by $$f(n) = \begin{cases} n/2 \,\,\,\text{if} \,\,\, n\,\,\,is\,\,\, even \\ (n + 1023)/2\,\,\, \text{if} \,\,\, n\,\,\,is\,\,\, odd \end{cases}$$ Find the least positive integer $n$ such that $f(f(f(f(f(n))))) = n.$ [b]p6.[/b] Write $\sqrt{10001}$ to the sixth decimal place, rounding down. [b]p7.[/b] Define $(a_n)$ recursively by $a_1 = 1$, $a_n = 20 \cos (a_{n-1}^o)$. As $n$ tends to infinity, $(a_n)$ tends to $18.9195...$. Define $(b_n)$ recursively by $b_1 = 1$, $b_n =\sqrt{800 + 800 \cos (b_{n-1}^o)}$. As $n$ tends to infinity, $(b_n)$ tends to $x$. Calculate $x$ to three decimal places. [b]p8.[/b] Let $mod_d (k)$ be the remainder of $k$ when divided by $d$. Find the number of positive integers $n$ satisfying $$mod_n(1999) = n^2 - 89n + 1999$$ [b]p9.[/b] Let $f(x) = x^3 + x$. Compute $$\sum^{10}_{k=1} \frac{1}{1 + f^{-1}(k - 1)^2 + f^{-1}(k - 1)f^{-1}(k) + f^{-1}(k)^2}$$ ($f^{-1}$ is the inverse of $f$: $f (f^{-1}1 (x)) = f^{-1}1 (f (x)) = x$ for all $x$.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For which non-negative integers $ a<2007$ the congruence $ x^2\plus{}a \equiv 0 \mod 2007$ has got exactly two different non-negative integer solutions? That means, that there exist exactly two different non-negative integers $ u$ and $ v$ less than $ 2007$, such that $ u^2\plus{}a$ and $ v^2\plus{}a$ are both divisible by $ 2007$.

For how many ordered pairs of positive integers $(a, b)$ such that $a \le 50$ is it true that $x^2 - ax + b$ has integer roots?

Given $a$, $b$ are positive integers greater than $1$, and for every positive integer $n$, $b^{n}-1$ divides $a^{n}-1$. Define the polynomial $p_{n}(x)$ as follows: $p_0{x}=-1$, $p_{n+1}(x)=b^{n+1}(x-1)p_{n}(bx)-a(b^{n+1}-1)p_{n}(x)$, for $n \ge 0$. Prove that there exist integers $C$ and positive integer $k$ such that $p_{k}(x)=Cx^k$.

Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.

For an integer $n \geq 3$ we define the sequence $\alpha_1, \alpha_2, \ldots, \alpha_k$ as the sequence of exponents in the prime factorization of $n! = p_1^{\alpha_1}p_2^{\alpha_2} \ldots p_k^{\alpha_k}$, where $p_1 < p_2 < \ldots < p_k$ are primes. Determine all integers $n \geq 3$ for which $\alpha_1, \alpha_2, \ldots, \alpha_k$ is a geometric progression.

For given integers $n>0$ and $k> 1$, let $F_{n,k}(x,y)=x!+n^k+n+1-y^k$. Prove that there are only finite couples $(a,b)$ of positive integers such that $F_{n,k}(a,b)=0$

A number from $1$ to $100$ is intended. In what is the smallest number of questions one can surely guess the intended number, if one is allowed to lie once? (Questions are asked like: “Does the intended number belong to such and such a numerical set?” The only possible answers are “Yes” and “No.”)

Do there exist 16 three digit numbers, using only three different digits in all, so that the all numbers give different residues when divided by 16? [i]Bulgaria[/i]