question stringlengths 35 2.07k | thinking stringlengths 2.4k 2.9k | answer stringlengths 1 261 | id int64 5 93.7k | content stringlengths 2.41k 3.02k | id_ stringlengths 3 6 |
|---|---|---|---|---|---|
Let's determine the value of the parameter $k$ such that the roots of the following equation, when listed in ascending order, have the same difference between each pair of consecutive roots.
$$
4 x^{4}-(4 k+13) x^{2}+(9 k+9)=0
$$ | <think>I. solution. Our equation is quadratic in terms of $x^{2}$, and it can have at most two solutions for $x^{2}$. If these solutions are real, distinct, and positive, then we will get four roots for $x$, which are equal in absolute value in pairs. (1) can be rewritten as:
$$
x^{4}-\left(\frac{13}{4}+k\right) x^{2}... | k_{1}=-\frac{3}{4},k_{2}=\frac{77}{4} | 83,095 | <think>I. solution. Our equation is quadratic in terms of $x^{2}$, and it can have at most two solutions for $x^{2}$. If these solutions are real, distinct, and positive, then we will get four roots for $x$, which are equal in absolute value in pairs. (1) can be rewritten as:
$$
x^{4}-\left(\frac{13}{4}+k\right) x^{2}... | 1_0 |
In a square $ABCD$ of diagonals $AC$ and $BD$, we call $O$ at the center of the square. A square $PQRS$ is constructed with sides parallel to those of $ABCD$ with $P$ in segment $AO, Q$ in segment $BO, R$ in segment $CO, S$ in segment $DO$. If area of $ABCD$ equals two times the area of $PQRS$, and $M$ is the midpoi... | <think>1. **Define the coordinates of the square \(ABCD\):**
- Let \(A(0,0)\), \(B(1,0)\), \(C(1,1)\), and \(D(0,1)\).
- The center \(O\) of the square \(ABCD\) is at \(\left(\frac{1}{2}, \frac{1}{2}\right)\).
2. **Define the coordinates of the square \(PQRS\):**
- Since \(PQRS\) is a smaller square with side... | \frac{45^\circ}{2} | 49,494 | <think>1. **Define the coordinates of the square \(ABCD\):**
- Let \(A(0,0)\), \(B(1,0)\), \(C(1,1)\), and \(D(0,1)\).
- The center \(O\) of the square \(ABCD\) is at \(\left(\frac{1}{2}, \frac{1}{2}\right)\).
2. **Define the coordinates of the square \(PQRS\):**
- Since \(PQRS\) is a smaller square with side... | 1_1 |
## Task 4 - 260924
For a right triangle $A B C$ with the right angle at $C$, it is required that this right angle be divided into four equal angles by the median of side $A B$, the angle bisector of $\angle A C B$, and the altitude perpendicular to side $A B$.
Investigate whether there exists a triangle $A B C$ that ... | <think>Let $W$ be the intersection of the angle bisector with $AB$, $H$ the foot of the perpendicular from $C$ to $AB$, and $M$ the midpoint of the segment $AB$.
Since the angle bisector divides the right angle at $C$ into the two angles $\angle A C W = \angle W C B = 45^{\circ}$, the altitude and the median must bise... | \angleBAC=22.5,\angleABC=67.5 | 52,034 | <think>Let $W$ be the intersection of the angle bisector with $AB$, $H$ the foot of the perpendicular from $C$ to $AB$, and $M$ the midpoint of the segment $AB$.
Since the angle bisector divides the right angle at $C$ into the two angles $\angle A C W = \angle W C B = 45^{\circ}$, the altitude and the median must bise... | 1_2 |
B1. Determine the smallest possible value of the expression $\left|25^{m}-36^{n}\right|$, where $m$ and $n$ are natural numbers. | <think>B1. By considering $25=5^{2}$ and $36=6^{2}$, the expression can be factored as
$$
\left|25^{m}-36^{n}\right|=\left|5^{2 m}-6^{2 n}\right|=\left|\left(5^{m}\right)^{2}-\left(6^{n}\right)^{2}\right|=\left|\left(5^{m}+6^{n}\right)\left(5^{m}-6^{n}\right)\right|=\left(5^{m}+6^{n}\right)\left|\left(5^{m}-6^{n}\righ... | 11 | 41,038 | <think>B1. By considering $25=5^{2}$ and $36=6^{2}$, the expression can be factored as
$$
\left|25^{m}-36^{n}\right|=\left|5^{2 m}-6^{2 n}\right|=\left|\left(5^{m}\right)^{2}-\left(6^{n}\right)^{2}\right|=\left|\left(5^{m}+6^{n}\right)\left(5^{m}-6^{n}\right)\right|=\left(5^{m}+6^{n}\right)\left|\left(5^{m}-6^{n}\righ... | 1_3 |
In a room there are $144$ people. They are joined by $n$ other people who are each carrying $k$ coins. When these coins are shared among all $n + 144$ people, each person has $2$ of these coins. Find the minimum possible value of $2n + k$. | <think>1. Let the number of people initially in the room be \(144\).
2. Let \(n\) be the number of additional people who join the room.
3. Each of these \(n\) additional people is carrying \(k\) coins.
4. When these coins are shared among all \(n + 144\) people, each person has \(2\) coins.
We need to find the minimum... | 50 | 30,969 | <think>1. Let the number of people initially in the room be \(144\).
2. Let \(n\) be the number of additional people who join the room.
3. Each of these \(n\) additional people is carrying \(k\) coins.
4. When these coins are shared among all \(n + 144\) people, each person has \(2\) coins.
We need to find the minimum... | 1_4 |
11. (This sub-question is worth 20 points) It is known that any positive integer $n$ can be uniquely represented as
$$
n=a_{0}+a_{1} 9+a_{2} 9^{2}+\cdots+a_{m} 9^{m}
$$
where $m$ is a non-negative integer, $a_{j} \in\{0,1, \cdots, 8\}(j=0,1, \cdots, m-1), a_{m} \in\{1, \cdots, 8\}$. Find the sum of all positive intege... | <think>Let $A$ and $B$ denote the sets of all positive integers that form strictly increasing and decreasing sequences, respectively, in $(*)$. The symbol $S(M)$ represents the sum of all numbers in the set $M$, and the positive integers satisfying $(*)$ are denoted as:
$$
n=\overline{a_{m} a_{m-1} \cdots a_{1} a_{0}}
... | 984374748 | 59,590 | <think>Let $A$ and $B$ denote the sets of all positive integers that form strictly increasing and decreasing sequences, respectively, in $(*)$. The symbol $S(M)$ represents the sum of all numbers in the set $M$, and the positive integers satisfying $(*)$ are denoted as:
$$
n=\overline{a_{m} a_{m-1} \cdots a_{1} a_{0}}
... | 1_5 |
13.3.27 Given two concentric circles in a plane with radii $R$ and $r$ ($R > r$). Let $P$ be a fixed point on the smaller circle, $B$ be a moving point on the larger circle, and the line $BP$ intersects the larger circle at another point $C$. The line $l$ through point $P$ and perpendicular to $BP$ intersects the small... | <think>(1) As shown in the figure, establish a Cartesian coordinate system with the centers of the two circles as the origin, so that point $P$ is on the negative half-axis of the $x$-axis. Then the coordinates of point $P$ are $(-r, 0)$, and the equations of the two circles are: $x^{2}+y^{2}=R^{2}$, $x^{2}+y^{2}=r^{2}... | 6R^2+2r^2 | 93,351 | <think>(1) As shown in the figure, establish a Cartesian coordinate system with the centers of the two circles as the origin, so that point $P$ is on the negative half-axis of the $x$-axis. Then the coordinates of point $P$ are $(-r, 0)$, and the equations of the two circles are: $x^{2}+y^{2}=R^{2}$, $x^{2}+y^{2}=r^{2}... | 1_6 |
Let's check the following equalities, look for regularities in the table, and based on that, write down the next two rows of the table.
$$
\begin{aligned}
3^{2}+4^{2} & =5^{2} \\
10^{2}+11^{2}+12^{2} & =13^{2}+14^{2} \\
21^{2}+22^{2}+23^{2}+24^{2} & =25^{2}+26^{2}+27^{2} \\
36^{2}+37^{2}+38^{2}+39^{2}+40^{2} & =41^{2}... | <think>The equalities hold, the values on both sides in the subsequent rows are 25, 365, 2030, 7230, respectively.
In each row, the squares of consecutive natural numbers are listed, the number of terms in the subsequent rows is 3, 5, 7, 9, and on the left side, there is always one more term than on the right side. Ac... | \begin{aligned}55^{2}+56^{2}+57^{2}+58^{2}+59^{2}+60^{2}&=61^{2}+62^{2}+63^{2}+64^{2}+65^{2}\\78^{2}+79^{2}+80^{2}+81^{2}+8 | 9,243 | <think>The equalities hold, the values on both sides in the subsequent rows are 25, 365, 2030, 7230, respectively.
In each row, the squares of consecutive natural numbers are listed, the number of terms in the subsequent rows is 3, 5, 7, 9, and on the left side, there is always one more term than on the right side. Ac... | 1_7 |
Two candidates participated in an election with $p+q$ voters. Candidate $A$ received $p$ votes and candidate $B$ received $q$ votes, with $p>q$. During the counting, only one vote is recorded at a time on a board. Let $r$ be the probability that the number associated with candidate $A$ on the board is always greater th... | <think>Solution
a) We can make lists with the letters $A$ and $B$ representing the possible orders of votes counted. For example, the list $A A B A B$ indicates that the first two and the fourth votes counted were for candidate $A$, the third and fifth for candidate $B$. There are exactly 10 lists with 3 letters $A$ a... | \frac{1}{2019} | 82,167 | <think>Solution
a) We can make lists with the letters $A$ and $B$ representing the possible orders of votes counted. For example, the list $A A B A B$ indicates that the first two and the fourth votes counted were for candidate $A$, the third and fifth for candidate $B$. There are exactly 10 lists with 3 letters $A$ a... | 1_8 |
2. Determine the largest possible number of non-empty, pairwise disjoint sets with the same sum of elements, into which the set can be divided:
a) $\{1,2, \ldots, 2017\}$,
b) $\{1,2, \ldots, 2018\}$.
If a set consists of a single number, we consider it as the sum of its elements. | <think>SOLUTION. Let's first look at the sets with the smallest possible number of elements; we can probably have at most one one-element set - otherwise, those two one-element sets would not have the same sum of elements. The other sets are therefore at least two-element.
In part a), let's take the one-element set to... | 1009 | 24,894 | <think>SOLUTION. Let's first look at the sets with the smallest possible number of elements; we can probably have at most one one-element set - otherwise, those two one-element sets would not have the same sum of elements. The other sets are therefore at least two-element.
In part a), let's take the one-element set to... | 1_9 |
Let be given a triangle $ABC$ and points $D,M,N$ belong to $BC,AB,AC$, respectively. Suppose that $MD$ is parallel to $AC$ and $ND$ is parallel to $AB$. If $S_{\vartriangle BMD} = 9$ cm $^2, S_{\vartriangle DNC} = 25$ cm$^2$, compute $S_{\vartriangle AMN}$?
| <think>1. **Assign coordinates to points:**
Let \( A(0,0) \), \( B(b,0) \), and \( C(a,c) \).
Choose \( M(\lambda,0) \) on \( AB \), then \( D \) on \( BC \) and \( N \) on \( AC \).
2. **Determine coordinates of \( D \) and \( N \):**
Since \( MD \parallel AC \), the coordinates of \( D \) can be expressed ... | 15 \, \text{cm}^2 | 33,696 | <think>1. **Assign coordinates to points:**
Let \( A(0,0) \), \( B(b,0) \), and \( C(a,c) \).
Choose \( M(\lambda,0) \) on \( AB \), then \( D \) on \( BC \) and \( N \) on \( AC \).
2. **Determine coordinates of \( D \) and \( N \):**
Since \( MD \parallel AC \), the coordinates of \( D \) can be expressed ... | 1_10 |
8. $n$ chess players participate in a chess tournament, with each pair of players competing in one match. The rules are: the winner gets 1 point, the loser gets 0 points, and in the case of a draw, both players get 0.5 points. If it is found after the tournament that among any $m$ players, there is one player who has w... | <think>8. First, prove two lemmas.
Lemma 1 When $n \geqslant m$, if the match results of $n$ players have property $P(m)$, then there must be a player who wins all others.
Proof of Lemma 1: When $n=m$, the proposition is obviously true.
Assume the proposition holds for $n$.
Then for $n+1$ players, choose any $n$ playe... | 2m-3 | 90,971 | <think>8. First, prove two lemmas.
Lemma 1 When $n \geqslant m$, if the match results of $n$ players have property $P(m)$, then there must be a player who wins all others.
Proof of Lemma 1: When $n=m$, the proposition is obviously true.
Assume the proposition holds for $n$.
Then for $n+1$ players, choose any $n$ playe... | 1_11 |
Example 6. Solve the system of differential equations
$$
\left\{\begin{array}{l}
x^{\prime}=3 x+4 y+2 z \\
y^{\prime}=x+4 y+z \\
z^{\prime}=4 x+6 y+5 z
\end{array}\right.
$$ | <think>Solution. The characteristic equation of the matrix $A=\left(\begin{array}{lll}3 & 4 & 2 \\ 1 & 4 & 1 \\ 4 & 6 & 5\end{array}\right)$ is: $\left|\begin{array}{ccc}3-\lambda & 4 & 2 \\ 1 & 4-\lambda & 1 \\ 4 & 6 & 5-\lambda\end{array}\right|=0$, or $(3-\lambda)(4-\lambda) \times$ $\times(5-\lambda)+12+16-6(3-\lam... | {\begin{pmatrix}C_{1}e^{}&+7C_{3}e^{9}\\&C_{2}e^{2}+4C_{3}e^{9}\\-C_{1}e^{}-2C_{2}e^{2}+13C_{3}e^{9}\end{pmatrix}.} | 76,054 | <think>Solution. The characteristic equation of the matrix $A=\left(\begin{array}{lll}3 & 4 & 2 \\ 1 & 4 & 1 \\ 4 & 6 & 5\end{array}\right)$ is: $\left|\begin{array}{ccc}3-\lambda & 4 & 2 \\ 1 & 4-\lambda & 1 \\ 4 & 6 & 5-\lambda\end{array}\right|=0$, or $(3-\lambda)(4-\lambda) \times$ $\times(5-\lambda)+12+16-6(3-\lam... | 1_12 |
Find the smallest real number $p$ such that the inequality $\sqrt{1^2+1}+\sqrt{2^2+1}+...+\sqrt{n^2+1} \le \frac{1}{2}n(n+p)$ holds for all natural numbers $n$. | <think>1. We start with the given inequality:
\[
\sum_{x=1}^n \sqrt{x^2 + 1} \leq \frac{n(n + p)}{2}
\]
for all natural numbers \( n \).
2. To find the smallest \( p \), we first transform the inequality:
\[
\sum_{x=1}^n (\sqrt{x^2 + 1} - x) \leq \frac{n(n + p)}{2} - \sum_{x=1}^n x
\]
Simplifyi... | 2\sqrt{2} - 1 | 19,024 | <think>1. We start with the given inequality:
\[
\sum_{x=1}^n \sqrt{x^2 + 1} \leq \frac{n(n + p)}{2}
\]
for all natural numbers \( n \).
2. To find the smallest \( p \), we first transform the inequality:
\[
\sum_{x=1}^n (\sqrt{x^2 + 1} - x) \leq \frac{n(n + p)}{2} - \sum_{x=1}^n x
\]
Simplifyi... | 1_13 |
Let $c$ be the constant number such that $c>1.$Find the least area of the figure surrounded by the line passing through the point $(1,\ c)$ and the palabola $y=x^{2}$ on $x-y$ plane. | <think>1. **Equation of the Line:**
The equation of the line \( L \) passing through the point \((1, c)\) with slope \( m \) is given by:
\[
y = m(x - 1) + c
\]
2. **Intersection Points:**
Let \((a, a^2)\) and \((b, b^2)\) be the points of intersection of the line \( L \) and the parabola \( y = x^2 \).... | \frac{4}{3} (c - 1)^{3/2} | 32,369 | <think>1. **Equation of the Line:**
The equation of the line \( L \) passing through the point \((1, c)\) with slope \( m \) is given by:
\[
y = m(x - 1) + c
\]
2. **Intersection Points:**
Let \((a, a^2)\) and \((b, b^2)\) be the points of intersection of the line \( L \) and the parabola \( y = x^2 \).... | 1_14 |
Seven people of seven different ages are attending a meeting. The seven people leave the meeting one at a
time in random order. Given that the youngest person leaves the meeting sometime before the oldest
person leaves the meeting, the probability that the third, fourth, and fifth people to leave the meeting do so in ord... | <think>1. **Determine the total number of possible orders:**
The total number of ways the seven people can leave the meeting is \(7!\). Since the youngest person must leave before the oldest person, we divide by 2 (due to symmetry), giving us:
\[
\frac{7!}{2} = \frac{5040}{2} = 2520
\]
2. **Define the peop... | 25 | 13,960 | <think>1. **Determine the total number of possible orders:**
The total number of ways the seven people can leave the meeting is \(7!\). Since the youngest person must leave before the oldest person, we divide by 2 (due to symmetry), giving us:
\[
\frac{7!}{2} = \frac{5040}{2} = 2520
\]
2. **Define the peop... | 1_15 |
1・185 On the blackboard, there are natural numbers $1,2,3, \cdots, n$, where $n \geqslant 3$. Each time, it is allowed to erase any two numbers $p$ and $q$, and replace them with $p+q$ and $|p-q|$. After such several rewrites, all the numbers on the blackboard become $k$. What values can $k$ possibly be? | <think>[Solution] Let $s$ be any natural number satisfying the inequality $2^{s} \geqslant n$.
Obviously, after each step, non-negative integers will be written on the blackboard. If the sum and difference of two non-negative integers can both be divided by an odd number $d$, then these two numbers themselves can also ... | 2^{} | 33,330 | <think>[Solution] Let $s$ be any natural number satisfying the inequality $2^{s} \geqslant n$.
Obviously, after each step, non-negative integers will be written on the blackboard. If the sum and difference of two non-negative integers can both be divided by an odd number $d$, then these two numbers themselves can also ... | 1_16 |
4. Let M be a set of six distinct positive integers whose sum is 60. We will write all of them on the faces of a cube, with exactly one on each face. In one step, we choose any three faces of the cube that share a common vertex and increase each of the numbers on these three faces by 1. Determine the number of all such... | <think>4. Let the faces of the cube be denoted by $S_{1}, S_{2}, \ldots, S_{6}$ such that face $S_{1}$ is opposite to face $S_{6}$, face $S_{2}$ is opposite to $S_{5}$, and $S_{3}$ is opposite to $S_{4}$. Let the number on face $S_{i}$ be denoted by $c_{i}$. Clearly, any vertex of the cube belongs to exactly one pair o... | 84 | 33,580 | <think>4. Let the faces of the cube be denoted by $S_{1}, S_{2}, \ldots, S_{6}$ such that face $S_{1}$ is opposite to face $S_{6}$, face $S_{2}$ is opposite to $S_{5}$, and $S_{3}$ is opposite to $S_{4}$. Let the number on face $S_{i}$ be denoted by $c_{i}$. Clearly, any vertex of the cube belongs to exactly one pair o... | 1_17 |
Solve the following system of equations:
$$
\begin{aligned}
& \left|a_{1}-a_{2}\right| \cdot x_{2}+\left|a_{1}-a_{3}\right| \cdot x_{3}+\left|a_{1}-a_{4}\right| \cdot x_{4}=1 \\
& \left|a_{2}-a_{1}\right| \cdot x_{1} \quad+\left|a_{2}-a_{3}\right| \cdot x_{3}+\left|a_{2}-a_{4}\right| \cdot x_{4}=1 \\
& \left|a_{3}-a_{... | <think>) First, we solve the system for the case of the parameter size relationship $a_{1}<a_{2}<a_{3}<a_{4}$. We will reduce other cases to this one. (I) is thus structured:
$$
\begin{array}{ccc}
\quad\left(a_{2}-a_{1}\right) x_{2} & +\left(a_{3}-a_{1}\right) x_{3}+\left(a_{4}-a_{1}\right) x_{4} & =1 \\
\left(a_{2}-a... | x_{}=x_{k}=\frac{1}{a_{k}-a_{}},\quadx_{i}=x_{j}=0 | 58,318 | <think>) First, we solve the system for the case of the parameter size relationship $a_{1}<a_{2}<a_{3}<a_{4}$. We will reduce other cases to this one. (I) is thus structured:
$$
\begin{array}{ccc}
\quad\left(a_{2}-a_{1}\right) x_{2} & +\left(a_{3}-a_{1}\right) x_{3}+\left(a_{4}-a_{1}\right) x_{4} & =1 \\
\left(a_{2}-a... | 1_18 |
Suppose three direction on the plane . We draw $ 11$ lines in each direction . Find maximum number of the points on the plane which are on three lines . | <think>1. **Affine Transformation and Line Directions**:
By an affine transformation, we can assume that the three directions of the lines are:
- Parallel to the \(x\)-axis.
- Parallel to the \(y\)-axis.
- Parallel to the line \(x = y\).
2. **Formation of the Grid**:
Fix the lines of the first two group... | 91 | 88,240 | <think>1. **Affine Transformation and Line Directions**:
By an affine transformation, we can assume that the three directions of the lines are:
- Parallel to the \(x\)-axis.
- Parallel to the \(y\)-axis.
- Parallel to the line \(x = y\).
2. **Formation of the Grid**:
Fix the lines of the first two group... | 1_19 |
Consider the polynomial $P(x)=x^3+x^2-x+2$. Determine all real numbers $r$ for which there exists a complex number $z$ not in the reals such that $P(z)=r$. | <think>1. Given the polynomial \( P(x) = x^3 + x^2 - x + 2 \), we need to determine all real numbers \( r \) for which there exists a complex number \( z \) (not in the reals) such that \( P(z) = r \).
2. If \( P(z) = r \), then we have:
\[
z^3 + z^2 - z + 2 = r \implies z^3 + z^2 - z + 2 - r = 0
\]
Let \(... | r \in (-\infty, \frac{49}{27}) \cup (3, \infty) | 81,992 | <think>1. Given the polynomial \( P(x) = x^3 + x^2 - x + 2 \), we need to determine all real numbers \( r \) for which there exists a complex number \( z \) (not in the reals) such that \( P(z) = r \).
2. If \( P(z) = r \), then we have:
\[
z^3 + z^2 - z + 2 = r \implies z^3 + z^2 - z + 2 - r = 0
\]
Let \(... | 1_20 |
[b]Q14.[/b] Let be given a trinagle $ABC$ with $\angle A=90^o$ and the bisectrices of angles $B$ and $C$ meet at $I$. Suppose that $IH$ is perpendicular to $BC$ ($H$ belongs to $BC$). If $HB=5 \text{cm}, \; HC=8 \text{cm}$, compute the area of $\triangle ABC$. | <think>1. Given a right triangle \( \triangle ABC \) with \( \angle A = 90^\circ \), the incenter \( I \) is the intersection of the angle bisectors of \( \angle B \) and \( \angle C \). The perpendicular from \( I \) to \( BC \) meets \( BC \) at \( H \), with \( HB = 5 \) cm and \( HC = 8 \) cm.
2. The lengths \( HB... | 40 | 74,803 | <think>1. Given a right triangle \( \triangle ABC \) with \( \angle A = 90^\circ \), the incenter \( I \) is the intersection of the angle bisectors of \( \angle B \) and \( \angle C \). The perpendicular from \( I \) to \( BC \) meets \( BC \) at \( H \), with \( HB = 5 \) cm and \( HC = 8 \) cm.
2. The lengths \( HB... | 1_21 |
Call a pair of integers $(a,b)$ [i]primitive[/i] if there exists a positive integer $\ell$ such that $(a+bi)^\ell$ is real. Find the smallest positive integer $n$ such that less than $1\%$ of the pairs $(a, b)$ with $0 \le a, b \le n$ are primitive.
[i]Proposed by Mehtaab Sawhney[/i] | <think>1. **Understanding the Problem:**
We need to find the smallest positive integer \( n \) such that less than \( 1\% \) of the pairs \((a, b)\) with \( 0 \le a, b \le n \) are primitive. A pair \((a, b)\) is called primitive if there exists a positive integer \(\ell\) such that \((a + bi)^\ell\) is real.
2. **... | 299 | 35,548 | <think>1. **Understanding the Problem:**
We need to find the smallest positive integer \( n \) such that less than \( 1\% \) of the pairs \((a, b)\) with \( 0 \le a, b \le n \) are primitive. A pair \((a, b)\) is called primitive if there exists a positive integer \(\ell\) such that \((a + bi)^\ell\) is real.
2. **... | 1_22 |
Let's determine the base $x$ of the number system if the following equation holds:
$$
2016_{x}=x^{3}+2 x+342
$$ | <think>I. solution. $x$ is a positive integer greater than 6, because the number written in base $x$ contains the digit 6. Since $2016_{x}=2 x^{3}+x+6$, we can write the following equation:
$$
\begin{aligned}
2 x^{3}+x+6 & =x^{3}+2 x+342 \\
x^{3}-x-336 & =0
\end{aligned}
$$
Let's examine the solutions of the equation... | 7 | 11,200 | <think>I. solution. $x$ is a positive integer greater than 6, because the number written in base $x$ contains the digit 6. Since $2016_{x}=2 x^{3}+x+6$, we can write the following equation:
$$
\begin{aligned}
2 x^{3}+x+6 & =x^{3}+2 x+342 \\
x^{3}-x-336 & =0
\end{aligned}
$$
Let's examine the solutions of the equation... | 1_23 |
Example. Find the work of the force
\[
\vec{F}=(x-y) \vec{i}+\vec{j}
\]
when moving along the curve \( L \)
\[
x^{2}+y^{2}=4 \quad(y \geq 0)
\]
from point \( M(2,0) \) to point \( N(-2,0) \). | <think>Solution.
1. The work $A$ of a force field is equal to the line integral of the second kind along the curve $L$:
$$
A=\int_{L}(\vec{F}, d \vec{r})=\int_{L}(x-y) d x+d y
$$
2. We compute the line integral. For this:
a) since $L$ is the upper semicircle, its parametric equations are written as
$$
\left\{\begi... | 2\pi | 51,447 | <think>Solution.
1. The work $A$ of a force field is equal to the line integral of the second kind along the curve $L$:
$$
A=\int_{L}(\vec{F}, d \vec{r})=\int_{L}(x-y) d x+d y
$$
2. We compute the line integral. For this:
a) since $L$ is the upper semicircle, its parametric equations are written as
$$
\left\{\begi... | 1_24 |
$1 \cdot 60$ Find the smallest positive integer $n>1$, such that the arithmetic mean of $1^{2}, 2^{2}, 3^{2}, \cdots, n^{2}$ is a perfect square. | <think>【Solution】Let
$$
\frac{1^{2}+2^{2}+\cdots+n^{2}}{n}=k^{2}
$$
where $k \in \mathbb{N}$. That is,
$$
\frac{1}{6}(n+1)(2 n+1)=k^{2}
$$
Since $n \geqslant 2$, we have
$$
\frac{1}{6}(n+1)(2 n+1) \geqslant \frac{5}{2},
$$
thus
$$
\begin{array}{l}
k^{2} \geqslant \frac{5}{2}, \\
k \geqslant 2.
\end{array}
$$
Since ... | 337 | 79,532 | <think>【Solution】Let
$$
\frac{1^{2}+2^{2}+\cdots+n^{2}}{n}=k^{2}
$$
where $k \in \mathbb{N}$. That is,
$$
\frac{1}{6}(n+1)(2 n+1)=k^{2}
$$
Since $n \geqslant 2$, we have
$$
\frac{1}{6}(n+1)(2 n+1) \geqslant \frac{5}{2},
$$
thus
$$
\begin{array}{l}
k^{2} \geqslant \frac{5}{2}, \\
k \geqslant 2.
\end{array}
$$
Since ... | 1_25 |
Find all functions \( f: \mathbb{R} \rightarrow \mathbb{R} \) that satisfy the conditions
\[ f(1+x y)-f(x+y)=f(x) f(y) \quad \text{for all } x, y \in \mathbb{R} \]
and \( f(-1) \neq 0 \). | <think>The only solution is the function $f(x)=x-1, x \in \mathbb{R}$. We set $g(x)=f(x)+1$ and show that $g(x)=x$ for all real $x$. The conditions take the form
$$ g(1+x y)-g(x+y)=(g(x)-1)(g(y)-1) \quad \text { for all } x, y \in \mathbb{R} \text { and } g(-1) \neq 1 $$
Denote $C=g(-1)-1 \neq 0$. Setting $y=-1$ in (... | f(x)=x-1, x \in \mathbb{R} | 58,611 | <think>The only solution is the function $f(x)=x-1, x \in \mathbb{R}$. We set $g(x)=f(x)+1$ and show that $g(x)=x$ for all real $x$. The conditions take the form
$$ g(1+x y)-g(x+y)=(g(x)-1)(g(y)-1) \quad \text { for all } x, y \in \mathbb{R} \text { and } g(-1) \neq 1 $$
Denote $C=g(-1)-1 \neq 0$. Setting $y=-1$ in (... | 1_26 |
We define the weight $W$ of a positive integer as follows: $W(1) = 0$, $W(2) = 1$, $W(p) = 1 + W(p + 1)$ for every odd prime $p$, $W(c) = 1 + W(d)$ for every composite $c$, where $d$ is the greatest proper factor of $c$. Compute the greatest possible weight of a positive integer less than 100. | <think>To solve the problem, we need to compute the weight \( W(n) \) for positive integers \( n \) and determine the greatest possible weight for \( n < 100 \). The weight function \( W \) is defined recursively as follows:
- \( W(1) = 0 \)
- \( W(2) = 1 \)
- \( W(p) = 1 + W(p + 1) \) for every odd prime \( p \)
- \( ... | 12 | 34,028 | <think>To solve the problem, we need to compute the weight \( W(n) \) for positive integers \( n \) and determine the greatest possible weight for \( n < 100 \). The weight function \( W \) is defined recursively as follows:
- \( W(1) = 0 \)
- \( W(2) = 1 \)
- \( W(p) = 1 + W(p + 1) \) for every odd prime \( p \)
- \( ... | 1_27 |
Suppose for independent events $A_{2}, A_{3}, \ldots, A_{n}$,
$$
P\left(A_{i}\right)=\frac{1}{2 i^{2}}
$$
What is the probability that an odd number of the events $A_{2}, A_{3}, \ldots, A_{n}$ occur? | <think>I. solution. Let $p_{n}$ be the probability asked for in the problem. Among the events $A_{2}, A_{3}, \ldots, A_{n+1}$, an odd number will occur either if an even number of the events $A_{2}, A_{3}, \ldots, A_{n}$ occur and $A_{n+1}$ also occurs, or if an odd number of the former occur and $A_{n+1}$ does not. Si... | \frac{n-1}{4n} | 53,869 | <think>I. solution. Let $p_{n}$ be the probability asked for in the problem. Among the events $A_{2}, A_{3}, \ldots, A_{n+1}$, an odd number will occur either if an even number of the events $A_{2}, A_{3}, \ldots, A_{n}$ occur and $A_{n+1}$ also occurs, or if an odd number of the former occur and $A_{n+1}$ does not. Si... | 1_28 |
Example 6 In isosceles $\triangle A B C$, $\angle B=\angle C=40^{\circ}$, extend $A B$ to point $D$, such that $A D=B C$. Find the degree measure of $\angle B C D$. | <think>Solution 1: As shown in Figure 7, construct an equilateral $\triangle ABE$ outside $\triangle ABC$ with $AB$ as a side, and connect $CE$. It is easy to see that
$$
AB=AC, \angle BAC=100^{\circ}.
$$
Since $\triangle ABE$ is an equilateral triangle, then
$$
\begin{array}{l}
AB=BE=AE, \\
\angle BAE=60^{\circ}, \\
... | 10^{\circ} | 16,387 | <think>Solution 1: As shown in Figure 7, construct an equilateral $\triangle ABE$ outside $\triangle ABC$ with $AB$ as a side, and connect $CE$. It is easy to see that
$$
AB=AC, \angle BAC=100^{\circ}.
$$
Since $\triangle ABE$ is an equilateral triangle, then
$$
\begin{array}{l}
AB=BE=AE, \\
\angle BAE=60^{\circ}, \\
... | 1_29 |
Example. Compute the integral
$$
\int_{L} \sin ^{2} z d z
$$
where $L$ is the line segment from the point $z_{1}=0$ to the point $z_{1}=i$. | <think>Solution. The function $f(z)=\sin ^{2} z$ is analytic everywhere, and, therefore, the integral does not depend on the path of integration and can be computed using the Newton-Leibniz formula (1).
1. We find the antiderivative $F(z)$ using the power reduction formulas
$$
\int \sin ^{2} z d z=\frac{1}{2} \int(1-... | \frac{i}{4}(2-\operatorname{sh}2) | 34,184 | <think>Solution. The function $f(z)=\sin ^{2} z$ is analytic everywhere, and, therefore, the integral does not depend on the path of integration and can be computed using the Newton-Leibniz formula (1).
1. We find the antiderivative $F(z)$ using the power reduction formulas
$$
\int \sin ^{2} z d z=\frac{1}{2} \int(1-... | 1_30 |
Let $ \mathcal{R}$ be the region consisting of the set of points in the coordinate plane that satisfy both $ |8 \minus{} x| \plus{} y \le 10$ and $ 3y \minus{} x \ge 15$. When $ \mathcal{R}$ is revolved around the line whose equation is $ 3y \minus{} x \equal{} 15$, the volume of the resulting solid is $ \frac {m\pi}{n... | <think>1. **Identify the region $\mathcal{R}$:**
- The inequality $|8 - x| + y \le 10$ can be split into two cases:
- Case 1: $x \leq 8 \implies 8 - x + y \le 10 \implies y \le x + 2$
- Case 2: $x > 8 \implies x - 8 + y \le 10 \implies y \le -x + 18$
- The inequality $3y - x \ge 15$ can be rewritten as ... | 365 | 56,625 | <think>1. **Identify the region $\mathcal{R}$:**
- The inequality $|8 - x| + y \le 10$ can be split into two cases:
- Case 1: $x \leq 8 \implies 8 - x + y \le 10 \implies y \le x + 2$
- Case 2: $x > 8 \implies x - 8 + y \le 10 \implies y \le -x + 18$
- The inequality $3y - x \ge 15$ can be rewritten as ... | 1_31 |
A grasshopper is jumping about in a grid. From the point with coordinates $(a, b)$ it can jump to either $(a + 1, b),(a + 2, b),(a + 1, b + 1),(a, b + 2)$ or $(a, b + 1)$. In how many ways can it reach the line $x + y = 2014?$ Where the grasshopper starts in $(0, 0)$. | <think>1. **Define the problem in terms of a recurrence relation:**
Let \( f(n) \) be the number of ways for the grasshopper to reach the line \( x + y = n \) starting from the point \((0,0)\). We need to find \( f(2014) \).
2. **Base cases:**
- For \( n = 0 \), the grasshopper is already at the line \( x + y = ... | \frac{3}{4} \cdot 3^{2014} + \frac{1}{4} | 66,004 | <think>1. **Define the problem in terms of a recurrence relation:**
Let \( f(n) \) be the number of ways for the grasshopper to reach the line \( x + y = n \) starting from the point \((0,0)\). We need to find \( f(2014) \).
2. **Base cases:**
- For \( n = 0 \), the grasshopper is already at the line \( x + y = ... | 1_32 |
What is the maximum number of terms in a geometric progression with common ratio greater than 1 whose entries all come from the set of integers between 100 and 1000 inclusive? | <think>1. **Identify the range and common ratio:**
We are given that the terms of the geometric progression (GP) must lie between 100 and 1000 inclusive, and the common ratio \( r \) is greater than 1. We need to find the maximum number of terms in such a GP.
2. **Assume a specific GP:**
Let's consider a specifi... | 6 | 67,302 | <think>1. **Identify the range and common ratio:**
We are given that the terms of the geometric progression (GP) must lie between 100 and 1000 inclusive, and the common ratio \( r \) is greater than 1. We need to find the maximum number of terms in such a GP.
2. **Assume a specific GP:**
Let's consider a specifi... | 1_33 |
For every positive integer $n$ let $\tau (n)$ denote the number of its positive factors. Determine all $n \in N$ that satisfy the equality $\tau (n) = \frac{n}{3}$ | <think>To solve the problem, we need to find all positive integers \( n \) such that the number of positive divisors of \( n \), denoted by \( \tau(n) \), satisfies the equation:
\[
\tau(n) = \frac{n}{3}
\]
1. **Express \( n \) in terms of its prime factorization:**
Let \( n \) be expressed as \( n = p_1^{e_1} p_2^... | 9, 18, 24 | 19,723 | <think>To solve the problem, we need to find all positive integers \( n \) such that the number of positive divisors of \( n \), denoted by \( \tau(n) \), satisfies the equation:
\[
\tau(n) = \frac{n}{3}
\]
1. **Express \( n \) in terms of its prime factorization:**
Let \( n \) be expressed as \( n = p_1^{e_1} p_2^... | 1_34 |
4. Given twelve red points on a circle. Find the minimum value of $n$, such that there exist $n$ triangles with red points as vertices, so that every chord with red points as endpoints is a side of one of these triangles.
(Supplied by Tao Pingsheng) | <think>4. Let the set of red points be $A=\left\{A_{1}, A_{2}, \cdots, A_{12}\right\}$.
There are 11 chords passing through point $A_{1}$, and any triangle containing vertex $A_{1}$ contains exactly two chords passing through point $A_{1}$. Therefore, these 11 chords passing through point $A_{1}$ must be distributed a... | 24 | 80,628 | <think>4. Let the set of red points be $A=\left\{A_{1}, A_{2}, \cdots, A_{12}\right\}$.
There are 11 chords passing through point $A_{1}$, and any triangle containing vertex $A_{1}$ contains exactly two chords passing through point $A_{1}$. Therefore, these 11 chords passing through point $A_{1}$ must be distributed a... | 1_35 |
The 17th question: Given an integer $n \geq 2$, it is known that real numbers $x_{1}, x_{2}, \ldots, x_{n}$ satisfy $\sum_{i=1}^{n} i x_{i}=1$,
(1) Find the minimum value of $\sum_{k=1}^{n} x_{k}^{2}+\sum_{1 \leq i<j \leq n} x_{i} x_{j}$;
(2) Find the minimum value of $\sum_{k=1}^{n} x_{k}^{2}+\sum_{1 \leq i<j \leq n}\... | <think>Question 17:
Solution: (1) Let $\mathrm{S}=\sum_{\mathrm{k}=1}^{\mathrm{n}} \mathrm{x}_{\mathrm{k}}^{2}+\sum_{1 \leq \mathrm{i}<\mathrm{j} \leq \mathrm{n}} \mathrm{x}_{\mathrm{i}} \mathrm{x}_{\mathrm{j}}$, then $2 \mathrm{~S}=\sum_{\mathrm{k}=1}^{\mathrm{n}} \mathrm{x}_{\mathrm{k}}^{2}+\left(\sum_{\mathrm{k}=1}^... | \frac{12}{n(n+2)(3n+1)} | 16,322 | <think>Question 17:
Solution: (1) Let $\mathrm{S}=\sum_{\mathrm{k}=1}^{\mathrm{n}} \mathrm{x}_{\mathrm{k}}^{2}+\sum_{1 \leq \mathrm{i}<\mathrm{j} \leq \mathrm{n}} \mathrm{x}_{\mathrm{i}} \mathrm{x}_{\mathrm{j}}$, then $2 \mathrm{~S}=\sum_{\mathrm{k}=1}^{\mathrm{n}} \mathrm{x}_{\mathrm{k}}^{2}+\left(\sum_{\mathrm{k}=1}^... | 1_36 |
Siva has the following expression, which is missing operations:
$$\frac12 \,\, \_ \,\,\frac14 \,\, \_ \,\, \frac18 \,\, \_ \,\,\frac{1}{16} \,\, \_ \,\,\frac{1}{32}.$$ For each blank, he flips a fair coin: if it comes up heads, he fills it with a plus, and if it comes up tails, he fills it with a minus. Afterwards, ... | <think>1. **Understanding the Problem:**
We need to determine the probability that the positive difference between two computed values of the expression
\[
\frac{1}{2} \,\, \_ \,\,\frac{1}{4} \,\, \_ \,\, \frac{1}{8} \,\, \_ \,\,\frac{1}{16} \,\, \_ \,\,\frac{1}{32}
\]
is greater than $\frac{1}{2}$. ... | 39 | 30,534 | <think>1. **Understanding the Problem:**
We need to determine the probability that the positive difference between two computed values of the expression
\[
\frac{1}{2} \,\, \_ \,\,\frac{1}{4} \,\, \_ \,\, \frac{1}{8} \,\, \_ \,\,\frac{1}{16} \,\, \_ \,\,\frac{1}{32}
\]
is greater than $\frac{1}{2}$. ... | 1_37 |
Together, Kenneth and Ellen pick a real number $a$. Kenneth subtracts $a$ from every thousandth root of unity (that is, the thousand complex numbers $\omega$ for which $\omega^{1000}=1$) then inverts each, then sums the results. Ellen inverts every thousandth root of unity, then subtracts $a$ from each, and then sums t... | <think>1. **Define the roots of unity and the sums:**
Let $\omega = e^{2\pi i / 1000}$ be a primitive 1000th root of unity. The 1000th roots of unity are $\omega^k$ for $k = 0, 1, 2, \ldots, 999$. Define:
\[
X = \sum_{k=0}^{999} \frac{1}{\omega^k - a}
\]
and
\[
Y = \sum_{k=0}^{999} \frac{1}{\omega^... | 3 | 18,904 | <think>1. **Define the roots of unity and the sums:**
Let $\omega = e^{2\pi i / 1000}$ be a primitive 1000th root of unity. The 1000th roots of unity are $\omega^k$ for $k = 0, 1, 2, \ldots, 999$. Define:
\[
X = \sum_{k=0}^{999} \frac{1}{\omega^k - a}
\]
and
\[
Y = \sum_{k=0}^{999} \frac{1}{\omega^... | 1_38 |
Integer $n>2$ is given. Find the biggest integer $d$, for which holds, that from any set $S$ consisting of $n$ integers, we can find three different (but not necesarilly disjoint) nonempty subsets, such that sum of elements of each of them is divisible by $d$. | <think>1. **Model and Initial Observation**:
Consider the set \( S = \{n+1, 2n+1, \ldots, n^2+1\} \). For this set, the only non-empty subset whose sum of elements is divisible by \( n \) is \( S \) itself. This implies that \( d < n \).
2. **Claim**:
We claim that \( d = n-1 \). To support this claim, we will u... | n-1 | 6,600 | <think>1. **Model and Initial Observation**:
Consider the set \( S = \{n+1, 2n+1, \ldots, n^2+1\} \). For this set, the only non-empty subset whose sum of elements is divisible by \( n \) is \( S \) itself. This implies that \( d < n \).
2. **Claim**:
We claim that \( d = n-1 \). To support this claim, we will u... | 1_39 |
There are 3 times as many boys as girls in a room. If 4 boys and 4 girls leave the room, then there will be 5 times as many boys as girls in the room. In total, how many boys and girls were in the room originally?
(A) 15
(B) 20
(C) 24
(D) 32
(E) 40 | <think>Solution 1
Originally there are 3 times as many boys as girls, so then for every 3 boys there is 1 girl and $3+1=4$ children in the room.
That is, the number of boys in the room is $\frac{3}{4}$ of the number of children in the room.
Next we consider each of the 5 possible answers, in turn, to determine which... | 32 | 39,847 | <think>Solution 1
Originally there are 3 times as many boys as girls, so then for every 3 boys there is 1 girl and $3+1=4$ children in the room.
That is, the number of boys in the room is $\frac{3}{4}$ of the number of children in the room.
Next we consider each of the 5 possible answers, in turn, to determine which... | 1_40 |
Can we find positive reals $a_1, a_2, \dots, a_{2002}$ such that for any positive integer $k$, with $1 \leq k \leq 2002$, every complex root $z$ of the following polynomial $f(x)$ satisfies the condition $|\text{Im } z| \leq |\text{Re } z|$,
\[f(x)=a_{k+2001}x^{2001}+a_{k+2000}x^{2000}+ \cdots + a_{k+1}x+a_k,\] w... | <think>To determine whether there exist positive reals \( a_1, a_2, \dots, a_{2002} \) such that for any positive integer \( k \) with \( 1 \leq k \leq 2002 \), every complex root \( z \) of the polynomial
\[ f(x) = a_{k+2001}x^{2001} + a_{k+2000}x^{2000} + \cdots + a_{k+1}x + a_k \]
satisfies the condition \( |\text{... | a_1, a_2, \dots, a_{2002} | 7,653 | <think>To determine whether there exist positive reals \( a_1, a_2, \dots, a_{2002} \) such that for any positive integer \( k \) with \( 1 \leq k \leq 2002 \), every complex root \( z \) of the polynomial
\[ f(x) = a_{k+2001}x^{2001} + a_{k+2000}x^{2000} + \cdots + a_{k+1}x + a_k \]
satisfies the condition \( |\text{... | 1_41 |
B4 In the following diagram, two lines that meet at a point $A$ are tangent to a circle at points $B$ and $C$. The line parallel to $A C$ passing through $B$ meets the circle again at $D$. Join the segments $C D$ and $A D$. Suppose $A B=49$ and $C D=28$. Determine the length of $A D$. | <think>Solution 1: The answer is $A D=63$.
Join the segment $B C$. Since the two lines are both tangent to the circle, $A B=A C$. Therefore, $\angle A B C=\angle A C B$.
Furthermore, since $B D$ is parallel to $A C, \angle A C B=\angle D B C$. Since $A C$ is tangent to the circle at $C$, by the tangent-chord theorem,... | 63 | 74,513 | <think>Solution 1: The answer is $A D=63$.
Join the segment $B C$. Since the two lines are both tangent to the circle, $A B=A C$. Therefore, $\angle A B C=\angle A C B$.
Furthermore, since $B D$ is parallel to $A C, \angle A C B=\angle D B C$. Since $A C$ is tangent to the circle at $C$, by the tangent-chord theorem,... | 1_42 |
Find all $7$-digit numbers which use only the digits $5$ and $7$ and are divisible by $35$. | <think>To find all 7-digit numbers that use only the digits 5 and 7 and are divisible by 35, we need to ensure that these numbers are divisible by both 5 and 7.
1. **Divisibility by 5**:
- A number is divisible by 5 if its last digit is either 0 or 5. Since we are only using the digits 5 and 7, the last digit must ... | 9 | 38,136 | <think>To find all 7-digit numbers that use only the digits 5 and 7 and are divisible by 35, we need to ensure that these numbers are divisible by both 5 and 7.
1. **Divisibility by 5**:
- A number is divisible by 5 if its last digit is either 0 or 5. Since we are only using the digits 5 and 7, the last digit must ... | 1_43 |
For which positive integers $n$, one can find a non-integer rational number $x$ such that $$x^n+(x+1)^n$$ is an integer? | <think>1. **Case \( n = 1 \):**
- If \( n = 1 \), we can choose \( x = \frac{1}{2} \).
- Then, \( x^1 + (x+1)^1 = \frac{1}{2} + \left(\frac{1}{2} + 1\right) = \frac{1}{2} + \frac{3}{2} = 2 \), which is an integer.
- Therefore, \( x = \frac{1}{2} \) works for \( n = 1 \).
2. **Case \( n > 1 \):**
- Let \( x... | n | 67,511 | <think>1. **Case \( n = 1 \):**
- If \( n = 1 \), we can choose \( x = \frac{1}{2} \).
- Then, \( x^1 + (x+1)^1 = \frac{1}{2} + \left(\frac{1}{2} + 1\right) = \frac{1}{2} + \frac{3}{2} = 2 \), which is an integer.
- Therefore, \( x = \frac{1}{2} \) works for \( n = 1 \).
2. **Case \( n > 1 \):**
- Let \( x... | 1_44 |
Example 2 Find all real roots of the equation $x^{2}-2 x \sin \frac{\pi x}{2}+1=0$.
(1956, Beijing Mathematical Competition) | <think>Text [3] P73 Consider the equation as a quadratic equation with a parameter in the linear term, and directly use the discriminant to solve it. Later, many journals published the solution method using the discriminant for this problem, and then made a "correction" to the "ingenious solution," the main reason bein... | x=1, -1 | 20,480 | <think>Text [3] P73 Consider the equation as a quadratic equation with a parameter in the linear term, and directly use the discriminant to solve it. Later, many journals published the solution method using the discriminant for this problem, and then made a "correction" to the "ingenious solution," the main reason bein... | 1_45 |
4. Let $a, b$ be any positive real numbers such that $a^{2}+b^{2}=1$. Find the smallest possible value of the expression
$$
\frac{a^{2}\left(a+b^{3}\right)}{b-b^{3}}+\frac{b^{2}\left(b+a^{3}\right)}{a-a^{3}}
$$
and determine for which pairs $(a, b)$ this value is achieved. (Tomáš Bárta) | <think>SOLUTION. Using the condition $a^{2}+b^{2}=1$, we first simplify the first fraction of the given expression:
$$
\frac{a^{2}\left(a+b^{3}\right)}{b-b^{3}}=\frac{a^{2}\left(a+b^{3}\right)}{b\left(1-b^{2}\right)}=\frac{a^{2}\left(a+b^{3}\right)}{b \cdot a^{2}}=\frac{a+b^{3}}{b}=\frac{a}{b}+b^{2} .
$$
Similarly, f... | 3 | 8,017 | <think>SOLUTION. Using the condition $a^{2}+b^{2}=1$, we first simplify the first fraction of the given expression:
$$
\frac{a^{2}\left(a+b^{3}\right)}{b-b^{3}}=\frac{a^{2}\left(a+b^{3}\right)}{b\left(1-b^{2}\right)}=\frac{a^{2}\left(a+b^{3}\right)}{b \cdot a^{2}}=\frac{a+b^{3}}{b}=\frac{a}{b}+b^{2} .
$$
Similarly, f... | 1_46 |
## 9. Diagonal Squares
Vlado covered the diagonal of a large square with a side length of $2020 \mathrm{~cm}$ using a row of smaller squares with a side length of $4 \mathrm{~cm}$ cut from green collage paper. The diagonals of the green squares align with the diagonal of the large square, and the intersection of any t... | <think>## Solution, First Method.
Let's calculate how many squares of side length $4 \mathrm{~cm}$ there are in total.
Start by drawing squares starting from the bottom left corner of the large square, which we will label as $A_{0}$. The top right corner of the first drawn square will be labeled as $A_{1}$, the top r... | 101 | 2,701 | <think>## Solution, First Method.
Let's calculate how many squares of side length $4 \mathrm{~cm}$ there are in total.
Start by drawing squares starting from the bottom left corner of the large square, which we will label as $A_{0}$. The top right corner of the first drawn square will be labeled as $A_{1}$, the top r... | 1_47 |
Find all positive integers $n$ such that the set $S=\{1,2,3, \dots 2n\}$ can be divided into $2$ disjoint subsets $S_1$ and $S_2$, i.e. $S_1 \cap S_2 = \emptyset$ and $S_1 \cup S_2 = S$, such that each one of them has $n$ elements, and the sum of the elements of $S_1$ is divisible by the sum of the elements in $S_2$.
... | <think>We need to find all positive integers \( n \) such that the set \( S = \{1, 2, 3, \ldots, 2n\} \) can be divided into two disjoint subsets \( S_1 \) and \( S_2 \) with \( |S_1| = |S_2| = n \), and the sum of the elements in \( S_1 \) is divisible by the sum of the elements in \( S_2 \).
1. **Define the sums of ... | n \not\equiv 5 \pmod{6} | 64,716 | <think>We need to find all positive integers \( n \) such that the set \( S = \{1, 2, 3, \ldots, 2n\} \) can be divided into two disjoint subsets \( S_1 \) and \( S_2 \) with \( |S_1| = |S_2| = n \), and the sum of the elements in \( S_1 \) is divisible by the sum of the elements in \( S_2 \).
1. **Define the sums of ... | 1_48 |
Exercise 7. We denote by $\mathbb{R}_{>0}$ the set of strictly positive real numbers. Find all functions $f: \mathbb{R}_{>0} \mapsto \mathbb{R}_{>0}$ such that
$$
f(x+f(x y))+y=f(x) f(y)+1
$$
for all strictly positive real numbers $x$ and $y$. | <think>Solution to Exercise 7 Let $f$ be a potential solution to the problem. In the following, we will denote $\mathbf{E}_{x, y}$ the equality from the statement. Let $a$ and $b$ be two strictly positive real numbers such that $f(a)=f(b)$. The equalities $\mathbf{E}_{1, a}$ and $\mathbf{E}_{1, b}$ indicate that
$$
a=... | f:\mapsto+1 | 81,919 | <think>Solution to Exercise 7 Let $f$ be a potential solution to the problem. In the following, we will denote $\mathbf{E}_{x, y}$ the equality from the statement. Let $a$ and $b$ be two strictly positive real numbers such that $f(a)=f(b)$. The equalities $\mathbf{E}_{1, a}$ and $\mathbf{E}_{1, b}$ indicate that
$$
a=... | 1_49 |
5. The segments between $n$ points such that there are no three collinear points among them are colored in one of $k$ colors. What is the smallest $n$ such that there exists a closed broken line with vertices at some of the $n$ points where all sides are colored the same color. | <think>Solution. We will prove the following lemma.
Lemma. If among $n$ points, no three of which are collinear, at least $n$ segments are drawn, then a closed broken line with vertices at some of these points is drawn.
Proof. If there is a point from which at most one segment is drawn, then we remove that point and ... | 2k+1 | 72,484 | <think>Solution. We will prove the following lemma.
Lemma. If among $n$ points, no three of which are collinear, at least $n$ segments are drawn, then a closed broken line with vertices at some of these points is drawn.
Proof. If there is a point from which at most one segment is drawn, then we remove that point and ... | 1_50 |
Find the minimum and maximum value of the function
\begin{align*} f(x,y)=ax^2+cy^2 \end{align*}
Under the condition $ax^2-bxy+cy^2=d$, where $a,b,c,d$ are positive real numbers such that $b^2 -4ac <0$ | <think>1. We start with the given function \( f(x,y) = ax^2 + cy^2 \) and the constraint \( ax^2 - bxy + cy^2 = d \), where \( a, b, c, d \) are positive real numbers and \( b^2 - 4ac < 0 \).
2. To simplify the problem, we introduce the variable \( z = \frac{x}{y} \). This allows us to rewrite the constraint in terms ... | \frac{2d\sqrt{ac}}{b + 2\sqrt{ac}} \leq f(x,y) \leq \frac{2d\sqrt{ac}}{b - 2\sqrt{ac}} | 18,617 | <think>1. We start with the given function \( f(x,y) = ax^2 + cy^2 \) and the constraint \( ax^2 - bxy + cy^2 = d \), where \( a, b, c, d \) are positive real numbers and \( b^2 - 4ac < 0 \).
2. To simplify the problem, we introduce the variable \( z = \frac{x}{y} \). This allows us to rewrite the constraint in terms ... | 1_51 |
Example 3 How many sets of positive integer solutions does the equation $3 x+5 y=501$ have?
(1967 American High School Mathematics Competition) | <think>Solve: From $3 x+5 y=501$, we get
$$
x=\frac{501-5 y}{3}=167-2 y+\frac{y}{3}.
$$
Since $x, y$ are positive integers, $\frac{y}{3}$ must also be a positive integer. Let $\frac{y}{3}=t, t$ be a positive integer. Then
$$
y=3 t, x=167-6 t+t=167-5 t.
$$
Therefore,
$$
x=167-5 t, y=3 t \text{ ( } x, y, t \text{ are a... | 33 | 7,509 | <think>Solve: From $3 x+5 y=501$, we get
$$
x=\frac{501-5 y}{3}=167-2 y+\frac{y}{3}.
$$
Since $x, y$ are positive integers, $\frac{y}{3}$ must also be a positive integer. Let $\frac{y}{3}=t, t$ be a positive integer. Then
$$
y=3 t, x=167-6 t+t=167-5 t.
$$
Therefore,
$$
x=167-5 t, y=3 t \text{ ( } x, y, t \text{ are a... | 1_52 |
Magicman and his helper want to do some magic trick. They have special card desk. Back of all cards is common color and face is one of $2017$ colors.
Magic trick: magicman go away from scene. Then viewers should put on the table $n>1$ cards in the row face up. Helper looks at these cards, then he turn all cards face do... | <think>1. **Define the Problem and Strategy:**
- We have a deck of cards with faces colored in one of 2017 colors.
- The helper turns all cards face down except one.
- The magician must identify the color of the face-down card.
- We need to find the minimum number \( n \) of cards such that the magician and... | n = 2018 | 35,743 | <think>1. **Define the Problem and Strategy:**
- We have a deck of cards with faces colored in one of 2017 colors.
- The helper turns all cards face down except one.
- The magician must identify the color of the face-down card.
- We need to find the minimum number \( n \) of cards such that the magician and... | 1_53 |
23. (1) Find the range of positive real numbers $\lambda$ such that the inequality $\left(\frac{a}{a+\lambda b}\right)^{2}+\left(\frac{b}{b+\lambda a}\right)^{2} \geqslant \frac{2}{(1+\lambda)^{2}}$ holds for any positive real numbers $a$ and $b$;
(2) Find the range of positive real numbers $\lambda$ such that the ineq... | <think>23. (1) Let $x_{1}=\frac{b}{a}, x_{2}=\frac{a}{b}$, then $x_{1}, x_{2}>0$, and $x_{1} x_{2}=1$. Therefore, equation (1) is equivalent to
$$
\begin{array}{l}
\frac{1}{\left(1+\lambda x_{1}\right)^{2}}+\frac{1}{\left(1+\lambda x_{2}\right)^{2}} \geqslant \frac{2}{(1+\lambda)^{2}} \\
\Leftrightarrow(1+\lambda)^{2}\... | \lambda\geqslant\frac{1}{2} | 69,269 | <think>23. (1) Let $x_{1}=\frac{b}{a}, x_{2}=\frac{a}{b}$, then $x_{1}, x_{2}>0$, and $x_{1} x_{2}=1$. Therefore, equation (1) is equivalent to
$$
\begin{array}{l}
\frac{1}{\left(1+\lambda x_{1}\right)^{2}}+\frac{1}{\left(1+\lambda x_{2}\right)^{2}} \geqslant \frac{2}{(1+\lambda)^{2}} \\
\Leftrightarrow(1+\lambda)^{2}\... | 1_54 |
For a constant $a,$ let $f(x)=ax\sin x+x+\frac{\pi}{2}.$ Find the range of $a$ such that $\int_{0}^{\pi}\{f'(x)\}^{2}\ dx \geq f\left(\frac{\pi}{2}\right).$ | <think>1. Given the function \( f(x) = ax \sin x + x + \frac{\pi}{2} \), we first find its derivative:
\[
f'(x) = \frac{d}{dx} \left( ax \sin x + x + \frac{\pi}{2} \right) = a \sin x + ax \cos x + 1
\]
2. We need to evaluate the integral:
\[
\int_{0}^{\pi} \left( f'(x) \right)^2 \, dx = \int_{0}^{\pi} \... | -\infty < a \leq 0 \cup \frac{6}{3 + 2\pi^2} \leq a < \infty | 21,338 | <think>1. Given the function \( f(x) = ax \sin x + x + \frac{\pi}{2} \), we first find its derivative:
\[
f'(x) = \frac{d}{dx} \left( ax \sin x + x + \frac{\pi}{2} \right) = a \sin x + ax \cos x + 1
\]
2. We need to evaluate the integral:
\[
\int_{0}^{\pi} \left( f'(x) \right)^2 \, dx = \int_{0}^{\pi} \... | 1_55 |
Consider the second-degree polynomial \(P(x) = 4x^2+12x-3015\). Define the sequence of polynomials
\(P_1(x)=\frac{P(x)}{2016}\) and \(P_{n+1}(x)=\frac{P(P_n(x))}{2016}\) for every integer \(n \geq 1\).
[list='a']
[*]Show that exists a real number \(r\) such that \(P_n(r) < 0\) for every positive integer \(n\).
[*]Fin... | <think>1. **Define the sequence of polynomials:**
Given \( P(x) = 4x^2 + 12x - 3015 \), we define \( P_1(x) = \frac{P(x)}{2016} \) and \( P_{n+1}(x) = \frac{P(P_n(x))}{2016} \) for every integer \( n \geq 1 \).
2. **Express \( P(x) \) in a different form:**
\[
P(x) = 4x^2 + 12x - 3015 = 4(x^2 + 3x - 753.75)
... | 1008 | 715 | <think>1. **Define the sequence of polynomials:**
Given \( P(x) = 4x^2 + 12x - 3015 \), we define \( P_1(x) = \frac{P(x)}{2016} \) and \( P_{n+1}(x) = \frac{P(P_n(x))}{2016} \) for every integer \( n \geq 1 \).
2. **Express \( P(x) \) in a different form:**
\[
P(x) = 4x^2 + 12x - 3015 = 4(x^2 + 3x - 753.75)
... | 1_56 |
C8. Let $n$ be a positive integer. Determine the smallest positive integer $k$ with the following property: it is possible to mark $k$ cells on a $2 n \times 2 n$ board so that there exists a unique partition of the board into $1 \times 2$ and $2 \times 1$ dominoes, none of which contains two marked cells. | <think>Answer. $2 n$.
Solution. We first construct an example of marking $2 n$ cells satisfying the requirement. Label the rows and columns $1,2, \ldots, 2 n$ and label the cell in the $i$-th row and the $j$-th column $(i, j)$.
For $i=1,2, \ldots, n$, we mark the cells $(i, i)$ and $(i, i+1)$. We claim that the requir... | 2n | 78,022 | <think>Answer. $2 n$.
Solution. We first construct an example of marking $2 n$ cells satisfying the requirement. Label the rows and columns $1,2, \ldots, 2 n$ and label the cell in the $i$-th row and the $j$-th column $(i, j)$.
For $i=1,2, \ldots, n$, we mark the cells $(i, i)$ and $(i, i+1)$. We claim that the requir... | 1_57 |
## Problem Statement
Find the indefinite integral:
$$
\int \frac{2 x^{3}+2 x^{2}+2 x+1}{\left(x^{2}+x+1\right)\left(x^{2}+1\right)} d x
$$ | <think>## Solution
$$
\int \frac{2 x^{3}+2 x^{2}+2 x+1}{\left(x^{2}+x+1\right)\left(x^{2}+1\right)} d x=
$$
Decompose the proper rational fraction into partial fractions using the method of undetermined coefficients:
$$
\begin{aligned}
& \frac{2 x^{3}+2 x^{2}+2 x+1}{\left(x^{2}+x+1\right)\left(x^{2}+1\right)}=\frac{... | \frac{1}{2}\cdot\ln(x^{2}+x+1)+\frac{1}{\sqrt{3}}\cdot\operatorname{arctg}(\frac{2x+1}{\sqrt{3}})+\frac{1}{2}\cdot\ln(x^{2}+1)+C | 19,557 | <think>## Solution
$$
\int \frac{2 x^{3}+2 x^{2}+2 x+1}{\left(x^{2}+x+1\right)\left(x^{2}+1\right)} d x=
$$
Decompose the proper rational fraction into partial fractions using the method of undetermined coefficients:
$$
\begin{aligned}
& \frac{2 x^{3}+2 x^{2}+2 x+1}{\left(x^{2}+x+1\right)\left(x^{2}+1\right)}=\frac{... | 1_58 |
Dudeney, Amusements in Mathematics Problem 12 It will be found that £66, 6s. 6d equals 15, 918 pence. Now, the four 6's added together make 24, and the figures 15, 918 also add to 24. It is a curious fact that there is only one other sum of money, in pounds, shillings and pence (all similarly repetitions of one figure... | <think>We are looking for k = 1, 2, 3, ... , or 9 and n = 1, 2, 3, ... such that the digit sum of k ... k (n ks) and k and k is the same as that of (240 k ... k + 12k + k). But in the case of k = 1, we can also have 11s 1d, 1s 11d or 11s 11d. The difficulty is that it is not clear how to find the digit sum for the numb... | £44,4444s4d=10,666,612d | 30,749 | <think>We are looking for k = 1, 2, 3, ... , or 9 and n = 1, 2, 3, ... such that the digit sum of k ... k (n ks) and k and k is the same as that of (240 k ... k + 12k + k). But in the case of k = 1, we can also have 11s 1d, 1s 11d or 11s 11d. The difficulty is that it is not clear how to find the digit sum for the numb... | 1_59 |
Example 18 Let the quadratic function $f(x)=a x^{2}+b x+c(a \neq 0)$ have values whose absolute values do not exceed 1 on the interval $[0,1]$, find the maximum value of $|a|+|b|+|c|$. | <think>Solve: From
we get
$$
\begin{array}{l}
\left\{\begin{array}{l}
f(0)=c \\
f(1)=a+b+c \\
f\left(\frac{1}{2}\right)=\frac{1}{4} a+\frac{1}{2} b+c
\end{array}\right. \\
\left\{\begin{array}{l}
a=2 f(0)-4 f\left(\frac{1}{2}\right)+2 f(1) \\
b=-3 f(0)+4 f\left(\frac{1}{2}\right)-f(1) \\
c=f(0)
\end{array}\right. \\
\... | 17 | 86,298 | <think>Solve: From
we get
$$
\begin{array}{l}
\left\{\begin{array}{l}
f(0)=c \\
f(1)=a+b+c \\
f\left(\frac{1}{2}\right)=\frac{1}{4} a+\frac{1}{2} b+c
\end{array}\right. \\
\left\{\begin{array}{l}
a=2 f(0)-4 f\left(\frac{1}{2}\right)+2 f(1) \\
b=-3 f(0)+4 f\left(\frac{1}{2}\right)-f(1) \\
c=f(0)
\end{array}\right. \\
\... | 1_60 |
Find all functions $f:\mathbb{N} \to \mathbb{N}$ so that for any distinct positive integers $x,y,z$ the value of $x+y+z$ is a perfect square if and only if $f(x)+f(y)+f(z)$ is a perfect square. | <think>1. **Lemma 1: \( f \) is injective.**
**Proof:**
Suppose that \( f(a) = f(b) \) for some positive integers \( a \) and \( b \). Then, for any integers \( x \) and \( y \) such that \( a + x + y \) is a perfect square, we have that \( f(a) + f(x) + f(y) \) is a perfect square. Since \( f(a) = f(b) \), it f... | f(x) = k^2 x | 40,139 | <think>1. **Lemma 1: \( f \) is injective.**
**Proof:**
Suppose that \( f(a) = f(b) \) for some positive integers \( a \) and \( b \). Then, for any integers \( x \) and \( y \) such that \( a + x + y \) is a perfect square, we have that \( f(a) + f(x) + f(y) \) is a perfect square. Since \( f(a) = f(b) \), it f... | 1_61 |
4. From the vertex of the obtuse angle $A$ of triangle $A B C$, the altitude $A D$ is dropped. A circle with center $D$ and radius $D A$ is drawn, intersecting sides $A B$ and $A C$ again at points $M$ and $N$ respectively. Find $A C$, if $A B=c, A M=m$ and $A N=n$. | <think>Answer: $\frac{m c}{n}$.
Solution. We will prove that $A M \cdot A B = A N \cdot A C$. This can be done in different ways.
First method. In the right triangles $A D B$ and $A D C$, draw the altitudes $D P$ and $D Q$ respectively (see Fig. 10.4a). Then $A P \cdot A B = A D^{2} = A Q \cdot A C$. Since triangles ... | \frac{}{n} | 4,194 | <think>Answer: $\frac{m c}{n}$.
Solution. We will prove that $A M \cdot A B = A N \cdot A C$. This can be done in different ways.
First method. In the right triangles $A D B$ and $A D C$, draw the altitudes $D P$ and $D Q$ respectively (see Fig. 10.4a). Then $A P \cdot A B = A D^{2} = A Q \cdot A C$. Since triangles ... | 1_62 |
Let $ABC$ be an equilateral triangle with side length $1$. Points $A_1$ and $A_2$ are chosen on side $BC$, points $B_1$ and $B_2$ are chosen on side $CA$, and points $C_1$ and $C_2$ are chosen on side $AB$ such that $BA_1<BA_2$, $CB_1<CB_2$, and $AC_1<AC_2$.
Suppose that the three line segments $B_1C_2$, $C_1A_2$, $A_... | <think>1. **Setup and Initial Conditions:**
- Let $ABC$ be an equilateral triangle with side length $1$.
- Points $A_1$ and $A_2$ are chosen on side $BC$ such that $BA_1 < BA_2$.
- Points $B_1$ and $B_2$ are chosen on side $CA$ such that $CB_1 < CB_2$.
- Points $C_1$ and $C_2$ are chosen on side $AB$ such t... | 1 | 15,049 | <think>1. **Setup and Initial Conditions:**
- Let $ABC$ be an equilateral triangle with side length $1$.
- Points $A_1$ and $A_2$ are chosen on side $BC$ such that $BA_1 < BA_2$.
- Points $B_1$ and $B_2$ are chosen on side $CA$ such that $CB_1 < CB_2$.
- Points $C_1$ and $C_2$ are chosen on side $AB$ such t... | 1_63 |
Six, let $X$ be a 56-element set. Find the smallest positive integer $n$, such that for any 15 subsets of $X$, if the union of any 7 of them has at least $n$ elements, then there must exist 3 of these 15 subsets whose intersection is non-empty.
(Cold Gangsong provided the problem) | <think>Six, the minimum value of $n$ is 41.
First, prove that $n=41$ meets the requirement. Use proof by contradiction.
Assume there exist 15 subsets of $X$ such that the union of any 7 of them contains at least 41 elements, and the intersection of any 3 of them is empty. Since each element belongs to at most 2 subsets... | 41 | 88,655 | <think>Six, the minimum value of $n$ is 41.
First, prove that $n=41$ meets the requirement. Use proof by contradiction.
Assume there exist 15 subsets of $X$ such that the union of any 7 of them contains at least 41 elements, and the intersection of any 3 of them is empty. Since each element belongs to at most 2 subsets... | 1_64 |
Solve the system of equations
$$
\begin{aligned}
& \cos x+\cos y+\cos z=\frac{3 \sqrt{3}}{2} \\
& \sin x+\sin y+\sin z=\frac{3}{2}
\end{aligned}
$$ | <think>I. solution. We square both equations and then add the resulting equations. Taking into account the identity $\cos ^{2} \alpha+\sin ^{2} \alpha=1$, we obtain:
$$
\begin{gathered}
3+2(\cos x \cos y+\cos x \cos z+\cos y \cos z)+ \\
+2(\sin x \sin y+\sin x \sin z+\sin y \sin z)=\frac{27}{4}+\frac{9}{4}=\frac{36}{4... | \frac{\pi}{6}+2k\pi,\quad\frac{\pi}{6}+2\pi,\quad\frac{\pi}{6}+2n\pi | 4,456 | <think>I. solution. We square both equations and then add the resulting equations. Taking into account the identity $\cos ^{2} \alpha+\sin ^{2} \alpha=1$, we obtain:
$$
\begin{gathered}
3+2(\cos x \cos y+\cos x \cos z+\cos y \cos z)+ \\
+2(\sin x \sin y+\sin x \sin z+\sin y \sin z)=\frac{27}{4}+\frac{9}{4}=\frac{36}{4... | 1_65 |
A quartic funtion $ y \equal{} ax^4 \plus{} bx^3 \plus{} cx^2 \plus{} dx\plus{}e\ (a\neq 0)$ touches the line $ y \equal{} px \plus{} q$ at $ x \equal{} \alpha ,\ \beta \ (\alpha < \beta ).$ Find the area of the region bounded by these graphs in terms of $ a,\ \alpha ,\ \beta$. | <think>1. Given the quartic polynomial function \( y = ax^4 + bx^3 + cx^2 + dx + e \) and the line \( y = px + q \), we know that they touch at \( x = \alpha \) and \( x = \beta \) where \( \alpha < \beta \). This implies that at these points, the function values and their first derivatives are equal.
2. Define the fu... | \frac{a (\beta - \alpha)^5}{30} | 12,925 | <think>1. Given the quartic polynomial function \( y = ax^4 + bx^3 + cx^2 + dx + e \) and the line \( y = px + q \), we know that they touch at \( x = \alpha \) and \( x = \beta \) where \( \alpha < \beta \). This implies that at these points, the function values and their first derivatives are equal.
2. Define the fu... | 1_66 |
A round extendable table has a diameter of 1 meter. When extended, a $1 \mathrm{~m} \times 0.5 \mathrm{~m}$ rectangle fits between the two semicircular parts of the tabletop. Does the tabletop then have two points that are more than $150 \mathrm{~cm}$ apart? | <think>Solution. When the table is in its extended state, let's complete the semicircles to form the circles $k$ and $\ell$, with centers $K$ and $L$.
The line $KL$ intersects the circles $k$ and $\ell$ at points $A$ and $B$ respectively. Enlarge the circle $k$ from point $A$ by a factor of $\frac{3}{2}$. The image of... | 1.5\, | 18,002 | <think>Solution. When the table is in its extended state, let's complete the semicircles to form the circles $k$ and $\ell$, with centers $K$ and $L$.
The line $KL$ intersects the circles $k$ and $\ell$ at points $A$ and $B$ respectively. Enlarge the circle $k$ from point $A$ by a factor of $\frac{3}{2}$. The image of... | 1_67 |
1. The number $a_{n}$ is formed by writing down the first $n$ squares of consecutive natural numbers in sequence. For example, $a_{11}=149162536496481100$ 121. Determine how many numbers divisible by twelve are among the numbers $a_{1}, a_{2}, \ldots, a_{100000}$. | <think>1. As we know, every natural number $k$ gives the same remainder when divided by three as the number $S(k)$ equal to the sum of the digits of the original number $k$. The number $a_{n}$, therefore, gives the same remainder when divided by three as the sum $S\left(1^{2}\right)+S\left(2^{2}\right)+\ldots+S\left(n^... | 16667 | 83,105 | <think>1. As we know, every natural number $k$ gives the same remainder when divided by three as the number $S(k)$ equal to the sum of the digits of the original number $k$. The number $a_{n}$, therefore, gives the same remainder when divided by three as the sum $S\left(1^{2}\right)+S\left(2^{2}\right)+\ldots+S\left(n^... | 1_68 |
183. The probability of winning with one lottery ticket is $p=0.01$. How many tickets need to be bought to win at least one of them with a probability $P$, not less than 0.95? | <think>Solution. The probability of winning is small, and the number of tickets that need to be purchased is obviously large, so the number of winning tickets is approximately Poisson distributed.
It is clear that the events "none of the purchased tickets are winning" and "at least one ticket is winning" are opposite.... | 300 | 70,379 | <think>Solution. The probability of winning is small, and the number of tickets that need to be purchased is obviously large, so the number of winning tickets is approximately Poisson distributed.
It is clear that the events "none of the purchased tickets are winning" and "at least one ticket is winning" are opposite.... | 1_69 |
Let $M$ be the intersection of two diagonal, $AC$ and $BD$, of a rhombus $ABCD$, where angle $A<90^\circ$. Construct $O$ on segment $MC$ so that $OB<OC$ and let $t=\frac{MA}{MO}$, provided that $O \neq M$. Construct a circle that has $O$ as centre and goes through $B$ and $D$. Let the intersections between the circle a... | <think>1. **Identify the angles and properties of the rhombus:**
- Let $\alpha = \angle DAB = \angle BCD$ and $\beta = \angle ABC = \angle CDA$.
- Since $ABCD$ is a rhombus, $\alpha + \beta = 180^\circ$.
2. **Establish the cyclic nature of quadrilateral $XBYD$:**
- Since $XBYD$ is cyclic, the sums of the oppo... | \frac{t + 1}{t - 1} | 60,046 | <think>1. **Identify the angles and properties of the rhombus:**
- Let $\alpha = \angle DAB = \angle BCD$ and $\beta = \angle ABC = \angle CDA$.
- Since $ABCD$ is a rhombus, $\alpha + \beta = 180^\circ$.
2. **Establish the cyclic nature of quadrilateral $XBYD$:**
- Since $XBYD$ is cyclic, the sums of the oppo... | 1_70 |
2.12. Compute surface integrals of the first kind:
a) $\iint_{\sigma}|x| d S, \quad \sigma: x^{2}+y^{2}+z^{2}=1, \quad z \geqslant 0$
b) $\iint_{\sigma}\left(x^{2}+y^{2}\right) d S, \quad \sigma: x^{2}+y^{2}=2 z, \quad z=1$;
c) $\iint_{\sigma}\left(x^{2}+y^{2}+z^{2}\right) d S$, where $\sigma$ is the part of the cone... | <think>Solution.
a) Let's represent the hemisphere $x^{2}+y^{2}+z^{2}=1, z \geqslant 0$ with parametric equations:
$x=\sin \theta \cos \varphi, \quad y=\sin \theta \sin \varphi, \quad z=\cos 0, \quad \varphi \in[0,2 \pi], \quad \theta \in\left[0, \frac{\pi}{2}\right]$.
The element of area in this representation is
... | \pi,\frac{4\pi}{15}(1+15\sqrt{3}),3\sqrt{2}\pi | 92,533 | <think>Solution.
a) Let's represent the hemisphere $x^{2}+y^{2}+z^{2}=1, z \geqslant 0$ with parametric equations:
$x=\sin \theta \cos \varphi, \quad y=\sin \theta \sin \varphi, \quad z=\cos 0, \quad \varphi \in[0,2 \pi], \quad \theta \in\left[0, \frac{\pi}{2}\right]$.
The element of area in this representation is
... | 1_71 |
33. Let $n>3$ be an integer, and let $a_{1}, a_{2}, \cdots, a_{n}$ be non-negative real numbers satisfying $a_{1}+a_{2}+\cdots+a_{n}=2$. Find the minimum value of $\frac{a_{1}}{a_{2}^{2}+1}+\frac{a_{2}}{a_{3}^{2}+1}+\cdots+\frac{a_{n}}{a_{1}^{2}+1}$. 2007 China Girls' Mathematical Olympiad | <think>33. From $a_{1}+a_{2}+\cdots+a_{n}=2$, the problem is equivalent to finding the maximum value of:
$$\begin{array}{l}
a_{1}-\frac{a_{1}}{a_{2}^{2}+1}+a_{2}-\frac{a_{2}}{a_{3}^{2}+1}+\cdots+a_{n}-\frac{a_{n}}{a_{1}^{2}+1}= \\
\frac{a_{1} a_{2}^{2}}{a_{2}^{2}+1}+\frac{a_{2} a_{3}^{2}}{a_{3}^{2}+1}+\cdots+\frac{a_{n... | \frac{3}{2} | 65,248 | <think>33. From $a_{1}+a_{2}+\cdots+a_{n}=2$, the problem is equivalent to finding the maximum value of:
$$\begin{array}{l}
a_{1}-\frac{a_{1}}{a_{2}^{2}+1}+a_{2}-\frac{a_{2}}{a_{3}^{2}+1}+\cdots+a_{n}-\frac{a_{n}}{a_{1}^{2}+1}= \\
\frac{a_{1} a_{2}^{2}}{a_{2}^{2}+1}+\frac{a_{2} a_{3}^{2}}{a_{3}^{2}+1}+\cdots+\frac{a_{n... | 1_72 |
In rectangle $ABCD$, we have $A=(6,-22)$, $B=(2006,178)$, $D=(8,y)$, for some integer $y$. What is the area of rectangle $ABCD$?
$\mathrm{(A) \ } 4000\qquad \mathrm{(B) \ } 4040\qquad \mathrm{(C) \ } 4400\qquad \mathrm{(D) \ } 40,000\qquad \mathrm{(E) \ } 40,400$ | <think>Solution 1
Let the slope of $AB$ be $m_1$ and the slope of $AD$ be $m_2$.
$m_1 = \frac{178-(-22)}{2006-6} = \frac{1}{10}$
$m_2 = \frac{y-(-22)}{8-6} = \frac{y+22}{2}$
Since $AB$ and $AD$ form a right angle:
$m_2 = -\frac{1}{m_1}$
$m_2 = -10$
$\frac{y+22}{2} = -10$
$y = -42$
Using the [distance formula](https://... | 40400 | 31,719 | <think>Solution 1
Let the slope of $AB$ be $m_1$ and the slope of $AD$ be $m_2$.
$m_1 = \frac{178-(-22)}{2006-6} = \frac{1}{10}$
$m_2 = \frac{y-(-22)}{8-6} = \frac{y+22}{2}$
Since $AB$ and $AD$ form a right angle:
$m_2 = -\frac{1}{m_1}$
$m_2 = -10$
$\frac{y+22}{2} = -10$
$y = -42$
Using the [distance formula](https://... | 1_73 |
Three rays originating from a single point form pairwise angles of $60^{\circ}$. A unit radius sphere is tangent to all three rays. Calculate the distance from the center of the sphere to the starting point of the rays. | <think>I. solution. Let the rays be $e_{1}, e_{2}, e_{3}$, their common point $C$, the center of the tangent sphere $O$, and the points of tangency $E_{1}, E_{2}, E_{3}$, respectively, so $O E_{1} \perp C E_{1}, O E_{2} \perp C E_{2}, O E_{3} \perp C E_{3}$.
 In the Cartesian coordinate system $x O y$, $F_{1}$ and $F_{2}$ are the left and right foci of the ellipse $\frac{x^{2}}{2}+y^{2}=1$. Let the line $l$ intersect the ellipse at two distinct points $A$ and $B$, and suppose the line $l$ does not pass through the focus $F_{1}$. The distance from the focus $... | <think>11. Given the conditions, we know the points $F_{1}(-1,0)$ and $F_{2}(1,0)$. Let the line $l: y=kx+m$, and the points $A\left(x_{1}, y_{1}\right)$, $B\left(x_{2}, y_{2}\right)$.
Then $x_{1}$ and $x_{2}$ satisfy $\frac{x^{2}}{2}+(kx+m)^{2}=1$, which is
$$
\left(2k^{2}+1\right)x^{2}+4kmx+\left(2m^{2}-2\right)=0.
$... | \in(\sqrt{3},2) | 46,088 | <think>11. Given the conditions, we know the points $F_{1}(-1,0)$ and $F_{2}(1,0)$. Let the line $l: y=kx+m$, and the points $A\left(x_{1}, y_{1}\right)$, $B\left(x_{2}, y_{2}\right)$.
Then $x_{1}$ and $x_{2}$ satisfy $\frac{x^{2}}{2}+(kx+m)^{2}=1$, which is
$$
\left(2k^{2}+1\right)x^{2}+4kmx+\left(2m^{2}-2\right)=0.
$... | 1_75 |
Let $A B C$ be a triangle in the $x y$ plane, where $B$ is at the origin $(0,0)$. Let $B C$ be produced to $D$ such that $B C: C D=1: 1, C A$ be produced to $E$ such that $C A: A E=1: 2$ and $A B$ be produced to $F$ such that $A B: B F=1: 3$. Let $G(32,24)$ be the centroid of the triangle $A B C$ and $K$ be the centroi... | <think>1. **Determine the coordinates of points \(A\), \(B\), and \(C\)**:
- Let \(B = (0,0)\).
- Let \(C = (x,0)\) for some \(x\).
- Let \(A = (a,b)\).
2. **Find the coordinates of points \(D\), \(E\), and \(F\)**:
- Since \(BC:CD = 1:1\), \(D\) is at \((2x,0)\).
- Since \(CA:AE = 1:2\), \(E\) is at \(... | 48 | 92,492 | <think>1. **Determine the coordinates of points \(A\), \(B\), and \(C\)**:
- Let \(B = (0,0)\).
- Let \(C = (x,0)\) for some \(x\).
- Let \(A = (a,b)\).
2. **Find the coordinates of points \(D\), \(E\), and \(F\)**:
- Since \(BC:CD = 1:1\), \(D\) is at \((2x,0)\).
- Since \(CA:AE = 1:2\), \(E\) is at \(... | 1_76 |
5. Anna and Ekaterina have opened a cosmetic salon in New Moscow. The enterprise applies the general taxation system. Ekaterina attended a seminar on taxation and learned about the Simplified System of Taxation (USNO). To avoid changing the document flow and control over financial and economic operations, the friends d... | <think># Solution:
Reference information: Chapter 26.2, Chapter 25, Part 2 of the Tax Code of the Russian Federation.
- Criteria applicable under the simplified tax system (STS) - Article 346.13;
- Taxable object - Article 346.14;
- Determination of income - Article 346.15;
- Determination of expenses - Article 346.1... | 172800 | 69,115 | <think># Solution:
Reference information: Chapter 26.2, Chapter 25, Part 2 of the Tax Code of the Russian Federation.
- Criteria applicable under the simplified tax system (STS) - Article 346.13;
- Taxable object - Article 346.14;
- Determination of income - Article 346.15;
- Determination of expenses - Article 346.1... | 1_77 |
3. There are 48 matches. They are laid out in three unequal piles. Then three transfers of matches from pile to pile are performed. First, from the first pile to the second, as many matches are transferred as there were in the second pile. Then, from the second pile to the third, as many matches are transferred as ther... | <think># Solution:
We solve the problem from the end. As a result of all three transfers, the number of matches in all piles became the same, i.e., 48: 3 = 16 matches in each pile. During the third transfer, the number of matches in the first pile was doubled by adding as many matches as it already had. Therefore, bef... | 22;14;12 | 89,116 | <think># Solution:
We solve the problem from the end. As a result of all three transfers, the number of matches in all piles became the same, i.e., 48: 3 = 16 matches in each pile. During the third transfer, the number of matches in the first pile was doubled by adding as many matches as it already had. Therefore, bef... | 1_78 |
Among the right circular cylinders that can be inscribed in a sphere, for which cylinder will the ratio of the surface area to the volume be the smallest? | <think>I. solution. Let the radius of the sphere be $R$, the radius of the base circle of the cylinder be $r$, and the height of the cylinder be $h$. Since the center of the cylinder and the sphere coincide, by the Pythagorean theorem, $h=2 \sqrt{R^{2}-r^{2}}$, and the ratio of the surface area to the volume is
$$
\fr... | \frac{(\sqrt[3]{4}+1)^{\frac{3}{2}}}{R} | 26,802 | <think>I. solution. Let the radius of the sphere be $R$, the radius of the base circle of the cylinder be $r$, and the height of the cylinder be $h$. Since the center of the cylinder and the sphere coincide, by the Pythagorean theorem, $h=2 \sqrt{R^{2}-r^{2}}$, and the ratio of the surface area to the volume is
$$
\fr... | 1_79 |
In the triangle shown, the first diagonal line, $1,2,3,4, \ldots$, begins at 1 and each number after the first is one larger than the previous number. The second diagonal line, $2,4,6,8, \ldots$ begins at 2 and each number after the first is two larger than the previous number. The $n^{\text {th }}$ diagonal line begin... | <think>Consider the diagonal lines that begin on the left edge of the triangle and move downward to the right.
The first number in the $n^{\text {th }}$ diagonal line is $n$, and it lies in the $n^{\text {th }}$ horizontal row.
For example, the first number in the $3^{\text {rd }}$ diagonal line $(3,6,9,12, \ldots)$ ... | 89 | 38,575 | <think>Consider the diagonal lines that begin on the left edge of the triangle and move downward to the right.
The first number in the $n^{\text {th }}$ diagonal line is $n$, and it lies in the $n^{\text {th }}$ horizontal row.
For example, the first number in the $3^{\text {rd }}$ diagonal line $(3,6,9,12, \ldots)$ ... | 1_80 |
Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$, $B(0,12)$, $C(16,0)$, $A'(24,18)$, $B'(36,18)$, and $C'(24,2)$. A rotation of $m$ degrees clockwise around the point $(x,y)$, where $0<m<180$, will transform $\triangle ABC$ to $\triangle A'B'C'$. Find $m+x+y$. | <think>1. **Finding the center of rotation:**
- The center of rotation lies on the intersection of the perpendicular bisectors of the segments \(AA'\), \(BB'\), and \(CC'\). We will find the perpendicular bisectors of \(AA'\) and \(BB'\) and solve for their intersection.
2. **Perpendicular bisector of \(AA'\):**
... | 108 | 29,599 | <think>1. **Finding the center of rotation:**
- The center of rotation lies on the intersection of the perpendicular bisectors of the segments \(AA'\), \(BB'\), and \(CC'\). We will find the perpendicular bisectors of \(AA'\) and \(BB'\) and solve for their intersection.
2. **Perpendicular bisector of \(AA'\):**
... | 1_81 |
Example 7 (1994 National Training Team Question) Let $S=$ $\{1,2, \cdots, 10\}, A_{1}, A_{2}, \cdots, A_{k}$ be subsets of $S$, satisfying the conditions:
(1) $\left|A_{i}\right|=5(i=1,2, \cdots, k)$;
(2) $\left|A_{i} \cap A_{j}\right| \leqslant 2(1 \leqslant i<j \leqslant k)$.
Find the maximum value of $K$. | <think>Thought analysis: We should derive an upper bound for $K$ based on the conditions that the subsets must satisfy. Let's make the following exploration: Let $A_{1}=\{1,2,3,4,5\}$, and the intersection of any two subsets has at most 2 common elements. Let $A_{2}=\{1,2,6,7,8\}$. At this point, if $\{1,2\} \subseteq ... | 6 | 37,482 | <think>Thought analysis: We should derive an upper bound for $K$ based on the conditions that the subsets must satisfy. Let's make the following exploration: Let $A_{1}=\{1,2,3,4,5\}$, and the intersection of any two subsets has at most 2 common elements. Let $A_{2}=\{1,2,6,7,8\}$. At this point, if $\{1,2\} \subseteq ... | 1_82 |
113. Given a triangle with vertices $A(4 ; 6), B(-3 ; 0)$, $C(2 ;-3)$. Find the angles of the triangle, the equation of the bisector $A D$, the equation of the altitude $C E$, and the point of their intersection. | <think>Solution. The angular coefficients of the lines $AB, BC, AC$ (Fig. 19) will be found using formula (6) §5:
$$
\begin{gathered}
k_{A B}=\frac{y_{2}-y_{1}}{x_{2}-x_{1}}=\frac{0-6}{-3-4}=\frac{6}{7} ; k_{B C}=\frac{-3-0}{2-(-3)}=-\frac{3}{5} ; k_{A C}= \\
=\frac{-3-6}{2-4}=\frac{9}{2} .
\end{gathered}
$$
Now we w... | F(0;-\frac{2}{3}) | 56,126 | <think>Solution. The angular coefficients of the lines $AB, BC, AC$ (Fig. 19) will be found using formula (6) §5:
$$
\begin{gathered}
k_{A B}=\frac{y_{2}-y_{1}}{x_{2}-x_{1}}=\frac{0-6}{-3-4}=\frac{6}{7} ; k_{B C}=\frac{-3-0}{2-(-3)}=-\frac{3}{5} ; k_{A C}= \\
=\frac{-3-6}{2-4}=\frac{9}{2} .
\end{gathered}
$$
Now we w... | 1_83 |
\section*{Problem 6B - 121246B}
In the plane, let two non-intersecting circles \(k_{1}\) and \(k_{2}\) and a point \(A\) outside both circles be given.
We are looking for an equilateral triangle \(\triangle A B C\) such that \(B\) lies on \(k_{1}\) and \(C\) lies on \(k_{2}\).
a) Justify and describe a construction ... | <think>Assume there exists a \(B \in k_{1}\) and a \(C \in k_{2}\) with \(A B=B C=C A\), then I obtain the point \(C\), if \(B\) is already fixed, by rotating the segment \(A B\) around \(A\) by \(60^{\circ}\).
If I choose an arbitrary point \(B\) on \(k_{1}\) and rotate \(A B\) around \(A\) by \(60^{\circ}\), it is l... | 4 | 59,706 | <think>Assume there exists a \(B \in k_{1}\) and a \(C \in k_{2}\) with \(A B=B C=C A\), then I obtain the point \(C\), if \(B\) is already fixed, by rotating the segment \(A B\) around \(A\) by \(60^{\circ}\).
If I choose an arbitrary point \(B\) on \(k_{1}\) and rotate \(A B\) around \(A\) by \(60^{\circ}\), it is l... | 1_84 |
Find all triples $(a, b, p)$ of positive integers, where $p$ is a prime number, such that $a^p - b^p = 2013$. | <think>To find all triples \((a, b, p)\) of positive integers, where \(p\) is a prime number, such that \(a^p - b^p = 2013\), we proceed as follows:
1. **Initial Observations and Bounds:**
- Since \(a^p - b^p = 2013\) and \(a > b\), we start by considering small values of \(a\) and \(b\) to bound \(p\).
- For \(... | (337, 334, 2) | 35,415 | <think>To find all triples \((a, b, p)\) of positive integers, where \(p\) is a prime number, such that \(a^p - b^p = 2013\), we proceed as follows:
1. **Initial Observations and Bounds:**
- Since \(a^p - b^p = 2013\) and \(a > b\), we start by considering small values of \(a\) and \(b\) to bound \(p\).
- For \(... | 1_85 |
Problem 3. Vasya wants to find all integers $a$ such that the expression $10 n^{3}+3 n^{5}+7 a n$ is divisible by 15 for all integers $n$. What remainders can the number $a$ give when divided by 15? Provide all possible answers or prove that there are no such integers $a$. | <think>Answer: 11.
Solution. First, let's show that $n^{3} \equiv n(\bmod 3)$ and $n^{5} \equiv n(\bmod 5)$ for any natural $n$. This can be done in several ways. We will present only three of them.
First method. We will divide all natural numbers into groups based on their remainders when divided by 3 and 5:
| $n$ ... | 11 | 4,981 | <think>Answer: 11.
Solution. First, let's show that $n^{3} \equiv n(\bmod 3)$ and $n^{5} \equiv n(\bmod 5)$ for any natural $n$. This can be done in several ways. We will present only three of them.
First method. We will divide all natural numbers into groups based on their remainders when divided by 3 and 5:
| $n$ ... | 1_86 |
Example 12. Expand into a Laurent series in the annulus $0<|z-1|<2$ the function
$$
f(z)=\frac{1}{\left(z^{2}-1\right)^{2}}
$$ | <think>Solution: The first method. The function $f(z)=\frac{1}{\left(z^{2}-1\right)^{2}}$ is analytic in the annulus $0<|z-1|<2$, i.e., $n>-3$. Applying formula (2) from § 6 for the derivative of any order of an analytic function, we get
$$
\begin{aligned}
& c_{n}=\frac{1}{2 \pi i} \int_{\Gamma} \frac{\frac{1}{(z+1)^{... | \frac{1}{(z^{2}-1)^{2}}=\frac{1}{4}\frac{1}{(z-1)^{2}}-\frac{1}{4}\frac{1}{z-1}+\frac{3}{16}-\frac{1}{8}(z-1)+\frac{5}{64}(z-1)^{2}-\frac{3}{64}(z | 68,414 | <think>Solution: The first method. The function $f(z)=\frac{1}{\left(z^{2}-1\right)^{2}}$ is analytic in the annulus $0<|z-1|<2$, i.e., $n>-3$. Applying formula (2) from § 6 for the derivative of any order of an analytic function, we get
$$
\begin{aligned}
& c_{n}=\frac{1}{2 \pi i} \int_{\Gamma} \frac{\frac{1}{(z+1)^{... | 1_87 |
Each of the players in a tennis tournament played one match against each of the others. If every player won at least one match, show that there are three players A,B, and C such that A beats B, B beats C, and C beats A. Such a triple of player is called a cycle. Determine the number of maximum cycles such a tournament ... | <think>### First Part:
1. **Base Case:**
- For \( n = 3 \), the base case is trivial. If there are three players, each player must have won at least one match. Therefore, there must be a cycle among the three players.
2. **Inductive Step:**
- Assume the statement is true for a tournament with \( k \) players.
... | \frac{(n-1)n(n+1)}{24} | 62,561 | <think>### First Part:
1. **Base Case:**
- For \( n = 3 \), the base case is trivial. If there are three players, each player must have won at least one match. Therefore, there must be a cycle among the three players.
2. **Inductive Step:**
- Assume the statement is true for a tournament with \( k \) players.
... | 1_88 |
In the right-angled triangle $A B C$, the midpoint of the leg $B C$ is $D$, a point on the line $A D$ is $E$, the line $C E$ intersects the hypotenuse $A B$ at $F$, and the perpendicular from $F$ to $B C$ intersects $B E$ at $G$. What is the geometric locus of the point $G$ as $E$ runs along the line $A D$? | <think>Let's choose the axes of our coordinate system to be the lines $CB$ and $CA$, and let the coordinates be $A(0, a)$, $B(b, 0)$, so $D(b / 2, 0)$. Any point $E$ on the line $AD$ can be written as $E(\lambda b / 2, (1-\lambda) a)$, where $\lambda$ is any real number. The equation of the line $CE$ is
$$
y = \frac{2... | y_{0}=\frac{}{b^2}(x_{0}-b)^2 | 25,733 | <think>Let's choose the axes of our coordinate system to be the lines $CB$ and $CA$, and let the coordinates be $A(0, a)$, $B(b, 0)$, so $D(b / 2, 0)$. Any point $E$ on the line $AD$ can be written as $E(\lambda b / 2, (1-\lambda) a)$, where $\lambda$ is any real number. The equation of the line $CE$ is
$$
y = \frac{2... | 1_89 |
Construct a geometric gure in a sequence of steps. In step $1$, begin with a $4\times 4$ square. In step $2$, attach a $1\times 1$ square onto the each side of the original square so that the new squares are on the outside of the original square, have a side along the side of the original square, and the midpoints of ... | <think>1. **Step 1: Calculate the area of the initial square.**
- The initial square is a \(4 \times 4\) square.
- The area of the initial square is:
\[
4 \times 4 = 16
\]
2. **Step 2: Calculate the area of the squares added in step 2.**
- In step 2, four \(1 \times 1\) squares are added, one o... | 285 | 76,651 | <think>1. **Step 1: Calculate the area of the initial square.**
- The initial square is a \(4 \times 4\) square.
- The area of the initial square is:
\[
4 \times 4 = 16
\]
2. **Step 2: Calculate the area of the squares added in step 2.**
- In step 2, four \(1 \times 1\) squares are added, one o... | 1_90 |
3. Rectangle $R$ is divided into 2016 small rectangles, with each small rectangle's sides parallel to the sides of rectangle $R$. The vertices of the small rectangles are called "nodes". A line segment on the side of a small rectangle, if both of its endpoints are nodes and its interior does not contain any other nodes... | <think>3. Construct a graph $G$ with all nodes as vertices and basic segments as edges. Let there be $N$ basic segments, which is the number of edges in graph $G$. It is easy to see that the degree of vertices in graph $G$ can only be $2$, $3$, or $4$.
Vertices with degree $2$ are exactly the four vertices of rectangl... | N_{\max}=6049,N_{\}=4122 | 85,483 | <think>3. Construct a graph $G$ with all nodes as vertices and basic segments as edges. Let there be $N$ basic segments, which is the number of edges in graph $G$. It is easy to see that the degree of vertices in graph $G$ can only be $2$, $3$, or $4$.
Vertices with degree $2$ are exactly the four vertices of rectangl... | 1_91 |
In the rectangle $A B C D$, the midpoint of side $B C$ is $F$, and the point $H$ is the closer to $C$ of the two trisection points on side $C D$. How large can the angle $H A F$ be? | <think>I. solution. In similar rectangles, the angle $H A F$ is equal. Fix the side $B C$ and change the side $A B$, so we can find a similar rectangle for every rectangle in the plane among these rectangles. Let the length of the segment $B C$ be 2, and the length of the segment $A B$ be $3 x$. Then the tangent of the... | \frac{\pi}{6} | 49,530 | <think>I. solution. In similar rectangles, the angle $H A F$ is equal. Fix the side $B C$ and change the side $A B$, so we can find a similar rectangle for every rectangle in the plane among these rectangles. Let the length of the segment $B C$ be 2, and the length of the segment $A B$ be $3 x$. Then the tangent of the... | 1_92 |
For each integer $a_{0}>1$, define the sequence $a_{0}, a_{1}, \cdots$ as follows: for any $n \geqslant 0$,
$a_{n+1}=\left\{\begin{array}{ll}\sqrt{a_{n}}, & \sqrt{a_{n}} \text { is an integer; } \\ a_{n}+3, & \text { otherwise. }\end{array}\right.$
Find all $a_{0}$ such that there exists a number $A$ for which $a_{n}=A... | <think>1. $a_{0}$ is all multiples of 3.
Since $a_{n+1}$ is determined solely by $a_{n}$, the sequence $\left\{a_{n}\right\}$ has infinitely many equal terms if and only if the sequence is eventually periodic, which is equivalent to the sequence being bounded.
Notice that perfect squares modulo 3 are congruent to 0 o... | a_{0} \text{ is all multiples of 3} | 6,621 | <think>1. $a_{0}$ is all multiples of 3.
Since $a_{n+1}$ is determined solely by $a_{n}$, the sequence $\left\{a_{n}\right\}$ has infinitely many equal terms if and only if the sequence is eventually periodic, which is equivalent to the sequence being bounded.
Notice that perfect squares modulo 3 are congruent to 0 o... | 1_93 |
The following $100$ numbers are written on the board: $$2^1 - 1, 2^2 - 1, 2^3 - 1, \dots, 2^{100} - 1.$$
Alice chooses two numbers $a,b,$ erases them and writes the number $\dfrac{ab - 1}{a+b+2}$ on the board. She keeps doing this until a single number remains on the board.
If the sum of all possible numbers she can ... | <think>1. **Define the function and verify symmetry:**
Let \( f(a, b) = \frac{ab - 1}{a + b + 2} \). We need to verify that \( f(a, b) = f(b, a) \):
\[
f(a, b) = \frac{ab - 1}{a + b + 2} = \frac{ba - 1}{b + a + 2} = f(b, a)
\]
This shows that \( f \) is symmetric.
2. **Prove the associativity property:*... | 100 | 24,425 | <think>1. **Define the function and verify symmetry:**
Let \( f(a, b) = \frac{ab - 1}{a + b + 2} \). We need to verify that \( f(a, b) = f(b, a) \):
\[
f(a, b) = \frac{ab - 1}{a + b + 2} = \frac{ba - 1}{b + a + 2} = f(b, a)
\]
This shows that \( f \) is symmetric.
2. **Prove the associativity property:*... | 1_94 |
Van 4 points on a plane. The distance between any two points is at most 1. What is the maximum possible sum of the squares of the 6 distances between the 4 points? | <think>If two of the four points coincide, the distance between these two points is zero, and the other five distances are at most one, so the sum of the squares of the six distances is at most 5. The value 5 can also be achieved; if three points form a regular triangle with a side length of one unit, and the fourth po... | 5 | 41,751 | <think>If two of the four points coincide, the distance between these two points is zero, and the other five distances are at most one, so the sum of the squares of the six distances is at most 5. The value 5 can also be achieved; if three points form a regular triangle with a side length of one unit, and the fourth po... | 1_95 |
A few (at least $5$) integers are put on a circle, such that each of them is divisible by the sum of its neighbors. If the sum of all numbers is positive, what is its minimal value? | <think>1. **Understanding the Problem:**
We need to find the minimal positive sum of integers placed on a circle such that each integer is divisible by the sum of its neighbors. The sum of all numbers must be positive.
2. **Analyzing the Divisibility Condition:**
Let the integers be \(a_1, a_2, \ldots, a_n\) arr... | 2 | 25,416 | <think>1. **Understanding the Problem:**
We need to find the minimal positive sum of integers placed on a circle such that each integer is divisible by the sum of its neighbors. The sum of all numbers must be positive.
2. **Analyzing the Divisibility Condition:**
Let the integers be \(a_1, a_2, \ldots, a_n\) arr... | 1_96 |
Let $ a$, $ b$, $ c$, and $ d$ be real numbers with $ |a\minus{}b|\equal{}2$, $ |b\minus{}c|\equal{}3$, and $ |c\minus{}d|\equal{}4$. What is the sum of all possible values of $ |a\minus{}d|$?
$ \textbf{(A)}\ 9 \qquad
\textbf{(B)}\ 12 \qquad
\textbf{(C)}\ 15 \qquad
\textbf{(D)}\ 18 \qquad
\textbf{(E)}\ 24$ | <think>1. Given the absolute value equations:
\[
|a - b| = 2 \implies a - b = 2 \text{ or } a - b = -2
\]
\[
|b - c| = 3 \implies b - c = 3 \text{ or } b - c = -3
\]
\[
|c - d| = 4 \implies c - d = 4 \text{ or } c - d = -4
\]
2. We need to find all possible values of \( |a - d| \). We will c... | 18 | 6,538 | <think>1. Given the absolute value equations:
\[
|a - b| = 2 \implies a - b = 2 \text{ or } a - b = -2
\]
\[
|b - c| = 3 \implies b - c = 3 \text{ or } b - c = -3
\]
\[
|c - d| = 4 \implies c - d = 4 \text{ or } c - d = -4
\]
2. We need to find all possible values of \( |a - d| \). We will c... | 1_97 |
Determine the number of integers $a$ with $1\leq a\leq 1007$ and the property that both $a$ and $a+1$ are quadratic residues mod $1009$. | <think>To determine the number of integers \( a \) with \( 1 \leq a \leq 1007 \) such that both \( a \) and \( a+1 \) are quadratic residues modulo \( 1009 \), we need to analyze the properties of quadratic residues modulo a prime number.
1. **Quadratic Residue Definition**:
An integer \( x \) is a quadratic residu... | 251 | 4,158 | <think>To determine the number of integers \( a \) with \( 1 \leq a \leq 1007 \) such that both \( a \) and \( a+1 \) are quadratic residues modulo \( 1009 \), we need to analyze the properties of quadratic residues modulo a prime number.
1. **Quadratic Residue Definition**:
An integer \( x \) is a quadratic residu... | 1_98 |
Let $m > 1$ be an integer. A sequence $a_1, a_2, a_3, \ldots$ is defined by $a_1 = a_2 = 1$, $a_3 = 4$, and for all $n \ge 4$, $$a_n = m(a_{n - 1} + a_{n - 2}) - a_{n - 3}.$$
Determine all integers $m$ such that every term of the sequence is a square. | <think>1. **Initial Terms and Recurrence Relation:**
Given the sequence \(a_1, a_2, a_3, \ldots\) defined by:
\[
a_1 = 1, \quad a_2 = 1, \quad a_3 = 4, \quad \text{and} \quad a_n = m(a_{n-1} + a_{n-2}) - a_{n-3} \quad \text{for} \quad n \geq 4
\]
We need to determine all integers \(m\) such that every te... | m = 2 | 35,212 | <think>1. **Initial Terms and Recurrence Relation:**
Given the sequence \(a_1, a_2, a_3, \ldots\) defined by:
\[
a_1 = 1, \quad a_2 = 1, \quad a_3 = 4, \quad \text{and} \quad a_n = m(a_{n-1} + a_{n-2}) - a_{n-3} \quad \text{for} \quad n \geq 4
\]
We need to determine all integers \(m\) such that every te... | 1_99 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.