Found problems: 85335
Find all the triples $(x,y,z)$ of real numbers such that
\[2x\sqrt{y-1}+2y\sqrt{z-1}+2z\sqrt{x-1} \ge xy+yz+zx \]
Take an arbitrary point $D$ on side $BC$ of triangle $ABC$ and draw a circle through point $D$ and the centers of the circles inscribed in triangles $ABD$ and $ACD$. Prove that all circles obtained for different points $D$ of side $BC$ have a common point.
For each vertex of a solid cube, consider the tetrahedron determined by the vertex and the midpoints of the three edges that meet at that vertex. The portion of the cube that remains when these eight tetrahedra are cut away is called a [i]cuboctahedron[/i]. The ratio of the volume of the cuboctahedron to the volume of the original cube is closest to which of these?
$ \textbf{(A)}\ 75\%\qquad\textbf{(B)}\ 78\%\qquad\textbf{(C)}\ 81\%\qquad\textbf{(D)}\ 84\%\qquad\textbf{(E)}\ 87\% $
How many zeros are at the end of the product
\[25\times 25\times 25\times 25\times 25\times 25\times 25\times 8\times 8\times 8?\]
$\text{(A)}\ 3 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 10 \qquad \text{(E)}\ 12$
A real-valued function $ f$ on $ \mathbb{Q}$ satisfies the following conditions for arbitrary $ \alpha, \beta \in \mathbb{Q}:$
[b](i)[/b] $ f(0) \equal{} 0,$
[b](ii)[/b] $ f(\alpha) > 0 \text{ if } \alpha \neq 0,$
[b](iii)[/b] $ f(\alpha \cdot \beta) \equal{} f(\alpha)f(\beta),$
[b](iv)[/b] $ f(\alpha \plus{} \beta) \leq f(\alpha) \plus{} f(\beta),$
[b](v)[/b] $ f(m) \leq 1989$ $ \forall m \in \mathbb{Z}.$
Prove that \[ f(\alpha \plus{} \beta) \equal{} \max\{f(\alpha), f(\beta)\} \text{ if } f(\alpha) \neq f(\beta).\]
What is the sum of all real numbers $x$ for which the median of the numbers $4,6,8,17,$ and $x$ is equal to the mean of those five numbers?
$\textbf{(A) } -5 \qquad\textbf{(B) } 0 \qquad\textbf{(C) } 5 \qquad\textbf{(D) } \frac{15}{4} \qquad\textbf{(E) } \frac{35}{4}$
If $a, b, c, d$ are positive numbers satisfying $a^3 + b^3 +3ab = c + d = 1,$ prove that \[\left(a+\frac{1}{a}\right)^3+\left(b+\frac{1}{b}\right)^3+\left(c+\frac{1}{c}\right)^3+\left(d+\frac{1}{d}\right)^3\geq 40.\]
Consider the $8\times 8\times 8$ Rubik’s cube below. Each face is painted with a different color, and it is possible to turn any layer, as you can with smaller Rubik’s cubes. Let $X$ denote the move that turns the shaded layer shown (indicated by arrows going from the top to the right of the cube) clockwise by $90$ degrees, about the axis labeled $X$. When move $X$ is performed, the only layer that moves is the shaded layer.
Likewise, define move $Y$ to be a clockwise $90$-degree turn about the axis labeled Y, of just the shaded layer shown (indicated by the arrows going from the front to the top, where the front is the side pierced by the $X$ rotation axis). Let $M$ denote the move “perform $X$, then perform $Y$.”
[img]https://cdn.artofproblemsolving.com/attachments/e/f/951ea75a3dbbf0ca23c45cd8da372595c2de48.png[/img]
Imagine that the cube starts out in “solved” form (so each face has just one color), and we start doing move $M$ repeatedly. What is the least number of repeats of $M$ in order for the cube to be restored to its original colors?
Let $P$ be a point inside triangle $ABC$. Let $AP$ meet $BC$ at $A_1$, let $BP$ meet $CA$ at $B_1$, and let $CP$ meet $AB$ at $C_1$. Let $A_2$ be the point such that $A_1$ is the midpoint of $PA_2$, let $B_2$ be the point such that $B_1$ is the midpoint of $PB_2$, and let $C_2$ be the point such that $C_1$ is the midpoint of $PC_2$. Prove that points $A_2, B_2$, and $C_2$ cannot all lie strictly inside the circumcircle of triangle $ABC$.
(Australia)
For a positive integer $n,$ the factorial notation $n!$ represents the product of the integers from $n$ to $1.$ (For example, $6! = 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1.$) What value of $N$ satisfies the following equation?
$$5! \cdot 9! = 12 \cdot N!$$
$\textbf{(A) }10 \qquad \textbf{(B) }11 \qquad \textbf{(C) }12 \qquad \textbf{(D) }13 \qquad \textbf{(E) }14$
A straight line connects City A at $(0, 0)$ to City B, 300 meters away at $(300, 0)$. At time $t=0$, a bullet train instantaneously sets out from City A to City B while another bullet train simultaneously leaves from City B to City A going on the same train track. Both trains are traveling at a constant speed of $50$ meters/second.
Also, at $t=0$, a super
y stationed at $(150, 0)$ and restricted to move only on the train tracks travels towards City B. The
y always travels at 60 meters/second, and any time it hits a train, it instantaneously reverses its direction and travels at the same speed. At the moment the
trains collide, what is the total distance that the y will have traveled? Assume each train is a point
and that the trains travel at their same respective velocities before and after collisions with the y
The three vertices of a triangle of sides $a,b,$ and $c$ are lattice points and lie on a circle of radius $R$. Show that $abc \geq 2R.$ (Lattice points are points in Euclidean plane with integral coordinates.)
The lengths of the sides of triangle $T'$ are equal to the lengths of the medians of triangle $T$. If triangles $T$ and $T'$ coincide in one angle, they are similar. Prove it.
Let $x,y,z \in \mathbb{R}$ such that $xyz = 1$. Prove that:
$$\left(x^4 + \frac{z^2}{y^2}\right)\left(y^4 + \frac{x^2}{z^2}\right)\left(z^4 + \frac{y^2}{x^2}\right) \ge \left(\frac{x^2}{y} + 1 \right)\left(\frac{y^2}{z} + 1 \right)\left(\frac{z^2}{x} + 1 \right).$$
Let $p_{1}$, $p_{2}$, ..., $p_{k}$ be different prime numbers. Determine the number of positive integers of the form $p_{1}^{\alpha_{1}}p_{2}^{\alpha_{2}}...p_{k}^{\alpha_{k}}$, $\alpha_{i}$ $\in$ $\mathbb{N}$ for which $\alpha_{1} \alpha_{2}...\alpha_{k}=p_{1}p_{2}...p_{k}$.
Show that for any non-negative integer $n$, the number $2^{2n+1}$ cannot be expressed as a sum of four non-zero square numbers.
Let $a_1<a_2<...<a_t$ be $t$ given positive integers where no three form an arithmetic progression. For $k=t,t+1,...$ define $a_{k+1}$ to be the smallest positive integer larger than $a_k$ satisfying the condition that no three of $a_1,a_2,...,a_{k+1}$ form an arithmetic progression. For any $x\in\mathbb{R}^+$ define $A(x)$ to be the number of terms in $\{a_i\}_{i\ge 1}$ that are at most $x$. Show that there exist $c>1$ and $K>0$ such that $A(x)\ge c\sqrt{x}$ for any $x>K$.
Walking down Jane Street, Ralph passed four houses in a row, each painted a different color. He passed the orange house before the red house, and he passed the blue house before the yellow house. The blue house was not next to the yellow house. How many orderings of the colored houses are possible?
${ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}}\ 5\qquad\textbf{(E)}\ 6$
Find the locus of all numbers $z\in\mathbb C$ in complex plane satisfying $$z+\bar z=a\cdot|z|,$$ where $a\in\mathbb R$ is given.
In the following exercise, $ C_G (e) $ denotes the centralizer of the element $ e $ in the group $ G. $
[b]a)[/b] Prove that $ \max_{\sigma\in S_n\setminus\{1\}} \left| C_{S_n} (\sigma ) \right| <\frac{n!}{2} , $ for any natural number $ n\ge 4. $
[b]b)[/b] Show that $ \lim_{n\to\infty} \left(\frac{1}{n!}\cdot\max_{\sigma\in S_n\setminus\{1\}} \left| C_{S_n} (\sigma ) \right|\right) =0. $
[i]Alexandru Cioba[/i]
Let $n$ be a positive integer and let $x_1,\ldots,x_n$ be $n$ nonzero points in $\mathbb R^2$. Suppose $\langle x_i,x_j\rangle$ (scalar or dot product) is a rational number for all $i,j$ ($1\le i,j\le n$). Let $S$ denote all points of $\mathbb R^2$ of the form $\sum_{i=1}^na_ix_i$ where the $a_i$ are integers. A closed disk of radius $R$ and center $P$ is the set of points at distance at most $R$ from $P$ (includes the points distance $R$ from $P$). Prove that there exists a positive number $R$ and closed disks $D_1,D_2,\ldots$ of radius $R$ such that
(a) Each disk contains exactly two points of $S$;
(b) Every point of $S$ lies in at least one disk;
(c) Two distinct disks intersect in at most one point.
David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, \(A\), \(B\), \(C\), which can each be inscribed in a circle with radius \(1\). Let \(\varphi_A\) denote the measure of the acute angle made by the diagonals of quadrilateral \(A\), and define \(\varphi_B\) and \(\varphi_C\) similarly. Suppose that \(\sin\varphi_A=\frac{2}{3}\), \(\sin\varphi_B=\frac{3}{5}\), and \(\sin\varphi_C=\frac{6}{7}\). All three quadrilaterals have the same area \(K\), which can be written in the form \(\frac{m}{n}\), where \(m\) and \(n\) are relatively prime positive integers. Find \(m+n\).
Let $f$ be a function $R \to R$ that satisfies the following equation: $$f (x)^2 + f (y)^2 = f (x^2 + y^2)+ f (0)$$ If there are $n$ possibilities for the function, find the sum of all values of $n \cdot f (12)$
Let $n \ge 3$ be an integer, and consider a circle with $n + 1$ equally spaced points marked on it. Consider all labellings of these points with the numbers $0, 1, ... , n$ such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called [i]beautiful[/i] if, for any four labels $a < b < c < d$ with $a + d = b + c$, the chord joining the points labelled $a$ and $d$ does not intersect the chord joining the points labelled $b$ and $c$.
Let $M$ be the number of beautiful labelings, and let N be the number of ordered pairs $(x, y)$ of positive integers such that $x + y \le n$ and $\gcd(x, y) = 1$. Prove that $$M = N + 1.$$
Given a finite set of points in the plane, each with integer coordinates, is it always possible to color the points red or white so that for any straight line $L$ parallel to one of the coordinate axes the difference (in absolute value) between the numbers of white and red points on $L$ is not greater than $1$?