Determine the smallest positive integer $k$ so that the equation $$2002x+273y=200201+k$$ has integer solutions, and for that value of $k$, find the number of solutions $\left (x,y\right )$ with $x$, $y$ positive integers that have the equation.

Does there exist a positive integer $ n$ such that $ n$ has exactly 2000 prime divisors and $ n$ divides $ 2^n \plus{} 1$?

[b]2A. [/b] Two triangles $ABC$ and $ABD$ share a common side. $ABC$ is drawn such that its entire area lies inside the larger triangle $ABD$. If $AB = 20$, side $AD$ meets side $AB$ at a right angle, and point $C$ is between points $A$ and $D$, then find the area outside of triangle $ABC$ but within $ABD$, given that both triangles have integral side lengths and $AB$ is the smallest side of either triangle. $ABC$ and $ABD$ are both primitive right triangles. [i] (1 point)[/i] [b]2B.[/b] Find the sum of all positive integral factors of the correct answer to [b]2A[/b]. [i](2 points)[/i] [b]2C.[/b] Let $B$ be the sum of the digits of the correct answer to [b]2B[/b] above. If the solution to the functional equation $21*f(x) - 7*f(1/x) = Bx$ is of the form $(Ax^2 + C) / Dx$, find $C$, given that $A$, $C$, and $D$ are relatively prime (they don’t share a common prime factor). [i](3 points)[/i] [hide=ANSWER KEY]2A.780 2B. 2352 2C. 3[/hide]

(a) $n$ is a natural number. $d_1,\dots,d_n,r_1,\dots ,r_n$ are natural numbers such that for each $i,j$ that $1\leq i < j \leq n$ we have $(d_i,d_j)=1$ and $d_i\geq 2$. Prove that there exist an $x$ such that (i) $1 \leq x \leq 3^n$ (ii)For each $1 \leq i \leq n$ \[x \overset{d_i}{\not{\equiv}} r_i\] (b) For each $\epsilon >0$ prove that there exists natural $N$ such that for each $n>N$ and each $d_1,\dots,d_n,r_1,\dots ,r_n$ satisfying the conditions above there exists an $x$ satisfying (ii) such that $1\leq x \leq (2+\epsilon )^n$. Time allowed for this exam was 75 minutes.

For odd positive integers $n$, define $f(n)$ to be the smallest odd integer greater than $n$ that is not relatively prime to $n$. Compute the smallest $n$ such that $f(f(n))$ is not divisible by $3$.

Determine all nonempty finite sets of positive integers $\{a_1, \dots, a_n\}$ such that $a_1 \cdots a_n$ divides $(x + a_1) \cdots (x + a_n)$ for every positive integer $x$. [i]Proposed by Ankan Bhattacharya[/i]

Compute the sum of all positive integers $n$ such that $n^n$ has 325 positive integer divisors. (For example, $4^4=256$ has 9 positive integer divisors: 1, 2, 4, 8, 16, 32, 64, 128, 256.)

