Given are 100 different positive integers. We call a pair of numbers [i]good[/i] if the ratio of these numbers is either 2 or 3. What is the maximum number of good pairs that these 100 numbers can form? (A number can be used in several pairs.) [i]Proposed by Alexander S. Golovanov, Russia[/i]

For a positive integer $n$, let $d(n)$ denote the number of positive divisors of $n$. Determine all positive integers $n$ for which $d(n)$ is the second largest divisor of $n$.

Let $m$ be a given positive integer. Define $a_k=\frac{(2km)!}{3^{(k-1)m}},k=1,2,\cdots.$ Prove that there are infinite many integers and infinite many non-integers in the sequence $\{a_k\}$.

Determine all pairs $(x, y)$ of positive integers such that \[\sqrt[3]{7x^2-13xy+7y^2}=|x-y|+1.\] [i]Proposed by Titu Andreescu, USA[/i]

Determine the smallest positive number $a$ such that the number of all integers belonging to $(a, 2016a]$ is $2016$.

Let $ n$ be an integer, $ n\geq 2$. Find all sets $ A$ with $ n$ integer elements such that the sum of any nonempty subset of $ A$ is not divisible by $ n\plus{}1$.

Find all triples $(a, b, c)$ of positive integers for which $\frac{32a + 3b + 48c}{4abc}$ is also an integer.

Determine the minimum value of prime $p> 3$ for which there is no natural number $n> 0$ such that $2^n+3^n\equiv 0\pmod{p} $.

For a natural number $n$, let $n'$ denote the number obtained by deleting zero digits, if any. (For example, if $n = 260$, $n' = 26$, if $n = 2020$, $n' = 22$.),Find the number of $3$-digit numbers $n$ for which $n'$ is a divisor of $n$, different from $n$.

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$.

Let $n,k$ be positive integers such that n is not divisible by 3 and $k \geq n$. Prove that there exists a positive integer $m$ which is divisible by $n$ and the sum of its digits in decimal representation is $k$.

Given an integer $n\geq 2,$ let $a_{n},b_{n},c_{n}$ be integer numbers such that \[ \left( \sqrt[3]{2}-1\right) ^{n}=a_{n}+b_{n}\sqrt[3]{2}+c_{n}\sqrt[3]{4}. \] Prove that $c_{n}\equiv 1\pmod{3} $ if and only if $n\equiv 2\pmod{3}.$

Determine whether there exists an infinite sequence $a_1, a_2, a_3, \dots$ of positive integers which satisfies the equality \[a_{n+2}=a_{n+1}+\sqrt{a_{n+1}+a_{n}} \] for every positive integer $n$.

Let $n\geq 3$ be an odd integer. On a line, $n$ points are marked in such a way that the distance between any two of them is an integer. It turns out that each marked point has an even sum of distances to the remaining $n-1$ marked points. Prove that the distance between any two marked points is even.

Determine all polynomials $P$ with integer coefficients for which there exists an integer $a_n$ such that $P(a_n)=n^n$ for all positive integers $n$.

Find all natural numbers $n$, such that $\min_{k\in \mathbb{N}}(k^2+[n/k^2])=1991$. ($[n/k^2]$ denotes the integer part of $n/k^2$.)

Call two regular polygons supplementary if the sum of an internal angle from each polygon adds up to $180^o$. For instance, two squares are supplementary because the sum of the internal angles is $90^o + 90^o = 180^o$. Find the other pair of supplementary polygons. Write your answer in the form $(m, n)$ where m and n are the number of sides of the polygons and $m < n$.

Foxes, wolves and bears arranged a big rabbit hunt. There were $45$ hunters catching $2008$ rabbits. Every fox caught $59$ rabbits, every wolf $41$ rabbits and every bear $40$ rabbits. How many foxes, wolves and bears were there in the hunting company?

Let $a, b, m$ be integers such that gcd $(a, b) = 1$ and $5 | ma^2 + b^2$ . Show that there exists an integer $n$ such that $5 | m - n^2$.

$11.$ Let $a,$ $b,$ and $c$ be real numbers such that $a-7b+8c=4.$ and $8a+4b-c=7.$ What is the value of $a^2-b^2+c^2 ?$

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

[b]p1.[/b] Suppose that $x$ and $y$ are positive real numbers such that $\log_2 x = \log_x y = \log_y 256$. Find $xy$. [b]p2.[/b] Let the roots of $x^2 + 7x + 11$ be $r$ and $s$. If f(x) is the monic polynomial with roots $rs + r + s$ and $r^2 + s^2$, what is $f(3)$? [b]p3.[/b] Call a positive three digit integer $\overline{ABC}$ fancy if $\overline{ABC} = (\overline{AB})^2 - 11 \cdot \overline{C}$. Find the sum of all fancy integers. [b]p4.[/b] In triangle $ABC$, points $D$ and $E$ are on line segments $BC$ and $AC$, respectively, such that $AD$ and $BE$ intersect at $H$. Suppose that $AC = 12$, $BC = 30$, and $EC = 6$. Triangle $BEC$ has area $45$ and triangle $ADC$ has area $72$, and lines $CH$ and $AB$ meet at $F$. If $BF^2$ can be expressed as $\frac{a-b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ with $c$ squarefree and $gcd(a, b, d) = 1$, then find $a + b + c + d$. [b]p5.[/b] Find the minimum possible integer $y$ such that $y > 100$ and there exists a positive integer $x$ such that $x^2 + 18x + y$ is a perfect fourth power. [b]p6.[/b] Let $ABCD$ be a quadrilateral such that $AB = 2$, $CD = 4$, $BC = AD$, and $\angle ADC + \angle BCD = 120^o$. If the sum of the maximum and minimum possible areas of quadrilateral $ABCD$ can be expressed as $a\sqrt{b}$ for positive integers $a, b$ with $b$ squarefree, then find $a + b$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a,b,c$ be integer numbers such that $(a+b+c) \mid (a^{2}+b^{2}+c^{2})$. Show that there exist infinitely many positive integers $n$ such that $(a+b+c) \mid (a^{n}+b^{n}+c^{n})$. [i]Laurentiu Panaitopol[/i]

Azambuja writes a rational number $q$ on a blackboard. One operation is to delete $q$ and replace it by $q+1$; or by $q-1$; or by $\frac{q-1}{2q-1}$ if $q \neq \frac{1}{2}$. The final goal of Azambuja is to write the number $\frac{1}{2018}$ after performing a finite number of operations. [b]a)[/b] Show that if the initial number written is $0$, then Azambuja cannot reach his goal. [b]b)[/b] Find all initial numbers for which Azambuja can achieve his goal.

Find the smallest number of the form $1...1$ in its decimal expression which is divisible by $\underbrace{\hbox{3...3}}_{\hbox{100}}$,.