Let $A_1,A_2,\cdots , A_n$ be arithmetic progressions of integers, each of $k$ terms, such that any two of these arithmetic progressions have at least two common elements. Suppose $b$ of these arithmetic progressions have common difference $d_1$ and the remaining arithmetic progressions have common difference $d_2$ where $0<b<n$. Prove that \[b \le 2\left(k-\frac{d_2}{gcd(d_1,d_2)}\right)-1.\]

Some distinct positive integers were written on a blackboard such that the sum of any two integers is a power of $2$. What is the maximal possible number written on the blackboard?

Find the smallest $x \in\mathbb{N}$ for which $\frac{7x^{25}-10}{83}$ is an integer.

Find the largest integer $A$ such that, for any permutation of the natural numbers not exceeding $100$, the sum of some ten successive numbers is at least $A$.

Prove that if $m,n$ are relatively prime positive integers, $x^m-y^n$ is irreducible in the complex numbers. (A polynomial $P(x,y)$ is irreducible if there do not exist nonconstant polynomials $f(x,y)$ and $g(x,y)$ such that $P(x,y) = f(x,y)g(x,y)$ for all $x,y$.) [i]David Yang.[/i]

The Fibonacci sequence $\{F_n\}$ is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all positive integers $n$. Determine all triplets of positive integers $(k,m,n)$ such that $F_n = F_m^k$.

Do there exist $ 14$ positive integers, upon increasing each of them by $ 1$,their product increases exactly $ 2008$ times?

Solve the equation for real numbers $x,y,z$ $$(x-y+z)^2=x^2-y^2+z^2$$

Positive integers $a,b,c,d$ satisfy $a+c=10$ and \[\displaystyle S=\frac{a}{b} + \frac{c}{d} <1.\] Find the maximum value of $S$.

[b]8.1 / 7.4[/b] What number needs to be put in place * so that the next the problem had a unique solution: “There are n straight lines on the plane, intersecting at * points. Find n.” ? [b]8.2 / 7.3[/b] Prove that for any natural number $n$ the number $ n(2n+1)(3n+1)...(1966n + 1) $ is divisible by every prime number less than $1966$. [b]8.3 / 7.6[/b] There are $n$ points on the plane so that any triangle with vertices at these points has an area less than $1$. Prove that all these points can be enclosed in a triangle of area $4$. [b]8.4[/b] Prove that the sum of all divisors of the number $n^2$ is odd. [b]8.5[/b] A quadrilateral has three obtuse angles. Prove that the larger of its two diagonals emerges from the vertex of an acute angle. [b]8.6[/b] Numbers $x_1, x_2, . . . $ are constructed according to the following rule: $$x_1 = 2, x_2 = (x^5_1 + 1)/5x_1, x_3 = (x^5_2 + 1)/5x_2, ...$$ Prove that no matter how much we continued this construction, all the resulting numbers will be no less $1/5$ and no more than $2$. PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3988082_1966_leningrad_math_olympiad]here[/url].

Let $A$ be the set of all polynomials $f(x)$ of order $3$ with integer coefficients and cubic coefficient $1$, so that for every $f(x)$ there exists a prime number $p$ which does not divide $2004$ and a number $q$ which is coprime to $p$ and $2004$, so that $f(p)=2004$ and $f(q)=0$. Prove that there exists a infinite subset $B\subset A$, so that the function graphs of the members of $B$ are identical except of translations

A finite set $K$ consists of at least 3 distinct positive integers. Suppose that $K$ can be partitioned into two nonempty subsets $A,B\in K$ such that $ab+1$ is always a perfect square whenever $a\in A$ and $b\in B$. Prove that \[\max_{k\in K}k\geq \left\lfloor (2+\sqrt{3})^{\min\{|A|,|B|\}-1}\right\rfloor+1,\]where $|X|$ stands for the cartinality of the set $X$, and for $x\in \mathbb{R}$, $\lfloor x\rfloor$ is the greatest integer that does not exceed $x$.

Find all polynomials $P(x)$ with integer coefficients, such that for any positive integer $n$ number $P(n)$ is a positive integer and a divisor of $n!$. [i]Proposed by Mykyta Kharin[/i]

For a three-digit prime number $p$, the equation $x^3+y^3=p^2$ has an integer solution. Calculate $p$.

Find all pairs $(p,q)$ of prime numbers such that $$ p(p^2 - p - 1) = q(2q + 3) .$$

Determine all pairs of prime numbers $p$ and $q$ greater than $1$ and less than $100$, such that the following five numbers: $$p+6,p+10,q+4,q+10,p+q+1,$$ are all prime numbers.

A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?

Prove that the number $$2^{2^k-1}-2^k-1$$is composite (not prime) for all positive integers $k>2$.