[b]p1.[/b] Suppose that $20\%$ of a number is $17$. Find $20\%$ of $17\%$ of the number. [b]p2.[/b] Let $A, B, C, D$ represent the numbers $1$ through $4$ in some order, with $A \ne 1$. Find the maximum possible value of $\frac{\log_A B}{C +D}$. Here, $\log_A B$ is the unique real number $X$ such that $A^X = B$. [b]p3. [/b]There are six points in a plane, no four of which are collinear. A line is formed connecting every pair of points. Find the smallest possible number of distinct lines formed. [b]p4.[/b] Let $a,b,c$ be real numbers which satisfy $$\frac{2017}{a}= a(b +c), \frac{2017}{b}= b(a +c), \frac{2017}{c}= c(a +b).$$ Find the sum of all possible values of $abc$. [b]p5.[/b] Let $a$ and $b$ be complex numbers such that $ab + a +b = (a +b +1)(a +b +3)$. Find all possible values of $\frac{a+1}{b+1}$. [b]p6.[/b] Let $\vartriangle ABC$ be a triangle. Let $X,Y,Z$ be points on lines $BC$, $CA$, and $AB$, respectively, such that $X$ lies on segment $BC$, $B$ lies on segment $AY$ , and $C$ lies on segment $AZ$. Suppose that the circumcircle of $\vartriangle XYZ$ is tangent to lines $AB$, $BC$, and $CA$ with center $I_A$. If $AB = 20$ and $I_AC = AC = 17$ then compute the length of segment $BC$. [b]p7. [/b]An ant makes $4034$ moves on a coordinate plane, beginning at the point $(0, 0)$ and ending at $(2017, 2017)$. Each move consists of moving one unit in a direction parallel to one of the axes. Suppose that the ant stays within the region $|x - y| \le 2$. Let N be the number of paths the ant can take. Find the remainder when $N$ is divided by $1000$. [b]p8.[/b] A $10$ digit positive integer $\overline{a_9a_8a_7...a_1a_0}$ with $a_9$ nonzero is called [i]deceptive [/i] if there exist distinct indices $i > j$ such that $\overline{a_i a_j} = 37$. Find the number of deceptive positive integers. [b]p9.[/b] A circle passing through the points $(2, 0)$ and $(1, 7)$ is tangent to the $y$-axis at $(0, r )$. Find all possible values of $ r$. [b]p10.[/b] An ellipse with major and minor axes $20$ and $17$, respectively, is inscribed in a square whose diagonals coincide with the axes of the ellipse. Find the area of the square. PS. You had better use hide for answers.

Prove that if $t$ is a natural number then there exists a natural number $n>1$ such that $(n,t)=1$ and none of the numbers $n+t,n^2+t,n^3+t,....$ are perfect powers.

Find all pairs $(x,n)$ of positive integers for which $x^n + 2^n + 1$ divides $x^{n+1} +2^{n+1} +1$.

Find the sum of all prime numbers $p$ which satisfy \[p = a^4 + b^4 + c^4 - 3\] for some primes (not necessarily distinct) $a$, $b$ and $c$.

On a board, the numbers from 1 to 2009 are written. A couple of them are erased and instead of them, on the board is written the remainder of the sum of the erased numbers divided by 13. After a couple of repetition of this erasing, only 3 numbers are left, of which two are 9 and 999. Find the third number.

For all positive integers $n$, find the remainder of $\dfrac{(7n)!}{7^n \cdot n!}$ upon division by 7.

p1. Two integers $m$ and $n$ are said to be [i]coprime [/i] if there are integers $a$ and $ b$ such that $am + bn = 1$. Show that for each integer $p$, the pair of numbers formed by $21p + 4$ and $14p + 3$ are always coprime. p2. Two farmers, Person $A$ and Person $B$ intend to change the boundaries of their land so that it becomes like a straight line, not curvy as in image below. They do not want the area of ​​their origin to be reduced. Try define the boundary line they should agree on, and explain why the new boundary does not reduce the area of ​​their respective origins. [img]https://cdn.artofproblemsolving.com/attachments/4/d/ec771d15716365991487f3705f62e4566d0e41.png[/img] p3. The system of equations of four variables is given: $\left\{\begin{array}{l} 23x + 47y - 3z = 434 \\ 47x - 23y - 4w = 183 \\ 19z + 17w = 91 \end{array} \right. $ where $x, y, z$, and $w$ are positive integers. Determine the value of $(13x - 14y)^3 - (15z + 16w)^3$ p4. A person drives a motorized vehicle so that the material used fuel is obtained at the following graph. [img]https://cdn.artofproblemsolving.com/attachments/6/f/58e9f210fafe18bfb2d9a3f78d90ff50a847b2.png[/img] Initially the vehicle contains $ 3$ liters of fuel. After two hours, in the journey of fuel remains $ 1$ liter. a. If in $ 1$ liter he can cover a distance of $32$ km, what is the distance taken as a whole? Explain why you answered like that? b. After two hours of travel, is there any acceleration or deceleration? Explain your answer. c. Determine what the average speed of the vehicle is. p5. Amir will make a painting of the circles, each circle to be filled with numbers. The circle's painting is arrangement follows the pattern below. [img]https://cdn.artofproblemsolving.com/attachments/8/2/533bed783440ea8621ef21d88a56cdcb337f30.png[/img] He made a rule that the bottom four circles would be filled with positive numbers less than $10$ that can be taken from the numbers on the date of his birth, i.e. $26 \,\, - \,\, 12 \,\, - \,\,1961$ without recurrence. Meanwhile, the circles above will be filled with numbers which is the product of the two numbers on the circles in underneath. a. In how many ways can he place the numbers from left to right, right on the bottom circles in order to get the largest value on the top circle? Explain. b. On another occasion, he planned to put all the numbers on the date of birth so that the number of the lowest circle now, should be as many as $8$ circles. He no longer cares whether the numbers are repeated or not . i. In order to get the smallest value in the top circle, how should the numbers be arranged? ii. How many arrays are worth considering to produce the smallest value?

