Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

$\boxed{\text{A5}}$ Determine all positive integers $a,b$ such that $a^{2}b^{2}+208=4([a,b]+(a,b))^2$ where $[a,b]$-lcm of $a,b$ and $(a,b)$-gcd of $a,b$.

$N$ integers are given. Prove that the sum of their squares is divisible by $N$ if it is known that the difference between the product of any $N - 1$ of them and the last one is divisible by $N$. (D. Fomin, Leningrad)

The six-digit decimal number contains six different non-zero digits and is divisible by $37$. Prove that having transposed its digits you can obtain at least $23$ more numbers divisible by $37$

Find all primes $p$, so that for every prime $q<p$ and $x\in \mathbb{Z}$ one has $p\nmid x^2-q$.

A positive integer is called a [b]double number[/b] if its decimal representation consists of a block of digits, not commencing with 0, followed immediately by an identical block. So, for instance, 360360 is a double number, but 36036 is not. Show that there are infinitely many double numbers which are perfect squares.

Prove that there is no $m$ such that ($1978^m - 1$) is divisible by ($1000^m - 1$).

$\textbf{N3:}$ For any positive integer $n$, define $rad(n)$ to be the product of all prime divisors of $n$ (without multiplicities), and in particular $rad(1)=1$. Consider an infinite sequence of positive integers $\{a_n\}_{n=1}^{\infty}$ satisfying that \begin{align*} a_{n+1} = a_n + rad(a_n), \: \forall n \in \mathbb{N} \end{align*} Show that there exist positive integers $t,s$ such that $a_t$ is the product of the $s$ smallest primes. [i]Proposed by ltf0501[/i]

Let $p$ be a prime number. $T(x)$ is a polynomial with integer coefficients and degree from the set $\{0,1,...,p-1\}$ and such that $T(n) \equiv T(m) (mod p)$ for some integers m and n implies that $ m \equiv n (mod p)$. Determine the maximum possible value of degree of $T(x)$

[b]p1.[/b] What is $6\times 7 + 4 \times 7 + 6\times 3 + 4\times 3$? [b]p2.[/b] How many integers $n$ have exactly $\sqrt{n}$ factors? [b]p3.[/b] A triangle has distinct angles $3x+10$, $2x+20$, and $x+30$. What is the value of $x$? [b]p4.[/b] If $4$ people of the Math Club are randomly chosen to be captains, and Henry is one of the $30$ people eligible to be chosen, what is the probability that he is not chosen to be captain? [b]p5.[/b] $a, b, c, d$ is an arithmetic sequence with difference $x$ such that $a, c, d$ is a geometric sequence. If $b$ is $12$, what is $x$? (Note: the difference of an aritmetic sequence can be positive or negative, but not $0$) [b]p6.[/b] What is the smallest positive integer that contains only $0$s and $5$s that is a multiple of $24$. [b]p7.[/b] If $ABC$ is a triangle with side lengths $13$, $14$, and $15$, what is the area of the triangle made by connecting the points at the midpoints of its sides? [b]p8.[/b] How many ways are there to order the numbers $1,2,3,4,5,6,7,8$ such that $1$ and $8$ are not adjacent? [b]p9.[/b] Find all ordered triples of nonnegative integers $(x, y, z)$ such that $x + y + z = xyz$. [b]p10.[/b] Noah inscribes equilateral triangle $ABC$ with area $\sqrt3$ in a cricle. If $BR$ is a diameter of the circle, then what is the arc length of Noah's $ARC$? [b]p11.[/b] Today, $4/12/14$, is a palindromic date, because the number without slashes $41214$ is a palindrome. What is the last palindromic date before the year $3000$? [b]p12.[/b] Every other vertex of a regular hexagon is connected to form an equilateral triangle. What is the ratio of the area of the triangle to that of the hexagon? [b]p13.[/b] How many ways are there to pick four cards from a deck, none of which are the same suit or number as another, if order is not important? [b]p14.[/b] Find all functions $f$ from $R \to R$ such that $f(x + y) + f(x - y) = x^2 + y^2$. [b]p15.[/b] What are the last four digits of $1(1!) + 2(2!) + 3(3!) + ... + 2013(2013!)$/ [b]p16.[/b] In how many distinct ways can a regular octagon be divided up into $6$ non-overlapping triangles? [b]p17.[/b] Find the sum of the solutions to the equation $\frac{1}{x-3} + \frac{1}{x-5} + \frac{1}{x-7} + \frac{1}{x-9} = 2014$ . [b]p18.[/b] How many integers $n$ have the property that $(n+1)(n+2)(n+3)(n+4)$ is a perfect square of an integer? [b]p19.[/b] A quadrilateral is inscribed in a unit circle, and another one is circumscribed. What is the minimum possible area in between the two quadrilaterals? [b]p20.[/b] In blindfolded solitary tic-tac-toe, a player starts with a blank $3$-by-$3$ tic-tac-toe board. On each turn, he randomly places an "$X$" in one of the open spaces on the board. The game ends when the player gets $3$ $X$s in a row, in a column, or in a diagonal as per normal tic-tac-toe rules. (Note that only $X$s are used, not $O$s). What fraction of games will run the maximum $7$ amount of moves? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Can every positive rational number $q$ be written as $$\frac{a^{2021} + b^{2023}}{c^{2022} + d^{2024}},$$ where $a, b, c, d$ are all positive integers? [i]Proposed by Dominic Yeo, UK[/i]

