Given is a nonzero integer $k$. Prove that equation $k =\frac{x^2 - xy + 2y^2}{x + y}$ has an odd number of ordered integer pairs $(x, y)$ just when $k$ is divisible by seven.

Alpha and Beta both took part in a two-day problem-solving competition. At the end of the second day, each had attempted questions worth a total of 500 points. Alpha scored 160 points out of 300 points attempted on the first day, and scored 140 points out of 200 points attempted on the second day. Beta who did not attempt 300 points on the first day, had a positive integer score on each of the two days, and Beta's daily success rate (points scored divided by points attempted) on each day was less than Alpha's on that day. Alpha's two-day success ratio was 300/500 = 3/5. The largest possible two-day success ratio that Beta could achieve is $m/n$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?

A positive integer is [i]totally square[/i] is the sum of its digits (written in base $10$) is a square number. For example, $13$ is totally square because $1 + 3 = 2^2$, but $16$ is not totally square. Show that there are infinitely many positive integers that are not the sum of two totally square integers.

Let $f(x)$ be the polynomial with integer coefficients ($f(x)$ is not constant) such that \[(x^3+4x^2+4x+3)f(x)=(x^3-2x^2+2x-1)f(x+1)\] Prove that for each positive integer $n\geq8$, $f(n)$ has at least five distinct prime divisors.

Let's call integer square-free if it's not divisible by $p^2$ for any prime $p$. You are given a square-free integer $n>1$, which has exactly $d$ positive divisors. Find the largest number of its divisors that you can choose, such that $a^2 + ab - n$ isn't a square of an integer for any $a, b$ among chosen divisors. [i](Proposed by Oleksii Masalitin)[/i]

Let $x = a_1a_2 \dots a_n$ be an n-digit number, where $a_1, a_2, \dots , an (a_1 \neq 0)$ are the digits. The $n$ numbers $ x_1 = x = a_1 a_2 ... a_n, $ $ x_2 = a_n a_1 ... a_{n-1}, $ $ x_3 = a_{n-1} a_n a _1 ... a_{n-2} $ , $ x_4 = a_{n-2} a_{n-1} a_n a_1 , ... a_{n-3} , $ $ ... , x_n = a_2 a_3 ... a_n a_1$ are said to be obtained from $x$ by the cyclic permutation of digits. [For example, if $n = 5$ and $x = 37001$, then the numbers are $x_1 = 37001, x_2 = 13700, $ $x_3 = 01370(= 1370), x_4 = 00137(= 137), $ $ x_5 = 70013.]$ Find, with proof, (i) the smallest natural number n for which there exists an n-digit number x such that the n numbers obtained from x by the cyclic permutation of digits are all divisible by 1989; and (ii) the smallest natural number x with this property.

Let $p$ be an odd prime number. Ana and Ben are playing a game with alternate moves as follows: in each move, the player which has the turn choose a number, which was not choosen before by any of the player, from the set $\{1,2,...,2p-3,2p-2\}$. This process continues until no number is left. After the end of the process, each player create the number by taking the product of the choosen numbers and then add 1. We say a player wins if the number that did create is divisible by $p$, while the number that did create the opponent it is not divisible by $p$, otherwise we say the game end in a draw. Ana start first move. Does it exist a strategy for any of the player to win the game? [i]Proposed by Dorlir Ahmeti, Kosovo[/i]

Suppose for some positive integers, that $\frac{p+\frac{1}{q}}{q+\frac{1}{p}}= 17$. What is the greatest integer $n$ such that $\frac{p+q}{n}$ is always an integer?

a) Is it possible that the sum of all the positive divisors of two different natural numbers are equal? b) Show that if the product of all the positive divisors of two natural numbers are equal, then the two numbers must be equal.

For $m = 1, 2, 3, ...$ denote $S(m)$ the sum of the digits of $m$, and let $f(m)=m+S(m)$. Show that for each positive integer $n$, there exists a number that appears exactly $n$ times in the sequence $f(1),f(2),...,f(m),...$

Let $n,k$ be positive integers such that $n\geq2k>3$ and $A= \{1,2,...,n\}.$ Find all $n$ and $k$ such that the number of $k$-element subsets of $A$ is $2n-k$ times bigger than the number of $2$-element subsets of $A.$

Let $\operatorname{cif}(x)$ denote the sum of the digits of the number $x$ in the decimal system. Put $a_1=1997^{1996^{1997}}$, and $a_{n+1}=\operatorname{cif}(a_n)$ for every $n>0$. Find $\lim_{n\to\infty}a_n$.