Let $k$, $n$ be fixed positive integers. In a circular table, there are placed pins numbered successively with the numbers $1, 2 \dots, n$, with $1$ and $n$ neighbors. It is known that pin $1$ is golden and the others are white. Arnaldo and Bernaldo play a game, in which a ring is placed initially on one of the pins and at each step it changes position. The game begins with Bernaldo choosing a starting pin for the ring, and the first step consists of the following: Arnaldo chooses a positive integer $d$ any and Bernaldo moves the ring $d$ pins clockwise or counterclockwise (positions are considered modulo $n$, i.e., pins $x$, $y$ equal if and only if $n$ divides $x-y$). After that, the ring changes its position according to one of the following rules, to be chosen at every step by Arnaldo: [b]Rule 1:[/b] Arnaldo chooses a positive integer $d$ and Bernaldo moves the ring $d$ pins clockwise or counterclockwise. [b]Rule 2:[/b] Arnaldo chooses a direction (clockwise or counterclockwise), and Bernaldo moves the ring in the chosen direction in $d$ or $kd$ pins, where $d$ is the size of the last displacement performed. Arnaldo wins if, after a finite number of steps, the ring is moved to the golden pin. Determine, as a function of $k$, the values of $n$ for which Arnaldo has a strategy that guarantees his victory, no matter how Bernaldo plays.

An integer $n>2$ is called [i]tasty[/i] if for every ordered pair of positive integers $(a,b)$ with $a+b=n,$ at least one of $\frac{a}{b}$ and $\frac{b}{a}$ is a terminating decimal. Do there exist infinitely many tasty integers? [i]Proposed by Vincent Huang[/i]

[b]p1.[/b] Will is distributing his money to three friends. Since he likes some friends more than others, the amount of money he gives each is in the ratio of $5 : 3 : 2$. If the person who received neither the least nor greatest amount of money was given $42$ dollars, how many dollars did Will distribute in all? [b]p2.[/b] Fan, Zhu, and Ming are driving around a circular track. Fan drives $24$ times as fast as Ming and Zhu drives $9$ times as fast as Ming. All three drivers start at the same point on the track and keep driving until Fan and Zhu pass Ming at the same time. During this interval, how many laps have Fan and Zhu driven together? [b]p3.[/b] Mr. DoBa is playing a game with Gunga the Gorilla. They both agree to think of a positive integer from $1$ to $120$, inclusive. Let the sum of their numbers be $n$. Let the remainder of the operation $\frac{n^2}{4}$ be $r$. If $r$ is $0$ or $1$, Mr. DoBa wins. Otherwise, Gunga wins. Let the probability that Mr. DoBa wins a given round of this game be $p$. What is $120p$? [b]p4.[/b] Let S be the set $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}$. How many subsets of $S$ are there such that if $a$ is the number of even numbers in the subset and $b$ is the number of odd numbers in the subset, then $a$ and $b$ are either both odd or both even? By definition, subsets of $S$ are unordered and only contain distinct elements that belong to $S$. [b]p5.[/b] Phillips Academy has five clusters, $WQN$, $WQS$, $PKN$, $FLG$ and $ABB$. The Blue Key heads are going to visit all five clusters in some order, except $WQS$ must be visited before $WQN$. How many total ways can they visit the five clusters? [b]p6.[/b] An astronaut is in a spaceship which is a cube of side length $6$. He can go outside but has to be within a distance of $3$ from the spaceship, as that is the length of the rope that tethers him to the ship. Out of all the possible points he can reach, the surface area of the outer surface can be expressed as $m+n\pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? [b]p7.[/b] Let $ABCD$ be a square and $E$ be a point in its interior such that $CDE$ is an equilateral triangle. The circumcircle of $CDE$ intersects sides $AD$ and $BC$ at $D$, $F$ and $C$, $G$, respectively. If $AB = 30$, the area of $AFGB$ can be expressed as $a-b\sqrt{c}$, where $a$, $b$, and $c$ are positive integers and c is not divisible by the square of any prime. Find $a + b + c$. [b]p8.[/b] Suppose that $x, y, z$ satisfy the equations $$x + y + z = 3$$ $$x^2 + y^2 + z^2 = 3$$ $$x^3 + y^3 + z^3 = 3$$ Let the sum of all possible values of $x$ be $N$. What is $12000N$? [b]p9.[/b] In circle $O$ inscribe triangle $\vartriangle ABC$ so that $AB = 13$, $BC = 14$, and $CA = 15$. Let $D$ be the midpoint of arc $BC$, and let $AD$ intersect $BC$ at $E$. Determine the value of $DE \cdot DA$. [b]p10.[/b] How many ways are there to color the vertices of a regular octagon in $3$ colors such that no two adjacent vertices have the same color? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many integers between $1000$ and $2000$ have all three of the numbers $15$, $20$, and $25$ as factors? $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Determine the values of the positive integer $n$ for which $$A =\sqrt{\frac{9n - 1}{n + 7}}$$ is rational.

Find all positive integers $n$ such that there are $\infty$ many lines of Pascal's triangle that have entries coprime to $n$ only. In other words: such that there are $\infty$ many $k$ with the property that the numbers $\binom{k}{0},\binom{k}{1},\binom{k}{2},...,\binom{k}{k}$ are all coprime to $n$.

We say a non-negative integer $n$ "[i]contains[/i]" another non-negative integer $m$, if the digits of its decimal expansion appear consecutively in the decimal expansion of $n$. For example, $2016$ [i]contains[/i] $2$, $0$, $1$, $6$, $20$, $16$, $201$, and $2016$. Find the largest integer $n$ that does not [i]contain[/i] a multiple of $7$.