A black bishop and a white king are placed randomly on a $2000 \times 2000$ chessboard (in distinct squares). Let $p$ be the probability that the bishop attacks the king (that is, the bishop and king lie on some common diagonal of the board). Then $p$ can be expressed in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m$. [i]Proposed by Ahaan Rungta[/i]

When the natural numbers are written one after another in an increasing way, you get an infinite succession of digits $123456789101112 ....$ Denote $A_k$ the number formed by the first $k$ digits of this sequence . Prove that for all positive integer $n$ there is a positive integer $m$ which simultaneously verifies the following three conditions: (i) $n$ divides $A_m$, (ii) $n$ divides $m$, (iii) $n$ divides the sum of the digits of $A_m$.

1) Let $a$ and $b$ be relatively prime positive integers. Prove that there is a positive integer $n$ such that $1 \le n \le b$ and $b$ divides $a^n - 1$. 2) Prove that there is a multiple of $7^{2010}$ of the form $99... 9$ ($n$ nines), for some positive integer $n$ not exceeding $7^{2010}$.

Let $f(x)$ and $g(x)$ be non-constant polynomials with integer positive coefficients, $m$ and $n$ are given natural numbers. Prove that there exists infinitely many natural numbers $k$ for which the numbers $$f(m^n)+g(0),f(m^n)+g(1),\ldots,f(m^n)+g(k)$$ are composite. [i]I. Tonov[/i]

Let $A$ be an infinite set of positive integers. Find all natural numbers $n$ such that for each $a \in A$, \[a^n + a^{n-1} +
\cdots
+ a^1 + 1 \mid a^{n!} + a^{(n-1)!} +
\cdots

+ a^{1!} + 1.\] [i]Proposed by Milos Milosavljevic[/i]

(a) Find all triples $(x,y,z)$ of positive integers such that $xy \equiv 2 (\bmod{z})$ , $yz \equiv 2 (\bmod{x})$ and $zx \equiv 2 (\bmod{y} )$ (b) Let $n \geq 1$ be an integer. Give an algoritm to determine all triples $(x,y,z)$ such that '2' in part (a) is replaced by 'n' in all three congruences.

How many subsets of $\{2,3,4,5,6,7,8,9\}$ contain at least one prime number? $\textbf{(A)} \text{ 128} \qquad \textbf{(B)} \text{ 192} \qquad \textbf{(C)} \text{ 224} \qquad \textbf{(D)} \text{ 240} \qquad \textbf{(E)} \text{ 256}$

Let $a$ and $b$ be integers such that $a - b = a^2c - b^2d$ for some consecutive integers $c$ and $d$. Prove that $|a - b|$ is a perfect square.

Let $p\geq 5$ be a prime number, and set $M=\{1,2,\cdots,p-1\}.$ Define $$T=\{(n,x_n):p|nx_n-1\ \textup{and}\ n,x_n\in M\}.$$ If $\sum_{(n,x_n)\in T}n\left[\dfrac{nx_n}{p}\right]\equiv k \pmod {p},$ with $0\leq k\leq p-1,$ where $\left[\alpha\right]$ denotes the largest integer that does not exceed $\alpha,$ determine the value of $k.$

Find all pairs $ (m$, $ n)$ of integers which satisfy the equation \[ (m \plus{} n)^4 \equal{} m^2n^2 \plus{} m^2 \plus{} n^2 \plus{} 6mn.\]

Determine the polynomial $$f(x) = x^k + a_{k-1} x^{k-1}+\cdots +a_1 x +a_0 $$ of smallest degree such that $a_i \in \{-1,0,1\}$ for $0\leq i \leq k-1$ and $f(n)$ is divisible by $30$ for all positive integers $n$.

