Found problems: 85335
For all $x\in\mathbb{R}$, $\sin^2 x+a\cos x+a^2\geq 1+\cos x$, then the range value of negative number $a$ is________
Let $(a_i)_{i\in \mathbb N}$ be a strictly increasing sequence of positive real numbers such that $\lim_{i \to \infty} a_i = +\infty$ and $a_{i+1}/a_i \leq 10$ for each $i$. Prove that for every positive integer $k$ there are infinitely many pairs $(i, j)$ with $10^k \leq a_i/a_j \leq 10^{k+1}.$
Consider an arc of a planar curve such that the total curvature of the arc is less than $ \pi$. Suppose, further, that the curvature and its derivative with respect to the arc length exist at every point of the arc and the latter nowhere equals zero. Let the osculating circles belonging to the endpoints of the arc and one of these points be given. Determine the possible positions of the other endpoint.
\[\int_0^2 |\sin(\pi x)|+|\cos(\pi x)|\mathrm dx\]
[i]Proposed by Anagh Sangavarapu[/i]
Let $ABC$ be a triangle with $AB=20$, $AC=34$, and $BC=42$. Let $\omega_1$ and $\omega_2$ be the semicircles with diameters $\overline{AB}$ and $\overline{AC}$ erected outwards of $\triangle ABC$ and denote by $\ell$ the common external tangent to $\omega_1$ and $\omega_2$. The line through $A$ perpendicular to $\overline{BC}$ intersects $\ell$ at $X$ and $BC$ at $Y$. The length of $\overline{XY}$ can be written in the form $m+\sqrt n$ where $m$ and $n$ are positive integers. Find $100m+n$.
[i]Proposed by David Altizio[/i]
When simplified $ \sqrt{1\plus{} \left (\frac{x^4\minus{}1}{2x^2} \right )^2}$ equals:
$ \textbf{(A)}\ \frac{x^4\plus{}2x^2\minus{}1}{2x^2} \qquad
\textbf{(B)}\ \frac{x^4\minus{}1}{2x^2} \qquad
\textbf{(C)}\ \frac{\sqrt{x^2\plus{}1}}{2} \\
\textbf{(D)}\ \frac{x^2}{\sqrt{2}} \qquad
\textbf{(E)}\ \frac{x^2}{2}\plus{}\frac{1}{2x^2}$
Let $f:(0,\infty)\to(0,\infty)$ be a function satisfying $f\bigl(xf(y)\bigr)+f\bigl(yf(x)\bigr)=2xy$ for all $x,y>0$. Show that $f(x) = x$ for all positive $x$.
$50$ gangsters simultaneously shoot at each other, and each shoots at the nearest gangster (if there are several of them, then at one of them) and kills him. Find the smallest possible number of people killed.
Let $\Gamma$ be a circle of center $O$, and $\delta$. be a line in the plane of $\Gamma$, not intersecting it. Denote by $A$ the foot of the perpendicular from $O$ onto $\delta$., and let $M$ be a (variable) point on $\Gamma$. Denote by $\gamma$ the circle of diameter $AM$ , by $X$ the (other than M ) intersection point of $\gamma$ and $\Gamma$, and by $Y$ the (other than $A$) intersection point of $\gamma$ and $\delta$. Prove that the line $XY$ passes through a fixed point.
Find the largest positive real number \( c \) such that for any positive integer \( n \), satisfies \(\{ \sqrt{7n} \} \geq \frac{c}{\sqrt{7n}}\).
Suppose that $n$ triangles are given in the plane such that any three of them have a common vertex, but no four of them do. Find the greatest possible $n$.
Let $f:[0,1]\rightarrow\mathbb{R}$ be a continuous function. Define $\tilde{f}:[0,1]\rightarrow\mathbb{R}$ as $$\tilde{f}(x)=\begin{dcases} \frac{1}{x}\cdot\int_0^x f(t)dt &\text{ for } x>0;\\ f(0) &\text{ for }x=0.\end{dcases}$$ Show that:
[list=a]
[*] $\tilde{f}$ is continuous in $0$ and differentiable on $(0,1]$.
[*] the following equality takes place: $$\int_0^1 f^2(x)dx = \left(\int_0^1 f(x)dx\right)^2 + \int_0^1 \left(f(x)-\tilde{f}(x)\right)^2dx.$$
The line $L$ is parallel to the plane $y=z$ and meets the parabola $2x=y^2 ,z=0$ and the parabola $3x=z^2, y=0$. Prove that if $L$ moves freely subject to these constraints then it generates the surface $x=(y-z)\left(\frac{y}{2}-\frac{z}{3}\right)$.
Let $ABC$ be a triangle with $AB = AC \neq BC$ and let $I$ be its incentre. The line $BI$ meets $AC$ at $D$, and the line through $D$ perpendicular to $AC$ meets $AI$ at $E$. Prove that the reflection of $I$ in $AC$ lies on the circumcircle of triangle $BDE$.
For each integer sequence $a_1, a_2, a_3, \dots, a_n$, a [i]single parity swapping[/i] is to choose $2$ terms in this sequence, say $a_i$ and $a_j$, such that $a_i + a_j$ is odd, then switch their placement, while the other terms stay in place. This creates a new sequence.
Find the minimal number of single parity swapping to transform the sequence $1,2,3, \dots, 2025$ to $2025, \dots, 3, 2, 1$, using only single parity swapping.
Two natural numbers, $p$ and $q$, do not end in zero. The product of any pair, p and q, is a power of 10
(that is, $10, 100, 1000, 10 000$ , ...). If $p >q$, the last digit of $p – q$ cannot be
$\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 9$
Basil has an unrestricted supply of straight bricks $1 \times 1 \times 3$ and Γ-shape bricks made of three cubes $1\times 1\times 1$. Basil filled a whole box $m \times n \times k$ with these bricks, where $m, n$ and $k$ are integers greater than $1$. Prove that it was sufficient to use only Γ-shape bricks.
(Mikhail Evdokimov)
Express $\int_0^2 f(x)dx$ for any quadratic functions $f(x)$ in terms of $f(0),\ f(1)$ and $f(2).$
Find all functions $f : (0, +\infty) \to (0, +\infty)$ which are increasing on $[1, +\infty)$ and for all positive reals $a, b, c$ they fulfill the following relation $f(ab)f(bc)f(ca)=f(a^2b^2c^2)+f(a^2)+f(b^2)+f(c^2)$.
find all pairs of relatively prime natural numbers $ (m,n) $ in such a way that there exists non constant polynomial f satisfying \[ gcd(a+b+1, mf(a)+nf(b) > 1 \]
for every natural numbers $ a $ and $ b $
Let $n \geq 2, n \in \mathbb{N}$, $a,b,c,d \in \mathbb{N}$, $\frac{a}{b} + \frac{c}{d} < 1$ and $a + c \leq n,$ find the maximum value of $\frac{a}{b} + \frac{c}{d}$ for fixed $n.$
We are given an infinite deck of cards, each with a real number on it. For every real number $x$, there is exactly one card in the deck that has $x$ written on it. Now two players draw disjoint sets $A$ and $B$ of $100$ cards each from this deck. We would like to define a rule that declares one of them a winner. This rule should satisfy the following conditions:
1. The winner only depends on the relative order of the $200$ cards: if the cards are laid down in increasing order face down and we are told which card belongs to which player, but not what numbers are written on them, we can still decide the winner.
2. If we write the elements of both sets in increasing order as $A =\{ a_1 , a_2 , \ldots, a_{100} \}$ and $B= \{ b_1 , b_2 , \ldots , b_{100} \}$, and $a_i > b_i$ for all $i$, then $A$ beats $B$.
3. If three players draw three disjoint sets $A, B, C$ from the deck, $A$ beats $B$ and $B$ beats $C$ then $A$ also beats $C$.
How many ways are there to define such a rule? Here, we consider two rules as different if there exist two sets $A$ and $B$ such that $A$ beats $B$ according to one rule, but $B$ beats $A$ according to the other.
[i]Proposed by Ilya Bogdanov, Russia[/i]
Suppose $a$, $b$, and $c$ are nonzero real numbers, and $a+b+c=0$. What are the possible value(s) for $\frac{a}{|a|}+\frac{b}{|b|}+\frac{c}{|c|}+\frac{abc}{|abc|}$?
$\textbf{(A) }0\qquad\textbf{(B) }1\text{ and }-1\qquad\textbf{(C) }2\text{ and }-2\qquad\textbf{(D) }0,2,\text{ and }-2\qquad\textbf{(E) }0,1,\text{ and }-1$
Given is the acute triangle $ABC$ with the intersection of altitudes $H$. The angle bisector of angle $BHC$ intersects side $BC$ at point $D$. Mark $E$ and $F$ the symmetrics of the point $D$ wrt lines $AB$ and $AC$. Prove that the circle circumscribed around the triangle $AEF$ passes through the midpoint of the arc $BAC$
Which of the following values is largest?
$\textbf{(A) }2+0+1+7\qquad\textbf{(B) }2 \times 0 +1+7\qquad\textbf{(C) }2+0 \times 1 + 7\qquad\textbf{(D) }2+0+1 \times 7\qquad\textbf{(E) }2 \times 0 \times 1 \times 7$