question stringlengths 43 2.77k | thinking stringlengths 1.9k 2.12k | answer stringlengths 1 174 | id int64 2 93.7k | content stringlengths 1.9k 2.26k | id_ stringlengths 3 6 |
|---|---|---|---|---|---|
7. Variant 1.
In the "Triangle" cinema, the seats are arranged in a triangular shape: in the first row, there is one seat with number 1, in the second row - seats with numbers 2 and 3, in the third row - 4, 5, 6, and so on (the figure shows an example of such a triangular hall with 45 seats). The best seat in the cine... | <think>Answer: 1035
Solution.
1st method.
Note that the number of rows in the cinema cannot be even, otherwise there would be no best seat. Let the total number of rows in the cinema be $2 n+1$, then the best seat is in the $n+1$ row. If we remove this row, the triangle can be divided into 4 parts, and the number of... | 1035 | 65,182 | <think>Answer: 1035
Solution.
1st method.
Note that the number of rows in the cinema cannot be even, otherwise there would be no best seat. Let the total number of rows in the cinema be $2 n+1$, then the best seat is in the $n+1$ row. If we remove this row, the triangle can be divided into 4 parts, and the number of... | 1_0 |
The function $f: \mathbb{N}\to\mathbb{N}_{0}$ satisfies for all $m,n\in\mathbb{N}$: \[f(m+n)-f(m)-f(n)=0\text{ or }1, \; f(2)=0, \; f(3)>0, \; \text{ and }f(9999)=3333.\] Determine $f(1982)$. | <think>1. **Given Conditions and Initial Analysis:**
- The function \( f: \mathbb{N} \to \mathbb{N}_0 \) satisfies:
\[
f(m+n) - f(m) - f(n) = 0 \text{ or } 1
\]
for all \( m, n \in \mathbb{N} \).
- Additional conditions:
\[
f(2) = 0, \quad f(3) > 0, \quad \text{and} \quad f(9999) = 3... | 660 | 57,614 | <think>1. **Given Conditions and Initial Analysis:**
- The function \( f: \mathbb{N} \to \mathbb{N}_0 \) satisfies:
\[
f(m+n) - f(m) - f(n) = 0 \text{ or } 1
\]
for all \( m, n \in \mathbb{N} \).
- Additional conditions:
\[
f(2) = 0, \quad f(3) > 0, \quad \text{and} \quad f(9999) = 3... | 1_1 |
Given an integer $n \ge 2$, determine the number of ordered $n$-tuples of integers $(a_1, a_2,...,a_n)$ such that
(a) $a_1 + a_2 + .. + a_n \ge n^2$ and
(b) $a_1^2 + a_2^2 + ... + a_n^2 \le n^3 + 1$ | <think>1. **Initial Claim and Setup**:
We need to determine the number of ordered $n$-tuples $(a_1, a_2, \ldots, a_n)$ of integers such that:
\[
a_1 + a_2 + \cdots + a_n \ge n^2 \quad \text{and} \quad a_1^2 + a_2^2 + \cdots + a_n^2 \le n^3 + 1.
\]
We claim that $a_i = n$ for all $1 \le i \le n$ is the on... | a_i = n \text{ for all } 1 \le i \le n | 81,254 | <think>1. **Initial Claim and Setup**:
We need to determine the number of ordered $n$-tuples $(a_1, a_2, \ldots, a_n)$ of integers such that:
\[
a_1 + a_2 + \cdots + a_n \ge n^2 \quad \text{and} \quad a_1^2 + a_2^2 + \cdots + a_n^2 \le n^3 + 1.
\]
We claim that $a_i = n$ for all $1 \le i \le n$ is the on... | 1_2 |
10) (20 points) Let positive real numbers $x, y, z$ satisfy $xyz=1$. Try to find the maximum value of $f(x, y, z) = (1-yz+z)(1-zx+x)(1-xy+y)$ and the values of $x, y, z$ at that time. | <think>10 Notice
$$
\left\{\begin{array} { l }
{ 1 - y z + z < 0 , } \\
{ 1 - x z + x < 0 }
\end{array} \Leftrightarrow \left\{\begin{array}{l}
x+x z<1, \\
y+x y<1
\end{array}\right.\right.
$$
$\Rightarrow(x+x z)(y+x y)<1 \Leftrightarrow x+x y+x^{2} y<0$, contradiction.
Therefore, $1-y z+z$, $1-z x+x$, and $1-x y+y$ c... | 1 | 45,640 | <think>10 Notice
$$
\left\{\begin{array} { l }
{ 1 - y z + z < 0 , } \\
{ 1 - x z + x < 0 }
\end{array} \Leftrightarrow \left\{\begin{array}{l}
x+x z<1, \\
y+x y<1
\end{array}\right.\right.
$$
$\Rightarrow(x+x z)(y+x y)<1 \Leftrightarrow x+x y+x^{2} y<0$, contradiction.
Therefore, $1-y z+z$, $1-z x+x$, and $1-x y+y$ c... | 1_3 |
We call the sum of any $k$ of $n$ given numbers (with distinct indices) a $k$-sum. Given $n$, find all $k$ such that, whenever more than half of $k$-sums of numbers $a_{1},a_{2},...,a_{n}$ are positive, the sum $a_{1}+a_{2}+...+a_{n}$ is positive as well. | <think>1. **Understanding the problem**: We need to find all values of \( k \) such that if more than half of the \( k \)-sums of \( n \) given numbers \( a_1, a_2, \ldots, a_n \) are positive, then the sum \( a_1 + a_2 + \cdots + a_n \) is also positive.
2. **Analyzing the \( k \)-sums**: A \( k \)-sum is the sum of ... | k \geq \frac{n}{2} | 54,417 | <think>1. **Understanding the problem**: We need to find all values of \( k \) such that if more than half of the \( k \)-sums of \( n \) given numbers \( a_1, a_2, \ldots, a_n \) are positive, then the sum \( a_1 + a_2 + \cdots + a_n \) is also positive.
2. **Analyzing the \( k \)-sums**: A \( k \)-sum is the sum of ... | 1_4 |
Let $ABC$ be a triangle and $I$ its incenter. Suppose $AI=\sqrt{2}$, $BI=\sqrt{5}$, $CI=\sqrt{10}$ and the inradius is $1$. Let $A'$ be the reflection of $I$ across $BC$, $B'$ the reflection across $AC$, and $C'$ the reflection across $AB$. Compute the area of triangle $A'B'C'$. | <think>1. **Identify the points of tangency and reflections:**
Let $D, E, F$ be the points of tangency of the incircle with sides $BC, AC,$ and $AB$ respectively. The points $A', B', C'$ are the reflections of the incenter $I$ across the sides $BC, AC,$ and $AB$ respectively.
2. **Similarity of triangles:**
Note... | \frac{24}{5} | 3,239 | <think>1. **Identify the points of tangency and reflections:**
Let $D, E, F$ be the points of tangency of the incircle with sides $BC, AC,$ and $AB$ respectively. The points $A', B', C'$ are the reflections of the incenter $I$ across the sides $BC, AC,$ and $AB$ respectively.
2. **Similarity of triangles:**
Note... | 1_5 |
Seven cards numbered $1$ through $7$ lay stacked in a pile in ascending order from top to bottom ($1$ on top, $7$ on bottom). A shuffle involves picking a random card [i]of the six not currently on top[/i], and putting it on top. The relative order of all the other cards remains unchanged. Find the probability that, af... | <think>1. Define \( p_k \) as the probability that card 6 is higher in the pile than card 3 after \( k \) shuffles.
2. We need to consider two cases for the \( k \)-th shuffle:
- **Case 1:** Card 6 is higher than card 3 after \( k-1 \) shuffles. This happens with probability \( p_{k-1} \). In this case, the \( k \)-... | \frac{3^{10} - 2^{10}}{2 \cdot 3^{10}} | 57,661 | <think>1. Define \( p_k \) as the probability that card 6 is higher in the pile than card 3 after \( k \) shuffles.
2. We need to consider two cases for the \( k \)-th shuffle:
- **Case 1:** Card 6 is higher than card 3 after \( k-1 \) shuffles. This happens with probability \( p_{k-1} \). In this case, the \( k \)-... | 1_6 |
Fredek runs a private hotel. He claims that whenever $ n \ge 3$ guests visit the hotel, it is possible to select two guests that have equally many acquaintances among the other guests, and that also have a common acquaintance or a common unknown among the guests. For which values of $ n$ is Fredek right? (Acquaintance ... | <think>1. **Case 1: \( n \) is odd**
Suppose \( n \) is odd. By the pigeonhole principle, there are two guests with the same number of acquaintances. Let's denote these two guests as \( A \) and \( B \). If \( A \) and \( B \) do not have a common acquaintance or a common unknown, then each of them must know exactl... | n \geq 3 | 3,608 | <think>1. **Case 1: \( n \) is odd**
Suppose \( n \) is odd. By the pigeonhole principle, there are two guests with the same number of acquaintances. Let's denote these two guests as \( A \) and \( B \). If \( A \) and \( B \) do not have a common acquaintance or a common unknown, then each of them must know exactl... | 1_7 |
For a positive integer $n$, written in decimal base, we denote by $p(n)$ the product of its digits.
a) Prove that $p(n) \leq n$;
b) Find all positive integers $n$ such that
\[ 10p(n) = n^2+ 4n - 2005. \]
[i]Eugen Păltănea[/i] | <think>### Part (a)
1. Let \( n = a_0 + a_1 \cdot 10 + \cdots + a_m \cdot 10^m \) be the decimal expansion of \( n \), where \( a_i \) are the digits of \( n \) and \( 0 \leq a_i \leq 9 \).
2. The product of the digits of \( n \) is given by \( p(n) = a_0 \cdot a_1 \cdots a_m \).
3. Since each \( a_i \leq 9 \), we have... | n = 45 | 19,933 | <think>### Part (a)
1. Let \( n = a_0 + a_1 \cdot 10 + \cdots + a_m \cdot 10^m \) be the decimal expansion of \( n \), where \( a_i \) are the digits of \( n \) and \( 0 \leq a_i \leq 9 \).
2. The product of the digits of \( n \) is given by \( p(n) = a_0 \cdot a_1 \cdots a_m \).
3. Since each \( a_i \leq 9 \), we have... | 1_8 |
Let $f(x)$ be an odd function on $\mathbb{R}$, such that $f(x)=x^2$ when $x\ge 0$. Knowing that for all $x\in [a,a+2]$, the inequality $f(x+a)\ge 2f(x)$ holds, find the range of real number $a$. | <think>1. **First Case: \(a + 2 \leq 0\)**
If \(a + 2 \leq 0\), then \(a \leq -2\). For \(x \in [a, a+2]\), we have \(x \leq 0\). Since \(f(x)\) is an odd function and \(f(x) = x^2\) for \(x \geq 0\), it follows that \(f(x) = -x^2\) for \(x < 0\).
Substituting \(x = a\) into the inequality \(f(x + a) \geq 2f(x)... | a \in [\sqrt{2}, +\infty) | 75,899 | <think>1. **First Case: \(a + 2 \leq 0\)**
If \(a + 2 \leq 0\), then \(a \leq -2\). For \(x \in [a, a+2]\), we have \(x \leq 0\). Since \(f(x)\) is an odd function and \(f(x) = x^2\) for \(x \geq 0\), it follows that \(f(x) = -x^2\) for \(x < 0\).
Substituting \(x = a\) into the inequality \(f(x + a) \geq 2f(x)... | 1_9 |
16. (1988 AIME Problem 6) Find the smallest positive integer $n$ such that the last three digits of its cube are 888. | <think>16. Solution 1 If the cube of a positive integer ends with 8, then this number itself must end with 2, i.e., it can be written in the form $n=10k+2$ (where $k$ is a non-negative integer).
Thus,
$$
n^{3}=(10k+2)^{3}=1000k^{3}+600k^{2}+120k+8.
$$
Here, $120k$ determines the tens digit of $n^{3}$.
Since it is requ... | 192 | 38,705 | <think>16. Solution 1 If the cube of a positive integer ends with 8, then this number itself must end with 2, i.e., it can be written in the form $n=10k+2$ (where $k$ is a non-negative integer).
Thus,
$$
n^{3}=(10k+2)^{3}=1000k^{3}+600k^{2}+120k+8.
$$
Here, $120k$ determines the tens digit of $n^{3}$.
Since it is requ... | 1_10 |
Jancsi usually waits for Juliska at the metro station in the afternoon. Once, he waited for 12 minutes, during which 5 trains arrived at the station. On another occasion, he waited for 20 minutes - this time Juliska arrived with the seventh train. Yesterday, Jancsi waited for 30 minutes. How many trains could have arri... | <think>Suppose that $d$ minutes elapse between the arrival of two trains, and that the trains stay at the station for a negligible amount of time. Let's examine what bounds can be derived for $d$ based on the conditions!
On Jancsi's 12-minute wait, 5 trains arrived. In the case of the least frequent schedule, this can... | 10or11 | 65,791 | <think>Suppose that $d$ minutes elapse between the arrival of two trains, and that the trains stay at the station for a negligible amount of time. Let's examine what bounds can be derived for $d$ based on the conditions!
On Jancsi's 12-minute wait, 5 trains arrived. In the case of the least frequent schedule, this can... | 1_11 |
6. Find the minimum of the expression
$$
\frac{a+b+c}{2}-\frac{[a, b]+[b, c]+[c, a]}{a+b+c}
$$
where the variables $a, b, c$ are any integers greater than $1$ and $[x, y]$ denotes the least common multiple of the numbers $x, y$.
(Tomáš Jurík) | <think>Solution. Considering the symmetry, it suffices to consider triples $(a, b, c)$ where $a \geqq b \geqq c$. For the "smallest" of them $(2,2,2),(3,2,2),(3,3,2),(3,3,3)$, and $(4,2,2)$, the given expression has values $2, 3/2, 17/8, 7/2$, and $11/4$, respectively. If we show that for all other triples $(a, b, c)$ ... | \frac{3}{2} | 15,260 | <think>Solution. Considering the symmetry, it suffices to consider triples $(a, b, c)$ where $a \geqq b \geqq c$. For the "smallest" of them $(2,2,2),(3,2,2),(3,3,2),(3,3,3)$, and $(4,2,2)$, the given expression has values $2, 3/2, 17/8, 7/2$, and $11/4$, respectively. If we show that for all other triples $(a, b, c)$ ... | 1_12 |
15. Suppose there are 128 ones written on a blackboard. In each step, you can erase any two numbers \(a\) and \(b\) and write \(ab + 1\). After performing this operation 127 times, only one number remains. Let the maximum possible value of this remaining number be \(A\). Determine the last digit of \(A\).
(1992 Saint P... | <think>15. First, prove that as long as each step involves the operation on the smallest two numbers on the blackboard, the final remaining number can reach its maximum value. We denote the operation on numbers \(a\) and \(b\) on the blackboard as \(a * b = ab + 1\). Suppose at some step, the operation is not performed... | 2 | 84,436 | <think>15. First, prove that as long as each step involves the operation on the smallest two numbers on the blackboard, the final remaining number can reach its maximum value. We denote the operation on numbers \(a\) and \(b\) on the blackboard as \(a * b = ab + 1\). Suppose at some step, the operation is not performed... | 1_13 |
The sets $A$ and $B$ are subsets of the positive integers. The sum of any two distinct elements of $A$ is an element of $B$. The quotient of any two distinct elements of $B$ (where we divide the largest by the smallest of the two) is an element of $A$. Determine the maximum number of elements in $A\cup B$. | <think>1. **Assume \( |A| \geq 3 \)**:
- Let \( x < y < z \) be the three smallest elements of \( A \).
- Since the sum of any two distinct elements of \( A \) is in \( B \), we have:
\[
x + y, \quad x + z, \quad y + z \in B
\]
2. **Consider the quotients**:
- The quotient of any two distinct e... | 5 | 38,394 | <think>1. **Assume \( |A| \geq 3 \)**:
- Let \( x < y < z \) be the three smallest elements of \( A \).
- Since the sum of any two distinct elements of \( A \) is in \( B \), we have:
\[
x + y, \quad x + z, \quad y + z \in B
\]
2. **Consider the quotients**:
- The quotient of any two distinct e... | 1_14 |
## Example. Compute the limit
$$
\lim _{x \rightarrow 0} \frac{2 x \sin x}{1-\cos x}
$$ | <think>Solution. The expression under the limit sign is the ratio of two infinitesimals at the point $x=0$, since
$$
\lim _{x \rightarrow 0}(2 x \sin x)=0, \quad \lim _{x \rightarrow 0}(1-\cos x)=0
$$
The infinitesimals in the numerator and denominator are replaced by equivalent ones:
$$
\begin{array}{ll}
2 x \sin x... | 4 | 22,457 | <think>Solution. The expression under the limit sign is the ratio of two infinitesimals at the point $x=0$, since
$$
\lim _{x \rightarrow 0}(2 x \sin x)=0, \quad \lim _{x \rightarrow 0}(1-\cos x)=0
$$
The infinitesimals in the numerator and denominator are replaced by equivalent ones:
$$
\begin{array}{ll}
2 x \sin x... | 1_15 |
Three. (20 points) Let $A B C D-A_{1} B_{1} C_{1} D_{1}$ be a cube with edge length 2, and point $M$ is the midpoint of edge $A A_{1}$. A sphere is constructed passing through points $M, B_{1}, C, D_{1}$. Try to find the radius $R$ of this sphere. | <think>Three, as shown in Figure 3, connect $B_{1} C$, $C D_{1}$, and $D_{1} B_{1}$. Let the body diagonal $A C_{1}$ intersect the plane of the equilateral $\triangle B_{1} C D_{1}$ at point $O_{1}$. Clearly, point $O_{1}$ is the center (centroid) of the equilateral $\triangle B_{1} C D_{1}$ (by symmetry), and $A C_{1}... | \frac{\sqrt{11}}{2} | 70,940 | <think>Three, as shown in Figure 3, connect $B_{1} C$, $C D_{1}$, and $D_{1} B_{1}$. Let the body diagonal $A C_{1}$ intersect the plane of the equilateral $\triangle B_{1} C D_{1}$ at point $O_{1}$. Clearly, point $O_{1}$ is the center (centroid) of the equilateral $\triangle B_{1} C D_{1}$ (by symmetry), and $A C_{1}... | 1_16 |
For each prime $p$, let $\mathbb S_p = \{1, 2, \dots, p-1\}$. Find all primes $p$ for which there exists a function $f\colon \mathbb S_p \to \mathbb S_p$ such that
\[ n \cdot f(n) \cdot f(f(n)) - 1 \; \text{is a multiple of} \; p \]
for all $n \in \mathbb S_p$.
[i]Andrew Wen[/i] | <think>1. **Primitive Root and Function Definition:**
- For any prime \( p \), there exists a primitive root \( g \) modulo \( p \).
- Let \( n = g^k \) for some integer \( k \).
- Define a function \( c \) such that \( g^{c(k)} = f(n) \). This implies \( g^{c(c(k))} = f(f(n)) \).
2. **Rewriting the Problem... | 2 | 354 | <think>1. **Primitive Root and Function Definition:**
- For any prime \( p \), there exists a primitive root \( g \) modulo \( p \).
- Let \( n = g^k \) for some integer \( k \).
- Define a function \( c \) such that \( g^{c(k)} = f(n) \). This implies \( g^{c(c(k))} = f(f(n)) \).
2. **Rewriting the Problem... | 1_17 |
Chekanov Yu.V.
$n$ schoolchildren want to divide $m$ identical chocolate bars equally, with each chocolate bar being broken no more than once.
a) For which $n$ is this possible if $m=9$?
b) For which $n$ and $m$ is this possible? | <think>b) Arrange $m$ chocolate bars in a line and cut the resulting chocolate strip evenly into $n$ equal parts. We will assume that the length of a chocolate bar is $n$. Each student should receive a portion of length $m$. If $n \leq m$, then the length of the portion will be no less than $n$. Therefore, no more than... | 1,2,3,4,5,6,7,8,9,10,12,18;whenn\leqorwhen<nisdivisiblen- | 75,518 | <think>b) Arrange $m$ chocolate bars in a line and cut the resulting chocolate strip evenly into $n$ equal parts. We will assume that the length of a chocolate bar is $n$. Each student should receive a portion of length $m$. If $n \leq m$, then the length of the portion will be no less than $n$. Therefore, no more than... | 1_18 |
Let $S$ be a real number. It is known that however we choose several numbers from the interval $(0, 1]$ with sum equal to $S$, these numbers can be separated into two subsets with the following property: The sum of the numbers in one of the subsets doesn’t exceed 1 and the sum of the numbers in the other subset doesn’t... | <think>1. **Upper Bound for \( S \)**:
- We start by noting that the sum of the numbers in the two subsets should not exceed 6. Therefore, \( S \leq 6 \).
2. **Contradiction for \( S \in (5.5, 6] \)**:
- Assume \( S \in (5.5, 6] \). Consider 11 numbers \( a_1, a_2, \ldots, a_{11} \) where \( a_i = 0.5 + b_i \) f... | 5.5 | 81,700 | <think>1. **Upper Bound for \( S \)**:
- We start by noting that the sum of the numbers in the two subsets should not exceed 6. Therefore, \( S \leq 6 \).
2. **Contradiction for \( S \in (5.5, 6] \)**:
- Assume \( S \in (5.5, 6] \). Consider 11 numbers \( a_1, a_2, \ldots, a_{11} \) where \( a_i = 0.5 + b_i \) f... | 1_19 |
Reflect the parabola $y=x^{2}$ over the point $(1 ; 1)$. What is the equation of the reflection? | <think>I. solution. Reflection does not change the position of the axis of the parabola, and the vertex of the reflected parabola is the reflection of the vertex of $y=x^{2}$, which is the origin, so its coordinates are $(2 ; 2)$.
The equation of the reflected parabola can thus be written in the form
$$
y=a(x-2)^{2}+... | -x^{2}+4x-2 | 54,795 | <think>I. solution. Reflection does not change the position of the axis of the parabola, and the vertex of the reflected parabola is the reflection of the vertex of $y=x^{2}$, which is the origin, so its coordinates are $(2 ; 2)$.
The equation of the reflected parabola can thus be written in the form
$$
y=a(x-2)^{2}+... | 1_20 |
## Problem Statement
Calculate the indefinite integral:
$$
\int \frac{4 x^{4}+2 x^{2}-x-3}{x(x-1)(x+1)} d x
$$ | <think>## Solution
$$
\int \frac{4 x^{4}+2 x^{2}-x-3}{x(x-1)(x+1)} d x=\int \frac{4 x^{4}+2 x^{2}-x-3}{x^{3}-x} d x=
$$
The integrand is an improper fraction. Let's separate the integer part:
$$
\begin{array}{ll}
4 x^{4}+2 x^{2}-x-3 & \left\lvert\, \frac{x^{3}-x}{4 x}\right. \\
\frac{4 x^{4}-4 x^{2}}{6 x^{2}-x-3}
\e... | 2x^{2}+3\cdot\ln|x|+\ln|x-1|+2\cdot\ln|x+1|+C | 83,581 | <think>## Solution
$$
\int \frac{4 x^{4}+2 x^{2}-x-3}{x(x-1)(x+1)} d x=\int \frac{4 x^{4}+2 x^{2}-x-3}{x^{3}-x} d x=
$$
The integrand is an improper fraction. Let's separate the integer part:
$$
\begin{array}{ll}
4 x^{4}+2 x^{2}-x-3 & \left\lvert\, \frac{x^{3}-x}{4 x}\right. \\
\frac{4 x^{4}-4 x^{2}}{6 x^{2}-x-3}
\e... | 1_21 |
Given a positive integer $n \ge 2$, determine the largest positive integer $N$ for which there exist $N+1$ real numbers $a_0, a_1, \dots, a_N$ such that
$(1) \ $ $a_0+a_1 = -\frac{1}{n},$ and
$(2) \ $ $(a_k+a_{k-1})(a_k+a_{k+1})=a_{k-1}-a_{k+1}$ for $1 \le k \le N-1$. | <think>1. **Claim**: The largest positive integer \( N \) for which there exist \( N+1 \) real numbers \( a_0, a_1, \dots, a_N \) satisfying the given conditions is \( \boxed{n} \).
2. **Base Case**: We start by verifying the base cases for \( k = 0 \) and \( k = 1 \).
- For \( k = 0 \):
\[
a_0 + a_1 = -... | n | 57,843 | <think>1. **Claim**: The largest positive integer \( N \) for which there exist \( N+1 \) real numbers \( a_0, a_1, \dots, a_N \) satisfying the given conditions is \( \boxed{n} \).
2. **Base Case**: We start by verifying the base cases for \( k = 0 \) and \( k = 1 \).
- For \( k = 0 \):
\[
a_0 + a_1 = -... | 1_22 |
Points $A$, $B$, and $C$ lie in that order on line $\ell$ such that $AB=3$ and $BC=2$. Point $H$ is such that $CH$ is perpendicular to $\ell$. Determine the length $CH$ such that $\angle AHB$ is as large as possible. | <think>1. **Define the problem geometrically**:
- Points \( A \), \( B \), and \( C \) lie on a line \(\ell\) such that \( AB = 3 \) and \( BC = 2 \).
- Point \( H \) is such that \( CH \) is perpendicular to \(\ell\).
- We need to determine the length \( CH \) such that \(\angle AHB\) is as large as possible.... | \sqrt{10} | 75,007 | <think>1. **Define the problem geometrically**:
- Points \( A \), \( B \), and \( C \) lie on a line \(\ell\) such that \( AB = 3 \) and \( BC = 2 \).
- Point \( H \) is such that \( CH \) is perpendicular to \(\ell\).
- We need to determine the length \( CH \) such that \(\angle AHB\) is as large as possible.... | 1_23 |
## Problem Statement
Calculate the definite integral:
$$
\int_{0}^{\pi}\left(8 x^{2}+16 x+17\right) \cos 4 x \, dx
$$ | <think>## Solution
$$
\int_{0}^{\pi}\left(8 x^{2}+16 x+17\right) \cos 4 x d x=
$$
Let's denote:
$$
\begin{aligned}
& u=8 x^{2}+16 x+17 ; d u=(16 x+16) d x \\
& d v=\cos 4 x d x ; v=\frac{1}{4} \sin 4 x
\end{aligned}
$$
We will use the integration by parts formula $\int u d v=u v-\int v d u$. We get:
$$
\begin{alig... | \pi | 48,820 | <think>## Solution
$$
\int_{0}^{\pi}\left(8 x^{2}+16 x+17\right) \cos 4 x d x=
$$
Let's denote:
$$
\begin{aligned}
& u=8 x^{2}+16 x+17 ; d u=(16 x+16) d x \\
& d v=\cos 4 x d x ; v=\frac{1}{4} \sin 4 x
\end{aligned}
$$
We will use the integration by parts formula $\int u d v=u v-\int v d u$. We get:
$$
\begin{alig... | 1_24 |
For a positive integer $n$, let $\Omega(n)$ denote the number of prime factors of $n$, counting multiplicity. Let $f_1(n)$ and $f_3(n)$ denote the sum of positive divisors $d|n$ where $\Omega(d)\equiv 1\pmod 4$ and $\Omega(d)\equiv 3\pmod 4$, respectively. For example, $f_1(72) = 72 + 2 + 3 = 77$ and $f_3(72) = 8+12+18... | <think>1. **Define the function \( f(x, y) \):**
\[
f(x, y) = (1 + x + x^2 + \cdots + x^{2020})(1 + y + y^2 + \cdots + y^{2020})
\]
This can be simplified using the formula for the sum of a geometric series:
\[
f(x, y) = \frac{(x^{2021} - 1)(y^{2021} - 1)}{(x - 1)(y - 1)}
\]
2. **Substitute \( x =... | \frac{1}{10}(6^{2021} - 3^{2021} - 2^{2021} - 1) | 15,617 | <think>1. **Define the function \( f(x, y) \):**
\[
f(x, y) = (1 + x + x^2 + \cdots + x^{2020})(1 + y + y^2 + \cdots + y^{2020})
\]
This can be simplified using the formula for the sum of a geometric series:
\[
f(x, y) = \frac{(x^{2021} - 1)(y^{2021} - 1)}{(x - 1)(y - 1)}
\]
2. **Substitute \( x =... | 1_25 |
1. Determine all integers $x$ for which the number $9 x^{2}-40 x+39$ is a power of a prime. (A natural number $m$ is a power of a prime if $m=p^{a}$ for some prime $p$ and non-negative integer $a$.) | <think>III/1. Let $9 x^{2}-40 x+39=p^{n}$ for some prime $p$ and non-negative integer $n$. From
$$
p^{n}=9 x^{2}-40 x+39=(9 x-13)(x-3)
$$
it follows that $9 x-13=p^{k}$ and $x-3=p^{l}$ or $9 x-13=-p^{k}$ and $x-3=-p^{l}$ for some numbers $k$ and $l$, where $0 \leq l<k$ and $n=k+l$.
First, let's solve the system of e... | -4,1,4,5 | 56,734 | <think>III/1. Let $9 x^{2}-40 x+39=p^{n}$ for some prime $p$ and non-negative integer $n$. From
$$
p^{n}=9 x^{2}-40 x+39=(9 x-13)(x-3)
$$
it follows that $9 x-13=p^{k}$ and $x-3=p^{l}$ or $9 x-13=-p^{k}$ and $x-3=-p^{l}$ for some numbers $k$ and $l$, where $0 \leq l<k$ and $n=k+l$.
First, let's solve the system of e... | 1_26 |
A mathematical contest had $3$ problems, each of which was given a score between $0$ and $7$ ($0$ and $7$ included). It is known that, for any two contestants, there exists at most one problem in which they have obtained the same score (for example, there are no two contestants whose ordered scores are $7,1,2$ and $7,1... | <think>1. **Define the problem in terms of lattice points:**
Consider the lattice points \((x,y,z)\) such that \(x, y, z \in [0,7]\) and \(x, y, z \in \mathbb{Z}\). Each lattice point \((x,y,z)\) represents a unique combination of scores for the three problems.
2. **Coloring the lattice points:**
Color a lattice... | 64 | 84,652 | <think>1. **Define the problem in terms of lattice points:**
Consider the lattice points \((x,y,z)\) such that \(x, y, z \in [0,7]\) and \(x, y, z \in \mathbb{Z}\). Each lattice point \((x,y,z)\) represents a unique combination of scores for the three problems.
2. **Coloring the lattice points:**
Color a lattice... | 1_27 |
Example 4. Solve the system
$$
\left\{\begin{aligned}
x_{1}-2 x_{2}+3 x_{3} & =5 \\
2 x_{1}+3 x_{2}-x_{3} & =7 \\
3 x_{1}+x_{2}+2 x_{3} & =12
\end{aligned}\right.
$$ | <think>Solution. We have (we suggest verifying this independently):
$$
\begin{aligned}
& \Delta=\left|\begin{array}{rrr}
1 & -2 & 3 \\
2 & 3 & -1 \\
3 & 1 & 2
\end{array}\right|=0, \quad \Delta_{1}=\left|\begin{array}{rrr}
5 & -2 & 3 \\
7 & 3 & -1 \\
12 & 1 & 2
\end{array}\right|=0 \\
& \Delta_{2}=\left|\begin{array}{... | X_{0}=(\frac{29}{7}-\alpha,-\frac{3}{7}+\alpha,\alpha) | 84,478 | <think>Solution. We have (we suggest verifying this independently):
$$
\begin{aligned}
& \Delta=\left|\begin{array}{rrr}
1 & -2 & 3 \\
2 & 3 & -1 \\
3 & 1 & 2
\end{array}\right|=0, \quad \Delta_{1}=\left|\begin{array}{rrr}
5 & -2 & 3 \\
7 & 3 & -1 \\
12 & 1 & 2
\end{array}\right|=0 \\
& \Delta_{2}=\left|\begin{array}{... | 1_28 |
Let $ABC$ be a triangle, let the $A$-altitude meet $BC$ at $D$, let the $B$-altitude meet $AC$ at $E$, and let $T\neq A$ be the point on the circumcircle of $ABC$ such that $AT || BC$. Given that $D,E,T$ are collinear, if $BD=3$ and $AD=4$, then the area of $ABC$ can be written as $a+\sqrt{b}$, where $a$ and $b$ are po... | <think>1. **Identify the given information and setup the problem:**
- We have a triangle \(ABC\) with \(A\)-altitude meeting \(BC\) at \(D\), \(B\)-altitude meeting \(AC\) at \(E\), and point \(T \neq A\) on the circumcircle of \(ABC\) such that \(AT \parallel BC\).
- Given \(D, E, T\) are collinear, \(BD = 3\), ... | 112 | 40,940 | <think>1. **Identify the given information and setup the problem:**
- We have a triangle \(ABC\) with \(A\)-altitude meeting \(BC\) at \(D\), \(B\)-altitude meeting \(AC\) at \(E\), and point \(T \neq A\) on the circumcircle of \(ABC\) such that \(AT \parallel BC\).
- Given \(D, E, T\) are collinear, \(BD = 3\), ... | 1_29 |
In a rectangle $ABCD, E$ is the midpoint of $AB, F$ is a point on $AC$ such that $BF$ is perpendicular to $AC$, and $FE$ perpendicular to $BD$. Suppose $BC = 8\sqrt3$. Find $AB$. | <think>1. **Identify the given information and setup the problem:**
- Rectangle \(ABCD\) with \(E\) as the midpoint of \(AB\).
- Point \(F\) on \(AC\) such that \(BF \perp AC\).
- \(FE \perp BD\).
- Given \(BC = 8\sqrt{3}\).
2. **Determine the coordinates of the points:**
- Let \(A = (0, h)\), \(B = (w,... | 24 | 55,253 | <think>1. **Identify the given information and setup the problem:**
- Rectangle \(ABCD\) with \(E\) as the midpoint of \(AB\).
- Point \(F\) on \(AC\) such that \(BF \perp AC\).
- \(FE \perp BD\).
- Given \(BC = 8\sqrt{3}\).
2. **Determine the coordinates of the points:**
- Let \(A = (0, h)\), \(B = (w,... | 1_30 |
3. Find all triples of consecutive natural numbers not exceeding 100, the product of which is divisible by 1001. | <think>Answer: $76,77,78$ and $77,78,79$.
## Solution:
Since $1001=7 \cdot 11 \cdot 13$, among this triplet of numbers, there must be a number divisible by 7, a number divisible by 11, and a number divisible by 13. At the same time, a number cannot be divisible by both 11 and 13, so the divisibility by these numbers ... | 76,77,7877,78,79 | 78,126 | <think>Answer: $76,77,78$ and $77,78,79$.
## Solution:
Since $1001=7 \cdot 11 \cdot 13$, among this triplet of numbers, there must be a number divisible by 7, a number divisible by 11, and a number divisible by 13. At the same time, a number cannot be divisible by both 11 and 13, so the divisibility by these numbers ... | 1_31 |
Let $ (x_1,x_2,\cdots)$ be a sequence of positive numbers such that $ (8x_2 \minus{} 7x_1)x_1^7 \equal{} 8$ and
\[ x_{k \plus{} 1}x_{k \minus{} 1} \minus{} x_k^2 \equal{} \frac {x_{k \minus{} 1}^8 \minus{} x_k^8}{x_k^7x_{k \minus{} 1}^7} \text{ for }k \equal{} 2,3,\ldots
\]
Determine real number $ a$ such that if ... | <think>1. Given the sequence \( (x_1, x_2, \cdots) \) of positive numbers such that \( (8x_2 - 7x_1)x_1^7 = 8 \) and
\[
x_{k+1}x_{k-1} - x_k^2 = \frac{x_{k-1}^8 - x_k^8}{x_k^7 x_{k-1}^7} \text{ for } k = 2, 3, \ldots
\]
we need to determine a real number \( a \) such that if \( x_1 > a \), then the sequenc... | a = 8^{1/8} | 71,879 | <think>1. Given the sequence \( (x_1, x_2, \cdots) \) of positive numbers such that \( (8x_2 - 7x_1)x_1^7 = 8 \) and
\[
x_{k+1}x_{k-1} - x_k^2 = \frac{x_{k-1}^8 - x_k^8}{x_k^7 x_{k-1}^7} \text{ for } k = 2, 3, \ldots
\]
we need to determine a real number \( a \) such that if \( x_1 > a \), then the sequenc... | 1_32 |
The Bank of Zürich issues coins with an $H$ on one side and a $T$ on the other side. Alice has $n$ of these coins arranged in a line from left to right. She repeatedly performs the following operation: if some coin is showing its $H$ side, Alice chooses a group of consecutive coins (this group must contain at least one... | <think>1. **Define the Problem and Key Terms:**
- We have \( n \) coins, each showing either \( H \) (heads) or \( T \) (tails).
- Alice can flip any group of consecutive coins.
- The goal is to determine the maximum number of operations \( m(C) \) required to turn any initial configuration \( C \) into all ta... | \lceil \frac{n}{2} \rceil | 23,307 | <think>1. **Define the Problem and Key Terms:**
- We have \( n \) coins, each showing either \( H \) (heads) or \( T \) (tails).
- Alice can flip any group of consecutive coins.
- The goal is to determine the maximum number of operations \( m(C) \) required to turn any initial configuration \( C \) into all ta... | 1_33 |
Example 7 Given that $x_{1}, x_{2}, \cdots, x_{40}$ are all positive integers, and $x_{1}+x_{2}+\cdots+x_{40}=58$. If the maximum value of $x_{1}^{2}+x_{2}^{2}+\cdots+x_{40}^{2}$ is $A$, and the minimum value is $B$, then $A+B=$ $\qquad$ | <think>Solution: Since there are only a finite number of ways to write 58 as the sum of 40 positive integers, the maximum and minimum values of $x_{1}^{2}+x_{2}^{2}+\cdots+x_{40}^{2}$ exist.
Assume without loss of generality that $x_{1} \leqslant x_{2} \leqslant \cdots \leqslant x_{40}$.
If $x_{1}>1$, then
$$
x_{1}+x_{... | 494 | 18,369 | <think>Solution: Since there are only a finite number of ways to write 58 as the sum of 40 positive integers, the maximum and minimum values of $x_{1}^{2}+x_{2}^{2}+\cdots+x_{40}^{2}$ exist.
Assume without loss of generality that $x_{1} \leqslant x_{2} \leqslant \cdots \leqslant x_{40}$.
If $x_{1}>1$, then
$$
x_{1}+x_{... | 1_34 |
Given are the sequences
\[ (..., a_{-2}, a_{-1}, a_0, a_1, a_2, ...); (..., b_{-2}, b_{-1}, b_0, b_1, b_2, ...); (..., c_{-2}, c_{-1}, c_0, c_1, c_2, ...)\]
of positive real numbers. For each integer $n$ the following inequalities hold:
\[a_n \geq \frac{1}{2} (b_{n+1} + c_{n-1})\]
\[b_n \geq \frac{1}{2} (c_{n+1} + a_{... | <think>1. **Define the sequences cyclically:**
We set \( x_n \) to be \( a_n \) if \( n \equiv 0 \pmod{3} \), \( b_n \) if \( n \equiv 1 \pmod{3} \), and \( c_n \) if \( n \equiv 2 \pmod{3} \). Similarly, we define \( y_n \) and \( z_n \) by cyclically permuting \( a, b, c \).
2. **Establish the inequalities for \(... | (2004, 26, 6) | 88,057 | <think>1. **Define the sequences cyclically:**
We set \( x_n \) to be \( a_n \) if \( n \equiv 0 \pmod{3} \), \( b_n \) if \( n \equiv 1 \pmod{3} \), and \( c_n \) if \( n \equiv 2 \pmod{3} \). Similarly, we define \( y_n \) and \( z_n \) by cyclically permuting \( a, b, c \).
2. **Establish the inequalities for \(... | 1_35 |
Rectangle $HOMF$ has $HO=11$ and $OM=5$. Triangle $ABC$ has orthocenter $H$ and circumcenter $O$. $M$ is the midpoint of $BC$ and altitude $AF$ meets $BC$ at $F$. Find the length of $BC$. | <think>1. **Define the coordinates:**
- Let $M$ be the midpoint of $BC$, so $M = (0,0)$.
- Let $F$ be the foot of the altitude from $A$ to $BC$, so $F = (-11,0)$.
- Let $H$ be the orthocenter, so $H = (-11,5)$.
- Let $O$ be the circumcenter, so $O = (0,5)$.
- Let $B = (-e,0)$ and $C = (e,0)$.
- Let $A... | 28 | 47,044 | <think>1. **Define the coordinates:**
- Let $M$ be the midpoint of $BC$, so $M = (0,0)$.
- Let $F$ be the foot of the altitude from $A$ to $BC$, so $F = (-11,0)$.
- Let $H$ be the orthocenter, so $H = (-11,5)$.
- Let $O$ be the circumcenter, so $O = (0,5)$.
- Let $B = (-e,0)$ and $C = (e,0)$.
- Let $A... | 1_36 |
Example 11 (13th National High School Mathematics Winter Camp Problem) Let $n \geqslant 2, x_{1}, x_{2}, \cdots, x_{n}$ be real numbers, and $\sum_{i=1}^{n} x_{i}^{2}+$ $\sum_{i=1}^{n-1} x_{i} x_{i+1}=1$. For each fixed $k(k \in \mathbf{Z}, 1 \leqslant k \leqslant n)$, find the maximum value of $\left|x_{k}\right|$. | <think>From the given conditions, we have $2 \sum_{i=1}^{n} x_{i}^{2}+2 \sum_{i=1}^{n-1} x_{i} x_{i+1}=2$, which means
$$
x_{1}^{2}+\left(x_{1}+x_{2}\right)^{2}+\left(x_{2}+x_{3}\right)^{2}+\cdots+\left(x_{n-2}+x_{n-1}\right)^{2}+\left(x_{n-1}+x_{n}\right)^{2}+x_{n}^{2}=2.
$$
By the Cauchy-Schwarz inequality, we get $... | \sqrt{\frac{2k(n+1-k)}{n+1}} | 80,636 | <think>From the given conditions, we have $2 \sum_{i=1}^{n} x_{i}^{2}+2 \sum_{i=1}^{n-1} x_{i} x_{i+1}=2$, which means
$$
x_{1}^{2}+\left(x_{1}+x_{2}\right)^{2}+\left(x_{2}+x_{3}\right)^{2}+\cdots+\left(x_{n-2}+x_{n-1}\right)^{2}+\left(x_{n-1}+x_{n}\right)^{2}+x_{n}^{2}=2.
$$
By the Cauchy-Schwarz inequality, we get $... | 1_37 |
Given a natural number $k$, find the smallest natural number $C$ such that
$$\frac C{n+k+1}\binom{2n}{n+k}$$is an integer for every integer $n\ge k$. | <think>1. **Claim and Initial Check:**
We claim that the smallest natural number \( C \) such that
\[
\frac{C}{n+k+1} \binom{2n}{n+k}
\]
is an integer for every integer \( n \ge k \) is \( C = 2k+1 \).
2. **Lower Bound for \( C \):**
To establish a lower bound for \( C \), consider the case when \( ... | 2k+1 | 93,564 | <think>1. **Claim and Initial Check:**
We claim that the smallest natural number \( C \) such that
\[
\frac{C}{n+k+1} \binom{2n}{n+k}
\]
is an integer for every integer \( n \ge k \) is \( C = 2k+1 \).
2. **Lower Bound for \( C \):**
To establish a lower bound for \( C \), consider the case when \( ... | 1_38 |
Let $ABCD$ be a rectangle with $AB = 6$ and $BC = 6 \sqrt 3$. We construct four semicircles $\omega_1$, $\omega_2$, $\omega_3$, $\omega_4$ whose diameters are the segments $AB$, $BC$, $CD$, $DA$. It is given that $\omega_i$ and $\omega_{i+1}$ intersect at some point $X_i$ in the interior of $ABCD$ for every $i=1,2,3,4... | <think>1. **Define the coordinates of the rectangle:**
Let \( A = (0, 0) \), \( B = (0, 6) \), \( C = (6\sqrt{3}, 6) \), and \( D = (6\sqrt{3}, 0) \). The sides of the rectangle are \( AB = 6 \) and \( BC = 6\sqrt{3} \).
2. **Write the equations of the semicircles:**
- Semicircle \(\omega_1\) with diameter \(AB\... | 243 | 28,956 | <think>1. **Define the coordinates of the rectangle:**
Let \( A = (0, 0) \), \( B = (0, 6) \), \( C = (6\sqrt{3}, 6) \), and \( D = (6\sqrt{3}, 0) \). The sides of the rectangle are \( AB = 6 \) and \( BC = 6\sqrt{3} \).
2. **Write the equations of the semicircles:**
- Semicircle \(\omega_1\) with diameter \(AB\... | 1_39 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 10