Found problems: 178
Find the exponent of $37$ in the representation of the number $111...... 11$ with $3\cdot 37^{2000}$ digits equals to $1$, as product of prime powers
Consider $10$ distinct positive integers that are all prime to each other (that is, there is no a prime factor common to all), but such that any two of them are not prime to each other. What is the smallest number of distinct prime factors that may appear in the product of $10$ numbers?
John takes seven positive integers $a_1,a_2,...,a_7$ and writes the numbers $a_i a_j$, $a_i+a_j$ and $|a_i -a_j |$ for all $i \ne j$ on the blackboard. Find the greatest possible number of distinct odd integers on the blackboard.
(a) Let $\gcd(m, k) = 1$. Prove that there exist integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ such that each product $a_ib_j$ ($i = 1, 2, \cdots ,m; \ j = 1, 2, \cdots, k$) gives a different residue when divided by $mk.$
(b) Let $\gcd(m, k) > 1$. Prove that for any integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ there must be two products $a_ib_j$ and $a_sb_t$ ($(i, j) \neq (s, t)$) that give the same residue when divided by $mk.$
[i]Proposed by Hungary.[/i]
Let $\vartriangle ABC$ be an equilateral triangle and let $P$ be a point in its interior. Let the lines $AP,BP,CP$ meet the sides $BC,CA,AB$ in the points $X,Y,Z$ respectively. Prove that $XY \cdot YZ\cdot ZX \ge XB\cdot YC\cdot ZA$.
Calculate the product of all positive integers less than $100$ and having exactly three positive divisors. Show that this product is a square.
Let $M$ be an arbitrary point of a circle circumscribed around an acute-angled triangle $ABC$. Prove that the product of the distances from the point $M$ to the sides $AC$ and $BC$ is equal to the product of the distances from $M$ to the side $AB$ and to the tangent to the circumscribed circle at point $C$.
Determine the greatest number, who is the product of some positive integers, and the sum of these numbers is $1976.$
The point $P$ lies inside the triangle $ABC$. A line is drawn through $P$ parallel to each side of the triangle. The lines divide $AB$ into three parts length $c, c', c"$ (in that order), and $BC$ into three parts length $a, a', a"$ (in that order), and $CA$ into three parts length $b, b', b"$ (in that order). Show that $abc = a'b'c' = a"b"c"$.
Let $p$ be a prime number. The natural numbers $m$ and $n$ are written in the system with the base $p$ as $n = a_0 + a_1p +...+ a_kp^k$ and $m = b_0 + b_1p +..+ b_kp^k$. Prove that
$${n \choose m} \equiv \prod_{i=0}^{k}{a_i \choose b_i} (mod p)$$
A math teacher chose $10$ consequtive numbers and submitted them to Pete and Basil. Each boy should split these numbers in pairs and calculate the sum of products of numbers in pairs. Prove that the boys can pair the numbers differently so that the resulting sums are equal.
Let $n$ be a positive integer. Prove that $n^2 + n + 1$ cannot be written as the product of two positive integers of which the difference is smaller than $2\sqrt{n}$.
Points $A$ and $B$ on the rays $CX$ and $CY$ respectively of an acute angle $XCY$ are given so that $CX < CA = CB < CY$. Construct a line meeting the ray $CX$ and the segments $AB,BC$ at $K,L,M$, respectively, such that $KA \cdot YB = XA \cdot MB = LA\cdot LB \ne 0$.
For real $a > 1$ find$$\lim \limits_{n \to \infty}\sqrt[n]{\prod \limits_{k=2}^n \left(a-a^{\frac{1}{k}}\right)}$$
For an arbitrary natural $n$, prove the equality
$$\sin \frac{\pi}{2n}\sin \frac{3\pi}{2n}\sin \frac{5\pi}{2n}...\sin \frac{n'\pi}{2n}=2^{\dfrac{1-n}{2}}$$
where $n'$ is the largest odd number not exceeding $n$.
Let $x_1,x_2,...,x_{1994}$ be positive real numbers. Prove that
$$\left(\frac{x_1}{x_2}\right)^{\frac{x_1}{x_2}}\left(\frac{x_2}{x_3}\right)^{\frac{x_2}{x_3}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1993}}{x_{1994}}} \ge \left(\frac{x_1}{x_2}\right)^{\frac{x_2}{x_1}}\left(\frac{x_2}{x_3}\right)^{\frac{x_3}{x_2}}...\left(\frac{x_{1993}}{x_{1994}}\right)^{\frac{x_{1994}}{x_{1993}}}$$
For each positive integer $m> 1$, let $P (m)$ be the product of all prime numbers that divide $m$.
Define the sequence $a_1, a_2, a_3,...$ as followed:
$a_1> 1$ is an arbitrary positive integer,
$a_{n + 1} = a_n + P (a_n)$ for each positive integer $n$.
Prove that there exist positive integers $j$ and $k$ such that $a_j$ is the product of the first $k$ prime numbers.
Prove that the product of five consecutive positive integers cannot be the square of an integer.
The least common multiple of positive integers $a, b, c$ and $d$ is equal to $a + b + c + d$. Prove that $abcd$ is divisible by at least one of $3$ and $5$.
( V Senderov)
Evaluate $\lim_{n\to \infty} cos\frac{x}{2}cos\frac{x}{2^2} cos\frac{x}{2^3}...cos\frac{x}{2^n}$
Each segment whose endpoints are the vertices of a given regular $100$-gon is colored red, if the number of vertices between its endpoints is even, and blue otherwise. (For example, all sides of the $100$-gon are red.) A number is placed in every vertex so that the sum of their squares is equal to $1$. On each segment the product of the numbers at its endpoints is written. The sum of the numbers on the blue segments is subtracted from the sum of the numbers on the red segments. What is the greatest possible result?
(Ilya Bogdanov)
On the board are written numbers $1, 2,. . . , 33$. In one step we select two numbers written on the product of which is the square of the natural number, we wipe off the two chosen numbers and write the square root of their product on the board. This way we continue to the board only the numbers remain so that the product of neither of them is a square. (In one we can also wipe out two identical numbers and replace them with the same number.) Prove that at least $16$ numbers remain on the board.
A set S consisting of $2019$ (different) positive integers has the following property:
[i]the product of every 100 elements of $S$ is a divisor of the product of the remaining $1919$ elements[/i].
What is the maximum number of prime numbers that $S$ can contain?
Find all pairs of integers $(x, y)$ such that ths sum of the fractions $\frac{19}{x}$ and $\frac{96}{y}$ would be equal to their product.
Let ${a_1, a_2, . . . , a_n,}$ and ${b_1, b_2, . . . , b_n}$ be real numbers with ${a_1, a_2, . . . , a_n}$ distinct. Show that if the product ${(a_i + b_1)(a_i + b_2) \cdot \cdot \cdot (a_i + b_n)}$ takes the same value for every ${ i = 1, 2, . . . , n, }$ , then the product ${(a_1 + b_j)(a_2 + b_j) \cdot \cdot \cdot (a_n + b_j)}$ also takes the same value for every ${j = 1, 2, . . . , n, }$ .