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
3. It is known that for some positive coprime numbers $m$ and $n$, the numbers $m+1941 n$ and $n+1941 m$ have a common prime divisor $d>8$. Find the smallest possible value of the number $d$ under these conditions.
Answer: $d_{\min }=97$. For example, $$ \begin{aligned} & m=96, n=1 \rightarrow 1941 m+n=1941 \cdot 96+1=97 \cdot 1921 \\ & m+1941 n=96+1941=97 \cdot 21 \end{aligned} $$
97
Number Theory
math-word-problem
Yes
Yes
olympiads
false
1. Danya is making a car trip from point A to point B, which are 300 km apart. The route of the trip is displayed on the computer screen. At any moment in time $t$ (hours), Danya 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)$ (hou...
Answer: 1) 180 km; 2) 48 km/h.
180
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. It is known that for some positive coprime numbers $m$ and $n$, the numbers $m+1947 n$ and $n+1947 m$ have a common prime divisor $d>9$. Find the smallest possible value of the number $d$ under these conditions.
Answer: $d_{\min }=139$. For example, $$ \begin{aligned} & m=138, n=1 \rightarrow 1947 m+n=1947 \cdot 138+1=139 \cdot 1933 \\ & m+1947 n=138+1947=139 \cdot 15 \end{aligned} $$
139
Number Theory
math-word-problem
Yes
Yes
olympiads
false
1. Find the number of divisors of the number $a=2^{3} \cdot 3^{2} \cdot 5^{2}$, which are divisible by 3. Find the sum of such divisors.
1. Solution. Among the divisors of the number $a=2^{3} \cdot 3^{2} \cdot 5^{2}$, which are divisible by 3, the number 2 can be chosen with exponents $0,1,2,3$ (4 options), the number 3 - with exponents 1,2 (2 options), and the number 5 - with exponents $0,1,2$ (3 options). Therefore, the total number of divisors is $4 ...
5580
Number Theory
math-word-problem
Yes
Yes
olympiads
false
2. How many integers $b$ exist such that the equation $x^{2}+b x-9600=0$ has an integer solution that is a multiple of both 10 and 12? Specify the largest possible $b$.
2. Solution. Since the desired integer solution $x$ is divisible by 10 and 12, it is divisible by 60, hence it can be written in the form $x=60 t, t \in Z$. Substitute $x=60 t$ into the original equation: $3600 t^{2}+60 b t-9600=0$. Express $b: b=\frac{160}{t}-60 t$. For $b$ to be an integer, $t$ must be a divisor of ...
9599
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. How many three-digit positive numbers $x$ exist that are divisible by 3 and satisfy the equation $GCD(15, GCD(x, 20))=5$? Find the largest one.
3. Solution. Since 20 is not divisible by 3, $NOD(x, 20)$ is also not divisible by 3. Therefore, the equation $NOD(15, NOD(x, 20))=5$ is equivalent to the condition that $NOD(x, 20)$ is divisible by 5, which is possible if and only if $x$ is divisible by 5. Thus, the condition of the problem is equivalent to $x$ being ...
60
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. On the sides of triangle $A B C$ with side lengths 2, 3, and 4, external squares $A B B_{1} A_{1}, B C C_{2} B_{2}, C A A_{3} C_{3}$ are constructed. Find the sum of the squares of the side lengths of the hexagon $A_{1} B_{1} B_{2} C_{2} C_{3} A_{3}$. ## Answers and Solutions Problem 1 Answer: 165 m.
Solution $m$ - the number of steps Petya takes, $n$ - the number of steps Vova takes $0.75 m=0.55 n=L-$ path length $k$ - the step number of Petya leading to the coincidence of the footprint, $i$ - the step number of Vova leading to the coincidence of the footprint, $0.75 k=0.55 i \rightarrow 15 k=11 i \rightarrow...
116
Geometry
math-word-problem
Yes
Yes
olympiads
false
4. Dima drew a parallelogram $A B C D$ and points $M$ and $N$ on sides $B C$ and $C D$ respectively such that $B M: M C=D N: N C=2: 3$. After that, he erased everything except points $A, M$ and $N$ using a cloth. Vova restored the drawing using a ruler and a compass. How did he do it?
4. Points $B$ and $D$ are the intersection points of lines $C M$ and $C N$ with the line passing through point $O$ and parallel to line $M N$. ## Problem 5 Numbers $A$, when divided by $n$, have a remainder of $r$, when divided by $n+1$ - a remainder of $r+1$, and when divided by $n+2$ - a remainder of $r+2$, have th...
1710
Geometry
math-word-problem
Yes
Yes
olympiads
false
4. Pete is trying to lay out a square on a table using identical cardboard rectangles measuring $14 \times 10$. Will he be able to do this? Propose your version of constructing such a square. What is the minimum number of rectangles he will need?
Solution. Let $n$ be the number of rectangles that form the square. Then the area of the square is $S=14 \cdot 10 \cdot n$. If the side of the square is formed by $m$ sides of length 14 and $k$ sides of length 10, then the length of the side of the square is $14 m + 10 k$, and its area is $S=(14 m + 10 k)^{2}$. Equatin...
35
Geometry
math-word-problem
Yes
Yes
olympiads
false
5. In a rectangular table, the letters of the word "олимпиада" (olympiada) are arranged in a certain order. | $\mathrm{O}$ | Л | И | M | П | И | A | Д | A | | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | | Л | И | M | П | И | A | Д | A | O | | И | M | П | И | A | Д | A | O | Л | | M | П | И | A | Д |...
Solution. In each cell of the table shown below | $\mathrm{O}$ | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | | | 1 | 3 | 6 | 10 | 15 | 21 | 28 | | | | 1 | 4 | 10 | 20 | 35 | 56 | | | | the number of different paths leading to...
93
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
4. On a sheet of paper, 12 consecutive integers are written. After one of them is crossed out, the sum of the remaining numbers equals 325. Which number was crossed out?
Solution. Let $n, n+1, \ldots, n+k-1, n+k, n+k+1, \ldots, n+11$ be 12 consecutive integers, and the number $n+k, k=0,1,2, \ldots, 11$ is crossed out. The sum of the numbers after crossing out is $$ \frac{2 n+11}{2} \cdot 12-(n+k)=325 \rightarrow 11 n+66-k=325 \rightarrow k=11 n-259 $$ Considering the condition $k \in...
29
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. A football is sewn from 256 pieces of leather: white ones in the shape of hexagons and black ones in the shape of pentagons. Black pentagons only border white hexagons, and any white hexagon borders three black pentagons and three white hexagons. Find the number of white hexagons on the football.
Answer: 160. Criteria for checking works, 7th grade Preliminary round of the sectoral physics and mathematics olympiad for schoolchildren "Rosatom", mathematics #
160
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
0.35 \cdot 160+0.1 x=0.2 \cdot 160+0.2 x, 0.15 \cdot 160=0.1 x, x=240 \text {. } $$ In total, it results in $160+240=400$ g of solution.
Answer: 400. ## Problem 9 Points $B_{1}$ and $C_{1}$ are the feet of the altitudes of triangle $ABC$, drawn from vertices $B$ and $C$ respectively. It is known that $AB=7, \quad AC=6, \sin \angle BAC=\frac{2 \sqrt{110}}{21}$. Find the length of the segment $B_{1}C_{1}$. ## Solution: Let the angle $\angle BAC$ be de...
400
Algebra
math-word-problem
Yes
Yes
olympiads
false
1. (10 points). Tourist Nikolai Petrovich was late by $\Delta t=5$ minutes for the departure of his riverboat, which had set off downstream. Fortunately, the owner of a fast motorboat agreed to help Nikolai Petrovich. Catching up with the riverboat and disembarking the unlucky tourist, the motorboat immediately set off...
1. $s=\left(3 v_{\mathrm{T}}+v_{\mathrm{T}}\right) \cdot\left(t_{1}+\Delta t\right)=\left(5 v_{\mathrm{T}}+v_{\mathrm{T}}\right) \cdot t_{1} \rightarrow 4 \Delta t=2 t_{1} \rightarrow t_{1}=2 \Delta t=10$ min $t_{2}=\frac{s}{5 v_{\mathrm{T}}-v_{\mathrm{T}}}=\frac{6 v_{\mathrm{T}} \cdot t_{1}}{4 v_{\mathrm{T}}}=\frac{3}...
25
Algebra
math-word-problem
Yes
Yes
olympiads
false
2. (15 points) A satellite is launched vertically from the pole of the Earth at the first cosmic speed. To what maximum distance from the Earth's surface will the satellite travel? (The acceleration due to gravity at the Earth's surface $g=10 \mathrm{m} / \mathrm{c}^{2}$, radius of the Earth $R=6400$ km).
2. According to the law of conservation of energy: $\frac{m v_{I}^{2}}{2}-\frac{\gamma m M}{R}=-\frac{\gamma m M}{R+H}$ The first cosmic speed $v_{I}=\sqrt{g R}$ The acceleration due to gravity at the surface $g=\frac{\gamma M}{R^{2}}$ Then $\frac{m g R}{2}-m g R=-\frac{m g R^{2}}{R+H}$ Finally, $H=R=6400$ km. (...
6400
Algebra
math-word-problem
Yes
Yes
olympiads
false
6. (15 points) Looking down from the edge of the stream bank, Vovochka decided that the height of his rubber boots would be enough to cross the stream. However, after crossing, Vovochka got his legs wet up to his knees ($H=52$ cm). Estimate the height $h$ of Vovochka's boots. Assume the depth of the stream is constant,...
6. From the figure $\frac{d}{h}=\operatorname{tg} \alpha ; \quad \frac{d}{H}=\operatorname{tg} \beta ; \quad \frac{H}{h}=\frac{\operatorname{tg} \alpha}{\operatorname{tg} \beta}$ Since all the information about the bottom of the stream falls into the space limited by the eye's pupil, all angles are small: $\operatorn...
39
Other
math-word-problem
Yes
Yes
olympiads
false
1. Dmitry is three times as old as Grigory was when Dmitry was as old as Grigory is now. When Grigory becomes as old as Dmitry is now, the sum of their ages will be 49 years. How old is Grigory?
Solution: Let Gregory be $y$ years old in the past, and Dmitry be $x$ years old. Then currently, Gregory is $x$ years old, and Dmitry is $3 y$ years old. In the future, Gregory will be $3 y$ years old, and Dmitry will be $z$ years old, and according to the condition, $z+3 y=49$. Since $z-3 y=3 y-x ; 3 y-x=x-y$, then $9...
14
Algebra
math-word-problem
Yes
Yes
olympiads
false
4. Solve the equation $\frac{4}{\sqrt{\log _{3}(81 x)}+\sqrt{\log _{3} x}}+\sqrt{\log _{3} x}=3$.
Solution: Using the properties of logarithms, our equation can be rewritten as $\frac{4}{\sqrt{4+\log _{3} x}+\sqrt{\log _{3} x}}+\sqrt{\log _{3} x}=3$. Let $t=\log _{3} x$. Then $\frac{4}{\sqrt{4+t}+\sqrt{t}}+\sqrt{t}=3$. Multiplying the numerator and denominator of the first fraction by $\sqrt{t+4}-\sqrt{t}$, we arri...
243
Algebra
math-word-problem
Yes
Yes
olympiads
false
8. On the sides $B C, C A, A B$ of an equilateral triangle $A B C$ with side length 7, points $A_{1}, B_{1}, C_{1}$ are taken respectively. It is known that $A C_{1}=B A_{1}=C B_{1}=3$. Find the ratio of the area of triangle $A B C$ to the area of the triangle formed by the lines $A A_{1}, B B_{1}, C C_{1}$.
Solution: Triangles $A B A_{1}, B C B_{1}, C A C_{1}$ are equal by sides and the angle between them, triangles $A D C_{1}, B E A_{1}, C F B_{1}$ are equal by side and angles. Triangle $A D C_{1}$ is similar to $A B A_{1}$ by two angles, triangle $A B C$ is similar to $D E F$. Let $S=S_{A B C}, S_{1}=S_{A B A_{1}}, S_{...
37
Geometry
math-word-problem
Yes
Yes
olympiads
false
1. Ivan is twice as old as Peter was when Ivan was as old as Peter is now. When Peter becomes as old as Ivan is now, the sum of their ages will be 54 years. How old is Peter?
Solution: Let Peter's age in the past be $y$ years, and Ivan's age be $x$ years. Then currently, Peter is $x$ years old, and Ivan is $2 y$ years old. In the future, Peter will be $2 y$ years old, and Ivan will be $z$ years old, and according to the condition, $z+2 y=54$. Since $z-2 y=2 y-x ; 2 y-x=x-y$, then $6 y-x=54$...
18
Algebra
math-word-problem
Yes
Yes
olympiads
false
4. Solve the equation $\frac{1}{\sqrt{\log _{5}(5 x)}+\sqrt{\log _{5} x}}+\sqrt{\log _{5} x}=2$.
Solution: Using the properties of logarithms, our equation can be rewritten as $\frac{1}{\sqrt{1+\log _{5} x}+\sqrt{\log _{5} x}}+\sqrt{\log _{5} x}=2$. Let $t=\log _{5} x$. Then $\frac{1}{\sqrt{1+t}+\sqrt{t}}+\sqrt{t}=2$. By multiplying the numerator and denominator of the first fraction by $\sqrt{t+1}-\sqrt{t}$, we a...
125
Algebra
math-word-problem
Yes
Yes
olympiads
false
8. On the sides $B C, C A, A B$ of an equilateral triangle $A B C$ with side length 11, points $A_{1}, B_{1}, C_{1}$ are taken respectively. It is known that $A C_{1}=B A_{1}=C B_{1}=5$. Find the ratio of the area of triangle $A B C$ to the area of the triangle formed by the lines $A A_{1}, B B_{1}, C C_{1}$.
Solution: Triangles $A B A_{1}, B C B_{1}, C A C_{1}$ are equal by sides and the angle between them, triangles $A D C_{1}, B E A_{1}, C F B_{1}$ are equal by side and angles. Triangle $A D C_{1}$ is similar to $A B A_{1}$ by two angles, triangle $A B C$ is similar to $D E F$. Let $S=S_{A B C}, S_{1}=S_{A B A_{1}}, S_{...
91
Geometry
math-word-problem
Yes
Yes
olympiads
false
10. For what values of the parameter $a$ does the equation $x^{4}-40 x^{2}+144=a\left(x^{2}+4 x-12\right)$ have exactly three distinct solutions?
Solution: Factorize the right and left sides of the equation: $(x-2)(x+2)(x-6)(x+6)=a(x-2)(x+6)$. The equation can be written as $(x-2)(x+6)\left(x^{2}-4 x-12-a\right)=0$. It is obvious that 2 and -6 are roots of this equation. We are satisfied with the situation where exactly one of the roots of the equation $x^{2}-4...
48
Algebra
math-word-problem
Yes
Yes
olympiads
false
From channel A to the Wiki site, $850 * 0.06=51$ people will transition From channel B to the Wiki site, $1500 * 0.042=63$ people will transition From channel C to the Wiki site, $4536 / 72=63$ people will transition
Answer: The most people will transition from channels B and V - 63 people each ## 2 Cost of transition from advertising on channel A: $-3417 / 51 = 67$ rubles Cost of transition from advertising on channel B: $4914 / 63 = 78$ rubles Answer: The lowest cost of transition to the site from advertising on channel A - 6...
2964
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. Expenses for medical services provided to a child (under 18 years old) of the taxpayer by medical organizations Correct answers: Pension contributions under a non-state pension agreement concluded by the taxpayer with a non-state pension fund in their own favor, Expenses for medical services provided to a child (...
Answer and write it in rubles as an integer without spaces and units of measurement. Answer: $\qquad$ Correct answer: 16250 Question 12 Score: 5.00 Insert the missing terms from the drop-down list. Under the insurance contract, one party insured; insurance premium; beneficiary; insurer; insurance amount undertak...
16250
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. the higher the risk of a financial instrument, the higher its return Correct answers: the higher the reliability of a financial instrument, the higher its return, a financial instrument can be reliable, profitable, and liquid at the same time, risk is not related to the return of a financial instrument Question ...
Answer write in rubles as an integer without spaces and units of measurement. Answer: $\qquad$ Correct answer: 1378 Question 16 Score: 5.00 Establish the correspondence between specific taxes and their types. | personal income tax | federal tax; local tax; regional tax; | | :---: | :---: | | land tax | federal ta...
1378
Algebra
math-word-problem
Yes
Yes
olympiads
false
# 15. Problem 15 What amount of mortgage credit in rubles will a bank client receive if their initial payment of 1800000 rubles amounted to $30 \%$ of the cost of the purchased property?
Answer in the form of a number should bewrittenwithoutspaces,withoutunitsofmeasurementandanycharacters. ## Answer: 4200000 #
4200000
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. reducing transaction time ## Correct answers: using licensed software, using a personal computer instead of a public one, using antivirus programs Question 3 Balya: 7.00 Mr. Vshokoladov earned X rubles per month throughout 2021. In addition, during this year, he won 2000000 rubles in a lottery. What is $X$ if...
Answer in rubles, without spaces and units of measurement. Answer: Correct answer: 600000 Question 4 Score: 3.00 Select all correct continuations of the statement. 2022 Higher Trial - qualifying stage To file a petition to recognize a citizen as bankrupt... ## Select one or more answers: \ulcorner
600000
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. A custodian stores securities, clients' money, and other material assets Correct answers: A paid investment advisor consults and provides recommendations to the client on investment management, A trustee manages the client's property in their own name Find the correspondence between the term and the statement so...
Answer in rubles, without spaces and units of measurement. Round the answer to the nearest whole number according to rounding rules. Answer: Correct answer: 13806 question 9 Score: 3.00 Select all possible features of an authentic ruble banknote. Select one or more answers: $\Gamma$
13806
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. watermark Correct answers: raised relief of certain text fragments, watermark, inscriptions and ornaments Question 10 Score: 7.00 Vladimir has saved 16,500 rubles to buy a gaming console as a birthday gift for his brother, which amounts to 220 US dollars at the current exchange rate. The birthday is not until ...
Answer in rubles, without spaces and units of measurement. Round the answer to the nearest whole number according to rounding rules. Answer: $\qquad$ Correct answer: 76 Question 11 Score: 3.00 What services can currently be provided remotely? Select all appropriate options.
76
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. the driver's marital status Correct answers: bonus-malus coefficient, engine power, driver's age Question 14 Score: 7.00 Maria Ivanovna has retired. She did not have a funded pension, only a social insurance pension, and her individual pension coefficient amount is 120. In addition, Maria Ivanovna has a bank d...
Provide the answer in rubles, without spaces and units of measurement. Answer: The correct answer is: 19930 Question 15 Score: 7.00 Insert the missing words from the list below (not all provided words will be needed!): Paying credit; preferential; higher; cash withdrawal; service; blocking; bonus; debit; freeze;...
19930
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. The Bank of Russia will ensure the conversion of the "digital ruble" into another form of money (rubles) at a one-to-one ratio. Correct answers: Stablecoins, backed by cash or gold, are an example of a CBDC., The Bank of Russia will ensure the conversion of the "digital ruble" into another form of money (rubles) ...
Provide the answer in rubles, without spaces and units of measurement. Round the answer to the nearest whole number. Answer: $\qquad$ Correct answer: 1321412 Question 20 Score: 7.00 Financial Literacy 11th Grade Day 1 Ivan and Petr, twin brothers, went on a vacation by the sea together and purchased two different ...
1321412
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. the higher the risk of a financial instrument, the higher its return Correct answers: the higher the reliability of a financial instrument, the higher its return, a financial instrument can be reliable, profitable, and liquid at the same time, risk is not related to the return of a financial instrument Question ...
Answer write in rubles as an integer without spaces and units of measurement. Answer: $\qquad$ Correct answer: 1378 Question 16 Score: 5.00 Establish the correspondence between specific taxes and their types. | personal income tax | federal tax; local tax; regional tax; | | :---: | :---: | | land tax | federal ta...
1378
Algebra
math-word-problem
Yes
Yes
olympiads
false
Problem 2. In a square of grid paper containing an integer number of cells, a hole in the shape of a square, also consisting of an integer number of cells, was cut out. How many cells did the large square contain if 209 cells remained after the cutout?
Answer: 225 cells Solution. The side of the larger square contains $n$ sides of a cell, and the side of the smaller square contains $m$ sides of a cell. Then $n^{2}-m^{2}=209 \rightarrow(n-m)(n+m)=209=11 \cdot 19$. Case 1. $\left\{\begin{array}{c}n+m=209 \\ n-m=1\end{array} \rightarrow\left\{\begin{array}{c}n=105 \\ ...
225
Number Theory
math-word-problem
Yes
Yes
olympiads
false
1. Subtract the second equation from the first: $x^{2}-2 x+y^{4}-8 y^{3}+24 y^{2}-32 y=-17 \rightarrow(x-1)^{2}+(y-2)^{4}=0 \rightarrow\left\{\begin{array}{l}x=1 \\ y=2\end{array}\right.$ Then $z=x^{2}+y^{4}-8 y^{3}=1+16-64=-47$
Answer: the only solution is $x=1, y=2, z=-47$.
-47
Algebra
math-word-problem
Yes
Yes
olympiads
false
16. The last digit of a six-digit number was moved to the beginning (for example, $456789 \rightarrow$ 945678), and the resulting six-digit number was added to the original number. Which numbers from the interval param 1 could have resulted from the addition? In the answer, write the sum of the obtained numbers. | par...
16. The last digit of a six-digit number was moved to the beginning (for example, $456789 \rightarrow$ 945678), and the resulting six-digit number was added to the original number. Which numbers from the interval param 1 could have resulted from the addition? In the answer, write the sum of the obtained numbers. | par...
1279267
Number Theory
math-word-problem
Yes
Yes
olympiads
false
1. Find the number of points in the $x O y$ plane having natural coordinates $(x, y)$ and lying on the parabola $y=-\frac{x^{2}}{4}+11 x+23$.
Answer: 22. Solution. Let's find those values of $x$ for which $y$ is positive: $-\frac{x^{2}}{4}+11 x+23>0 \Leftrightarrow-\frac{1}{4}(x+2)(x-46)>0$, from which $-2<x<46$. On this interval, there are 45 natural values of $x: x=1, x=2, \ldots, x=45$. In this interval, $y$ takes integer values only for even $x$ - a tot...
22
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 0 * 2 *$, each of the 6 asterisks needs to be replaced with any of the digits $0,1,2,3,4,5,6,7,8$ (digits can be repeated) so that the resulting 12-digit number is divisible by 45. In how many ways can this be done?
Answer: 13122. Solution. For a number to be divisible by 45, it is necessary and sufficient that it is divisible by 5 and by 9. To ensure divisibility by 5, we can choose 0 or 5 as the last digit (2 ways). To ensure divisibility by nine, we proceed as follows. We will choose four digits arbitrarily (this can be done ...
13122
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 0 *$, each of the 5 asterisks needs to be replaced with any of the digits $0,1,2,3,4,5,6,7,8$ (digits can repeat) so that the resulting 10-digit number is divisible by 18. In how many ways can this be done?
Answer: 3645. Solution. For a number to be divisible by 18, it is necessary and sufficient that it is divisible by 2 and by 9. To ensure divisibility by 2, we can choose the last digit from the available options as $0, 2, 4, 6$ or 8 (5 ways). To ensure divisibility by nine, we proceed as follows. Choose three digits ...
3645
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
1. Find the number of points in the $x O y$ plane having natural coordinates $(x, y)$ and lying on the parabola $y=-\frac{x^{2}}{4}+9 x+19$.
Answer: 18. Solution. Let's find those values of $x$ for which $y$ is positive: $-\frac{x^{2}}{4}+9 x+19>0 \Leftrightarrow-\frac{1}{4}(x+2)(x-38)>0$, from which $-2<x<38$. On this interval, there are 37 natural values of $x: x=1, x=2, \ldots, x=37$. In this interval, $y$ takes integer values only for even $x$ - a tota...
18
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 0 *$, each of the 5 asterisks needs to be replaced with any of the digits $0,1,2,3,4,5,6,7,8$ (digits can repeat) so that the resulting 10-digit number is divisible by 45. In how many ways can this be done?
Answer: 1458. Solution. For a number to be divisible by 45, it is necessary and sufficient that it is divisible by 5 and by 9. To ensure divisibility by 5, we can choose 0 or 5 as the last digit (2 ways). To ensure divisibility by nine, we proceed as follows. We select three digits arbitrarily (this can be done in $9...
1458
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 0 * 2 *$, each of the 6 asterisks needs to be replaced with any of the digits $1,2,3,4,5,6,7,8,9$ (digits can repeat) so that the resulting 12-digit number is divisible by 18. In how many ways can this be done?
Answer: 26244. Solution. For a number to be divisible by 18, it is necessary and sufficient that it is divisible by 2 and by 9. To ensure divisibility by 2, we can choose the last digit from the available options as $2, 4, 6$ or 8 (4 ways). To ensure divisibility by nine, we proceed as follows. Choose four digits arb...
26244
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
1. Find the number of points in the $x O y$ plane having natural coordinates $(x, y)$ and lying on the parabola $y=-\frac{x^{2}}{3}+13 x+42$.
Answer: 13. Solution. Let's find those values of $x$ for which $y$ is positive: $-\frac{x^{2}}{3}+13 x+42>0 \Leftrightarrow-\frac{1}{3}(x+3)(x-42)>0$, from which $-3<x<42$. On this interval, there are 41 natural values of $x: x=1, x=2, \ldots, x=41$. In this case, $y$ takes integer values only when $x$ is divisible by...
13
Algebra
math-word-problem
Yes
Yes
olympiads
false
2. Find the value of the expression $\frac{a}{b}+\frac{b}{a}$, where $a$ and $b$ are the largest and smallest roots of the equation $x^{3}-7 x^{2}+7 x=1$, respectively.
Answer: 34. Solution. The given equation is equivalent to the following $$ \left(x^{3}-1\right)-7\left(x^{2}-x\right)=0 \Leftrightarrow(x-1)\left(x^{2}+x+1\right)-7 x(x-1)=0 \Leftrightarrow(x-1)\left(x^{2}-6 x+1\right)=0, $$ from which $x=1$ or $x=3 \pm \sqrt{8}$. The largest root is $a=3+\sqrt{8}$, and the smallest...
34
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2016 * * * * 02 * *$, each of the 6 asterisks needs to be replaced with any of the digits $0,2,4,5,7,9$ (digits can be repeated) so that the resulting 12-digit number is divisible by 15. In how many ways can this be done?
Answer: 5184. Solution. For a number to be divisible by 15, it is necessary and sufficient that it is divisible by 5 and by 3. To ensure divisibility by 5, we can choose 0 or 5 as the last digit from the available options (2 ways). To ensure divisibility by three, we proceed as follows. Choose four digits arbitrarily...
5184
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
2. Find the value of the expression $\frac{p}{q}+\frac{q}{p}$, where $p$ and $q$ are the largest and smallest roots of the equation $x^{3}+6 x^{2}+6 x=-1$, respectively.
Answer: 23. Solution. The given equation is equivalent to the following $$ \left(x^{3}+1\right)+6\left(x^{2}+x\right)=0 \Leftrightarrow(x+1)\left(x^{2}-x+1\right)+6 x(x+1)=0 \Leftrightarrow(x+1)\left(x^{2}+5 x+1\right)=0 \text {, } $$ from which $x=-1$ or $x=\frac{-5 \pm \sqrt{21}}{2}$. The largest root is $p=\frac{...
23
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2016 * * * * 02 *$, each of the 5 asterisks needs to be replaced with any of the digits $0,2,4,6,7,8$ (digits can be repeated) so that the resulting 11-digit number is divisible by 6. In how many ways can this be done?
Answer: 2160. Solution. For a number to be divisible by 6, it is necessary and sufficient that it is divisible by 2 and by 3. To ensure divisibility by 2, we can choose the last digit from the available options as $0, 2, 4, 6, 8$ (5 ways). To ensure divisibility by three, we proceed as follows. Choose three digits ar...
2160
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
2. Find the value of the expression $\frac{a}{b}+\frac{b}{a}$, where $a$ and $b$ are the largest and smallest roots of the equation $x^{3}-9 x^{2}+9 x=1$, respectively.
Answer: 62. Solution. The given equation is equivalent to the following $$ \left(x^{3}-1\right)-9\left(x^{2}-x\right)=0 \Leftrightarrow(x-1)\left(x^{2}+x+1\right)-9 x(x-1)=0 \Leftrightarrow(x-1)\left(x^{2}-8 x+1\right)=0 $$ from which $x=1$ or $x=4 \pm \sqrt{15}$. The largest root is $a=4+\sqrt{15}$, the smallest is...
62
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2016 * * * * 02 *$, each of the 5 asterisks needs to be replaced with any of the digits $0,2,4,5,7,9$ (digits can be repeated) so that the resulting 11-digit number is divisible by 15. In how many ways can this be done?
# Answer: 864. Solution. For a number to be divisible by 15, it is necessary and sufficient that it is divisible by 5 and by 3. To ensure divisibility by 5, we can choose 0 or 5 as the last digit from the available options (2 ways). To ensure divisibility by three, we proceed as follows. We will choose three digits a...
864
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
1. Find the number of points in the $x O y$ plane having natural coordinates $(x, y)$ and lying on the parabola $y=-\frac{x^{2}}{3}+20 x+63$.
Answer: 20. Solution. Let's find the values of $x$ for which $y$ is positive: $-\frac{x^{2}}{3}+20 x+63>0 \Leftrightarrow-\frac{1}{3}(x+3)(x-63)>0$, from which $-3<x<63$. On this interval, there are 62 natural values of $x: x=1, x=2, \ldots, x=62$. In this case, $y$ takes integer values only when $x$ is divisible by 3...
20
Algebra
math-word-problem
Yes
Yes
olympiads
false
2. Find the value of the expression $\frac{p}{q}+\frac{q}{p}$, where $p$ and $q$ are the largest and smallest roots of the equation $x^{3}-8 x^{2}+8 x=1$, respectively.
# Answer: 47. Solution. The given equation is equivalent to the following $$ \left(x^{3}-1\right)-8\left(x^{2}-x\right)=0 \Leftrightarrow(x-1)\left(x^{2}+x+1\right)-8 x(x-1)=0 \Leftrightarrow(x-1)\left(x^{2}-7 x+1\right)=0 \text {, } $$ from which $x=1$ or $x=\frac{7 \pm \sqrt{45}}{2}$. The largest root is $p=\frac{...
47
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2016 * * * * 02 *$, each of the 5 asterisks needs to be replaced with any of the digits $0,2,4,7,8,9$ (digits can be repeated) so that the resulting 11-digit number is divisible by 6. In how many ways can this be done?
Answer: 1728. Solution. For a number to be divisible by 6, it is necessary and sufficient that it is divisible by 2 and by 3. To ensure divisibility by 2, we can choose the last digit from the available options as $0, 2, 4, 8$ (4 ways). To ensure divisibility by three, we proceed as follows. Choose three digits arbit...
1728
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 0 * 2 *$, each of the 6 asterisks needs to be replaced with any of the digits $0,2,4,5,7,9$ (digits can be repeated) so that the resulting 12-digit number is divisible by 75. In how many ways can this be done?
Answer: 2592. Solution. For a number to be divisible by 75, it is necessary and sufficient that it is divisible by 25 and by 3. To ensure divisibility by 25, we can choose 5 as the last digit from the available options (1 way). To ensure divisibility by three, we proceed as follows. Select four digits arbitrarily (th...
2592
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
4. Plot on the plane $(x ; y)$ the set of points satisfying the equation $|15 x|+|8 y|+|120-15 x-8 y|=120$, and find the area of the resulting figure.
Answer: 60. Solution. Note that the equality $|a|+|b|+|c|=a+b+c$ holds if and only if the numbers $a, b$, and $c$ are non-negative (since if at least one of them is negative, the left side is greater than the right). Therefore, the first equation is equivalent to the system of inequalities $$ \left\{\begin{array} { l...
60
Geometry
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 02 *$, each of the 5 asterisks needs to be replaced with any of the digits $0,2,4,7,8,9$ (digits can repeat) so that the resulting 11-digit number is divisible by 12. In how many ways can this be done?
Answer: 1296. Solution. For a number to be divisible by 12, it is necessary and sufficient that it is divisible by 4 and by 3. To ensure divisibility by 4, we can choose 0, 4, or 8 as the last digit (3 ways). To ensure divisibility by 3, we proceed as follows. We will choose three digits arbitrarily (this can be done...
1296
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
4. On the plane $(x ; y)$, plot the set of points satisfying the equation $|3 x|+|4 y|+|48-3 x-4 y|=48$, and find the area of the resulting figure.
Answer: 96. Solution. Note that the equality $|a|+|b|+|c|=a+b+c$ holds if and only if the numbers $a, b$, and $c$ are non-negative (since if at least one of them is negative, the left side is greater than the right). Therefore, the first equation is equivalent to the system of inequalities $$ \left\{\begin{array} { l...
96
Geometry
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 07 *$, each of the 5 asterisks needs to be replaced with any of the digits $0,2,4,5,6,7$ (digits can repeat) so that the resulting 11-digit number is divisible by 75. In how many ways can this be done?
# Answer: 432. Solution. For a number to be divisible by 75, it is necessary and sufficient that it is divisible by 25 and by 3. To ensure divisibility by 25, we can choose 5 as the last digit (1 way) from the available options. To ensure divisibility by three, we proceed as follows. We will choose three digits arbit...
432
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
4. Plot on the plane $(x ; y)$ the set of points satisfying the equation $|5 x|+|12 y|+|60-5 x-12 y|=60$, and find the area of the resulting figure.
Answer: 30. Solution. Note that the equality $|a|+|b|+|c|=a+b+c$ holds if and only if the numbers $a, b$, and $c$ are non-negative (since if at least one of them is negative, the left side is greater than the right). Therefore, the first equation is equivalent to the system of inequalities $$ \left\{\begin{array} { l...
30
Geometry
math-word-problem
Yes
Yes
olympiads
false
3. In the number $2 * 0 * 1 * 6 * 0 * 2 *$, each of the 6 asterisks needs to be replaced with any of the digits $0,2,4,5,7,9$ (digits can be repeated) so that the resulting 12-digit number is divisible by 12. In how many ways can this be done?
Answer: 5184. Solution. For a number to be divisible by 12, it is necessary and sufficient that it is divisible by 4 and by 3. To ensure divisibility by 4, we can choose 0 or 4 as the last digit from the available options (2 ways). To ensure divisibility by three, we proceed as follows. We will choose four digits arb...
5184
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
4. On the plane $(x ; y)$, plot the set of points satisfying the equation $|4 x|+|3 y|+|24-4 x-3 y|=24$, and find the area of the resulting figure. #
# Answer: 24. Solution. Note that the equality $|a|+|b|+|c|=a+b+c$ holds if and only if the numbers $a, b$, and $c$ are non-negative (since if at least one of them is negative, the left side is greater than the right). Therefore, the first equation is equivalent to the system of inequalities $$ \left\{\begin{array} {...
24
Geometry
math-word-problem
Yes
Yes
olympiads
false
2. Given a regular 20-gon $M$. Find the number of quadruples of vertices of this 20-gon that are the vertices of convex quadrilaterals, which have at least one pair of parallel sides.
Answer: 765. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{20}$ in a circle. Each quadrilateral with a pair of parallel sides is determined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{20}$. Consider a chord connecting two adjacent vertices of the polygon, for example, ...
765
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
3. Find the number of natural numbers $k$, not exceeding 291000, such that $k^{2}-1$ is divisible by 291.
Answer: 4000. Solution. By factoring the dividend and divisor, we get the condition $(k-1)(k+1):(3 \cdot 97)$. This means that one of the numbers $(k+1)$ or $(k-1)$ is divisible by 97. Let's consider two cases. a) $(k+1): 97$, i.e., $k=97 p+96, p \in \mathrm{Z}$. Then we get $(97 p+95)(97 p+97):(3 \cdot 97) \Leftrigh...
4000
Number Theory
math-word-problem
Yes
Yes
olympiads
false
2. Given a regular 16-gon $M$. Find the number of quadruples of vertices of this 16-gon that are the vertices of convex quadrilaterals, which have at least one pair of parallel sides.
Answer: 364. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{16}$ in a circle. Each quadrilateral with a pair of parallel sides is determined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{16}$. Consider a chord connecting two adjacent vertices of the polygon, for example, ...
364
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
3. Find the number of natural numbers $k$, not exceeding 445000, such that $k^{2}-1$ is divisible by 445. Answer: 4000.
Solution. Factoring the dividend and divisor, we get the condition $(k-1)(k+1):(5 \cdot 89)$. This means that one of the numbers $(k+1)$ or $(k-1)$ is divisible by 89. Let's consider two cases. a) $(k+1): 89$, i.e., $k=89 p+88, p \in \mathrm{Z}$. Then we get $(89 p+87)(89 p+89):(5 \cdot 89) \Leftrightarrow(89 p+87)(p+...
4000
Number Theory
math-word-problem
Yes
Yes
olympiads
false
2. Given a regular 22-gon $M$. Find the number of quadruples of vertices of this 22-gon that are the vertices of convex quadrilaterals, which have at least one pair of parallel sides.
Answer: 1045. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{22}$ in a circle. Each quadrilateral with a pair of parallel sides is determined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{22}$. Consider a chord connecting two adjacent vertices of the polygon, for example,...
1045
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
3. Find the number of natural numbers $k$, not exceeding 485000, such that $k^{2}-1$ is divisible by 485.
Answer: 4000. Solution. By factoring the dividend and divisor, we get the condition $(k-1)(k+1):(5 \cdot 97)$. This means that one of the numbers $(k+1)$ or $(k-1)$ is divisible by 97. Let's consider two cases. a) $(k+1): 97$, i.e., $k=97 p+96, p \in \mathrm{Z}$. Then we get $(97 p+95)(97 p+97):(5 \cdot 97) \Leftrigh...
4000
Number Theory
math-word-problem
Yes
Yes
olympiads
false
2. Given a regular 18-gon $M$. Find the number of quadruples of vertices of this 18-gon that are the vertices of convex quadrilaterals, which have at least one pair of parallel sides.
Answer: 540. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{18}$ in a circle. Each quadrilateral with a pair of parallel sides is determined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{18}$. Consider a chord connecting two adjacent vertices of the polygon, for example, ...
540
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
3. Find the number of natural numbers $k$, not exceeding 267000, such that $k^{2}-1$ is divisible by 267.
Answer: 4000. Solution. By factoring the dividend and divisor, we get the condition $(k-1)(k+1):(3 \cdot 89)$. This means that one of the numbers $(k+1)$ or $(k-1)$ is divisible by 89. Let's consider two cases. a) $(k+1): 89$, i.e., $k=89 p+88, p \in \mathbb{Z}$. Then we get $(89 p+87)(89 p+89):(3 \cdot 89) \Leftrigh...
4000
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. Find the number of pairs of integers $(x ; y)$ that satisfy the condition $5 x^{2}-6 x y+y^{2}=6^{100}$.
Answer: 19594. Solution: By factoring the left and right sides of the equation, we get $(5 x-y)(x-y)=2^{100} \cdot 3^{100}$. Since each factor on the left side is an integer, it follows that $$ \left\{\begin{array}{l} 5 x - y = 2 ^ { k } \cdot 3 ^ { l }, \\ x - y = 2 ^ { 1 0 0 - k } \cdot 3 ^ { 1 0 0 - l } \end{array...
19594
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. Find the number of pairs of integers $(x ; y)$ that satisfy the condition $6 x^{2}-7 x y+y^{2}=10^{100}$.
Answer: 19998. Solution: By factoring the left and right sides of the equation, we get $(6 x-y)(x-y)=2^{100} \cdot 5^{100}$. Since each factor on the left side is an integer, it follows that $$ \left\{\begin{array}{l} 6 x - y = 2 ^ { k } \cdot 5 ^ { l } , \\ x - y = 2 ^ { 1 0 0 - k } \cdot 5 ^ { 1 0 0 - l } \end{arra...
19998
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. Find the number of pairs of integers $(x ; y)$ that satisfy the condition $x^{2}+6 x y+5 y^{2}=10^{100}$.
Answer: 19594. Solution: By factoring the left and right sides of the equation, we get $(x+5 y)(x+y)=2^{100} \cdot 5^{100}$. Since each factor on the left side is an integer, it follows that $$ \left\{\begin{array}{l} x+5 y=2^{k} \cdot 5^{l}, \\ x+y=2^{100-k} \cdot 5^{100-l} \end{array} \text { or } \left\{\begin{arr...
19594
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. Find the number of pairs of integers $(x ; y)$ that satisfy the condition $x^{2}+7 x y+6 y^{2}=15^{50}$.
Answer: 4998. Solution: Factoring the left and right sides of the equation, we get $(x+6 y)(x+y)=5^{50} \cdot 3^{50}$. Since each factor on the left side is an integer, it follows that $$ \left\{\begin{array}{l} x+6 y=5^{k} \cdot 3^{l}, \\ x+y=5^{50-k} \cdot 3^{50-l} \end{array} \text { or } \left\{\begin{array}{l} x...
4998
Algebra
math-word-problem
Yes
Yes
olympiads
false
2. Find the number of natural numbers $k$, not exceeding 242400, such that $k^{2}+2 k$ is divisible by 303. Answer: 3200.
Solution. Factoring the dividend and divisor, we get the condition $k(k+2):(3 \cdot 101)$. This means that one of the numbers $k$ or $(k+2)$ is divisible by 101. Let's consider two cases. a) $k: 101$, i.e., $k=101 p, p \in \mathrm{Z}$. Then we get $101 p(101 p+2):(3 \cdot 101) \Leftrightarrow p(101 p+2): 3$. The first...
3200
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. Given a regular 20-gon $M$. Find the number of quadruples of vertices of this 20-gon that are the vertices of trapezoids.
Answer: 720. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{20}$ in a circle. Each trapezoid is defined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{20}$. Consider a chord connecting two adjacent vertices of the polygon, for example, $K_{6} K_{7}$. There are 9 more chord...
720
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
5. Given a regular 16-gon $M$. Find the number of quadruples of vertices of this 16-gon that are the vertices of trapezoids.
Answer: 336. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{16}$ in a circle. Each trapezoid is defined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{16}$. Consider a chord connecting two adjacent vertices of the polygon, for example, $K_{6} K_{7}$. There are 7 more chord...
336
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
2. Find the number of natural numbers $k$, not exceeding 333300, such that $k^{2}-2 k$ is divisible by 303. Answer: 4400.
Solution. Factoring the dividend and divisor, we get the condition $k(k-2):(3 \cdot 101)$. This means that one of the numbers $k$ or $(k-2)$ is divisible by 101. Let's consider two cases. a) $k: 101$, i.e., $k=101 p, p \in \mathrm{Z}$. Then we get $101 p(101 p-2):(3 \cdot 101) \Leftrightarrow p(101 p-2): 3$. The first...
4400
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. Given a regular 22-gon $M$. Find the number of quadruples of vertices of this 22-gon that are the vertices of trapezoids.
Answer: 990. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{22}$ in a circle. Each trapezoid side is defined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{22}$. Consider a chord connecting two adjacent vertices of the polygon, for example, $K_{6} K_{7}$. There are 10 more...
990
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
2. Find the number of natural numbers $k$, not exceeding 454500, such that $k^{2}-k$ is divisible by 505. Answer: 3600.
Solution. Factoring the dividend and divisor, we get the condition $k(k-1):(5 \cdot 101)$. This means that one of the numbers $k$ or $(k-1)$ is divisible by 101. Let's consider two cases. a) $k: 101$, i.e., $k=101 p, p \in \mathrm{Z}$. Then we get $101 p(101 p-1):(5 \cdot 101) \Leftrightarrow p(101 p-1): 5$. The first...
3600
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. Given a regular 18-gon $M$. Find the number of quadruples of vertices of this 18-gon that are the vertices of trapezoids.
Answer: 504. Solution. Let's inscribe the given polygon $K_{1} K_{2} \ldots K_{18}$ in a circle. Each trapezoid is defined by a pair of parallel chords with endpoints at points $K_{1}, \ldots, K_{18}$. Consider a chord connecting two adjacent vertices of the polygon, for example, $K_{6} K_{7}$. There are 8 more chord...
504
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
12. Find the number of integer solutions ( $x ; y ; z$ ) of the equation param 1 , satisfying the condition param 2. | param1 | param2 | | | :---: | :---: | :---: | | $60^{x} \cdot\left(\frac{500}{3}\right)^{y} \cdot 360^{z}=2160$ | $\|x+y+z\| \leq 60$ | | | $60^{x} \cdot\left(\frac{500}{3}\right)^{y} \cdot 360^{z}=...
12. Find the number of integer solutions ( $x ; y ; z$ ) of the equation param 1 , satisfying the condition param 2. | param1 | param2 | Answer | | :---: | :---: | :---: | | $60^{x} \cdot\left(\frac{500}{3}\right)^{y} \cdot 360^{z}=2160$ | $\|x+y+z\| \leq 60$ | 60 | | $60^{x} \cdot\left(\frac{500}{3}\right)^{y} \cdot ...
86
Number Theory
math-word-problem
Yes
Yes
olympiads
false
19. In a football tournament held in a single round-robin format (each team must play each other exactly once), $N$ teams are participating. At some point in the tournament, the coach of team $A$ noticed that any two teams, different from $A$, have played a different number of games. It is also known that by this point...
19. In a football tournament held in a single round-robin format (each team must play every other team exactly once), $N$ teams are participating. At a certain point in the tournament, the coach of team $A$ noticed that any two teams, different from $A$, have played a different number of games. It is also known that by...
63
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
20. On the table, there are param 1 externally identical coins. It is known that among them, there are exactly param 2 counterfeit ones. You are allowed to point to any two coins and ask whether it is true that both these coins are counterfeit. What is the minimum number of questions needed to guarantee getting at leas...
20. On the table, there are param 1 externally identical coins. It is known that among them, there are exactly param 2 counterfeit ones. You are allowed to point to any two coins and ask whether it is true that both these coins are counterfeit. What is the minimum number of questions needed to guarantee getting at leas...
54
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
18. For each natural $n$, which is not a perfect square, the number of values of the variable $x$ is calculated, for which both numbers $x+\sqrt{n}$ and $x^{2}+param1 \cdot \sqrt{n}$ are natural numbers less than param2. Find the total number of such values of $x$. | param1 | param2 | answer | | :---: | :---: | :---: ...
18. For each natural $n$, which is not a perfect square, the number of values of the variable $x$ is calculated, for which both numbers $x+\sqrt{n}$ and $x^{2}+param1 \cdot \sqrt{n}$ are natural numbers less than param2. Find the total number of such values of $x$. | param1 | param2 | answer | | :---: | :---: | :---: ...
108
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. On the table, there are 140 different cards with numbers $3,6,9, \ldots 417,420$ (each card has exactly one number, and each number appears exactly once). In how many ways can 2 cards be chosen so that the sum of the numbers on the selected cards is divisible by $7?$
Answer: 1390. Solution. The given numbers, arranged in ascending order, form an arithmetic progression with a common difference of 3. Therefore, the remainders when these numbers are divided by 7 alternate. Indeed, if one of these numbers is divisible by 7, i.e., has the form $7k$, where $k \in \mathbb{N}$, then the n...
1390
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
5. On the table, there are 210 different cards with numbers $2,4,6, \ldots 418,420$ (each card has exactly one number, and each number appears exactly once). In how many ways can 2 cards be chosen so that the sum of the numbers on the selected cards is divisible by $7?$
Answer: 3135. Solution. The given numbers, arranged in ascending order, form an arithmetic progression with a difference of 2. Therefore, the remainders of these numbers when divided by 7 alternate. Indeed, if one of these numbers is divisible by 7, i.e., has the form $7k$, where $k \in \mathbb{N}$, then the following...
3135
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
5. There are 200 different cards with numbers $2,3,2^{2}, 3^{2}, \ldots, 2^{100}, 3^{100}$ (each card has exactly one number, and each number appears exactly once). In how many ways can 2 cards be chosen so that the product of the numbers on the chosen cards is a cube of an integer?
Answer: 4389. Solution. To obtain the cube of a natural number, it is necessary and sufficient for each factor to enter the prime factorization of the number in a power that is a multiple of 3. Suppose two cards with powers of two are chosen. We have 33 exponents divisible by 3 $(3,6,9, \ldots, 99)$, 34 exponents giv...
4389
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. There are 100 different cards with numbers $2,5,2^{2}, 5^{2}, \ldots, 2^{50}, 5^{50}$ (each card has exactly one number, and each number appears exactly once). In how many ways can 2 cards be chosen so that the product of the numbers on the chosen cards is a cube of an integer?
Answer: 1074. Solution. To obtain the cube of a natural number, it is necessary and sufficient for each factor to enter the prime factorization of the number in a power that is a multiple of 3. Suppose two cards with powers of two are chosen. We have 16 exponents that are divisible by 3 $(3,6,9, \ldots, 48)$, 17 expo...
1074
Number Theory
math-word-problem
Yes
Yes
olympiads
false
9. On the table, there are param 1 externally identical coins. It is known that among them, there are exactly param 2 counterfeit ones. You are allowed to point to any two coins and ask whether it is true that both these coins are counterfeit. What is the minimum number of questions needed to guarantee getting at least...
9. On the table, there are param 1 visually identical coins. It is known that among them, there are exactly param 2 counterfeit ones. You are allowed to point to any two coins and ask whether it is true that both these coins are counterfeit. What is the minimum number of questions needed to guarantee that you will get ...
63
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
19. In a football tournament held in a single round-robin format (each team must play every other team exactly once), $N$ teams are participating. At a certain point in the tournament, the coach of team $A$ noticed that any two teams, different from $A$, have played a different number of games. It is also known that by...
19. In a football tournament held in a single round-robin format (each team must play every other team exactly once), $N$ teams are participating. At a certain point in the tournament, the coach of team $A$ noticed that any two teams, different from $A$, have played a different number of games. It is also known that by...
63
Combinatorics
math-word-problem
Yes
Yes
olympiads
false
4. On the coordinate plane, squares are considered, all vertices of which have integer non-negative coordinates, and the center is located at the point $(60 ; 45)$. Find the number of such squares.
Answer: 2070. Solution. Draw through the given point $(60 ; 45)$ vertical and horizontal lines $(x=60$ and $y=45)$. There are two possible cases. a) The vertices of the square lie on these lines (and its diagonals are parallel to the coordinate axes). Then the "lower" vertex of the square can be located in 45 ways: $...
2070
Geometry
math-word-problem
Yes
Yes
olympiads
false
4. On the coordinate plane, consider squares all of whose vertices have natural coordinates, and the center is located at the point $(55 ; 40)$. Find the number of such squares.
Answer: 1560. Solution. Draw through the given point $(55 ; 40)$ vertical and horizontal lines $(x=55$ and $y=40)$. There are two possible cases. a) The vertices of the square lie on these lines (and its diagonals are parallel to the coordinate axes). Then the "lower" vertex of the square can be located in 39 ways: $...
1560
Geometry
math-word-problem
Yes
Yes
olympiads
false
4. Find the number of pairs of integers $(x ; y)$ that satisfy the equation $x^{2}+x y=30000000$.
Answer: 256. Solution. By factoring the left and right sides of the equation, we get $x(x+y)=$ $3 \cdot 2^{7} \cdot 5^{7}$. Then, if $x>0$, $x$ is one of the divisors of the right side. The right side has a total of $2 \cdot 8 \cdot 8=128$ divisors (since any divisor can be represented as $3^{a} \cdot 2^{b} \cdot 5^{c...
256
Algebra
math-word-problem
Yes
Yes
olympiads
false
5. Find the number of pairs of integers $(a ; b)$ such that $1 \leqslant a \leqslant 70, 1 \leqslant b \leqslant 50$, and at the same time, the area $S$ of the figure defined by the system of inequalities $$ \left\{\begin{array}{l} \frac{x}{a}+\frac{y}{b} \geqslant 1 \\ x \leqslant a \\ y \leqslant b \end{array}\right...
Answer: 1260. Solution. The given system of inequalities defines a triangle on the plane with vertices $(a ; 0),(0 ; b)$, and $(a ; b)$. This triangle is right-angled, and its doubled area is equal to the product of the legs, i.e., $a b$. According to the condition, $a b \vdots 5$, so one of the numbers $a$ or $b$ mus...
1260
Geometry
math-word-problem
Yes
Yes
olympiads
false
1. It is known that for three consecutive natural values of the argument, the quadratic function $f(x)$ takes the values 6, 14, and 14, respectively. Find the greatest possible value of $f(x)$.
Answer: 15. Solution. Let $n, n+1, n+2$ be the three given consecutive values of the argument. Since a quadratic function takes the same values at points symmetric with respect to the x-coordinate of the vertex of the parabola $x_{\text{v}}$, then $x_{\text{v}}=n+1.5$, and thus $f(x)$ can be represented as $f(x)=a(x-n...
15
Algebra
math-word-problem
Yes
Yes
olympiads
false
3. Two equal rectangles $P Q R S$ and $P_{1} Q_{1} R_{1} S_{1}$ are inscribed in triangle $A B C$ (with points $P$ and $P_{1}$ lying on side $A B$, points $Q$ and $Q_{1}$ lying on side $B C$, and points $R, S, R_{1}$ and $S_{1}$ lying on side $A C$). It is known that $P S=3, P_{1} S_{1}=9$. Find the area of triangle $A...
Answer: 72. Solution. Draw the height $B F$ of triangle $A B C$. Let it intersect segments $P Q$ and $P_{1} Q_{1}$ at points $H$ and $M$ respectively. Note that $H M=6$. From the similarity of triangles $B P Q$ and $B P_{1} Q_{1}$, it follows that $\frac{B H}{P Q}=\frac{B M}{P_{1} Q_{1}}$ (the ratio of the height to t...
72
Geometry
math-word-problem
Yes
Yes
olympiads
false
4. Find the number of pairs of integers $(x ; y)$ that satisfy the equation $y^{2}-x y=700000000$.
Answer: 324. Solution. Factoring the left and right sides of the equation, we get $y(y-x)=$ $7 \cdot 2^{8} \cdot 5^{8}$. Then if $y>0$, $y$ is one of the divisors of the right side. The right side has a total of $2 \cdot 9 \cdot 9=162$ divisors (since any divisor can be represented as $7^{a} \cdot 2^{b} \cdot 5^{c}$, ...
324
Number Theory
math-word-problem
Yes
Yes
olympiads
false
5. Find the number of pairs of integers $(a ; b)$ such that $1 \leqslant a \leqslant 80,1 \leqslant b \leqslant 30$, and the area $S$ of the figure defined by the system of inequalities $$ \left\{\begin{array}{l} \frac{x}{a}+\frac{y}{b} \geqslant 1 \\ x \leqslant a \\ y \leqslant b \end{array}\right. $$ is such that ...
Answer: 864. Solution. The given system of inequalities defines a triangle on the plane with vertices $(a ; 0),(0 ; b)$, and $(a ; b)$. This triangle is right-angled, and its doubled area is equal to the product of the legs, i.e., $a b$. According to the condition, $a b: 5$, so one of the numbers $a$ or $b$ must be di...
864
Geometry
math-word-problem
Yes
Yes
olympiads
false
3. Find the number of natural numbers $k$, not exceeding 267000, such that $k^{2}-1$ is divisible by 267. Answer: 4000.
Solution. Factoring the dividend and divisor, we get the condition $(k-1)(k+1):(3 \cdot 89)$. This means that one of the numbers $(k+1)$ or $(k-1)$ is divisible by 89. Let's consider two cases. a) $(k+1): 89$, i.e., $k=89 p+88, p \in \mathrm{Z}$. Then we get $(89 p+87)(89 p+89):(3 \cdot 89) \Leftrightarrow(89 p+87)(p+...
4000
Number Theory
math-word-problem
Yes
Yes
olympiads
false
3. Find the number of natural numbers $k$, not exceeding 242400, such that $k^{2}+2 k$ is divisible by 303.
Answer: 3200. Solution. By factoring the dividend and divisor, we get the condition $k(k+2):(3 \cdot 101)$. This means that one of the numbers $k$ or $(k+2)$ is divisible by 101. Let's consider two cases. a) $k: 101$, i.e., $k=101 p, p \in \mathbb{Z}$. Then we get $101 p(101 p+2):(3 \cdot 101) \Leftrightarrow p(101 p...
3200
Number Theory
math-word-problem
Yes
Yes
olympiads
false
3. Find the number of natural numbers $k$, not exceeding 353500, such that $k^{2}+k$ is divisible by 505.
Answer: 2800. Solution: By factoring the dividend and divisor, we get the condition $k(k+1):(5 \cdot 101)$. This means that one of the numbers $k$ or $(k+1)$ is divisible by 101. Let's consider two cases. a) $k: 101$, i.e., $k=101 p, p \in \mathbb{Z}$. Then we get $101 p(101 p+1):(5 \cdot 101) \Leftrightarrow p(101 p...
2800
Number Theory
math-word-problem
Yes
Yes
olympiads
false