Let $n$ be a composite positive integer. Let $1=d_1<d_2<\cdots<d_k=n$ be the positive divisors of $n.{}$ Assume that the equations $d_{i+2}x^2-2d_{i+1}x+d_i=0$ for $i=1,\ldots,k-2$ all have real solutions. Prove that $n=p^{k-1}$ for some prime number $p.{}$

Let $P(n)$ be the number of ways to split a natural number $n$ to the sum of powers of two, when the order does not matter. For example $P(5) = 4$, as $5=4+1=2+2+1=2+1+1+1=1+1+1+1+1$. Prove that for any natural the identity $P(n) + (-1)^{a_1} P(n-1) + (-1)^{a_2} P(n-2) + \ldots + (-1)^{a_{n-1}} P(1) + (-1)^{a_n} = 0,$ is true, where $a_k$ is the number of units in the binary number record $k$ . [url=http://matol.kz/comments/2720/show]source[/url]

In the middle of a vast prairie, a firetruck is stationed at the intersection of two perpendicular straight highways. The truck travels at $50$ miles per hour along the highways and at $14$ miles per hour across the prairie. Consider the set of points that can be reached by the firetruck within six minutes. The area of this region is $m/n$ square miles, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

A triple integer $(a, b, c)$ is called [i]brilliant [/i] when it satisfies: (i) $a> b> c$ are prime numbers (ii) $a = b + 2c$ (iii) $a + b + c$ is a perfect square number Find the minimum value of $abc$ if triple $(a, b, c)$ is [i]brilliant[/i].

How many positive integers are there such that $\frac{2n^2+4n+18}{3n+3}$ is an integer?

There exist two distinct positive integers, both of which are divisors of $10^{10}$, with sum equal to $157$. What are they?

In one country there are coins of value $1,2,3,4$ or $5$. Nisse wants to buy a pair of shoes. While paying, he tells the seller that he has $100$ coins in the bag, but that he does not know the exact number of coins of each value. ”Fine, then you will have the exact amount”, the seller responds. What is the price of the shoes, and how did the seller conclude that Nisse would have the exact amount?

[b]p1.[/b] What is $20\times 19 + 20 \div (2 - 7)$? [b]p2.[/b] Will has three spinners. The first has three equally sized sections numbered $1$, $2$, $3$; the second has four equally sized sections numbered $1$, $2$, $3$, $4$; and the third has five equally sized sections numbered $1$, $2$, $3$, $4$, $5$. When Will spins all three spinners, the probability that the same number appears on all three spinners is $p$. Compute $\frac{1}{p}$. [b]p3.[/b] Three girls and five boys are seated randomly in a row of eight desks. Let $p$ be the probability that the students at the ends of the row are both boys. If $p$ can be expressed in the form $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m + n$. [b]p4.[/b] Jaron either hits a home run or strikes out every time he bats. Last week, his batting average was $.300$. (Jaron's batting average is the number of home runs he has hit divided by the number of times he has batted.) After hitting $10$ home runs and striking out zero times in the last week, Jaron has now raised his batting average to $.310$. How many home runs has Jaron now hit? [b]p5.[/b] Suppose that the sum $$\frac{1}{1 \cdot 4} +\frac{1}{4 \cdot 7}+ ...+\frac{1}{97 \cdot 100}$$ is expressible as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p6.[/b] Let $ABCD$ be a unit square with center $O$, and $\vartriangle OEF$ be an equilateral triangle with center $A$. Suppose that $M$ is the area of the region inside the square but outside the triangle and $N$ is the area of the region inside the triangle but outside the square, and let $x = |M -N|$ be the positive difference between $M$ and $N$. If $$x =\frac1 8(p -\sqrt{q})$$ for positive integers $p$ and $q$, find $p + q$. [b]p7.[/b] Find the number of seven-digit numbers such that the sum of any two consecutive digits is divisible by $3$. For example, the number $1212121$ satisfies this property. [b]p8.[/b] There is a unique positive integer $x$ such that $x^x$ has $703$ positive factors. What is $x$? [b]p9.[/b] Let $x$ be the number of digits in $2^{2019}$ and let $y$ be the number of digits in $5^{2019}$. Compute $x + y$. [b]p10.[/b] Let $ABC$ be an isosceles triangle with $AB = AC = 13$ and $BC = 10$. Consider the set of all points $D$ in three-dimensional space such that $BCD$ is an equilateral triangle. This set of points forms a circle $\omega$. Let $E$ and $F$ be points on $\omega$ such that $AE$ and $AF$ are tangent to $\omega$. If $EF^2$ can be expressed in the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers, determine $m + n$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $m$ and $n$ be positive integers such that $5m+ n$ is a divisor of $5n +m$. Prove that $m$ is a divisor of $n$.

Let $n, m, k$ and $l$ be positive integers with $n \neq 1$ such that $n^k + mn^l + 1$ divides $n^{k+l} - 1$. Prove that [list] [*]$m = 1$ and $l = 2k$; or [*]$l|k$ and $m = \frac{n^{k-l}-1}{n^l-1}$. [/list]

[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 $d$ be a positive divisor of a positive integer $m$ and $(a_l), (b_l)$ two arithmetic sequences of positive integers. It is given that $gcd(a_i, b_j) = 1$ and $gcd(a_k, b_n) = m$ for some positive integers $i,j,k,$ and $n$. Prove that there exist positive integers $t$ and $s$ such that $gcd(a_t, b_s) = d$.

Define the modulo $2553$ distance $d(x, y)$ between two integers $x, y$ to be the smallest nonnegative integer $d$ equivalent to either $x - y$ or $y - x$ modulo $2553$. Show that, given a set S of integers such that $|S| \ge 70$, there must be $m, n \in S$ with $d(m, n) \le 36$.

Let $p>2$ be a prime. Define a sequence $(Q_{n}(x))$ of polynomials such that $Q_{0}(x)=1, Q_{1}(x)=x$ and $Q_{n+1}(x) =xQ_{n}(x) + nQ_{n-1}(x)$ for $n\geq 1.$ Prove that $Q_{p}(x)-x^p $ is divisible by $p$ for all integers $x.$

Let $ k > 1$ be an integer, and consider the infinite array given by the integer lattice in the first quadrant of the plane, filled with real numbers. The array is said to be constant if all its elements are equal in value. The array is said to be $ k$-balanced if it is non-constant, and the sums of the elements of any $ k\times k$ sub-square have a constant value $ v_k$. An array which is both $ p$-balanced and $ q$-balanced will be said to be $ (p, q)$-balanced, or just doubly-balanced, if there is no confusion as to which $ p$ and $ q$ are meant. If $p, q$ are relatively prime, the array is said to be co-prime. We will call $ (M\times N)$-seed a $ M \times N$ array, anchored with its lower left corner in the origin of the plane, which extended through periodicity in both dimensions in the plane results into a $ (p, q)$-balanced array; more precisely, if we denote the numbers in the array by $ a_{ij}$ , where $ i, j$ are the coordinates of the lower left corner of the unit square they lie in, we have, for all non-negative integers $ i, j$ \[ a_{i \plus{} M,j} \equal{} a_{i,j} \equal{} a_{i,j \plus{} N}\] (a) Prove that $ q^2v_p \equal{} p^2v_q$ for a $ (p, q)$-balanced array. (b) Prove that more than two different values are used in a co-prime $ (p,q)$-balanced array. Show that this is no longer true if $ (p, q) > 1$. (c) Prove that any co-prime $ (p, q)$-balanced array originates from a seed. (d) Show there exist $ (p, q)$-balanced arrays (using only three different values) for arbitrary values $ p, q$. (e) Show that neither a $ k$-balanced array, nor a $ (p, q)$-balanced array if $ (p, q) > 1$, need originate from a seed. (f) Determine the minimal possible value $ T$ for a square $ (T\times T)$-seed resulting in a co-prime $ (p, q)$-balanced array, when $p,q$ are both prime. (g) Show that for any relatively prime $ p, q$ there must exist a co-prime $ (p, q)$-balanced array originating from a square $ (T\times T)$-seed, with no lesser $ (M\times N)$-seed available ($ M\leq T, N\leq T$ and $MN< T^2$). [i]Dan Schwarz[/i]

Determine all solutions of the diophantine equation $a^2 = b \cdot (b + 7)$ in integers $a\ge 0$ and $b \ge 0$. (W. Janous, Innsbruck)

Let $A = \{m : m$ an integer and the roots of $x^2 + mx + 2020 = 0$ are positive integers $\}$ and $B= \{n : n$ an integer and the roots of $x^2 + 2020x + n = 0$ are negative integers $\}$. Suppose $a$ is the largest element of $A$ and $b$ is the smallest element of $B$. Find the sum of digits of $a + b$.

For all $n>1$ let $f(n)$ be the sum of the smallest factor of $n$ that is not 1 and $n$ . The computer prints $f(2),f(3),f(4),...$ with order:$4,6,6,...$ ( Because $f(2)=2+2=4,f(3)=3+3=6,f(4)=4+2=6$ etc.). In this infinite sequence, how many times will be $ 2015$ and $ 2016$ written? (Explain your answer)

A whole number is written on the board. Its last digit is remembered is then erased and multiplied by $5$ added to the number that remained on the board after erasing. The number was originally written $7^{1998}$. After applying several such operations, can one get the number $1998^7$?

Consider a function f defined on the positive integers that meets the following conditions: $$f(1) = 1 \, , \,\, f(2n) = 2f(n) \, , \,\, nf(2n + 1) = (2n + 1)(f(n) + n) $$ for all $n \ge 1$. a) Prove that $f(n)$ is an integer for all $n$. b) Find all positive integers $m$ less than $2013$ that satisfy the equation $f(m) = 2m$.

Determine for which $ n$ positive integer the equation: $ a \plus{} b \plus{} c \plus{} d \equal{} n \sqrt {abcd}$ has positive integer solutions.

A strictly increasing sequence $(a_n)$ has the property that $\gcd(a_m,a_n) = a_{\gcd(m,n)}$ for all $m,n\in \mathbb{N}$. Suppose $k$ is the least positive integer for which there exist positive integers $r < k < s$ such that $a_k^2 = a_ra_s$. Prove that $r | k$ and $k | s$.

John had to solve a math problem in the class. While cleaning the blackboard, he accidentally erased a part of his problem as well: the text that remained on board was $37 \cdot(72 + 3x) = 14**45$, where $*$ marks an erased digit. Show that John can still solve his problem, knowing that $x$ is an integer

Find all positive $k$ such that product of the first $k$ odd prime numbers, reduced by 1 is exactly degree of natural number (which more than one).

A [i]complete [/i] number is a $9$ digit number that contains each of the digits $1$ to $9$ exactly once. The [i]difference [/i] number of a number $N$ is the number you get by taking the differences of consecutive digits in $N$ and then stringing these digits together. For instance, the [i]difference [/i] number of $25143$ is equal to $3431$. The [i]complete [/i] number $124356879$ has the additional property that its [i]difference [/i] number, $12121212$, consists of digits alternating between $1$ and $2$. Determine all $a$ with $3 \le a \le 9$ for which there exists a [i]complete [/i] number $N$ with the additional property that the digits of its [i]difference[/i] number alternate between $1 $ and $a$.