For $n$ positive integers $a_1,...,a_n$ consider all their pairwise products $a_ia_j$, $1 \le i < j \le n$. Let $N$ be the number of those products which are the cubes of positive integers. Find the maximal possible value of $N$ if it is known that none of $a_j$ is a cube of an integer. (S. Mazanik)

Each time you click a toggle switch, the switch either turns from [i]off[/i] to [i]on[/i] or from [i]on[/i] to [i]off[/i]. Suppose that you start with three toggle switches with one of them [i]on[/i] and two of them [i]off[/i]. On each move you randomly select one of the three switches and click it. Let $m$ and $n$ be relatively prime positive integers so that $\frac{m}{n}$ is the probability that after four such clicks, one switch will be [i]on[/i] and two of them will be [i]off[/i]. Find $m+n$.

Are there integers $m$ and $n$ such that \[5m^2 - 6mn + 7n^2 = 1985 \ ?\]

A natural number $n$ is said to be $good$ if $n$ is the sum or $r$ consecutive positive integers, for some $r \geq 2 $. Find the number of good numbers in the set $\{1,2 \dots , 100\}$.

Find the minimum value attained by $\sum_{m=1}^{100} \gcd(M - m, 400)$ for $M$ an integer in the range $[1746, 2017]$.

For a positive integer $n$, we dene $D_n$ as the largest integer that is a divisor of $a^n + (a + 1)^n + (a + 2)^n$ for all positive integers $a$. 1. Show that for all positive integers $n$, the number $D_n$ is of the form $3^k$ with $k \ge 0$ an integer. 2. Show that for all integers $k \ge 0$ there exists a positive integer n such that $D_n = 3^k$.

[b]p1.[/b] Show that the $n \times n$ determinant $$\begin{vmatrix} 1+x & 1 & 1 & . & . & . & 1 \\ 1 & 1+x & 1 & . & . & . & 1 \\ . & . & . & . & . & . & . \\ . & . & . & . & . & . & . \\ 1 & 1 & . & . & . & . & 1+x \\ \end{vmatrix}$$ has the value zero when $x = -n$ [b]p2.[/b] Let $c > a \ge b$ be the lengths of the sides of an obtuse triangle. Prove that $c^n = a^n + b^n$ for no positive integer $n$. [b]p3.[/b] Suppose that $p_1 = p_2^2+ p_3^2 + p_4^2$ , where $p_1$, $p_2$, $p_3$, and $p_4$ are primes. Prove that at least one of $p_2$, $p_3$, $p_4$ is equal to $3$. [b]p4.[/b] Suppose $X$ and $Y$ are points on tJhe boundary of the triangular region $ABC$ such that the segment $XY$ divides the region into two parts of equal area. If $XY$ is the shortest such segment and $AB = 5$, $BC = 4$, $AC = 3$ calculate the length of $XY$. Hint: Of all triangles having the same area and same vertex angle the one with the shortest base is isosceles. Clearly justify all claims. [b]p5.[/b] Find all solutions of the following system of simultaneous equations $$x + y + z = 7\,\, , \,\, x^2 + y^2 + z^2 = 31\,\,, \,\,x^3 + y^3 + z^3 = 154$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that if the natural numbers $ a $, $ b $, $ c $ satisfy the equation $$ a^2 + b^2 = c^2,$$ then: 1) at least one of the numbers $ a $ and $ b $ is divisible by $ 3 $, 2) at least one of the numbers $ a $ and $ b $ is divisible by $ 4 $, 3) at least one of the numbers $ a $, $ b $, $ c $ is divisible by $ 5 $.

Compute the number of ordered pairs of integers $(x,y)$ such that $x^2 + y^2 < 2019$ and $$x^2 + min(x,y) = y^2 + max(x, y) .$$

Fawzi cuts a spherical cheese completely into (at least three) slices of equal thickness. He starts at one end, making successive parallel cuts, working through the cheese until the slicing is complete. The discs exposed by the first two cuts have integral areas. [list](i) Prove that all the discs that he cuts have integral areas. (ii) Prove that the original sphere had integral surface area if, and only if, the area of the second disc that he exposes is even.[/list]

Let $O, M, P$ and $D$ be distinct digits from each other, and different from zero, such that $O < M < P < D$, and the following equation is true: \[ \overline{\text{OMPD}} \times \left( \overline{\text{OM}} - \overline{\text{D}} \right) = \overline{\text{MDDMP}} - \overline{\text{OM}} \] (a) Using estimates, explain why it is impossible for the value of $O$ to be greater than or equal to $3$. (b) Explain why $O$ cannot be equal to $1$. (c) Is it possible for $M$ to be greater than or equal to $5$? Justify. (d) Determine the values of $M$, $P$, and $D$.

