problem stringlengths 2 5.64k | solution stringlengths 2 13.5k | answer stringlengths 2 43 | problem_type stringclasses 8
values | question_type stringclasses 4
values | problem_is_valid stringclasses 1
value | solution_is_valid stringclasses 1
value | source stringclasses 6
values | synthetic bool 1
class |
|---|---|---|---|---|---|---|---|---|
Problem 4. A $5 \times 100$ table is divided into 500 unit square cells, where $n$ of them are coloured black and the rest are coloured white. Two unit square cells are called adjacent if they share a common side. Each of the unit square cells has at most two adjacent black unit square cells. Find the largest possible... |
Solution. If we colour all the cells along all edges of the board together with the entire middle row except the second and the last-but-one cell, the condition is satisfied and there are 302 black cells. The figure below exhibits this colouring for the $5 \times 8$ case.
. Then $A M=M P$ and $t \perp A P$, hence the triangle $A P N$ is isosceles with $A P$ as its base, so $\angle N A P=\angle N P A$. We have $\angle B A P=\angle B A M=\angle B M N$ and $\angle B A N=\angle B N M$.
Thus we have
$$
180^{\circ}... | 45 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
Problem 4. Let $M$ be a subset of the set of 2021 integers $\{1,2,3, \ldots, 2021\}$ such that for any three elements (not necessarily distinct) $a, b, c$ of $M$ we have $|a+b-c|>10$. Determine the largest possible number of elements of $M$.
|
Solution. The set $M=\{1016,1017, \ldots, 2021\}$ has 1006 elements and satisfies the required property, since $a, b, c \in M$ implies that $a+b-c \geqslant 1016+1016-2021=11$. We will show that this is optimal.
Suppose $M$ satisfies the condition in the problem. Let $k$ be the minimal element of $M$. Then $k=|k+k-k|... | 1006 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
G4. Let $A B C$ be an acute-angled triangle with circumcircle $\Gamma$, and let $O, H$ be the triangle's circumcenter and orthocenter respectively. Let also $A^{\prime}$ be the point where the angle bisector of angle $B A C$ meets $\Gamma$. If $A^{\prime} H=A H$, find the measure of angle $B A C$.
, then $\angle B O A=$ $2 y$, and since $O A=O B$, it is $\angle O A B=\angle O B A=90^{\circ}-y$. Also since $A H \perp B C$, it is
$\angle H A C=90^{\circ}-y=\angle O A B$ and the claim follows.
Since $A . A^{\prime}$ bisect... | 60 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
## A1 MLD
Let $x, y, z$ be real numbers, satisfying the relations
$$
\left\{\begin{array}{l}
x \geq 20 \\
y \geq 40 \\
z \geq 1675 \\
x+y+z=2015
\end{array}\right.
$$
Find the greatest value of the product $P=x \cdot y \cdot z$.
| ## Solution 1:
By virtue of $z \geq 1675$ we have
$$
y+z<2015 \Leftrightarrow y<2015-z \leq 2015-1675<1675
$$
It follows that $(1675-y) \cdot(1675-z) \leq 0 \Leftrightarrow y \cdot z \leq 1675 \cdot(y+z-1675)$.
By using the inequality $u \cdot v \leq\left(\frac{u+v}{2}\right)^{2}$ for all real numbers $u, v$ we obt... | 48407500 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
## A2 ALB
3) If $x^{3}-3 \sqrt{3} x^{2}+9 x-3 \sqrt{3}-64=0$, find the value of $x^{6}-8 x^{5}+13 x^{4}-5 x^{3}+49 x^{2}-137 x+2015$.
|
Solution
$x^{3}-3 \sqrt{3} x^{2}+9 x-3 \sqrt{3}-64=0 \Leftrightarrow(x-\sqrt{3})^{3}=64 \Leftrightarrow(x-\sqrt{3})=4 \Leftrightarrow x-4=\sqrt{3} \Leftrightarrow x^{2}-8 x+16=3 \Leftrightarrow$ $x^{2}-8 x+13=0$
$x^{6}-8 x^{5}+13 x^{4}-5 x^{3}+49 x^{2}-137 x+2015=\left(x^{2}-8 x+13\right)\left(x^{4}-5 x+9\right)+189... | 1898 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
NT1 SAU
What is the greatest number of integers that can be selected from a set of 2015 consecutive numbers so that no sum of any two selected numbers is divisible by their difference?
| ## Solution:
We take any two chosen numbers. If their difference is 1 , it is clear that their sum is divisible by their difference. If their difference is 2 , they will be of the same parity, and their sum is divisible by their difference. Therefore, the difference between any chosen numbers will be at least 3 . In o... | 672 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
## C3 ALB
Positive integers are put into the following table
| 1 | 3 | 6 | 10 | 15 | 21 | 28 | 36 | | |
| ---: | ---: | ---: | ---: | ---: | ---: | ---: | ---: | ---: | ---: |
| 2 | 5 | 9 | 14 | 20 | 27 | 35 | 44 | | |
| 4 | 8 | 13 | 19 | 26 | 34 | 43 | 53 | | |
| 7 | 12 | 18 | 25 | 33 | 42 | | | | |
| 11 |... | ## Solution 1:
We shall observe straights lines as on the next picture. We can call these lines diagonals.
| 1 | $\sqrt{3}$ | 6 | 10 | 15 | 21 | 28 | 36 | |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| 2 | 5 | 9 | 14 | 20 | 27 | 35 | 44 | |
| 4 | 8 | 13 | 19 | 26 | 34 | 43 | 53 | |
|... | 2015 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
C2 Consider 50 points in the plane, no three of them belonging to the same line. The points have been colored into four colors. Prove that there are at least 130 scalene triangles whose vertices are colored in the same color.
| ## Solution
Since $50=4 \cdot 12+2$, according to the pigeonhole principle we will have at least 13 points colored in the same color. We start with the:
Lemma. Given $n>8$ points in the plane, no three of them collinear, then there are at least $\frac{n(n-1)(n-8)}{6}$ scalene triangles with vertices among the given p... | 130 | Combinatorics | proof | Yes | Yes | olympiads | false |
G2 Let $A B C D$ be a convex quadrilateral with $\varangle D A C=\varangle B D C=36^{\circ}, \varangle C B D=18^{\circ}$ and $\varangle B A C=72^{\circ}$. If $P$ is the point of intersection of the diagonals $A C$ and $B D$, find the measure of $\varangle A P D$.
| ## Solution
On the rays ( $D A$ and ( $B A$ we take points $E$ and $Z$, respectively, such that $A C=A E=$ $A Z$. Since $\varangle D E C=\frac{\varangle D A C}{2}=18^{\circ}=\varangle C B D$, the quadrilateral $D E B C$ is cyclic.
Similarly, the quadrilateral $C B Z D$ is cyclic, because $\varangle A Z C=\frac{\varan... | 108 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
## A1
For any real number a, let $\lfloor a\rfloor$ denote the greatest integer not exceeding a. In positive real numbers solve the following equation
$$
n+\lfloor\sqrt{n}\rfloor+\lfloor\sqrt[3]{n}\rfloor=2014
$$
|
Solution1. Obviously $n$ must be positive integer. Now note that $44^{2}=19362000$ than $2014=n+\lfloor\sqrt{n}\rfloor+\lfloor\sqrt[3]{n}\rfloor>2000+44+12=2056$, a contradiction!
So $1950 \leq n \leq 2000$, therefore $\lfloor\sqrt{n}\rfloor=44$ and $\lfloor\sqrt[3]{n}\rfloor=12$. Plugging that into the original equa... | 1956 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
## C2
In a country with $n$ cities, all direct airlines are two-way. There are $r>2014$ routes between pairs of different cities that include no more than one intermediate stop (the direction of each route matters). Find the least possible $n$ and the least possible $r$ for that value of $n$.
|
Solution. Denote by $X_{1}, X_{2}, \ldots X_{n}$ the cities in the country and let $X_{i}$ be connected to exactly $m_{i}$ other cities by direct two-way airline. Then $X_{i}$ is a final destination of $m_{i}$ direct routes and an intermediate stop of $m_{i}\left(m_{i}-1\right)$ non-direct routes. Thus $r=m_{1}^{2}+\l... | 2016 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
A3. Let $A$ and $B$ be two non-empty subsets of $X=\{1,2, \ldots, 11\}$ with $A \cup B=X$. Let $P_{A}$ be the product of all elements of $A$ and let $P_{B}$ be the product of all elements of $B$. Find the minimum and maximum possible value of $P_{A}+P_{B}$ and find all possible equality cases.
|
Solution. For the maximum, we use the fact that $\left(P_{A}-1\right)\left(P_{B}-1\right) \geqslant 0$, to get that $P_{A}+P_{B} \leqslant P_{A} P_{B}+1=11!+1$. Equality holds if and only if $A=\{1\}$ or $B=\{1\}$.
For the minimum observe, first that $P_{A} \cdot P_{B}=11!=c$. Without loss of generality let $P_{A} \l... | 12636 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
C3. In a $5 \times 100$ table we have coloured black $n$ of its cells. Each of the 500 cells has at most two adjacent (by side) cells coloured black. Find the largest possible value of $n$.
|
Solution. If we colour all the cells along all edges of the board together with the entire middle row except the second and the last-but-one cell, the condition is satisfied and there are 302 black cells. The figure below exhibits this colouring for the $5 \times 8$ case.
}{2}=7 k$. This is possible only if $n \equiv 0,1 \bmod 7$.
- In order to obtain $n=7 m+1$, arrange the kids in a circ... | 26 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
G2 Let $A D, B F$ and $C E$ be the altitudes of $\triangle A B C$. A line passing through $D$ and parallel to $A B$ intersects the line $E F$ at the point $G$. If $H$ is the orthocenter of $\triangle A B C$, find the angle $\widehat{C G H}$.
| ## Solution 1
We can see easily that points $C, D, H, F$ lies on a circle of diameter $[C H]$.
Take $\left\{F, G^{\prime}\right\}=\odot(C H F) \cap E F$. We have $\widehat{E F H}=\widehat{B A D}=\widehat{B C E}=\widehat{D F H}$ since the quadrilaterals $A E D C, A E H F, C D H F$ are cyclic. Hence $[F B$ is the bisec... | 90 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
G3 Let $A B C$ be a triangle in which ( $B L$ is the angle bisector of $\widehat{A B C}(L \in A C), A H$ is an altitude of $\triangle A B C(H \in B C)$ and $M$ is the midpoint of the side $[A B]$. It is known that the midpoints of the segments $[B L]$ and $[M H]$ coincides. Determine the internal angles of triangle $\... | ## Solution
Let $N$ be the intersection of the segments $[B L]$ and $[M H]$. Because $N$ is the midpoint of both segments $[B L]$ and $[M H]$, it follows that $B M L H$ is a parallelogram. This implies that $M L \| B C$ and $L H \| A B$ and hence, since $M$ is the midpoint of $[A B]$, the angle bisector [ $B L$ and th... | 60 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
C2. Given $m \times n$ table, each cell signed with "-". The following operations are
(i) to change all the signs in entire row to the opposite, i. e. every "-" to "+", and every "+" to "-";
(ii) to change all the signs in entire column to the opposite, i. e. every "-" to "+" and every "+" to " -".
(a) Prove that i... |
Solution. If we apply (i) to $l$ rows and (ii) to $k$ columns we obtain $(m-k) l+(n-l) k$
(a) We have equation $(100-k) l+(100-l) k=2004$, or $100 l+100 k-2 l k=2004$, le
$$
50 l+50 k-1 k=1002
$$
Rewrite the lasc equation as
$$
(50-l)(50-h)=2.500-100.2=1498
$$
Since $1498=2 \cdot 7 \cdot 107$, this equation has n... | 102 | Combinatorics | proof | Yes | Yes | olympiads | false |
Problem A2. Determine all four digit numbers $\overline{a b c d}$ such that
$$
a(a+b+c+d)\left(a^{2}+b^{2}+c^{2}+d^{2}\right)\left(a^{6}+2 b^{6}+3 c^{6}+4 d^{6}\right)=\overline{a b c d}
$$
|
Solution. From $\overline{a b c d}\overline{1 b c d}=(1+b+c+d)\left(1+b^{2}+c^{2}+d^{2}\right)\left(1+2 b^{6}+3 c^{6}+4 d^{6}\right) \geq$ $(b+1)\left(b^{2}+1\right)\left(2 b^{6}+1\right)$, so $b \leq 2$. Similarly one gets $c\overline{2 b c d}=2(2+b+c+d)\left(4+b^{2}+c^{2}+d^{2}\right)\left(64+2 b^{6}+3 c^{6}+4 d^{6}... | 2010 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
Problem G2. Consider a triangle $A B C$ and let $M$ be the midpoint of the side $B C$. Suppose $\angle M A C=\angle A B C$ and $\angle B A M=105^{\circ}$. Find the measure of $\angle A B C$.
|
Solution. The angle measure is $30^{\circ}$.
Let $O$ be the circumcenter of the triangle $A B M$. From $\angle B A M=105^{\circ}$ follows $\angle M B O=15^{\circ}$. Let $M^{\prime}, C^{\pri... | 30 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
C2. The natural numbers from 1 to 50 are written down on the blackboard. At least how many of them should be deleted, in order that the sum of any two of the remaining numbers is not a prime?
|
Solution. Notice that if the odd, respectively even, numbers are all deleted, then the sum of any two remaining numbers is even and exceeds 2 , so it is certainly not a prime. We prove that 25 is the minimal number of deleted numbers. To this end, we group the positive integers from 1 to 50 in 25 pairs, such that the ... | 25 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
C3. Consider any four pairwise distinct real numbers and write one of these numbers in each cell of a $5 \times 5$ array so that each number occurs exactly once in every $2 \times 2$ subarray. The sum over all entries of the array is called the total sum of that array. Determine the maximum number of distinct total su... |
Solution. We will prove that the maximum number of total sums is 60 .
The proof is based on the following claim.
Claim. Either each row contains exactly two of the numbers, or each column contains exactly two of the numbers.
Proof of the Claim. Indeed, let $R$ be a row containing at least three of the numbers. Then... | 60 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
N1. Determine the largest positive integer $n$ that divides $p^{6}-1$ for all primes $p>7$.
|
Solution. Note that
$$
p^{6}-1=(p-1)(p+1)\left(p^{2}-p+1\right)\left(p^{2}+p+1\right)
$$
For $p=11$ we have
$$
p^{6}-1=1771560=2^{3} \cdot 3^{2} \cdot 5 \cdot 7 \cdot 19 \cdot 37
$$
For $p=13$ we have
$$
p^{6}-1=2^{3} \cdot 3^{2} \cdot 7 \cdot 61 \cdot 157
$$
From the last two calculations we find evidence to tr... | 504 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
N5. Determine all four-digit numbers $\overline{a b c d}$ such that
$$
(a+b)(a+c)(a+d)(b+c)(b+d)(c+d)=\overline{a b c d}
$$
|
Solution. Depending on the parity of $a, b, c, d$, at least two of the factors $(a+b),(a+c)$, $(a+d),(b+c),(b+d),(c+d)$ are even, so that $4 \mid \overline{a b c d}$.
We claim that $3 \mid \overline{a b c d}$.
Assume $a+b+c+d \equiv 2(\bmod 3)$. Then $x+y \equiv 1(\bmod 3)$, for all distinct $x, y \in\{a, b, c, d\}$... | 2016 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
NT 3. Find the largest integer $k(k \geq 2)$, for which there exists an integer $n(n \geq k)$ such that from any collection of $n$ consecutive positive integers one can always choose $k$ numbers, which verify the following conditions:
1. each chosen number is not divisible by 6 , by 7 and by 8 ;
2. the positive diffe... |
Solution. An integer is divisible by 6,7 and 8 if and only if it is divisible by their Least Common Multiple, which equals $6 \times 7 \times 4=168$.
Let $n$ be a positive integer and let $A$ be an arbitrary set of $n$ consecutive positive integers. Replace each number $a_{i}$ from $A$ with its remainder $r_{i}$ ( mo... | 108 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
A 5. Let $a, b, c, d$ and $x, y, z, t$ be real numbers such that
$$
0 \leq a, b, c, d \leq 1, \quad x, y, z, t \geq 1 \text { and } a+b+c+d+x+y+z+t=8
$$
Prove that
$$
a^{2}+b^{2}+c^{2}+d^{2}+x^{2}+y^{2}+z^{2}+t^{2} \leq 28
$$
When does the equality hold?
|
Solution. We observe that if $u \leq v$ then by replacing $(u, v)$ with $(u-\varepsilon, v+\varepsilon)$, where $\varepsilon>0$, the sum of squares increases. Indeed,
$$
(u-\varepsilon)^{2}+(v+\varepsilon)^{2}-u^{2}-v^{2}=2 \varepsilon(v-u)+2 \varepsilon^{2}>0
$$
Then, denoting
$$
E(a, b, c, d, x, y, z, t)=a^{2}+b^... | 28 | Inequalities | proof | Yes | Yes | olympiads | false |
A 7. Let $A$ be a set of positive integers with the following properties:
(a) If $n$ is an element of $A$ then $n \leqslant 2018$.
(b) If $S$ is a subset of $A$ with $|S|=3$ then there are two elements $n, m$ of $S$ with $|n-m| \geqslant \sqrt{n}+\sqrt{m}$.
What is the maximum number of elements that $A$ can have?
|
Solution. Assuming $n>m$ we have
$$
\begin{aligned}
|n-m| \geqslant \sqrt{n}+\sqrt{m} & \Leftrightarrow(\sqrt{n}-\sqrt{m})(\sqrt{n}+\sqrt{m}) \geqslant \sqrt{n}+\sqrt{m} \\
& \Leftrightarrow \sqrt{n} \geqslant \sqrt{m}+1 .
\end{aligned}
$$
Let $A_{k}=\left\{k^{2}, k^{2}+1, \ldots,(k+1)^{2}-1\right\}$. Note that each... | 88 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
C3 a) In how many ways can we read the word SARAJEVO from the table below, if it is allowed to jump from cell to an adjacent cell (by vertex or a side) cell?
b) After the letter in one cell... |
Solution: In the first of the tables below the number in each cell shows the number of ways to reach that cell from the start (which is the sum of the quantities in the cells, from which we can come), and in the second one are the number of ways to arrive from that cell to the end (which is the sum of the quantities i... | 750 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
NT2 A group of $n>1$ pirates of different age owned total of 2009 coins. Initially each pirate (except for the youngest one) had one coin more than the next younger.
a) Find all possible values of $n$.
b) Every day a pirate was chosen. The chosen pirate gave a coin to each of the other pirates. If $n=7$, find the la... | ## Solution:
a) If $n$ is odd, then it is a divisor of $2009=7 \times 7 \times 41$. If $n>49$, then $n$ is at least $7 \times 41$, while the average pirate has 7 coins, so the initial division is impossible. So, we can have $n=7, n=41$ or $n=49$. Each of these cases is possible (e.g. if $n=49$, the average pirate has ... | 1994 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
C4 In a group of $n$ people, each one had a different ball. They performed a sequence of swaps; in each swap, two people swapped the ball they had at that moment. Each pair of people performed at least one swap. In the end each person had the ball he/she had at the start. Find the least possible number of swaps, if: $... | ## Solution
We will denote the people by $A, B, C, \ldots$ and their initial balls by the corresponding small letters. Thus the initial state is $A a, B b, C c, D d, E e(, F f)$. A swap is denoted by the (capital) letters of the people involved.
a) Five people form 10 pairs, so at least 10 swaps are necessary.
In fa... | 16 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
C5 A set $S$ of natural numbers is called good, if for each element $x \in S, x$ does not divide the sum of the remaining numbers in $S$. Find the maximal possible number of elements of a good set which is a subset of the set $A=\{1,2,3, \ldots, 63\}$.
|
Solution
Let set $B$ be the good subset of $A$ which have the maximum number of elements. We can easily see that the number 1 does not belong to $B$ since 1 divides all natural numbers. Based on the property of divisibility, we know that $x$ divides the sum of the remaining numbers if and only if $x$ divides the sum ... | 61 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
G3. Let $A B C D E F$ be a regular hexagon. The points $\mathrm{M}$ and $\mathrm{N}$ are internal points of the sides $\mathrm{DE}$ and $\mathrm{DC}$ respectively, such that $\angle A M N=90^{\circ}$ and $A N=\sqrt{2} \cdot C M$. Find the measure of the angle $\angle B A M$.
| ## Solution
Since $A C \perp C D$ and $A M \perp M N$ the quadrilateral $A M N C$ is inscribed. So, we have
$$
\angle M A N=\angle M C N
$$
Let $P$ be the projection of the point $M$ on the line $C D$. The triangles $A M N$ and $C P M$ are similar implying
$$
\frac{A M}{C P}=\frac{M N}{P M}=\frac{A N}{C M}=\sqrt{2}... | 75 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
A6 Let $x_{i}>1$, for all $i \in\{1,2,3, \ldots, 2011\}$. Prove the inequality $\sum_{i=1}^{2011} \frac{x_{i}^{2}}{x_{i+1}-1} \geq 8044$ where $x_{2012}=x_{1}$. When does equality hold?
| ## Solution 1
Realize that $\left(x_{i}-2\right)^{2} \geq 0 \Leftrightarrow x_{i}^{2} \geq 4\left(x_{i}-1\right)$. So we get:
$\frac{x_{1}^{2}}{x_{2}-1}+\frac{x_{2}^{2}}{x_{3}-1}+\ldots+\frac{x_{2011}^{2}}{x_{1}-1} \geq 4\left(\frac{x_{1}-1}{x_{2}-1}+\frac{x_{2}-1}{x_{3}-1}+\ldots+\frac{x_{2011}-1}{x_{1}-1}\right)$. ... | 8044 | Inequalities | proof | Yes | Yes | olympiads | false |
A9 Consider an integer $n \geq 4$ and a sequence of real numbers $x_{1}, x_{2}, x_{3}, \ldots, x_{n}$. An operation consists in eliminating all numbers not having the rank of the form $4 k+3$, thus leaving only the numbers $x_{3}, x_{7}, x_{11}, \ldots$ (for example, the sequence $4,5,9,3,6,6,1,8$ produces the sequenc... | ## Solution
After the first operation 256 number remain; after the second one, 64 are left, then 16, next 4 and ultimately only one number.
Notice that the 256 numbers left after the first operation are $3,7, \ldots, 1023$, hence they are in arithmetical progression of common difference 4. Successively, the 64 number... | 683 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
NT7 Determine the minimal prime number $p>3$ for which no natural number $n$ satisfies
$$
2^{n}+3^{n} \equiv 0(\bmod p)
$$
| ## Solution
We put $A(n)=2^{n}+3^{n}$. From Fermat's little theorem, we have $2^{p-1} \equiv 1(\bmod p)$ and $3^{p-1} \equiv 1(\bmod p)$ from which we conclude $A(n) \equiv 2(\bmod p)$. Therefore, after $p-1$ steps
at most, we will have repetition of the power. It means that in order to determine the minimal prime num... | 19 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
88.1. The positive integer $n$ has the following property: if the three last digits of $n$ are removed, the number $\sqrt[3]{n}$ remains. Find $n$.
|
Solution. If $x=\sqrt[3]{n}$, and $y, 0 \leq y1000$, and $x>31$. On the other hand, $x^{3}<1000 x+1000$, or $x\left(x^{2}-1000\right)<1000$. The left hand side of this inequality is an increasing function of $x$, and $x=33$ does not satisfy the inequality. So $x<33$. Since $x$ is an integer, $x=32$ and $n=32^{3}=32768... | 32768 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
95.2. Messages are coded using sequences consisting of zeroes and ones only. Only sequences with at most two consecutive ones or zeroes are allowed. (For instance the sequence 011001 is allowed, but 011101 is not.) Determine the number of sequences consisting of exactly 12 numbers.
|
Solution 1. Let $S_{n}$ be the set of acceptable sequences consisting of $2 n$ digits. We partition $S_{n}$ in subsets $A_{n}, B_{n}, C_{n}$, and $D_{n}$, on the basis of the two last digits of the sequence. Sequences ending in 00 are in $A_{n}$, those ending in 01 are in $B_{n}$, those ending in 10 are in $C_{n}$, an... | 466 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
00.1. In how many ways can the number 2000 be written as a sum of three positive, not necessarily different integers? (Sums like $1+2+3$ and $3+1+2$ etc. are the same.)
|
Solution. Since 3 is not a factor of 2000 , there has to be at least two different numbers among any three summing up to 2000 . Denote by $x$ the number of such sums with three different summands and by $y$ the number of sums with two different summands. Consider 3999 boxes consequtively numbered fron 1 to 3999 such t... | 333333 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
## Problem 2
Let $A B C D$ be a cyclic quadrilateral satisfying $A B=A D$ and $A B+B C=C D$.
Determine $\angle C D A$.
|
Solution 2 Answer: $\angle C D A=60^{\circ}$.
Choose the point $E$ on the segment $C D$ such that $D E=A D$. Then $C E=C D-A D=$ $C D-A B=B C$, and hence the triangle $C E B$ is isosceles.
... | 60 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
## Problem 4
King George has decided to connect the 1680 islands in his kingdom by bridges. Unfortunately the rebel movement will destroy two bridges after all the bridges have been built, but not two bridges from the same island.
What is the minimal number of bridges the King has to build in order to make sure that ... |
Solution 4 Answer: 2016
An island cannot be connected with just one bridge, since this bridge could be destroyed. Consider the case of two islands, each with only two bridges, connected by a bridge. (It is not possible that they are connected with two bridges, since then they would be isolated from the other islands ... | 2016 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
XXV - I - Task 1
During World War I, a battle took place near a certain castle. One of the shells destroyed a statue of a knight with a spear standing at the entrance to the castle. This happened on the last day of the month. The product of the day of the month, the month number, the length of the spear expressed in f... | The last day of the month can only be $28$, $29$, $30$, or $31$. Of these numbers, only $29$ is a divisor of the number $451,066 = 2 \cdot 7 \cdot 11 \cdot 29 \cdot 101$. Therefore, the battle took place on February $29$ in a leap year. During World War I, only the year $1916$ was a leap year. From the problem statemen... | 1714 | Logic and Puzzles | math-word-problem | Yes | Yes | olympiads | false |
LVII OM - I - Problem 4
Participants in a mathematics competition solved six problems, each graded with one of the scores 6, 5, 2, 0. It turned out that
for every pair of participants $ A, B $, there are two problems such that in each of them $ A $ received a different score than $ B $.
Determine the maximum number ... | We will show that the largest number of participants for which such a situation is possible is 1024. We will continue to assume that the permissible ratings are the numbers 0, 1, 2, 3 (instead of 5 points, we give 4, and then divide each rating by 2).
Let $ P = \{0,1,2,3\} $ and consider the set
Set $ X $ obviou... | 1024 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
XXIII OM - I - Problem 7
A broken line contained in a square with a side length of 50 has the property that the distance from any point of this square to it is less than 1. Prove that the length of this broken line is greater than 1248. | Let the broken line $ A_1A_2 \ldots A_n $ have the property given in the problem. Denote by $ K_i $ ($ i= 1, 2, \ldots, n $) the circle with center at point $ A_i $ and radius of length $ 1 $, and by $ F_i $ ($ i= 1, 2, \ldots, n-1 $) the figure bounded by segments parallel to segment $ \overline{A_iA_{i+1}} $ and at a... | 1248 | Geometry | proof | Yes | Yes | olympiads | false |
VIII OM - I - Task 6
Find a four-digit number, whose first two digits are the same, the last two digits are the same, and which is a square of an integer. | If $ x $ is the number sought, then
where $ a $ and $ b $ are integers satisfying the inequalities $ 0 < a \leq 9 $, $ 0 \leq b \leq 9 $. The number $ x $ is divisible by $ 11 $, since
Since $ x $ is a perfect square, being divisible by $ 11 $ it must be divisible by $ 11^2 $, so the number
is divisib... | 7744 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
LI OM - II - Problem 4
Point $ I $ is the center of the circle inscribed in triangle $ ABC $, where $ AB \neq AC $. Lines $ BI $ and $ CI $ intersect sides $ AC $ and $ AB $ at points $ D $ and $ E $, respectively. Determine all possible measures of angle $ BAC $ for which the equality $ DI = EI $ can hold. | We will show that the only value taken by angle $ BAC $ is $ 60^\circ $.
By the Law of Sines applied to triangles $ ADI $ and $ AEI $, we obtain $ \sin \measuredangle AEI = \sin \measuredangle ADI $. Hence,
om51_2r_img_6.jpg
First, suppose that the equality $ \measuredangle AEI = \measuredangle ADI $ holds (Fig.... | 60 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
VI OM - II - Task 3
What should be the angle at the vertex of an isosceles triangle so that a triangle can be constructed with sides equal to the height, base, and one of the remaining sides of this isosceles triangle? | We will adopt the notations indicated in Fig. 9. A triangle with sides equal to $a$, $c$, $h$ can be constructed if and only if the following inequalities are satisfied:
Since in triangle $ADC$ we have $a > h$, $\frac{c}{2} + h > a$, the first two of the above inequalities always hold, so the necessary and suffic... | 106 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
XXXVIII OM - III - Zadanie 5
Wyznaczyć najmniejszą liczbę naturalną $ n $, dla której liczba $ n^2-n+11 $ jest iloczynem czterech liczb pierwszych (niekoniecznie różnych).
|
Niech $ f(x) = x^2-x+11 $. Wartości przyjmowane przez funkcję $ f $ dla argumentów całkowitych są liczbami całkowitymi niepodzielnymi przez $ 2 $, $ 3 $, $ 5 $, $ 7 $. Przekonujemy się o tym badając reszty z dzielenia $ n $ i $ f(n) $ przez te cztery początkowe liczby pierwsze:
\begin{tabular}{lllll}
&\multicolum... | 132 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
XII OM - II - Task 4
Find the last four digits of the number $ 5^{5555} $. | \spos{1} We will calculate a few consecutive powers of the number $ 5 $ starting from $ 5^4 $:
It turned out that $ 5^8 $ has the same last four digits as $ 5^4 $, and therefore the same applies to the numbers $ 5^9 $ and $ 5^5 $, etc., i.e., starting from $ 5^4 $, two powers of the number $ 5 $, whose exponents ... | 8125 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
L OM - I - Task 3
In an isosceles triangle $ ABC $, angle $ BAC $ is a right angle. Point $ D $ lies on side $ BC $, such that $ BD = 2 \cdot CD $. Point $ E $ is the orthogonal projection of point $ B $ onto line $ AD $. Determine the measure of angle $ CED $. | Let's complete the triangle $ABC$ to a square $ABFC$. Assume that line $AD$ intersects side $CF$ at point $P$, and line $BE$ intersects side $AC$ at point $Q$. Since
$ CP= \frac{1}{2} CF $. Using the perpendicularity of lines $AP$ and $BQ$ and the above equality, we get $ CQ= \frac{1}{2} AC $, and consequently $... | 45 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
LX OM - III - Zadanie 2
Let $ S $ be the set of all points in the plane with both coordinates being integers. Find
the smallest positive integer $ k $ for which there exists a 60-element subset of the set $ S $
with the following property: For any two distinct elements $ A $ and $ B $ of this subset, there exists a po... | Let $ K $ be a subset of the set $ S $ having for a given number $ k $ the property given in the problem statement.
Let us fix any two different points $ (a, b), (c, d) \in K $. Then for some integers
$ x, y $ the area of the triangle with vertices $ (a, b) $, $ (c, d) $, $ (x, y) $ is $ k $, i.e., the equality
$ \frac... | 210 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
LII OM - I - Task 4
Determine whether 65 balls with a diameter of 1 can fit into a cubic box with an edge of 4. | Answer: It is possible.
The way to place the balls is as follows.
At the bottom of the box, we place a layer consisting of 16 balls. Then we place a layer consisting of 9 balls, each of which is tangent to four balls of the first layer (Fig. 1 and 2). The third layer consists of 16 balls that are tangent to the balls o... | 66 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
XX OM - II - Task 2
Find all four-digit numbers in which the thousands digit is equal to the hundreds digit, and the tens digit is equal to the units digit, and which are squares of integers. | Suppose the number $ x $ satisfies the conditions of the problem and denote its consecutive digits by the letters $ a, a, b, b $. Then
The number $ x $ is divisible by $ 11 $, so as a square of an integer, it is divisible by $ 11^2 $, i.e., $ x = 11^2 \cdot k^2 $ ($ k $ - an integer), hence
Therefore,
... | 7744 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
XV OM - I - Problem 11
In triangle $ ABC $, angle $ A $ is $ 20^\circ $, $ AB = AC $. On sides $ AB $ and $ AC $, points $ D $ and $ E $ are chosen such that $ \measuredangle DCB = 60^\circ $ and $ \measuredangle EBC = 50^\circ $. Calculate the angle $ EDC $. | Let $ \measuredangle EDC = x $ (Fig. 9). Notice that $ \measuredangle ACB = \measuredangle $ABC$ = 80^\circ $, $ \measuredangle CDB = 180^\circ-80^\circ-60^\circ = 40^\circ $, $ \measuredangle CEB = 180^\circ - 80^\circ-50^\circ = \measuredangle EBC $, hence $ EC = CB $. The ratio $ \frac{DC}{CE} $ of the sides of tr... | 30 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
XXVIII - II - Task 3
In a hat, there are 7 slips of paper. On the $ n $-th slip, the number $ 2^n-1 $ is written ($ n = 1, 2, \ldots, 7 $). We draw slips randomly until the sum exceeds 124. What is the most likely value of this sum? | The sum of the numbers $2^0, 2^1, \ldots, 2^6$ is $127$. The sum of any five of these numbers does not exceed $2^2 + 2^3 + 2^4 + 2^5 + 2^6 = 124$. Therefore, we must draw at least six slips from the hat.
Each of the events where we draw six slips from the hat, and the seventh slip with the number $2^{n-1}$ ($n = 1, 2, ... | 127 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
XLII OM - I - Problem 8
Determine the largest natural number $ n $ for which there exist in space $ n+1 $ polyhedra $ W_0, W_1, \ldots, W_n $ with the following properties:
(1) $ W_0 $ is a convex polyhedron with a center of symmetry,
(2) each of the polyhedra $ W_i $ ($ i = 1,\ldots, n $) is obtained from $ W_0 $ by ... | Suppose that polyhedra $W_0, W_1, \ldots, W_n$ satisfy the given conditions. Polyhedron $W_1$ is the image of $W_0$ under a translation by a certain vector $\overrightarrow{\mathbf{v}}$ (condition (2)). Let $O_0$ be the center of symmetry of polyhedron $W_0$ (condition (1)); the point $O_1$, which is the image of $O_0$... | 26 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
XXII OM - III - Problem 5
Find the largest integer $ A $ such that for every permutation of the set of natural numbers not greater than 100, the sum of some 10 consecutive terms is at least $ A $. | The sum of all natural numbers not greater than $100$ is equal to $1 + 2 + \ldots + 100 = \frac{1 + 100}{2} \cdot 100 = 5050$. If $a_1, a_2, \ldots, a_{100}$ is some permutation of the set of natural numbers not greater than $100$ and the sum of any $10$ terms of this permutation is less than some number $B$, then in p... | 505 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
L OM - I - Problem 11
In an urn, there are two balls: a white one and a black one. Additionally, we have 50 white balls and 50 black balls at our disposal. We perform the following action 50 times: we draw a ball from the urn, and then return it to the urn along with one more ball of the same color as the drawn ball. ... | Let $ P(k,n) $, where $ 1 \leq k\leq n-1 $, denote the probability of the event that when there are $ n $ balls in the urn, exactly $ k $ of them are white. Then
Using the above relationships, we prove by induction (with respect to $ n $) that $ P(k,n) = 1/(n-1) $ for $ k = 1,2,\ldots,n-1 $. In particular
T... | 51 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
XLIV OM - I - Problem 11
In six different cells of an $ n \times n $ table, we place a cross; all arrangements of crosses are equally probable. Let $ p_n $ be the probability that in some row or column there will be at least two crosses. Calculate the limit of the sequence $ (np_n) $ as $ n \to \infty $. | Elementary events are determined by six-element subsets of the set of $n^2$ cells of the table; there are $\binom{n^2}{6}$ of them. Let $\mathcal{Z}$ be the complementary event to the event considered in the problem. The configurations favorable to event $\mathcal{Z}$ are obtained as follows: we place the first cross i... | 30 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
XXVI - I - Task 1
At the ball, there were 42 people. Lady $ A_1 $ danced with 7 gentlemen, Lady $ A_2 $ danced with 8 gentlemen, ..., Lady $ A_n $ danced with all the gentlemen. How many gentlemen were at the ball? | The number of ladies at the ball is $ n $, so the number of gentlemen is $ 42-n $. The lady with number $ k $, where $ 1 \leq k \leq n $, danced with $ k+6 $ gentlemen. Therefore, the lady with number $ n $ danced with $ n+ 6 $ gentlemen. These were all the gentlemen present at the ball. Thus, $ 42-n = n + 6 $. Solving... | 24 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
L OM - II - Task 5
Let $ S = \{1, 2,3,4, 5\} $. Determine the number of functions $ f: S \to S $ satisfying the equation $ f^{50} (x) = x $ for all $ x \in S $.
Note: $ f^{50}(x) = \underbrace{f \circ f \circ \ldots \circ f}_{50} (x) $. | Let $ f $ be a function satisfying the conditions of the problem. For numbers $ x \neq y $, we get $ f^{49}(f(x)) = x \neq y = f^{49}(f(y)) $, hence $ f(x) \neq f(y) $. Therefore, $ f $ is a permutation of the set $ S $. Denote by $ r(x) $ ($ x \in S $) the smallest positive integer such that $ f^{r(x)}(x) = x $. Then ... | 50 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
XXII OM - III - Task 3
How many locks at least need to be placed on the treasury so that with a certain distribution of keys among the 11-member committee authorized to open the treasury, any 6 members can open it, but no 5 can? Determine the distribution of keys among the committee members with the minimum number of ... | Suppose that for some natural number $ n $ there exists a key distribution to $ n $ locks among an 11-member committee such that the conditions of the problem are satisfied. Let $ A_i $ denote the set of locks that the $ i $-th member of the committee can open, where $ i = 1, 2, \ldots, 11 $, and let $ A $ denote the s... | 462 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
4. Consider the set $M$ of integers $n \in[-100 ; 500]$, for which the expression $A=n^{3}+2 n^{2}-5 n-6$ is divisible by 11. How many integers are contained in $M$? Find the largest and smallest of them? | Answer: 1) 164 numbers; 2) $n_{\text {min }}=-100, n_{\text {max }}=497$. | 164 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
1. Solution. According to the problem, the sum of the original numbers is represented by the expression:
$$
\begin{aligned}
& \left(a_{1}+2\right)^{2}+\left(a_{2}+2\right)^{2}+\ldots+\left(a_{50}+2\right)^{2}=a_{1}^{2}+a_{2}^{2}+\ldots+a_{50}^{2} \rightarrow \\
& {\left[\left(a_{1}+2\right)^{2}-a_{1}^{2}\right]+\left[... | Answer: will increase by 150. | 150 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
1. A set of 60 numbers is such that adding 3 to each of them does not change the value of the sum of their squares. By how much will the sum of the squares of these numbers change if 4 is added to each number? | Answer: will increase by 240. | 240 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
1. A set of 70 numbers is such that adding 4 to each of them does not change the magnitude of the sum of their squares. By how much will the sum of the squares of these numbers change if 5 is added to each number? | Answer: will increase by 350. | 350 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
1. A set of 80 numbers is such that adding 5 to each of them does not change the magnitude of the sum of their squares. By how much will the sum of the squares of these numbers change if 6 is added to each number? | Answer: will increase by 480. | 480 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
5. Find the fraction $\frac{p}{q}$ with the smallest possible natural denominator, for which $\frac{1}{2014}<\frac{p}{q}<\frac{1}{2013}$. Enter the denominator of this fraction in the provided field | 5. Find the fraction $\frac{p}{q}$ with the smallest possible natural denominator, for which
$\frac{1}{2014}<\frac{p}{q}<\frac{1}{2013}$. Enter the denominator of this fraction in the provided field
Answer: 4027 | 4027 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
4. If $\quad a=\overline{a_{1} a_{2} a_{3} a_{4} a_{5} a_{6}}, \quad$ then $\quad P(a)=\overline{a_{6} a_{1} a_{2} a_{3} a_{4} a_{5}}$, $P(P(a))=\overline{a_{5} a_{6} a_{1} a_{2} a_{3} a_{4}} \quad$ with $\quad a_{5} \neq 0, a_{6} \neq 0, a_{1} \neq 0 . \quad$ From the equality $P(P(a))=a$ it follows that $a_{1}=a_{5},... | Answer: 1) 81 is the number; 2) $a=\overline{t u t u t u}, t, u$, where $t, u$ - are any digits, not equal to zero. | 81 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
3. Square the numbers $a=10001, b=100010001$. Extract the square root of the number $c=1000200030004000300020001$. | 1) $a^{2}=100020001$; 2) $b^{2}=10002000300020001$; 3) $\sqrt{c}=1000100010001$. | 1000100010001 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
2. By what natural number can the numerator and denominator of the ordinary fraction of the form $\frac{5 n+3}{7 n+8}$ be reduced? For which integers $n$ can this occur? | Answer: it can be reduced by 19 when $n=19k+7, k \in Z$. | 19 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
5. The angle at vertex $B$ of triangle $A B C$ is $130^{\circ}$. Through points $A$ and $C$, lines perpendicular to line $A C$ are drawn and intersect the circumcircle of triangle $A B C$ at points $E$ and $D$. Find the acute angle between the diagonals of the quadrilateral with vertices at points $A, C, D$ and $E$.
P... | Solution. Let $a$ be the number of students in the first category, $c$ be the number of students in the third category, and $b$ be the part of students from the second category who will definitely lie in response to the first question (and say "YES" to all three questions), while the rest of the students from this cate... | 80 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
5. In a convex quadrilateral $A B C D$, the lengths of sides $B C$ and $A D$ are 2 and $2 \sqrt{2}$ respectively. The distance between the midpoints of diagonals $B D$ and $A C$ is 1. Find the angle between the lines $B C$ and $A D$. | Answer: $\alpha=45^{\circ}$. | 45 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
5. Let's introduce the notation: $A B=2 c, A C=2 b, \measuredangle B A C=\alpha$. The feet of the perpendicular bisectors are denoted by points $P$ and $Q$. Then, in the right triangle $\triangle A M Q$, the hypotenuse $A M=\frac{b}{\cos \alpha}$. And in the right triangle $\triangle A N P$, the hypotenuse $A N=\frac{c... | Answer: $60^{\circ}$ or $120^{\circ}$. | 60 | Geometry | proof | Yes | Yes | olympiads | false |
5. In triangle $A B C$, the perpendicular bisectors of sides $A B$ and $A C$ intersect lines $A C$ and $A B$ at points $N$ and $M$ respectively. The length of segment $N M$ is equal to the length of side $B C$ of the triangle. The angle at vertex $C$ of the triangle is $40^{\circ}$. Find the angle at vertex $B$ of the ... | Answer: $80^{\circ}$ or $20^{\circ}$.
## Final round of the "Rosatom" Olympiad, 9th grade, CIS, February 2020
# | 80 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
4. The sum $b_{6}+b_{7}+\ldots+b_{2018}$ of the terms of the geometric progression $\left\{b_{n}\right\}, b_{n}>0$ is 6. The sum of the same terms taken with alternating signs $b_{6}-b_{7}+b_{8}-\ldots-b_{2017}+b_{2018}$ is 3. Find the sum of the squares of the same terms $b_{6}^{2}+b_{7}^{2}+\ldots+b_{2018}^{2}$. | Answer: $b_{6}^{2}+b_{7}^{2}+\ldots+b_{2018}^{2}=18$. | 18 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
2. Integers, the decimal representation of which reads the same from left to right and from right to left, we will call symmetric. For example, the number 513315 is symmetric, while 513325 is not. How many six-digit symmetric numbers exist such that adding 110 to them leaves them symmetric? | Answer: 81 numbers of the form $\overline{a b 99 b a}$, where $a=1,2, \ldots, 9, b=0,1,2, \ldots, 8$. | 81 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
3. In city "N", there are 12 horizontal and 16 vertical streets, of which a pair of horizontal and a pair of vertical streets form the rectangular boundary of the city, while the rest divide it into blocks that are squares with a side length of 100m. Each block has an address consisting of two integers $(i ; j), i=1,2,... | Answer: 165 blocks; $c_{\min }=4$ coins, $c_{\max }=8$ coins. | 165 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
2. Integers, the decimal representation of which reads the same from left to right and from right to left, we will call symmetric. For example, the number 5134315 is symmetric, while 5134415 is not. How many seven-digit symmetric numbers exist such that adding 1100 to them leaves them symmetric? | Answer: 810 numbers of the form $\overline{a b c 9 c b a}$, where $a=1,2, \ldots, 9$, $b=0,1,2, \ldots, 9, c=0,1,2, \ldots, 8$. | 810 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
3. In city "N", there are 7 horizontal and 13 vertical streets, of which a pair of horizontal and a pair of vertical streets form the rectangular boundary of the city, while the rest divide it into blocks that are squares with a side length of 100 m. Each block has an address consisting of two integers $(i ; j), i=1,2,... | # Answer: 72 blocks; $c_{\min }=8$ coins, $c_{\max }=12$ coins. | 72 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
2. Integers, whose decimal notation reads the same from left to right and from right to left, we will call symmetric. For example, the number 513151315 is symmetric, while 513152315 is not. How many nine-digit symmetric numbers exist such that adding 11000 to them leaves them symmetric? | Answer: 8100 numbers of the form $\overline{a b c d 9 d c b a}$, where $a=1,2, \ldots, 9$, $b=0,1,2, \ldots, 9, c=0,1,2, \ldots, 9, d=0,1,2, \ldots, 8$. | 8100 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
3. In city "N", there are 10 horizontal and 12 vertical streets, of which a pair of horizontal and a pair of vertical streets form the rectangular boundary of the city, while the rest divide it into blocks that are squares with a side length of 100 meters. Each block has an address consisting of two integers $(i ; j), ... | Answer: 99 blocks; $c_{\min }=10$ coins, $c_{\max }=14$ coins. | 99 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
5. Kuzya the flea can make a jump in any direction on a plane for exactly 19 mm. Her task is to get from point $A$ to point $B$ on the plane, the distance between which is 1812 cm. What is the minimum number of jumps she must make to do this? | Answer: $n_{\min }=954$ jumps. | 954 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
1. When purchasing goods for an amount of no less than 1000 rubles, the store provides a discount on subsequent purchases of $50 \%$. Having 1200 rubles in her pocket, Dasha wanted to buy 4 kg of strawberries and 6 kg of sugar. In the store, strawberries were sold at a price of 300 rubles per kg, and sugar - at a price... | First purchase: 3 kg of strawberries, 4 kg of sugar. Its cost is $300 \times 3 + 4 \times 30 = 1020$ rubles. Second purchase: 1 kg of strawberries, 2 kg of sugar. With a $50\%$ discount, its price is $(300 + 60) \cdot 0.5 = 180$ rubles. The total amount of both purchases is $1200$ rubles. | 1200 | Logic and Puzzles | math-word-problem | Yes | Yes | olympiads | false |
1. The polynomial $p_{1}=x-a$ can have a root $x=a$ coinciding with one of the roots of the product $p(x)=p_{1}(x) \cdot p_{2}(x)$.
Case $1 \quad a=1$
Then the polynomial $p_{2}(x)=(x-1)^{r}(x-2)^{s}(x+3)^{t}$, where $r \geq 1, s \geq 1, t \geq 1-$ are integers, $r+s+t=4$, satisfies the condition of the problem. The ... | Answer: $p_{1}(x)=x+3, p_{2}(x)=(x-1)(x-2)(x+3)^{2} ; a_{0}=21$ | 21 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
3. A natural number $a$ is divisible by 21 and has 105 different divisors, including 1 and $a$. Find the smallest such $a$. | Answer: $a_{\min }=2^{6} \cdot 3^{4} \cdot 7^{2}=254016$ | 254016 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
3. A natural number $a$ is divisible by 35 and has 75 different divisors, including 1 and $a$. Find the smallest such $a$. | Answer: $a_{\text {min }}=2^{4} \cdot 5^{4} \cdot 7^{2}=490000$. | 490000 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
3. A natural number $a$ is divisible by 55 and has 117 distinct divisors, including 1 and $a$. Find the smallest such $a$. | Answer: $a_{\min }=2^{12} \cdot 5^{2} \cdot 11^{2}=12390400$. | 12390400 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
2.17. Final round of the "Rosatom" Olympiad, 7th grade
# Answers and solutions
Problem 1 Answer: 9
There exists a set of 8 buttons in which there are no three buttons of the same color: each color has two buttons. In any set of 9 buttons, there will be at least one triplet of buttons of the same color.
If we assum... | Answer: 9 buttons.
Problem 2 Answer: 1261
\[
\left\{\begin{array}{l}
a=35 n+1 \\
a=45 m+1
\end{array} \rightarrow 35 n=45 m \rightarrow 7 n=9 m \rightarrow\left\{\begin{array}{c}
n=9 t \\
m=7 t, t \in Z
\end{array} \rightarrow\right.\right.
\]
\[
a=315 t+1 \geq 1000 \rightarrow t \geq 4 \rightarrow a_{\text {min }}=... | 1261 | Combinatorics | math-word-problem | Yes | Yes | olympiads | false |
3. In the decimal representation of a six-digit number $a$, there are no zeros and the sum of its digits is 18. Find the sum of all different numbers obtained from the number $a$ by cyclic permutations of its digits. In a cyclic permutation, all digits of the number, except the last one, are shifted one place to the ri... | 3. Solution. Case 1. The number $a=333333$. This number does not change under cyclic permutations, so it is the only one and the sum of the numbers is the number itself, that is, 333333.
Case 2. The number $a$ consists of three identical cycles of two digits each, for example, $a=242424$. Such numbers have two differe... | 1999998 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
5. On a sheet of paper, 14 parallel lines $L$ and 15 lines $P$ perpendicular to them are drawn. The distances between adjacent lines from $L$ from the first to the last are given: 2;4;6;2;4;6;2;4;6;2;4;6;2. The distances between adjacent lines from $P$ are also known: 3;1;2;6;3;1;2;6;3;1;2;6;3;1. Find the greatest leng... | 5. Solution. We will prove that the maximum length of the side of the square is 40. Calculate the distance from the first to the last line in $P: 3+1+2+6+3+1+2+6+3+1+2+6+3+1=40$. Therefore, the side length of the square cannot be more than 40. On the other hand, in $L$ the distance from the second line to the third lin... | 40 | Geometry | math-word-problem | Yes | Yes | olympiads | false |
1. The polynomial $P(x)$ with integer coefficients satisfies the condition $P(29)=P(37)=2022$. Find the smallest possible value of $P(0)>0$ under these conditions. | Answer: $P(0)_{\min }=949$. | 949 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
1. The polynomial $P(x)$ with integer coefficients satisfies the condition $P(11)=P(13)=2021$. Find the smallest possible value of $P(0)>0$ under these conditions. | Answer: $P(0)_{\text {min }}=19$. | 19 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
1. The polynomial $P(x)$ with integer coefficients satisfies the condition $P(19)=P(21)=2020$. Find the smallest possible value of $P(0)>0$ under these conditions. | Answer: $P(0)_{\min }=25$. | 25 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
2. The number $A$ in decimal form is represented as $A=\overline{7 a 631 b}$, where $a, b$ are non-zero digits. The number $B$ is obtained by summing all distinct six-digit numbers, including $A$, that are formed by cyclic permutations of the digits of $A$ (the first digit moves to the second position, the second to th... | 2. Solution. The sum of the digits of number $A$ and the numbers obtained from $A$ by cyclic permutations of its digits is $a+b+17$. After summing these numbers (there are 6 of them), in each digit place of number $B$ we get
$a+b+17$, so $B=(a+b+17)\left(10^{5}+10^{4}+10^{3}+10^{2}+10+1\right)=(a+b+17) \cdot 111111$. ... | 796317 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
5. How many different pairs of integers $a$ and $b$ exist such that the equation $a x^{2}+b x+1944=0$ has positive integer roots? | Answer: $\quad 108+24=132$ pairs. | 132 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
5. How many different pairs of integers $a$ and $b$ exist such that the equation $a x^{2}+b x+432=0$ has positive integer roots | Answer: $\quad 78+20=98$ pairs. | 98 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
1. By the condition
$$
T(t)=\frac{270-s(t)}{s(t) / t}=\frac{t(270-s(t))}{s(t)}=C>1, t \in[0.5 ; 1]
$$
Then $s(t)=\frac{270 t}{t+C}$ on this interval. The speed of movement
$$
\begin{aligned}
& v(t)=s^{\prime}(t)=\frac{270 C}{(t+C)^{2}}=60 \text { when } t=1 \text {, i.e. } \\
& \qquad 2 c^{2}-5 c+2=0 \rightarrow C_{... | Answer: 1) 90 km; 2) 86.4 km/hour | 90 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
3. If $m+2019 n$ and $n+2019 m$ are divisible by $d$, then the number
$$
2019(m+2019 n)-(n+2019 m)=(2019^2-1) n
$$
is also divisible by $d$. If $n$ is divisible by $d$, and $m+2019 n$ is divisible by $d$, then $m$ is divisible by $d$ and the numbers $m$ and $n$ are not coprime. Therefore, $d$ divides the number
$$
2... | Answer: $d_{\text {min }}=101$. | 101 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
1. Kostya is making a car trip from point A to point B, which are 320 km apart. The route of the trip is displayed on the computer screen. At any moment in time $t$ (hours), Kostya can receive information about the distance traveled $s(t)$ (km), the speed of movement $v(t)$ (km/hour), and the estimated time $T=T(t)$ (h... | Answer: 1) 128 km; 2) 38.4 km/h. | 128 | Algebra | math-word-problem | Yes | Yes | olympiads | false |
3. It is known that for some positive coprime numbers $m$ and $n$, the numbers $m+2024 n$ and $n+2024 m$ have a common prime divisor $d>7$. Find the smallest possible value of the number $d$ under these conditions. | Answer: $d_{\min }=17$.
For example,
$$
\begin{aligned}
& m=16, n=1 \rightarrow 2024 m+n=2024 \cdot 16+1=32385=17 \cdot 1905 \\
& m+2024 n=16+2024=17 \cdot 120
\end{aligned}
$$ | 17 | Number Theory | math-word-problem | Yes | Yes | olympiads | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.