Let n be a positve integer. prove there exists a positive integer n st $n^{2013}-n^{20}+n^{13}-2013$ has at least N distinct prime factors.

Let $L(n)$ denote the least common multiple of $\{1, 2 . . . , n\}$. (i) Prove that there exists a positive integer $k$ such that $L(k) = L(k + 1) = ... = L(k + 2000)$. (ii) Find all $m$ such that $L(m + i) \ne L(m + i + 1)$ for all $i = 0, 1, 2$.

A prime is called [i]perfect[/i] if there is a permutation $a_1, a_2, \cdots, a_{\frac{p-1}{2}}, b_1, b_2, \cdots, b_{\frac{p-1}{2}}$ of $1, 2, \cdots, p-1$ satisfies $$b_i \equiv a_i + \frac{1}{a_i} \pmod p$$ for all $1 \le i \le \frac{p-1}{2}$. Show that there are infinitely many primes that are not perfect. [i]Proposed By - CSJL[/i]

We say a natural number $n$ is perfect if the sum of all the positive divisors of $n$ is equal to $2n$. For example, $6$ is perfect since its positive divisors $1,2,3,6$ add up to $12=2\times 6$. Show that an odd perfect number has at least $3$ distinct prime divisors. [i]Note: It is still not known whether odd perfect numbers exist. So assume such a number is there and prove the result.[/i]

For a given rational number $r$, find all integers $z$ such that \[2^z + 2 = r^2\mbox{.}\] [i](Swiss Mathematical Olympiad 2011, Final round, problem 7)[/i]

For a positive integer $N$, let $f(N)$ be the number of ordered pairs of positive integers $(a,b)$ such that the number $$\frac{ab}{a+b}$$ is a divisor of $N$. Prove that $f(N)$ is always a perfect square.

The smallest positive integer $x$ for which $1260x=N^3$, where $N$ is an integer, is: $\textbf{(A)}\ 1050 \qquad \textbf{(B)}\ 1260 \qquad \textbf{(C)}\ 1260^2 \qquad \textbf{(D)}\ 7350 \qquad \textbf{(E)}\ 44100$

Let $a\geq 2$ be an integer. Prove that there exists a positive integer $b$ with the following property: For each positive integer $n$, there is a prime number $p$ (possibly depending on $a,b,n$) such that $a^n + b$ is divisible by $p$, but not divisible by $p^2$.

Prove: For each positive integer is the number of divisors whose decimal representations ends with a 1 or 9 not less than the number of divisors whose decimal representations ends with 3 or 7.

[u]Round 1 [/u] [b]p1.[/b] Pirate Jim had $8$ boxes with gun powder weighing $1, 2, 3, 4, 5, 6, 7$, and $8$ pounds (the weight is printed on top of every box). Pirate Bob hid a $1$-pound gold bar in one of these boxes. Pirate Jim has a balance scale that he can use, but he cannot open any of the boxes. Help him find the box with the gold bar using two weighings on the balance scale. [b]p2.[/b] James Bond will spend one day at Dr. Evil's mansion to try to determine the answers to two questions: a) Is Dr. Evil at home? b) Does Dr. Evil have an army of ninjas? The parlor in Dr. Evil's mansion has three windows. At noon, Mr. Bond will sneak into the parlor and use open or closed windows to signal his answers. When he enters the parlor, some windows may already be opened, and Mr. Bond will only have time to open or close one window (or leave them all as they are). Help Mr. Bond and Moneypenny design a code that will tell Moneypenny the answers to both questions when she drives by later that night and looks at the windows. Note that Moneypenny will not have any way to know which window Mr. Bond opened or closed. [b]p3.[/b] Suppose that you have a triangle in which all three side lengths and all three heights are integers. Prove that if these six lengths are all different, there cannot be four prime numbers among them. p4. Fred and George have designed the Amazing Maze, a $5\times 5$ grid of rooms, with Adorable Doors in each wall between rooms. If you pass through a door in one direction, you gain a gold coin. If you pass through the same door in the opposite direction, you lose a gold coin. The brothers designed the maze so that if you ever come back to the room in which you started, you will find that your money has not changed. Ron entered the northwest corner of the maze with no money. After walking through the maze for a while, he had $8$ shiny gold coins in his pocket, at which point he magically teleported himself out of the maze. Knowing this, can you determine whether you will gain or lose a coin when you leave the central room through the north door? [b]p5.[/b] Bill and Charlie are playing a game on an infinite strip of graph paper. On Bill’s turn, he marks two empty squares of his choice (not necessarily adjacent) with crosses. Charlie, on his turn, can erase any number of crosses, as long as they are all adjacent to each other. Bill wants to create a line of $2013$ crosses in a row. Can Charlie stop him? [u]Round 2 [/u] [b]p6.[/b] $1000$ non-zero numbers are written around a circle and every other number is underlined. It happens that each underlined number is equal to the sum of its two neighbors and that each non-underlined number is equal to the product of its two neighbors. What could the sum of all the numbers written on the circle be? [b]p7.[/b] A grasshopper is sitting at the edge of a circle of radius $3$ inches. He can hop exactly $4$ inches in any direction, as long as he stays within the circle. Which points inside the circle can the grasshopper reach if he can make as many jumps as he likes? [img]https://cdn.artofproblemsolving.com/attachments/1/d/39b34b2b4afe607c1232f4ce9dec040a34b0c8.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If $p$ is a prime greater than $3$, show that at least one of the numbers \[\frac{3}{p^2} , \frac{4}{p^2} , \cdots, \frac{p-2}{p^2}\] is expressible in the form $\frac{1}{x} + \frac{1}{y}$, where $x$ and $y$ are positive integers.

