Dataset Viewer
Auto-converted to Parquet Duplicate
question
stringlengths
37
4.33k
thinking
stringlengths
2.12k
2.4k
answer
stringlengths
1
190
id
int64
56
93.7k
content
stringlengths
2.12k
2.58k
id_
stringlengths
3
6
Let $n$ be an integer greater than $1$, and let $p$ be a prime divisor of $n$. A confederation consists of $p$ states, each of which has exactly $n$ airports. There are $p$ air companies operating interstate flights only such that every two airports in different states are joined by a direct (two-way) flight operated ...
<think>Switch to graph theoretical notation: a \( p \)-partite complete graph \( K_{n,n,\ldots,n} \) has its edges colored in \( p \) distinct colors. We need to determine the minimal size of the largest connected component in the color subgraphs \( G_i \), \( i=1,2,\ldots,p \). We claim the required size is \( n \). ...
n
86,704
<think>Switch to graph theoretical notation: a \( p \)-partite complete graph \( K_{n,n,\ldots,n} \) has its edges colored in \( p \) distinct colors. We need to determine the minimal size of the largest connected component in the color subgraphs \( G_i \), \( i=1,2,\ldots,p \). We claim the required size is \( n \). ...
1_0
Find all natural numbers $n$ for which $n + 195$ and $n - 274$ are perfect cubes.
<think>1. Let \( n + 195 = x^3 \) and \( n - 274 = y^3 \). This implies: \[ n = x^3 - 195 \quad \text{and} \quad n = y^3 + 274 \] Equating the two expressions for \( n \), we get: \[ x^3 - 195 = y^3 + 274 \] Simplifying, we obtain: \[ x^3 - y^3 = 469 \] 2. We can factorize \( x^3 - y^3...
2002
41,683
<think>1. Let \( n + 195 = x^3 \) and \( n - 274 = y^3 \). This implies: \[ n = x^3 - 195 \quad \text{and} \quad n = y^3 + 274 \] Equating the two expressions for \( n \), we get: \[ x^3 - 195 = y^3 + 274 \] Simplifying, we obtain: \[ x^3 - y^3 = 469 \] 2. We can factorize \( x^3 - y^3...
1_1
A spinning turntable is rotating in a vertical plane with period $ 500 \, \text{ms} $. It has diameter 2 feet carries a ping-pong ball at the edge of its circumference. The ball is bolted on to the turntable but is released from its clutch at a moment in time when the ball makes a subtended angle of $\theta>0$ with the...
<think>1. **Determine the velocity of projection:** The turntable has a period \( T = 500 \, \text{ms} = 0.5 \, \text{s} \) and a diameter of 2 feet, so the radius \( r = 1 \, \text{foot} \). The velocity \( u \) of the ball at the edge of the turntable is given by: \[ u = \frac{2 \pi r}{T} \] Substituti...
12^\circ
91,366
<think>1. **Determine the velocity of projection:** The turntable has a period \( T = 500 \, \text{ms} = 0.5 \, \text{s} \) and a diameter of 2 feet, so the radius \( r = 1 \, \text{foot} \). The velocity \( u \) of the ball at the edge of the turntable is given by: \[ u = \frac{2 \pi r}{T} \] Substituti...
1_2
The side lengths $a,b,c$ of a triangle $ABC$ are positive integers. Let:\\ \[T_{n}=(a+b+c)^{2n}-(a-b+c)^{2n}-(a+b-c)^{2n}+(a-b-c)^{2n}\] for any positive integer $n$. If $\frac{T_{2}}{2T_{1}}=2023$ and $a>b>c$ , determine all possible perimeters of the triangle $ABC$.
<think>1. We start with the given expression for \( T_n \): \[ T_n = (a+b+c)^{2n} - (a-b+c)^{2n} - (a+b-c)^{2n} + (a-b-c)^{2n} \] 2. We need to find \( T_1 \) and \( T_2 \): \[ T_1 = (a+b+c)^2 - (a-b+c)^2 - (a+b-c)^2 + (a-b-c)^2 \] 3. Expand each term: \[ (a+b+c)^2 = a^2 + b^2 + c^2 + 2ab + 2bc + 2ca \] \[ (a-b+c)...
49
82,797
<think>1. We start with the given expression for \( T_n \): \[ T_n = (a+b+c)^{2n} - (a-b+c)^{2n} - (a+b-c)^{2n} + (a-b-c)^{2n} \] 2. We need to find \( T_1 \) and \( T_2 \): \[ T_1 = (a+b+c)^2 - (a-b+c)^2 - (a+b-c)^2 + (a-b-c)^2 \] 3. Expand each term: \[ (a+b+c)^2 = a^2 + b^2 + c^2 + 2ab + 2bc + 2ca \] \[ (a-b+c)...
1_3
Suppose that $a$ is an integer. A sequence $x_{1}, x_{2}, x_{3}, x_{4}, \ldots$ is constructed with - $x_{1}=a$, - $x_{2 k}=2 x_{2 k-1}$ for every integer $k \geq 1$, and - $x_{2 k+1}=x_{2 k}-1$ for every integer $k \geq 1$. For example, if $a=2$, then $$ x_{1}=2 \quad x_{2}=2 x_{1}=4 \quad x_{3}=x_{2}-1=3 \quad x_{...
<think>Suppose that $x_{1}=a$. Then $$ \begin{aligned} x_{2} & =2 x_{1}=2 a \\ x_{3} & =x_{2}-1=2 a-1 \\ x_{4} & =2 x_{3}=4 a-2 \\ x_{5} & =x_{4}-1=4 a-3 \\ x_{6} & =2 x_{5}=8 a-6 \\ x_{7} & =x_{6}-1=8 a-7 \\ x_{8} & =2 x_{7}=16 a-14 \\ x_{9} & =x_{8}-1=16 a-15 \\ x_{10} & =2 x_{9}=32 a-30 \\ x_{11} & =x_{10}-1=32 a-...
1409
13,486
<think>Suppose that $x_{1}=a$. Then $$ \begin{aligned} x_{2} & =2 x_{1}=2 a \\ x_{3} & =x_{2}-1=2 a-1 \\ x_{4} & =2 x_{3}=4 a-2 \\ x_{5} & =x_{4}-1=4 a-3 \\ x_{6} & =2 x_{5}=8 a-6 \\ x_{7} & =x_{6}-1=8 a-7 \\ x_{8} & =2 x_{7}=16 a-14 \\ x_{9} & =x_{8}-1=16 a-15 \\ x_{10} & =2 x_{9}=32 a-30 \\ x_{11} & =x_{10}-1=32 a-...
1_4
11. (20 points) Given positive real numbers $0<a<b$, let $x_{1}$, $x_{2}$, $x_{3}$, $x_{4} \in [a, b]$. Find $$ \frac{\frac{x_{1}^{2}}{x_{2}}+\frac{x_{2}^{2}}{x_{3}}+\frac{x_{3}^{2}}{x_{4}}+\frac{x_{4}^{2}}{x_{1}}}{x_{1}+x_{2}+x_{3}+x_{4}} $$ the minimum and maximum values.
<think>11. (1) Given $x_{1}, x_{2}, x_{3}, x_{4} \in [a, b], 0 < a < b$, we know $$ \begin{array}{l} \frac{x_{1}^{2}}{x_{2}} + x_{2} \geqslant 2 \sqrt{\frac{x_{1}^{2}}{x_{2}} \cdot x_{2}} = 2 x_{1}, \\ \frac{x_{2}^{2}}{x_{3}} + x_{3} \geqslant 2 \sqrt{\frac{x_{2}^{2}}{x_{3}} \cdot x_{3}} = 2 x_{2}, \\ \frac{x_{3}^{2}}...
1\frac{b}{}+\frac{}{b}-1
74,967
<think>11. (1) Given $x_{1}, x_{2}, x_{3}, x_{4} \in [a, b], 0 < a < b$, we know $$ \begin{array}{l} \frac{x_{1}^{2}}{x_{2}} + x_{2} \geqslant 2 \sqrt{\frac{x_{1}^{2}}{x_{2}} \cdot x_{2}} = 2 x_{1}, \\ \frac{x_{2}^{2}}{x_{3}} + x_{3} \geqslant 2 \sqrt{\frac{x_{2}^{2}}{x_{3}} \cdot x_{3}} = 2 x_{2}, \\ \frac{x_{3}^{2}}...
1_5
The new PUMaC tournament hosts $2020$ students, numbered by the following set of labels $1, 2, . . . , 2020$. The students are initially divided up into $20$ groups of $101$, with each division into groups equally likely. In each of the groups, the contestant with the lowest label wins, and the winners advance to the s...
<think>1. **Restate the problem**: We need to find the expected value of the champion's number in a tournament where 2020 students are divided into 20 groups of 101, and the lowest-numbered student in each group wins. The champion is then chosen uniformly at random from these 20 winners. The expected value of the champ...
2123
24,480
<think>1. **Restate the problem**: We need to find the expected value of the champion's number in a tournament where 2020 students are divided into 20 groups of 101, and the lowest-numbered student in each group wins. The champion is then chosen uniformly at random from these 20 winners. The expected value of the champ...
1_6
Consider a regular polygon with $2^n$ sides, for $n \ge 2$, inscribed in a circle of radius $1$. Denote the area of this polygon by $A_n$. Compute $\prod_{i=2}^{\infty}\frac{A_i}{A_{i+1}}$
<think>1. **Understanding the Problem:** We are given a regular polygon with \(2^n\) sides inscribed in a circle of radius 1. We need to compute the infinite product \(\prod_{i=2}^{\infty}\frac{A_i}{A_{i+1}}\), where \(A_n\) denotes the area of the polygon with \(2^n\) sides. 2. **Area of a Regular Polygon:** Th...
\frac{2}{\pi}
18,314
<think>1. **Understanding the Problem:** We are given a regular polygon with \(2^n\) sides inscribed in a circle of radius 1. We need to compute the infinite product \(\prod_{i=2}^{\infty}\frac{A_i}{A_{i+1}}\), where \(A_n\) denotes the area of the polygon with \(2^n\) sides. 2. **Area of a Regular Polygon:** Th...
1_7
8.6. On a certain segment, its endpoints and three internal points were marked. It turned out that all pairwise distances between the five marked points are different and are expressed in whole centimeters. What is the smallest possible length of the segment? Justify your answer.
<think>Solution: There are 5 points, so there are 10 pairwise distances. If all of them are expressed as positive whole numbers of centimeters and are distinct, at least one of them is not less than 10. Therefore, the length of the segment is not less than 10. Suppose the length of the segment is exactly 10. Then the p...
11
93,724
<think>Solution: There are 5 points, so there are 10 pairwise distances. If all of them are expressed as positive whole numbers of centimeters and are distinct, at least one of them is not less than 10. Therefore, the length of the segment is not less than 10. Suppose the length of the segment is exactly 10. Then the p...
1_8
The numbers $p$ and $q$ are prime and satisfy \[\frac{p}{{p + 1}} + \frac{{q + 1}}{q} = \frac{{2n}}{{n + 2}}\] for some positive integer $n$. Find all possible values of $q-p$. [i]Luxembourg (Pierre Haas)[/i]
<think>1. We start with the given equation: \[ \frac{p}{p + 1} + \frac{q + 1}{q} = \frac{2n}{n + 2} \] We can rewrite the fractions on the left-hand side: \[ \frac{p}{p + 1} = 1 - \frac{1}{p + 1} \quad \text{and} \quad \frac{q + 1}{q} = 1 + \frac{1}{q} \] Substituting these into the equation, we...
\{2, 3, 5\}
47,324
<think>1. We start with the given equation: \[ \frac{p}{p + 1} + \frac{q + 1}{q} = \frac{2n}{n + 2} \] We can rewrite the fractions on the left-hand side: \[ \frac{p}{p + 1} = 1 - \frac{1}{p + 1} \quad \text{and} \quad \frac{q + 1}{q} = 1 + \frac{1}{q} \] Substituting these into the equation, we...
1_9
7. Let $n$ be a positive integer. From the set $\{1,2, \cdots, 2015\}$, the probability that a randomly chosen positive integer $n$ is a solution to the equation $$ \left[\frac{n}{2}\right]=\left[\frac{n}{3}\right]+\left[\frac{n}{6}\right] $$ is $\qquad$ ( $[x]$ denotes the greatest integer not exceeding the real numb...
<think>7. $\frac{1007}{2015}$. When $n=6 k\left(k \in \mathbf{Z}_{+}\right)$, $$ \begin{array}{l} {\left[\frac{n}{2}\right]=\left[\frac{6 k}{2}\right]=3 k,} \\ {\left[\frac{n}{3}\right]+\left[\frac{n}{6}\right]=\left[\frac{6 k}{3}\right]+\left[\frac{6 k}{6}\right]=2 k+k=3 k,} \end{array} $$ The $n$ that satisfies the...
\frac{1007}{2015}
61,375
<think>7. $\frac{1007}{2015}$. When $n=6 k\left(k \in \mathbf{Z}_{+}\right)$, $$ \begin{array}{l} {\left[\frac{n}{2}\right]=\left[\frac{6 k}{2}\right]=3 k,} \\ {\left[\frac{n}{3}\right]+\left[\frac{n}{6}\right]=\left[\frac{6 k}{3}\right]+\left[\frac{6 k}{6}\right]=2 k+k=3 k,} \end{array} $$ The $n$ that satisfies the...
1_10
1. We will call a prime number nice if it can be written as the difference of two cubes of natural numbers. Determine the last digit of all nice prime numbers.
<think>1. First, notice that $5^{3}-4^{3}=61$, $2^{3}-1^{3}=7$, and $3^{3}-2^{3}=19$ are all nice prime numbers, so 1, 7, and 9 belong to the sought-after last digits. We will show that no other digits can be the last digit. Choose a nice prime number $p$ and write it as $m^{3}-n^{3}$, where $m>n$ are natural numbers....
1,7,9
42,551
<think>1. First, notice that $5^{3}-4^{3}=61$, $2^{3}-1^{3}=7$, and $3^{3}-2^{3}=19$ are all nice prime numbers, so 1, 7, and 9 belong to the sought-after last digits. We will show that no other digits can be the last digit. Choose a nice prime number $p$ and write it as $m^{3}-n^{3}$, where $m>n$ are natural numbers....
1_11
In kindergarden, there are 32 children and three classes: Judo, Agriculture, and Math. Every child is in exactly one class and every class has at least one participant. One day, the teacher gathered 6 children to clean up the classroom. The teacher counted and found that exactly 1/2 of the Judo students, 1/4 of the Ag...
<think>1. Let \( j \) be the number of children in the Judo class, \( a \) be the number of children in the Agriculture class, and \( m \) be the number of children in the Math class. We know that: \[ j + a + m = 32 \] This equation represents the total number of children in the kindergarten. 2. The teache...
(j, a, m) = (4, 4, 24)
42,057
<think>1. Let \( j \) be the number of children in the Judo class, \( a \) be the number of children in the Agriculture class, and \( m \) be the number of children in the Math class. We know that: \[ j + a + m = 32 \] This equation represents the total number of children in the kindergarten. 2. The teache...
1_12
$ABC$ is a triangle with $AB = 33$, $AC = 21$ and $BC = m$, an integer. There are points $D$, $E$ on the sides $AB$, $AC$ respectively such that $AD = DE = EC = n$, an integer. Find $m$.
<think>1. Given a triangle \(ABC\) with \(AB = 33\), \(AC = 21\), and \(BC = m\), where \(m\) is an integer. Points \(D\) and \(E\) are on sides \(AB\) and \(AC\) respectively such that \(AD = DE = EC = n\), where \(n\) is also an integer. We need to find \(m\). 2. Let \(\angle BAC = k\). In triangle \(ADE\), we have:...
30
90,818
<think>1. Given a triangle \(ABC\) with \(AB = 33\), \(AC = 21\), and \(BC = m\), where \(m\) is an integer. Points \(D\) and \(E\) are on sides \(AB\) and \(AC\) respectively such that \(AD = DE = EC = n\), where \(n\) is also an integer. We need to find \(m\). 2. Let \(\angle BAC = k\). In triangle \(ADE\), we have:...
1_13
## Problem Statement Calculate the indefinite integral: $$ \int \frac{x^{3}-6 x^{2}+14 x-6}{(x+1)(x-2)^{3}} d x $$
<think>## Solution $$ \int \frac{x^{3}-6 x^{2}+14 x-6}{(x+1)(x-2)^{3}} d x= $$ We decompose the proper rational fraction into partial fractions using the method of undetermined coefficients: $$ \begin{aligned} & \frac{x^{3}-6 x^{2}+14 x-6}{(x+1)(x-2)^{3}}=\frac{A}{x+1}+\frac{B_{1}}{x-2}+\frac{B_{2}}{(x-2)^{2}}+\frac...
\ln|x+1|-\frac{1}{(x-2)^{2}}+C
91,052
<think>## Solution $$ \int \frac{x^{3}-6 x^{2}+14 x-6}{(x+1)(x-2)^{3}} d x= $$ We decompose the proper rational fraction into partial fractions using the method of undetermined coefficients: $$ \begin{aligned} & \frac{x^{3}-6 x^{2}+14 x-6}{(x+1)(x-2)^{3}}=\frac{A}{x+1}+\frac{B_{1}}{x-2}+\frac{B_{2}}{(x-2)^{2}}+\frac...
1_14
In the square $A B C D$, the point $P$ was taken inside such that $A P: B P: C P=1: 2: 3$. What is the measure of the angle $A P B$?
<think>I. solution. Rotate the $B P C$ triangle $90^{\circ}$ around $B$ so that the image of $C$ is $A$. Let $P^{\prime}$ be the rotated image of $P$ (1st figure). Then the $P^{\prime} B P$ triangle is isosceles and the angle at $B$ is a right angle. Therefore, $P^{\prime} P B \varangle=45^{\circ}$, and by the Pythagor...
135
23,613
<think>I. solution. Rotate the $B P C$ triangle $90^{\circ}$ around $B$ so that the image of $C$ is $A$. Let $P^{\prime}$ be the rotated image of $P$ (1st figure). Then the $P^{\prime} B P$ triangle is isosceles and the angle at $B$ is a right angle. Therefore, $P^{\prime} P B \varangle=45^{\circ}$, and by the Pythagor...
1_15
Triangle $ABC$ is inscribed in a unit circle $\omega$. Let $H$ be its orthocenter and $D$ be the foot of the perpendicular from $A$ to $BC$. Let $\triangle XY Z$ be the triangle formed by drawing the tangents to $\omega$ at $A, B, C$. If $\overline{AH} = \overline{HD}$ and the side lengths of $\triangle XY Z$ form an a...
<think>1. **Understanding the Problem:** - We have a triangle \( \triangle ABC \) inscribed in a unit circle \( \omega \). - \( H \) is the orthocenter of \( \triangle ABC \). - \( D \) is the foot of the perpendicular from \( A \) to \( BC \). - \( \triangle XYZ \) is formed by drawing tangents to \( \omeg...
11
2,441
<think>1. **Understanding the Problem:** - We have a triangle \( \triangle ABC \) inscribed in a unit circle \( \omega \). - \( H \) is the orthocenter of \( \triangle ABC \). - \( D \) is the foot of the perpendicular from \( A \) to \( BC \). - \( \triangle XYZ \) is formed by drawing tangents to \( \omeg...
1_16
A polynomial of degree four with leading coefficient 1 and integer coefficients has two zeros, both of which are integers. Which of the following can also be a zero of the polynomial? $ \textbf{(A)} \ \frac {1 \plus{} i \sqrt {11}}{2} \qquad \textbf{(B)} \ \frac {1 \plus{} i}{2} \qquad \textbf{(C)} \ \frac {1}{2} \p...
<think>1. Let \( P(x) \) be a polynomial of degree four with leading coefficient 1 and integer coefficients. Given that \( P(x) \) has two zeros which are integers, we can write: \[ P(x) = (x - a)(x - b)Q(x) \] where \( a \) and \( b \) are integers, and \( Q(x) \) is a quadratic polynomial with integer coe...
\textbf{(A)}
36,191
<think>1. Let \( P(x) \) be a polynomial of degree four with leading coefficient 1 and integer coefficients. Given that \( P(x) \) has two zeros which are integers, we can write: \[ P(x) = (x - a)(x - b)Q(x) \] where \( a \) and \( b \) are integers, and \( Q(x) \) is a quadratic polynomial with integer coe...
1_17
Let $ n$ be a positive integer. Find all $ x_1,x_2,\ldots,x_n$ that satisfy the relation: \[ \sqrt{x_1\minus{}1}\plus{}2\cdot \sqrt{x_2\minus{}4}\plus{}3\cdot \sqrt{x_3\minus{}9}\plus{}\cdots\plus{}n\cdot\sqrt{x_n\minus{}n^2}\equal{}\frac{1}{2}(x_1\plus{}x_2\plus{}x_3\plus{}\cdots\plus{}x_n).\]
<think>1. We start with the given equation: \[ \sqrt{x_1 - 1} + 2 \cdot \sqrt{x_2 - 4} + 3 \cdot \sqrt{x_3 - 9} + \cdots + n \cdot \sqrt{x_n - n^2} = \frac{1}{2}(x_1 + x_2 + x_3 + \cdots + x_n). \] 2. Let's assume \( x_i = k \cdot i^2 \) for some constant \( k \). We will determine \( k \) such that the equat...
x_i = 2i^2 \text{ for } i = 1, 2, \ldots, n.
20,314
<think>1. We start with the given equation: \[ \sqrt{x_1 - 1} + 2 \cdot \sqrt{x_2 - 4} + 3 \cdot \sqrt{x_3 - 9} + \cdots + n \cdot \sqrt{x_n - n^2} = \frac{1}{2}(x_1 + x_2 + x_3 + \cdots + x_n). \] 2. Let's assume \( x_i = k \cdot i^2 \) for some constant \( k \). We will determine \( k \) such that the equat...
1_18
4. Given that $A_{1}, B_{1}, C_{1}, D_{1}$ are points on the four sides of square $A B C D$. The following are two propositions about it: (1) If $A_{1} B_{1} C_{1} D_{1}$ is a rectangle with unequal adjacent sides, then the rectangle $A_{1} B_{1} C_{1} D_{1}$ must have a side parallel to one of the diagonals of the squ...
<think>4. (D). (1) As shown in the figure, it is easy to know that $\angle A D_{1} A_{1} + \angle D D_{1} C_{1} = 90^{\circ}, \angle D D_{1} C_{1} + \angle D C_{1} D_{1} = 90^{\circ}, \angle A D_{1} A_{1} = \angle D C_{1} D_{1}$, thus $\triangle A D_{1} A_{1} \sim \triangle D C_{1} D_{1}$. Also, Rt $\triangle A D_{1} A...
D
2,242
<think>4. (D). (1) As shown in the figure, it is easy to know that $\angle A D_{1} A_{1} + \angle D D_{1} C_{1} = 90^{\circ}, \angle D D_{1} C_{1} + \angle D C_{1} D_{1} = 90^{\circ}, \angle A D_{1} A_{1} = \angle D C_{1} D_{1}$, thus $\triangle A D_{1} A_{1} \sim \triangle D C_{1} D_{1}$. Also, Rt $\triangle A D_{1} A...
1_19
Brad answers 10 math problems, one after another. He answers the first problem correctly and answers the second problem incorrectly. For each of the remaining 8 problems, the probability that he answers the problem correctly equals the ratio of the number of problems that he has already answered correctly to the total ...
<think>Brad's answer to each question is either right or wrong, and so there are $2^{8}$ possible combinations of right and wrong answers for the remaining 8 questions. Since Brad has already answered exactly 1 question correctly, then $\binom{8}{4}$ of these combinations will include exactly 5 correct answers. (We ch...
\frac{1}{9}
13,451
<think>Brad's answer to each question is either right or wrong, and so there are $2^{8}$ possible combinations of right and wrong answers for the remaining 8 questions. Since Brad has already answered exactly 1 question correctly, then $\binom{8}{4}$ of these combinations will include exactly 5 correct answers. (We ch...
1_20
Solve the following system of equations: $$ \begin{aligned} & \cos x+\cos y=\cos (x+y) \\ & \sin x+\sin y=\sin (x+y) \end{aligned} $$
<think>I. solution. Let us introduce the notations $u=\frac{x+y}{2}$ and $v=\frac{x-y}{2}$. With these, $x=u+v, y=u-v$, and our system of equations transforms into: $$ \begin{aligned} & 2 \cos u \cos v=2 \cos ^{2} u-1 \\ & 2 \sin u \cos v=2 \sin u \cos u \end{aligned} $$ From (1), $\cos u \neq \cos v$, since $2 \cos ...
\begin{aligned}&\\frac{\pi}{3}+2(k+)\pi,\\&\\frac{\pi}{3}+2\pi\end{aligned}
53,153
<think>I. solution. Let us introduce the notations $u=\frac{x+y}{2}$ and $v=\frac{x-y}{2}$. With these, $x=u+v, y=u-v$, and our system of equations transforms into: $$ \begin{aligned} & 2 \cos u \cos v=2 \cos ^{2} u-1 \\ & 2 \sin u \cos v=2 \sin u \cos u \end{aligned} $$ From (1), $\cos u \neq \cos v$, since $2 \cos ...
1_21
A group of hikers sets out on a journey at a constant speed of $5 \mathrm{~km}$ per hour. 4 hours and 24 minutes later, a cyclist messenger sets out after them. After $8 \mathrm{~km}$, the cyclist's inner tube bursts. It takes 10 minutes to change the tire. Then, traveling at a speed $2 \mathrm{~km}$ per hour faster, t...
<think>I. Solution: Let the initial speed of the cyclist be $x \mathrm{~km} /$ hour and assume that $t$ hours after departure, they meet the group of hikers. If the cyclist had traveled at the initial speed without stopping, they would have covered $t x \mathrm{~km}-\mathrm{t}$ by the time of the meeting. However, in r...
16\mathrm{~}/
71,828
<think>I. Solution: Let the initial speed of the cyclist be $x \mathrm{~km} /$ hour and assume that $t$ hours after departure, they meet the group of hikers. If the cyclist had traveled at the initial speed without stopping, they would have covered $t x \mathrm{~km}-\mathrm{t}$ by the time of the meeting. However, in r...
1_22
Given positive integers $k, m, n$, satisfying $1 \leqslant k \leqslant m \leqslant n$. Try to find $$ \sum_{i=0}^{n}(-1)^{i} \frac{1}{n+k+i} \cdot \frac{(m+n+i)!}{i!(n-i)!(m+i)!} $$ and write down the derivation process. (Xu Yichao, provided)
<think>II. The answer to this question is 0. Below, we will prove this combinatorial identity by constructing polynomials and using interpolation and difference methods. Method 1: Construct the polynomial $$ \begin{aligned} f(x) & =\sum_{i=0}^{n} a_{i} x(x+1) \cdots(x+i-1)(x+i+1) \\ & \cdots(x+n)-(x-m-1) \cdots(x-m-n) ...
0
30,617
<think>II. The answer to this question is 0. Below, we will prove this combinatorial identity by constructing polynomials and using interpolation and difference methods. Method 1: Construct the polynomial $$ \begin{aligned} f(x) & =\sum_{i=0}^{n} a_{i} x(x+1) \cdots(x+i-1)(x+i+1) \\ & \cdots(x+n)-(x-m-1) \cdots(x-m-n) ...
1_23
1. Find all positive integers $n \geqslant 2$, such that for all integers $a$ and $b$ coprime with $n, a \equiv b(\bmod n)$ if and only if $a b \equiv 1(\bmod n)$.
<think>The given condition is equivalent to each integer $a$ satisfying $(a, n)=1$, $$ a^{2} \equiv 1(\bmod n) . $$ In fact, if $a \equiv b(\bmod n)$ is equivalent to $a b \equiv 1(\bmod n)$, then by $a b \equiv 1(\bmod n)$, when $b=a$, we have $a^{2} \equiv 1(\bmod n)$. Conversely, if $a^{2} \equiv 1(\bmod n)$, for a...
n=2,3,4,6,8,12,24
87,991
<think>The given condition is equivalent to each integer $a$ satisfying $(a, n)=1$, $$ a^{2} \equiv 1(\bmod n) . $$ In fact, if $a \equiv b(\bmod n)$ is equivalent to $a b \equiv 1(\bmod n)$, then by $a b \equiv 1(\bmod n)$, when $b=a$, we have $a^{2} \equiv 1(\bmod n)$. Conversely, if $a^{2} \equiv 1(\bmod n)$, for a...
1_24
15. For any positive integer $m$, the set $$ \{m, m+1, m+2, \cdots, m+99\} $$ has the property that in any $n(n \geqslant 3)$-element subset, there are always three elements that are pairwise coprime. Find the minimum value of $n$.
<think>15. Consider the set $\{1,2, \cdots, 100\}$ when $m=1$, and its 67-element subset, whose elements are even numbers and odd numbers divisible by 3, i.e., $$ P=\{2,4, \cdots, 100,3,9, \cdots, 99\} . $$ Clearly, there do not exist three pairwise coprime elements in set $P$. Thus, $n \leqslant 67$ does not meet the...
68
48,600
<think>15. Consider the set $\{1,2, \cdots, 100\}$ when $m=1$, and its 67-element subset, whose elements are even numbers and odd numbers divisible by 3, i.e., $$ P=\{2,4, \cdots, 100,3,9, \cdots, 99\} . $$ Clearly, there do not exist three pairwise coprime elements in set $P$. Thus, $n \leqslant 67$ does not meet the...
1_25
Determine the largest constant $K\geq 0$ such that $$\frac{a^a(b^2+c^2)}{(a^a-1)^2}+\frac{b^b(c^2+a^2)}{(b^b-1)^2}+\frac{c^c(a^2+b^2)}{(c^c-1)^2}\geq K\left (\frac{a+b+c}{abc-1}\right)^2$$ holds for all positive real numbers $a,b,c$ such that $ab+bc+ca=abc$. [i]Proposed by Orif Ibrogimov (Czech Technical University of...
<think>To determine the largest constant \( K \geq 0 \) such that the inequality \[ \frac{a^a(b^2+c^2)}{(a^a-1)^2} + \frac{b^b(c^2+a^2)}{(b^b-1)^2} + \frac{c^c(a^2+b^2)}{(c^c-1)^2} \geq K \left( \frac{a+b+c}{abc-1} \right)^2 \] holds for all positive real numbers \( a, b, c \) such that \( ab + bc + ca = abc \), we wil...
K = 18
10,985
<think>To determine the largest constant \( K \geq 0 \) such that the inequality \[ \frac{a^a(b^2+c^2)}{(a^a-1)^2} + \frac{b^b(c^2+a^2)}{(b^b-1)^2} + \frac{c^c(a^2+b^2)}{(c^c-1)^2} \geq K \left( \frac{a+b+c}{abc-1} \right)^2 \] holds for all positive real numbers \( a, b, c \) such that \( ab + bc + ca = abc \), we wil...
1_26
Find all primes $p$, such that there exist positive integers $x$, $y$ which satisfy $$\begin{cases} p + 49 = 2x^2\\ p^2 + 49 = 2y^2\\ \end{cases}$$
<think>To find all primes \( p \) such that there exist positive integers \( x \) and \( y \) which satisfy the system of equations: \[ \begin{cases} p + 49 = 2x^2 \\ p^2 + 49 = 2y^2 \end{cases} \] 1. **Express \( p \) in terms of \( x \):** From the first equation, we have: \[ p + 49 = 2x^2 \implies p = 2x^2...
p = 23
2,045
<think>To find all primes \( p \) such that there exist positive integers \( x \) and \( y \) which satisfy the system of equations: \[ \begin{cases} p + 49 = 2x^2 \\ p^2 + 49 = 2y^2 \end{cases} \] 1. **Express \( p \) in terms of \( x \):** From the first equation, we have: \[ p + 49 = 2x^2 \implies p = 2x^2...
1_27
For any positive integer $k$, let $f_{1}(k)$ be the square of the sum of the digits of $k$ when written in decimal notation, and for $n>1$, let $f_{n}(k)=f_{1}\left(f_{n-1}(k)\right)$. What is $f_{1992}\left(2^{1991}\right)$?
<think>We can answer the question based on two aspects: on the one hand, we determine the number of digits, and on the other hand, the remainder of the number in question when divided by 9. Let's denote the number $2^{1991}$ as $K$. $$ K=8^{\frac{1991}{3}}<10^{664} $$ Thus, the number $K$ has at most 664 digits, and...
256
29,441
<think>We can answer the question based on two aspects: on the one hand, we determine the number of digits, and on the other hand, the remainder of the number in question when divided by 9. Let's denote the number $2^{1991}$ as $K$. $$ K=8^{\frac{1991}{3}}<10^{664} $$ Thus, the number $K$ has at most 664 digits, and...
1_28
In the coordinate plane, find the area of the region bounded by the curve $ C: y\equal{}\frac{x\plus{}1}{x^2\plus{}1}$ and the line $ L: y\equal{}1$.
<think>1. **Define the function and the line:** The curve \( C \) is given by the function \( f(x) = \frac{x+1}{x^2+1} \) and the line \( L \) is given by \( y = 1 \). 2. **Find the intersection points:** To find the points where the curve intersects the line \( y = 1 \), we solve the equation: \[ \frac{x+...
1 - \frac{\pi}{4} - \frac{\ln(2)}{2}
51,004
<think>1. **Define the function and the line:** The curve \( C \) is given by the function \( f(x) = \frac{x+1}{x^2+1} \) and the line \( L \) is given by \( y = 1 \). 2. **Find the intersection points:** To find the points where the curve intersects the line \( y = 1 \), we solve the equation: \[ \frac{x+...
1_29
Given an integer $n\ge 2$, compute $\sum_{\sigma} \textrm{sgn}(\sigma) n^{\ell(\sigma)}$, where all $n$-element permutations are considered, and where $\ell(\sigma)$ is the number of disjoint cycles in the standard decomposition of $\sigma$.
<think>1. **Define the sets and the problem:** Let \( A \) be the set of all bijections from \( \{1, 2, \cdots, n\} \) to \( \{1, 2, \cdots, n\} \), i.e., the set of all permutations of \( n \) elements. Let \( B \) be the set of all functions from \( \{1, 2, \cdots, n\} \) to \( \{1, 2, \cdots, n\} \). We aim to co...
n!
76,246
<think>1. **Define the sets and the problem:** Let \( A \) be the set of all bijections from \( \{1, 2, \cdots, n\} \) to \( \{1, 2, \cdots, n\} \), i.e., the set of all permutations of \( n \) elements. Let \( B \) be the set of all functions from \( \{1, 2, \cdots, n\} \) to \( \{1, 2, \cdots, n\} \). We aim to co...
1_30
Let $ABCD$ be a parallelogram that is not rhombus. We draw the symmetrical half-line of $(DC$ with respect to line $BD$. Similarly we draw the symmetrical half- line of $(AB$ with respect to $AC$. These half- lines intersect each other in $P$. If $\frac{AP}{DP}= q$ find the value of $\frac{AC}{BD}$ in function of $q$.
<think>1. **Identify the given elements and their properties:** - \(ABCD\) is a parallelogram, which implies \(AB \parallel CD\) and \(AD \parallel BC\). - The symmetrical half-line of \(DC\) with respect to line \(BD\) is drawn. - The symmetrical half-line of \(AB\) with respect to line \(AC\) is drawn. - ...
\sqrt{q}
20,346
<think>1. **Identify the given elements and their properties:** - \(ABCD\) is a parallelogram, which implies \(AB \parallel CD\) and \(AD \parallel BC\). - The symmetrical half-line of \(DC\) with respect to line \(BD\) is drawn. - The symmetrical half-line of \(AB\) with respect to line \(AC\) is drawn. - ...
1_31
The sequence ${a_{n}}$ $n\in \mathbb{N}$ is given in a recursive way with $a_{1}=1$, $a_{n}=\prod_{i=1}^{n-1} a_{i}+1$, for all $n\geq 2$. Determine the least number $M$, such that $\sum_{n=1}^{m} \frac{1}{a_{n}} <M$ for all $m\in \mathbb{N}$
<think>1. **Define the sequence and initial conditions:** The sequence \(\{a_n\}\) is defined recursively with \(a_1 = 1\) and for \(n \geq 2\), \[ a_n = \prod_{i=1}^{n-1} a_i + 1. \] 2. **Calculate the first few terms of the sequence:** - For \(n = 2\): \[ a_2 = a_1 + 1 = 1 + 1 = 2. \] ...
2
31,528
<think>1. **Define the sequence and initial conditions:** The sequence \(\{a_n\}\) is defined recursively with \(a_1 = 1\) and for \(n \geq 2\), \[ a_n = \prod_{i=1}^{n-1} a_i + 1. \] 2. **Calculate the first few terms of the sequence:** - For \(n = 2\): \[ a_2 = a_1 + 1 = 1 + 1 = 2. \] ...
1_32
We write the numbers $1,2, \ldots, n$ in some order, then we take the sum of the absolute values of the differences of adjacent numbers. What is the largest possible value of this sum for $n=3,4,5,6$?
<think>The first three natural numbers can be written in six different orders: $1,2,3$ $(2)$ $2,1,3$ $(3)$ $3,1,2$ $(3)$ $1,3,2$ $(3)$ $2,3,1$ $(3)$ $3,2,1$ $(2)$. The sum of the absolute values of the differences between adjacent numbers is noted in parentheses next to each order. If we generally denote the sought su...
S_{3}=3,S_{4}=7,S_{5}=11,S_{6}=17
39,705
<think>The first three natural numbers can be written in six different orders: $1,2,3$ $(2)$ $2,1,3$ $(3)$ $3,1,2$ $(3)$ $1,3,2$ $(3)$ $2,3,1$ $(3)$ $3,2,1$ $(2)$. The sum of the absolute values of the differences between adjacent numbers is noted in parentheses next to each order. If we generally denote the sought su...
1_33
5. Given three positive real numbers $o, \rho, v$, construct a triangle $A B C$ with perimeter equal to $o$, the radius of its $A$-excircle equal to $\rho$, and the length of its $A$ altitude equal to $v$. Determine the number of solutions (non-congruent triangles) in terms of the given lengths. (Patrik Bak)
<think> Solution. Let $P$ be a point on the ray opposite to $B C$ such that $B P=B A$ and, similarly, let $Q$ be a point on the ray opposite to $C B$ such that $C Q=C A$. Then $P Q=o$. Let $I_{a}$ be the $A$-excenter of $\triangle A B C$ (Fig. 4). Since $I_{a} B$ is the bisector of angle $A B P$ and the triangle $A B ...
\begin{pmatrix}\sqrt{\rho^{2}+\frac{1}{4}^{2}}>\rho+v:&\ldots2\text{solutions,}\\\sqrt{\rho^{2}+\frac{1}{4}^{2}}=\rho+v:&\ldots1\text{solution,}\\\sqrt{\rho^{2}+\frac{1}{4}^{2}}<\
7,441
<think> Solution. Let $P$ be a point on the ray opposite to $B C$ such that $B P=B A$ and, similarly, let $Q$ be a point on the ray opposite to $C B$ such that $C Q=C A$. Then $P Q=o$. Let $I_{a}$ be the $A$-excenter of $\triangle A B C$ (Fig. 4). Since $I_{a} B$ is the bisector of angle $A B P$ and the triangle $A B ...
1_34
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
6