The seven-digit integer numbers are different in pairs and this number is divided by each of its own numbers. a) Find all possibilities for the three numbers that are not included in this number. b) Give an example of such a number.

What is the units digit of $ 13^{2003}$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

We call a positive integer $n\ge 4$[i] beautiful[/i] if there exists some permutation $$\{x_1,x_2,\dots ,x_{n-1}\}$$ of $\{1,2,\dots ,n-1\}$ such that $\{x^1_1,\ x^2_2,\ \dots,x^{n-1}_{n-1}\}$ gives all the residues $\{1,2,\dots, n-1\}$ modulo $n$. Prove that if $n$ is beautiful then $n=2p,$ for some prime number $p.$

Let $p$ be a prime number and $a, k$ be positive integers such that $p^a<k<2p^a$. Prove that there exists a positive integer $n$ such that \[n<p^{2a}, C_n^k\equiv n\equiv k\pmod {p^a}.\]

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

Find the number of pairs $(a, b)$ of positive integers with the property that the greatest common divisor of $a$ and $ b$ is equal to $1\cdot 2 \cdot 3\cdot ... \cdot50$, and the least common multiple of $a$ and $ b$ is $1^2 \cdot 2^2 \cdot 3^2\cdot ... \cdot 50^2$.

Let $n$ be an even positive integer. We fill in a number on each cell of a rectangle table of $n$ columns and multiple rows as following: i. Each row is assigned to some positive integer $a$ and its cells are filled by $0$ or $a$ (in any order); ii. The sum of all numbers in each row is $n$. Note that we cannot add any more row to the table such that the conditions (i) and (ii) still hold. Prove that if the number of $0$’s on the table is odd then the maximum odd number on the table is a perfect square.

Show that the equation $x^3 +y^3 = 4(x^2y+xy^2 +1)$ has no integer solutions.

Prove that $\sqrt 3$ is irrational.

Let \(d(n)\) denote the number of positive divisors of \(n\). The sequence \(a_0\), \(a_1\), \(a_2\), \(\ldots\) is defined as follows: \(a_0=1\), and for all integers \(n\ge1\), \[a_n=d(a_{n-1})+d(d(a_{n-2}))+\cdots+ {\underbrace{d(d(\ldots d(a_0)\ldots))}_{n\text{ times}}}.\] Show that for all integers \(n\ge1\), we have \(a_n\le3n\). [i]Proposed by Karthik Vedula[/i]

Let $n$ be a given positive integer and $$A =\frac{1 \cdot 3 \cdot 5 \cdot ... \cdot (2n- 1)}{2 \cdot 4 \cdot 6 \cdot ... \cdot 2n}$$ Prove that at least one term of the sequence $A, 2A,4A,8A,...,2^kA, ... $ is an integer.