[b]6.1 [/b] Three people with one double seater motorbike simultaneously headed from city A to city B . How should they act so that time, for which the last of them will get to , was the smallest? Determine this time. Pedestrian speed - 5 km/h, motorcycle speed - 45 km/h, distance from A to B is equal to 60 kilometers . [b]6.2 / 7.2[/b] The numbers $A$ and $B$ are relatively prime. What common divisors can have the numbers $A+B$ and $A-B$? [b]6.3.[/b] A person's age in $1962$ was one more than the sum of digits of the year of his birth. How old is he? [b]6.4. / 7.3[/b] $15$ magazines lie on the table, completely covering it. Prove that it is possible to remove eight of them so that the remaining magz cover at least $7/15$ of the table area. [b]6.5.[/b] Prove that a $201 \times 201$ chessboard can be bypassed by moving a chess knight, visiting each square exactly once. [b]6.6.[/b] Can an integer whose last two digits are odd be the square of another integer? PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983459_1962_leningrad_math_olympiad]here[/url].

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

Fridolin the frog jumps on the number line: He starts at $0$, then jumps in some order on each of the numbers $1,2,\dots,9$ exactly once and finally returns with his last jump to $0$. Can the total distance he travelled with these $10$ jumps be a) $20$, b) $25$?

Determine all ten-digit numbers whose decimal $\overline{a_0a_1a_2a_3a_4a_5a_6a_7a_8a_9}$ is given by such that for each integer $j$ with $0\le j \le 9, a_j$ is equal to the number of digits equal to $j$ in this representation. That is: the first digit is equal to the amount of "$0$" in the writing of that number, the second digit is equal to the amount of "$1$" in the writing of that number, the third digit is equal to the amount of "$2$" in the writing of that number, ... , the tenth digit is equal to the number of "$9$" in the writing of that number.

The nine horizontal and nine vertical lines on an $8\times8$ checkerboard form $r$ rectangles, of which $s$ are squares. The number $s/r$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Prove that for all odd prime numbers $p$ there exist a natural number $m<p$ and integers $x_1, x_2, x_3$ such that: \[mp=x_1^2+x_2^2+x_3^2.\]

Let $n \geq 2$ be a positive integer. If $m$ is a positive integer, for which all of its positive divisors can be split into $n$ disjoint sets of equal sum, prove that $m \geq 2^{n+1}-2$

Prove that a necessary and sufficient for the existence of a set $ S \subset \{1,2,...,n \}$ with the property that the integers $ 0,1,...,n\minus{}1$ all have an odd number of representations in the form $ x\minus{}y, x,y \in S$, is that $ (2n\minus{}1)$ has a multiple of the form $ 2.4^k\minus{}1$ [i]L. Lovasz, J. Pelikan[/i]

Let $a$ and $b$ be two non-zero rational numbers such that the equation $ax^2+by^2=0$ has a non-zero solution in rational numbers . Prove that for any rational number $t$ , there is a solution of the equation $ax^2+by^2=t$.

Call a $4$-digit number $\overline{a b c d}$ [i]unnoticeable [/i] if $a +c = b +d$ and $\overline{a b c d} +\overline{c d a b}$ is a multiple of $7$. Find the number of unnoticeable numbers. Note: $a$, $b$, $c$, and $d$ are nonzero distinct digits. [i]Proposed by Aditya Rao[/i]

Find all positive integers $n$ such that there exists a monic polynomial $P(x)$ of degree $n$ with integers coefficients satisfying $$P(a)P(b)\neq P(c)$$ for all integers $a,b,c$.

Solve the equation for positive integers $m, n$: \[\left \lfloor \frac{m^2}n \right \rfloor + \left \lfloor \frac{n^2}m \right \rfloor = \left \lfloor \frac mn + \frac nm \right \rfloor +mn\]

Fix a sequence $ a_1,a_2,a_3,... $ of integers satisfying the following condition:for all prime numbers $ p $ and all positive integers $ k $, we have $ a_{pk+1}=pa_k-3a_p+13 $.Determine all possible values of $ a_{2013} $.

Prove that for all sufficiently large positive integers $n$ and a positive integer $k \leq n$, there exists a positive integer $m$ having exactly $k$ divisors in the set $\{1,2, \ldots, n\}$.