[b]8.1[/b] $x$ and $y$ are the roots of the equation $t^2-ct-c=0$. Prove that holds the inequality $x^3 + y^3 + (xy)^3 \ge 0.$ [b]8.2.[/b] Two circles touch internally at point $A$ . Through a point $B$ of the inner circle, different from $A$, a tangent to this circle intersecting the outer circle at points C and $D$. Prove that $AB$ is a bisector of angle $CAD$. [img]https://cdn.artofproblemsolving.com/attachments/2/8/3bab4b5c57639f24a6fd737f2386a5e05e6bc7.png[/img] [b]8.3[/b] Prove that $2^{3^{100}} + 1$ is divisible by $3^{101}$. [b]8.4 / 7.5[/b] An entire arc of circle is drawn through the vertices $A$ and $C$ of the rectangle $ABCD$ lying inside the rectangle. Draw a line parallel to $AB$ intersecting $BC$ at point $P$, $AD$ at point $Q$, and the arc $AC$ at point $R$ so that the sum of the areas of the figures $AQR$ and $CPR$ is the smallest. [img]https://cdn.artofproblemsolving.com/attachments/1/4/9b5a594f82a96d7eff750e15ca6801a5fc0bf1.png [/img] [b]8.5[/b] In a certain group of people, everyone has one enemy and one Friend. Prove that these people can be divided into two companies so that in every company there will be neither enemies nor friends. [b]8.6[/b] Numbers $a_1, a_2, . . . , a_{100}$ are such that $$a_1 - 2a_2 + a_3 \le 0$$ $$a_2-2a_3 + a_ 4 \le 0$$ $$...$$ $$a_{98}-2a_{99 }+ a_{100} \le 0$$ and at the same time $a_1 = a_{100}\ge 0$. Prove that all these numbers are non-negative. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988083_1967_leningrad_math_olympiad]here[/url].

Let the sequence ($a_n$) be defined by $a_n = n^6 +5n^4 -12n^2 -36, n \ge 2$. (a) Prove that any prime number divides some term in this sequence. (b) Prove that there is a positive integer not dividing any term in the sequence. (c) Determine the least $n \ge 2$ for which $1989 | a_n$.

For $r> 0$ denote by $B_r$ the set of points at distance at most $r$ length units from the origin. If $P_r$ is the set of the points in $B_r$ whit integer coordinates, show that the equation $$xy^3z + 2x^3z^3-3x^5y = 0$$ has an odd number of solutions $(x, y, z)$ in $P_r$.

Several prime numbers (some repeated) are written on the board. Mauro added the numbers on the board and Fernando multiplied the numbers on the board. The result obtained by Fernando is equal to $40$ times the result obtained by Mauro. Determine what the numbers on the board can be. Give all chances.

How many $3$ digit positive integers are not divided by $5$ neither by $7$?

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

A [i]change [/i] in a natural number $n$ consists of adding a pair of zeros between two digits or at the end of the decimal representation of $n$. A [i]countryman [/i] of $n$ is a number that can be obtained from one or more changes in $n$. For example. $40041$, $4410000$ and $4004001$ are all countrymen from $441$. Determine all the natural numbers $n$ for which there is a natural number m with the property that $n$ divides $m$ and all the countrymen of $m$.

Find all prime numbers $p$ for which number $p^2 + 11$ has exactly six different divisors (counting $1$ and itself).

Let $A$ be a set of $N$ residues $\pmod{N^2}$. Prove that there exists a set $B$ of $N$ residues $\pmod{N^2}$ such that the set $A+B=\{a+b \vert a \in A, b \in B \}$ contains at least half of all the residues $\pmod{N^2}$.

Show that $\sum_{n=0}^{2013}\frac{4026!}{(n!(2013-n)!)^2}$ is a perfect square.

The integers $a, b, c$ are not $0$ such that $\frac{a}{b + c^2}=\frac{a + c^2}{b}$. Prove that $a + b + c \le 0$.

Let $a$ and $ b$ be integers and $n$ a positive integer. Prove that \[\frac{b^{n-1}a(a + b)(a + 2b) \cdots (a + (n - 1)b)}{n!}\] is an integer.

Given a positive integer $n$, let $D$ is the set of positive divisors of $n$, and let $f: D \to \mathbb{Z}$ be a function. Prove that the following are equivalent: (a) For any positive divisor $m$ of $n$, \[ n ~\Big|~ \sum_{d|m} f(d) \binom{n/d}{m/d}. \] (b) For any positive divisor $k$ of $n$, \[ k ~\Big|~ \sum_{d|k} f(d). \]

For a prime number $p$. Can the number of n positive integers that make the expression \[\dfrac{n^3+np+1}{n+p+1}\] an integer be $777$?