[b]p1.[/b] A permutation on $\{1, 2,..., n\}$ is an ordered arrangement of the numbers. For example, $32154$ is a permutation of $\{1, 2, 3, 4, 5\}$. Does there exist a permutation $a_1a_2... a_n$ of $\{1, 2,..., n\}$ such that $i+a_i$ is a perfect square for every $1 \le i \le n$ when a) $n = 6$ ? b) $n = 13$ ? c) $n = 86$ ? Justify your answers. [b]p2.[/b] Circle $C$ and circle $D$ are tangent at point $P$. Line $L$ is tangent to $C$ at point $Q$ and to $D$ at point $R$ where $Q$ and $R$ are distinct from $P$. Circle $E$ is tangent to $C, D$, and $L$, and lies inside triangle $PQR$. $C$ and $D$ both have radius $8$. Find the radius of $E$, and justify your answer. [img]https://cdn.artofproblemsolving.com/attachments/f/b/4b98367ea64e965369345247fead3456d3d18a.png[/img] [b]p3.[/b] (a) Prove that $\sin 3x = 4 \cos^2 x \sin x - \sin x$ for all real $x$. (b) Prove that $$(4 \cos^2 9^o - 1)(4 \cos^2 27^o - 1)(4 cos^2 81^o - 1)(4 cos^2 243^o - 1)$$ is an integer. [b]p4.[/b] Consider a $3\times 3\times 3$ stack of small cubes making up a large cube (as with the small cubes in a Rubik's cube). An ant crawls on the surface of the large cube to go from one corner of the large cube to the opposite corner. The ant walks only along the edges of the small cubes and covers exactly nine of these edges. How many different paths can the ant take to reach its goal? [b]p5.[/b] Let $m$ and $n$ be positive integers, and consider the rectangular array of points $(i, j)$ with $1 \le i \le m$, $1 \le j \le n$. For what pairs m; n of positive integers does there exist a polygon for which the $mn$ points $(i, j)$ are its vertices, such that each edge is either horizontal or vertical? The figure below depicts such a polygon with $m = 10$, $n = 22$. Thus $10$, $22$ is one such pair. [img]https://cdn.artofproblemsolving.com/attachments/4/5/c76c0fe197a8d1ebef543df8e39114fe9d2078.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find positive integers $x, y, z$ such that $x > z > 1999 \cdot 2000 \cdot 2001 > y$ and $2000x^{2}+y^{2}= 2001z^{2}.$

Find all pairs of positive integer $\alpha$ and function $f : N \to N_0$ that satisfies (i) $f(mn^2) = f(mn) + \alpha f(n)$ for all positive integers $m, n$. (ii) If $n$ is a positive integer and $p$ is a prime number with $p|n$, then $f(p) \ne 0$ and $f(p)|f(n)$.