p1. The pattern $ABCCCDDDDABBCCCDDDDABBCCCDDDD...$ repeats to infinity. Which letter ranks in place $2533$ ? p2. Prove that if $a > 2$ and $b > 3$ then $ab + 6 > 3a + 2b$. p3. Given a rectangle $ABCD$ with size $16$ cm $\times 25$ cm, $EBFG$ is kite, and the length of $AE = 5$ cm. Determine the length of $EF$. [img]https://cdn.artofproblemsolving.com/attachments/2/e/885af838bcf1392eb02e2764f31ae83cb84b78.png[/img] p4. Consider the following series of statements. It is known that $x = 1$. Since $x = 1$ then $x^2 = 1$. So $x^2 = x$. As a result, $x^2 - 1 = x- 1$ $(x -1) (x + 1) = (x - 1) \cdot 1$ Using the rule out, we get $x + 1 = 1$ $1 + 1 = 1$ $2 = 1$ The question. a. If $2 = 1$, then every natural number must be equal to $ 1$. Prove it. b. The result of $2 = 1$ is something that is impossible. Of course there's something wrong in the argument above? Where is the fault? Why is that you think wrong? p5. To calculate $\sqrt{(1998)(1996)(1994)(1992)+16}$ . someone does it in a simple way as follows: $2000^2-2 \times 5\times 2000 + 5^2 - 5$? Is the way that person can justified? Why? p6. To attract customers, a fast food restaurant give gift coupons to everyone who buys food at the restaurant with a value of more than $25,000$ Rp.. Behind every coupon is written one of the following numbers: $9$, $12$, $42$, $57$, $69$, $21$, 15, $75$, $24$ and $81$. Successful shoppers collect coupons with the sum of the numbers behind the coupon is equal to 100 will be rewarded in the form of TV $21''$. If the restaurant owner provides as much as $10$ $21''$ TV pieces, how many should be handed over to the the customer? p7. Given is the shape of the image below. [img]https://cdn.artofproblemsolving.com/attachments/4/6/5511d3fb67c039ca83f7987a0c90c652b94107.png[/img] The centers of circles $B$, $C$, $D$, and $E$ are placed on the diameter of circle $A$ and the diameter of circle $B$ is the same as the radius of circle $A$. Circles $C$, $D$, and $E$ are equal and the pairs are tangent externally such that the sum of the lengths of the diameters of the three circles is the same with the radius of the circle $A$. What is the ratio of the circumference of the circle $A$ with the sum of the circumferences of circles $B$, $C$, $D$, and $E$? p8. It is known that $a + b + c = 0$. Prove that $a^3 + b^3 + c^3 = 3abc$.

Determine all integers $a$ such that $a^k + 1$ is divisible by $12321$ for some $k$

Find all positive integers $m, n$ satisfying $n!+2^{n-1}=2^m$.

Let $a$ and $b$ be 2019-digit numbers. Exactly 12 digits of $a$ are non-zero: the five leftmost and seven rightmost, and exactly 14 digits of $b$ are non-zero: the five leftmost and nine rightmost. Prove that the largest common divisor of $a$ and $b$ has no more than 14 digits. [i]Proposed by L. Samoilov[/i]

The teacher has chosen two different figures from $\{1, 2, 3, \dots, 9\}$. Nick intends to find a seven-digit number divisible by $7$ such that its decimal representation contains no figures besides these two. Is this possible for each teacher’s choice? (4 marks)

Let $p\ge5$ be a prime. Show that \[\sum_{k=0}^{(p-1)/2}\binom{p}{k}3^k\equiv 2^p - 1\pmod{p^2}.\] [i]Victor Wang.[/i]

How many ordered triples $(a, b, c)$ of positive integers are there such that none of $a, b, c$ exceeds $2010$ and each of $a, b, c$ divides $a + b + c$?

Determine all three-digit numbers $N$ having the property that $N$ is divisible by 11, and $\dfrac{N}{11}$ is equal to the sum of the squares of the digits of $N$.

Does there exist an integer such that its cube is equal to $3n^2 + 3n + 7,$ where $n$ is an integer.

Find all integral solutions to $x^y - y^x = 1$

Show that, for every positive integer $n$, there exist $n$ consecutive positive integers such that none is divisible by the sum of its digits. (Alternative Formulation: Call a number good if it's not divisible by the sum of its digits. Show that for every positive integer $n$ there are $n$ consecutive good numbers.)

Find all positive integers $k$ such that for every $n\in\mathbb N$, if there are $k$ factors (not necessarily distinct) of $n$ so that the sum of their squares is $n$, then there are $k$ factors (not necessarily distinct) of $n$ so that their sum is exactly $n$.

The sequence $a_1, a_2, ...$ of natural numbers satisfies $GCD(a_i, a_j)=GCD(i, j)$ for all $i \neq j$. Prove that $a_i=i$ for all $i$.

[b]p1.[/b] For what integers $n$ is $2^6 + 2^9 + 2^n$ the square of an integer? [b]p2.[/b] Two integers are chosen at random (independently, with repetition allowed) from the set $\{1,2,3,...,N\}$. Show that the probability that the sum of the two integers is even is not less than the probability that the sum is odd. [b]p3.[/b] Let $X$ be a point in the second quadrant of the plane and let $Y$ be a point in the first quadrant. Locate the point $M$ on the $x$-axis such that the angle $XM$ makes with the negative end of the $x$-axis is twice the angle $YM$ makes with the positive end of the $x$-axis. [b]p4.[/b] Let $a,b$ be positive integers such that $a \ge b \sqrt3$. Let $\alpha^n = (a + b\sqrt3)^n = a_n + b_n\sqrt3$ for $n = 1,2,3,...$. i. Prove that $\lim_{n \to + \infty} \frac{a_n}{b_n}$ exists. ii. Evaluate this limit. [b]p5.[/b] Suppose $m$ and $n$ are the hypotenuses are of Pythagorean triangles, i.e,, there are positive integers $a,b,c,d$, so that $m^2 = a^2 + b^2$ and $n^2= c^2 + d^2$. Show than $mn$ is the hypotenuse of at least two distinct Pythagorean triangles. Hint: you may not assume that the pair $(a,b)$ is different from the pair $(c,d)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].