Found problems: 85335
Equation $(1-\text{i})x^2+(\lambda+\text{i})x+(1+\text{i}\lambda)=0(\lambda\in\mathbb{R})$ has two imaginary roots, then the range value of $\lambda$ is________.
Let $n, m \in \mathbb{N}$; $a_1,\ldots, a_m \in \mathbb{Z}^n$. Show that nonnegative integer linear combinations of these vectors give exactly the whole $\mathbb{Z}^n$ lattice, if $m \ge n$ and the following two statements are satisfied:
[list]
[*] The vectors do not fall into the half-space of $\mathbb{R}^n$ containing the origin (i.e. they do not fall on the same side of an $n-1$ dimensional subspace),
[*] the largest common divisor (not pairwise, but together) of $n \times n$ minor determinants of the matrix $(a_1,\ldots, a_m)$ (which is of size $m \times n$ and the $i$-th column is $a_i$ as a column vector) is $1$.
[/list]
Find the smallest real constant $p$ for which the inequality holds $\sqrt{ab}- \frac{2ab}{a + b} \le p \left( \frac{a + b}{2} -\sqrt{ab}\right)$ with any positive real numbers $a, b$.
Let \( ABC \) be an acute-angled scalene triangle. Let \( D \) be a point on the interior of segment \( BC \), different from the foot of the altitude from \( A \). The tangents from \( A \) and \( B \) to the circumcircle of triangle \( ABD \) meet at \( O_1 \), and the tangents from \( A \) and \( C \) to the circumcircle of triangle \( ACD \) meet at \( O_2 \). Show that the circle centered at \( O_1 \) passing through \( A \), the circle centered at \( O_2 \) passing through \( A \), and the line \( BC \) have a common point.
Vasya has a calculator that works with pairs of numbers. The calculator knows hoe to make a pair $(x+y,x)$ or a pair $(2x+y+1,x+y+1)$ from a pair $(x,y).$ At the beginning, the pair $(1,1)$ is presented on the calculator. Prove that for any natural $n$ there is exactly one pair $(n,k)$ that can be obtained using a calculator.
Let $(f_i)$ be a sequence of functions defined by: $f_1(x)=x, f_n(x) = \sqrt{f_{n-1}(x)}-\dfrac14$. ($n\in \mathbb{N}, n\ge2$)
(a) Prove that $f_n(x) \le f_{n-1}(x)$ for all x where both functions are defined.
(b) Find for each $n$ the points of $x$ inside the domain for which $f_n(x)=x$.
For any measurable set $H \subset R$ , we define the sequence $a_n(H)$ by the formula:
$$a_n(H) = \lambda \bigg([0,1] \setminus \bigcup_{k = n}^{2n} (H + \log_2 k) \bigg)$$
where $\lambda$ denotes the Lebesgue measure and $\log_2$ denotes the binary logarithm. Prove that there is a measurable, 1-periodic, positive measure set $H \subset R$ , such that the sequence $a_n( H )$ does not belong to any space $l_p$ ($1 \leq p < \infty$).
[hide=not sure about this part]For what numbers $1 \leq p <\infty$ is it true that whenever H is 1-periodic, positive measure, the sequence $a_n( H )$ belongs to the space $l_p$?[/hide]
Show that each convex pentagon has a vertex from which the distance to the opposite side of the pentagon is strictly less than the sum of the distances from the two adjacent vertices to the same side.
[i]Note[/i]. If the pentagon is labeled $ ABCDE$, the adjacent vertices of $ A$ are $ B$ and $ E$, the ones of $ B$ are $ A$ and $ C$ etc.
Let $n$ be a positive integer and $N=n^{2021}$. There are $2021$ concentric circles centered at $O$, and $N$ equally-spaced rays are emitted from point $O$. Among the $2021N$ intersections of the circles and the rays, some are painted red while the others remain unpainted.
It is known that, no matter how one intersection point from each circle is chosen, there is an angle $\theta$ such that after a rotation of $\theta$ with respect to $O$, all chosen points are moved to red points. Prove that the minimum number of red points is $2021n^{2020}$.
[I]Proposed by usjl.[/i]
Let be a natural power of two. Find the number of numbers equivalent with $ 1 $ modulo $ 3 $ that divide it.
[i]Dan Brânzei[/i]
For a positive integer $n$, $S_n$ is the set of positive integer $n$-tuples $(a_1,a_2, \cdots ,a_n)$ which satisfies the following.
(i). $a_1=1$.
(ii). $a_{i+1} \le a_i+1$.
For $k \le n$, define $N_k$ as the number of $n$-tuples $(a_1, a_2, \cdots a_n) \in S_n$ such that $a_k=1, a_{k+1}=2$.
Find the sum $N_1 + N_2+ \cdots N_{k-1}$.
\[\int_1^2 \frac{\sqrt{1-\frac 1x}}{x-1}\mathrm dx\]
[i]Proposed by Connor Gordon[/i]
Let $x,y>0$ be real numbers.Prove that: $$\frac{1}{x^2+y^2} +\frac{1}{x^2}+\frac{1}{y^2}\ge\frac{10}{(x+y)^2}$$
I tried CBS, but it doesn't work... Can you give an idea, please?
There is a chip in one of the squares on the checkered board. In one move, she can move either $1$ square to the right, or diagonally $1$ to the left and $1$ up, or $1$ to the left and $3$ down (see Fig.). The chip made $n$ moves and returned to the starting square. Prove that a) $n$ is divisible by $2$, b) $n$ is divisible by $8$.
[i]K.A.Sukhov[/i]
Let the points $M$ and $N$ in the triangle $ABC$ be the midpoints of the sides $BC$ and $AC$, respectively. It is known that the point of intersection of the altitudes of the triangle $ABC$ coincides with the point of intersection of the medians of the triangle $AMN$. Find the value of the angle $ABC$.
A tournament is arranged amongst a finite number of people. Every person plays every other person just once and each game results in a win to one of the players (there are no draws). Show that there must a person $X$ such that, given any other person $Y$ in the tournament, either $X$ beat $Y$ , or $X$ beat $Z$ and $Z$ beat $Y$ for some $Z$.
Mr. and Mrs. Lopez have two children. When they get into their family car, two people sit in the front, and the other two sit in the back. Either Mr. Lopez or Mrs. Lopez must sit in the driver's seat. How many seating arrangements are possible?
$ \textbf{(A) } 4 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 16 \qquad \textbf{(D) } 24 \qquad \textbf{(E) } 48$
Call a day a [i]perfect[/i] day if the sum of the digits of the month plus sum of the digits of the day equals the sum of digits of the year. For example, February $28$th, $2028$ is a perfect day because $2+2+8=2+0+2+8$. Find the number of perfect days in $2018$.
[i]2018 CCA Math Bonanza Team Round #5[/i]
What is the maximum number of possible change of directions in a path traveling on the edges of a rectangular array of $2004 \times 2004$, if the path does not cross the same place twice?.
Let $R$ be the rectangle in the Cartesian plane with vertices at $(0,0), (2,0), (2,1),$ and $(0,1)$. $R$ can be divided into two unit squares, as shown; the resulting figure has seven edges.
[asy]
size(3cm);
draw((0,0)--(2,0)--(2,1)--(0,1)--cycle); draw((1,0)--(1,1));
[/asy]
How many subsets of these seven edges form a connected figure?
Prove that for every real number $x>0$ and each integer $n>0$ we have
\[x^n+\frac1{x^n}-2 \ge n^2\left(x+\frac1x-2\right)\]
Let $A$ and $B$ be two points inside a given circle $k$. Prove that there exist (infinitely many) circles through $A$ and $B$ which lie entirely in $k$.
(A.Zaslavsky, 8--9) Given a circle and a point $ O$ on it. Another circle with center $ O$ meets the first one at points $ P$ and $ Q$. The point $ C$ lies on the first circle, and the lines $ CP$, $ CQ$ meet the second circle for the second time at points $ A$ and $ B$. Prove that $ AB\equal{}PQ$.
Consider the following $100$ sets of $10$ elements each:
\begin{align*}
&\{1,2,3,\cdots,10\}, \\
&\{11,12,13,\cdots,20\},\\
&\{21,22,23,\cdots,30\},\\
&\vdots\\
&\{991,992,993,\cdots,1000\}.
\end{align*}
How many of these sets contain exactly two multiples of $7$?
$\textbf{(A)} 40\qquad\textbf{(B)} 42\qquad\textbf{(C)} 43\qquad\textbf{(D)} 49\qquad\textbf{(E)} 50$
Let $H$ be the orthocenter of triangle $\mathrm T$. The sidelines of triangle $\mathrm T_1$ pass through the midpoints of $\mathrm T$ and are perpendicular to the corresponding bisectors of $\mathrm T$. The vertices of triangle $\mathrm T_2$ bisect the bisectors of $\mathrm T$. Prove that the lines joining $H$ with the vertices of $\mathrm T_1$ are perpendicular to the sidelines of $\mathrm T_2$.