[b]p1.[/b] Find $20 \cdot 18 + 20 + 18 + 1$. [b]p2.[/b] Suzie’s Ice Cream has $10$ flavors of ice cream, $5$ types of cones, and $5$ toppings to choose from. An ice cream cone consists of one flavor, one cone, and one topping. How many ways are there for Sebastian to order an ice cream cone from Suzie’s? [b]p3.[/b] Let $a = 7$ and $b = 77$. Find $\frac{(2ab)^2}{(a+b)^2-(a-b)^2}$ . [b]p4.[/b] Sebastian invests $100,000$ dollars. On the first day, the value of his investment falls by $20$ percent. On the second day, it increases by $25$ percent. On the third day, it falls by $25$ percent. On the fourth day, it increases by $60$ percent. How many dollars is his investment worth by the end of the fourth day? [b]p5.[/b] Square $ABCD$ has side length $5$. Points $K,L,M,N$ are on segments $AB$,$BC$,$CD$,$DA$ respectively,such that $MC = CL = 2$ and $NA = AK = 1$. The area of trapezoid $KLMN$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Suppose that $p$ and $q$ are prime numbers. If $p + q = 30$, find the sum of all possible values of $pq$. [b]p7.[/b] Tori receives a $15 - 20 - 25$ right triangle. She cuts the triangle into two pieces along the altitude to the side of length $25$. What is the difference between the areas of the two pieces? [b]p8.[/b] The factorial of a positive integer $n$, denoted $n!$, is the product of all the positive integers less than or equal to $n$. For example, $1! = 1$ and $5! = 120$. Let $m!$ and $n!$ be the smallest and largest factorial ending in exactly $3$ zeroes, respectively. Find $m + n$. [b]p9.[/b] Sam is late to class, which is located at point $B$. He begins his walk at point $A$ and is only allowed to walk on the grid lines. He wants to get to his destination quickly; how many paths are there that minimize his walking distance? [img]https://cdn.artofproblemsolving.com/attachments/a/5/764e64ac315c950367357a1a8658b08abd635b.png[/img] [b]p10.[/b] Mr. Iyer owns a set of $6$ antique marbles, where $1$ is red, $2$ are yellow, and $3$ are blue. Unfortunately, he has randomly lost two of the marbles. His granddaughter starts drawing the remaining $4$ out of a bag without replacement. She draws a yellow marble, then the red marble. Suppose that the probability that the next marble she draws is blue is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positiveintegers. What is $m + n$? [b]p11.[/b] If $a$ is a positive integer, what is the largest integer that will always be a factor of $(a^3+1)(a^3+2)(a^3+3)$? [b]p12.[/b] What is the largest prime number that is a factor of $160,401$? [b]p13.[/b] For how many integers $m$ does the equation $x^2 + mx + 2018 = 0$ have no real solutions in $x$? [b]p14.[/b] What is the largest palindrome that can be expressed as the product of two two-digit numbers? A palindrome is a positive integer that has the same value when its digits are reversed. An example of a palindrome is $7887887$. [b]p15.[/b] In circle $\omega$ inscribe quadrilateral $ADBC$ such that $AB \perp CD$. Let $E$ be the intersection of diagonals $AB$ and $CD$, and suppose that $EC = 3$, $ED = 4$, and $EB = 2$. If the radius of $\omega$ is $r$, then $r^2 =\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Determine $m + n$. [b]p16.[/b] Suppose that $a, b, c$ are nonzero real numbers such that $2a^2 + 5b^2 + 45c^2 = 4ab + 6bc + 12ca$. Find the value of $\frac{9(a + b + c)^3}{5abc}$ . [b]p17.[/b] Call a positive integer n spicy if there exist n distinct integers $k_1, k_2, ... , k_n$ such that the following two conditions hold: $\bullet$ $|k_1| + |k_2| +... + |k_n| = n2$, $\bullet$ $k_1 + k_2 + ...+ k_n = 0$. Determine the number of spicy integers less than $10^6$. [b]p18.[/b] Consider the system of equations $$|x^2 - y^2 - 4x + 4y| = 4$$ $$|x^2 + y^2 - 4x - 4y| = 4.$$ Find the sum of all $x$ and $y$ that satisfy the system. [b]p19.[/b] Determine the number of $8$ letter sequences, consisting only of the letters $W,Q,N$, in which none of the sequences $WW$, $QQQ$, or $NNNN$ appear. For example, $WQQNNNQQ$ is a valid sequence, while $WWWQNQNQ$ is not. [b]p20.[/b] Triangle $\vartriangle ABC$ has $AB = 7$, $CA = 8$, and $BC = 9$. Let the reflections of $A,B,C$ over the orthocenter H be $A'$,$B'$,$C'$. The area of the intersection of triangles $ABC$ and $A'B'C'$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ , where $b$ is squarefree and $a$ and $c$ are relatively prime. determine $a+b+c$. (The orthocenter of a triangle is the intersection of its three altitudes.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Define a sequence $(a_n)$ recursively by $a_1=0, a_2=2, a_3=3$ and $a_n=\max_{0<d<n} a_d \cdot a_{n-d}$ for $n \ge 4$. Determine the prime factorization of $a_{19702020}$.

For each nonnegative integer $n$ we define $A_n = 2^{3n}+3^{6n+2}+5^{6n+2}$. Find the greatest common divisor of the numbers $A_0,A_1,\ldots, A_{1999}$. [i]Romania[/i]

Prove that for any $p>2$ prime number, there exists only one positive number $n$ that makes the equation $n^2-np$ a perfect square of a positive integer

How many factors of $(20^{12})^2$ less than $20^{12}$ are not factors of $20^{12}$ ?

Find the greatest positive integer $m$ with the following property: For every permutation $a_1, a_2, \cdots, a_n,\cdots$ of the set of positive integers, there exists positive integers $i_1<i_2<\cdots <i_m$ such that $a_{i_1}, a_{i_2}, \cdots, a_{i_m}$ is an arithmetic progression with an odd common difference.

Determine all positive integers$ n$ that can be written as the product of two consecutive integers and as well as the product of four consecutive integers numbers. In the formula: $n = a (a + 1) = b (b + 1) (b + 2) (b + 3)$.

Prove that $5^n-3^n$ is not divisible by $2^n+65$ for any positive integer $n$.

There are two sorts of people on an island: [i]knights[/i], who always talk truth, and [i]scoundrels[/i], who always lie. One day, the people establish a council consisting of $2003$ members. They sit around a round table, and during the council each member said: "Both my neighbors are scoundrels". In a later day, the council meets again, but one member could not come due to illness, so only $2002$ members were present. They sit around the round table, and everybody said: "Both my neighbors belong to the sort different from mine". Is the absent member a knight or a scoundrel?

Sequence $(G_n)$ is defined by $G_0 = 0, G_1 = 1$ and $G_n = G_{n-1} + G_{n-2} + 1$ for every $n \ge2$. Prove that for every positive integer $m$ there exist two consecutive terms in the sequence that are both divisible by $m$.