[b]p1.[/b] Nine coins are placed in a row, alternating between heads and tails as follows: $H T H T H T H T H$. A legal move consists of turning over any two adjacent coins. (a) Give a sequence of legal moves that changes the configuration into $H H H H H H H H H$. (b) Prove that there is no sequence of legal moves that changes the original configuration into $T T T T T T T T T$. [b]p2.[/b] Find (with proof) all integers $k $that satisfy the equation $$\frac{k - 15}{2000}+\frac{k - 12}{2003}+\frac{k - 9}{2006}+\frac{k - 6}{2009}+\frac{k - 3}{2012} = \frac{k - 2000}{15}+\frac{k - 2003}{12}+\frac{k - 2006}{9}+\frac{k - 2009}{6}+\frac{k - 2012}{3}.$$ [b]p3.[/b] Some (not necessarily distinct) natural numbers from $1$ to $2015$ are written on $2015$ lottery tickets, with exactly one number written on each ticket. It is known that the sum of the numbers on any nonempty subset of tickets (including the set of all tickets) is not divisible by $2016$. Prove that the same number is written on all of the tickets. [b]p4.[/b] A set of points $A$ is called distance-distinct if every pair of points in $A$ has a different distance. (a) Show that for all infinite sets of points $B$ on the real line, there exists an infinite distance-distinct set A contained in $B$. (b) Show that for all infinite sets of points $B$ on the real plane, there exists an infinite distance-distinct set A contained in $B$. [b]p5.[/b] Let $ABCD$ be a (not necessarily regular) tetrahedron and consider six points $E, F, G, H, I, J$ on its edges $AB$, $BC$, $AC$, $AD$, $BD$, $CD$, respectively, such that $$|AE| \cdot |EB| = |BF| \cdot |FC| = |AG| \cdot |GC| = |AH| \cdot |HD| = |BI| \cdot |ID| = |CJ| \cdot |JD|.$$ Prove that the points $E, F, G, H, I$, and $J$ lie on the surface of a sphere. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Define $f(x, y)$ to be $\frac{|x|}{|y|}$ if that value is a positive integer, $\frac{|y|}{|x|}$ if that value is a positive integer, and zero otherwise. We say that a sequence of integers $\ell_1$ through $\ell_n$ is [i]good [/i] if $f(\ell_i, \ell_{i+1})$ is nonzero for all $i$ where $1 \le i \le n - 1$, and the score of the sequence is $\sum^{n-1}_{i=1} f(\ell_i, \ell_{i+1})$

A set $S$ consists of $1992$ positive integers among whose units digits all $10$ digits occur. Show that there is such a set $S$ having no nonempty subset $S_{1}$ whose sum of elements is divisible by $2000$.

Prove there exist positive integers a,b,c for which $a+b+c=1998$, the gcd is maximized, and $0<a<b\leq c<2a$. Find those numbers. Are they unique?

Find all pairs of integers $ (x,y)$ satisfying $ 1\plus{}1996x\plus{}1998y\equal{}xy.$

Let $n$ be a natural number. Prove that, \[ \left\lfloor \frac{n}{1} \right\rfloor+ \left\lfloor \frac{n}{2} \right\rfloor + \cdots + \left\lfloor \frac{n}{n} \right\rfloor + \left\lfloor \sqrt{n} \right\rfloor \] is even.

Find all triples $(a, b, c)$ of positive integers for which $a + [a, b] = b + [b, c] = c + [c, a]$. Here $[a, b]$ denotes the least common multiple of integers $a, b$. [i](Proposed by Mykhailo Shtandenko)[/i]

Let $a,b,c,d$ be the natural numbers such that $2^a+4^b+5^c=2014^d.$ Find all $(a,b,c,d).$

Find a three-digit number with the property that the number represented by these digits and in the same order, but with a numbering base different than $ 10 $, is twice as large as the given number.

Find the remainder of $\binom{3^n}{2^n}$ modulo $3^{n+1}$. [i]Proposed by V. Rastorguev[/i]

Consider the sequence of integer such that: $ a_1 = 2$ $ a_2 = 5$ $ a_{n + 1} = (2 - n^2)a_n + (2 + n^2)a_{n - 1}, \forall n\ge 2$ Find all triplies $ (x,y,z) \in \mathbb{N}^3$ such that $ a_xa_y = a_z$.

Prove that for any natural numbers min the inequality holds $$1^m + 2^m + \ldots + n^m \geq n\cdot \left( \frac{n+1}{2}\right)^m$$

Let $a, b$ be positive integers and $p, q$ be prime numbers for which $p \nmid q - 1$ and $q \mid a^p - b^p$. Prove that $q \mid a - b$.

$p$ is a prime. Let $K_p$ be the set of all polynomials with coefficients from the set $\{0,1,\dots ,p-1\}$ and degree less than $p$. Assume that for all pairs of polynomials $P,Q\in K_p$ such that $P(Q(n))\equiv n\pmod p$ for all integers $n$, the degrees of $P$ and $Q$ are equal. Determine all primes $p$ with this condition.