Found problems: 85335
A semicircle is inscribed in right triangle $ABC$ with right angle $B$ and has diameter on $AB$, with
one end on point $B$. Given that $AB = 15$ and $BC = 8$, determine the radius of the semicircle
[i]2015 CCA Math Bonanza Team Round #6[/i]
Jingyuan is designing a bucket hat for BMT merchandise. The hat has the shape of a cylinder on top of a truncated cone, as shown in the diagram below. The cylinder has radius $9$ and height $12$. The truncated cone has base radius $15$ and height $4$, and its top radius is the same as the cylinder’s radius. Compute the total volume of this bucket hat.
[img]https://cdn.artofproblemsolving.com/attachments/a/9/467d19889d08a6081f9dcd3f4d9df60582f244.png[/img]
In a $\triangle XYZ$, points $A,B$ lie on segment $ZX, C,D$ lie on segment $XY , E, F$ lie on segment $YZ$. $A, B, C, D$ lie on a circle, and $\frac{AZ \cdot EY \cdot ZB \cdot Y F}{EZ \cdot CY \cdot ZF \cdot Y D}= 1$ . Let $L = ZX \cap DE$, $M = XY \cap AF$, $N = Y Z \cap BC$. Prove that $L,M,N$ are collinear.
Let $A$ and $B$ be given real numbers. Let the sum of real numbers $0\le x_1\le x_2\le\ldots \le x_n$ be $A$, and let the sum of real numbers $0\le y_1\le y_2\le \ldots\le y_n$ be $B$. Find the largest possible value of
\[\sum_{i=1}^n (x_i-y_i)^2.\]
[i]Proposed by Péter Csikvári, Budapest[/i]
Positive real numbers $x, y, z$ satisfy $xyz+xy+yz+zx = x+y+z+1$. Prove that \[ \frac{1}{3} \left( \sqrt{\frac{1+x^2}{1+x}} + \sqrt{\frac{1+y^2}{1+y}} + \sqrt{\frac{1+z^2}{1+z}} \right) \le \left( \frac{x+y+z}{3} \right)^{5/8} . \]
Given are two points $B,C$. Consider point $A$ not lying on the line $BC$ and draw the circles $C_1(K_1,R_1)$ (with center $K_1$ and radius $R_1$) and $C_2(K_2,R_2)$ with chord $AB, AC$ respectively such that their centers lie on the interior of the triangle $ABC$ and also $R_1 \cdot AC= R_2 \cdot AB$. Let $T$ be the intersection point of the two circles, different from $A$, and M be a random pointof line $AT$, prove that $TC \cdot S_{(MBT)}=TB \cdot S_{(MCT)}$
There are two piles of stones with $1012$ stones each. Ann and Ben play a game. In every move, a player removes two stones from one of the piles and adds one to the other pile. Ann goes first. The first player to remove the last stone in one of the piles wins the game. Which player has a winning strategy and why?
There is $n\times n$ chessboard. Each square has a number between $0$ and $k$. There is a button for each row and column, which increases the number of $n$ numbers of the row or column the button represents(if the number of the square is $k$, then it becomes $0$). If certain button is pressed, call it 'operation.'
And we have a chessboard which is filled with 0(for all squares). After some 'operation's, the numbers of squares are different now. Prove that we can make all of the number $0$ within $kn$ 'operation's.
Twenty cubes have been coloured in the following way: There are two red faces opposite each other, two blue faces opposite each other and two green faces opposite each other. The cubes have been glued together as shown in the figure. Two faces that are glued together always have the same colour. The figure shows the colours of some of the faces. Which colours are possible for the face marked with the symbol $\times$?
[img]https://cdn.artofproblemsolving.com/attachments/8/2/6127db5bfdce7a749d730fe3626499582f62ba.png[/img]
Let $T$ be a tree with$ n$ vertices. Choose a positive integer $k$ where $1 \le k \le n$ such that $S_k$ is a subset with $k$ elements from the vertices in $T$. For all $S \in S_k$, define $c(S)$ to be the number of component of graph from $S$ if we erase all vertices and edges in $T$, except all vertices and edges in $S$. Determine $\sum_{S\in S_k} c(S)$, expressed in terms of $n$ and $k$.
Let $ ABC$ be a triangle, let $ AB > AC$. Its incircle touches side $ BC$ at point $ E$. Point $ D$ is the second intersection of the incircle with segment $ AE$ (different from $ E$). Point $ F$ (different from $ E$) is taken on segment $ AE$ such that $ CE \equal{} CF$. The ray $ CF$ meets $ BD$ at point $ G$. Show that $ CF \equal{} FG$.
Solve the system $$\begin{cases} \displaystyle 4^{-x}+27^{-y}= \frac{5}{6} \\ \displaystyle 27^y-4^x \le 1 \\ \displaystyle \log_{27}y-\log_4 x \ge \frac{1}{6} \end{cases}.$$
What is the minimum possible value of \[\left|x\right|-\left|x-1\right|+\left|x+2\right|-\left|x-3\right|+\left|x+4\right|-\cdots-\left|x-2019\right|\] over all real $x$?
[i]2019 CCA Math Bonanza Individual Round #10[/i]
Find all real numbers $x$ which satisfy $\frac{n}{3n+1}\leq x\leq \frac{4n+1}{2n-1}$, for all $n\in\mathbb{N}^*$.
[i]Gheorghe Boroica[/i]
Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that
\[ m^2 + f(n) \mid mf(m) +n \]
for all positive integers $m$ and $n$.
For natural numbers $x_1,\ldots,x_k$, let $[x_k,\ldots,x_1]$ be defined recurrently as follows: $[x_2,x_1]=x_2^{x_1}$ and, for $k\ge3$, $[x_k,x_{k-1},\ldots,x_1]=x_k^{[x_{k-1},\ldots,x_1]}$.
(a) Let $3\le a_1\le a_2\le\ldots\le a_n$be integers. For a permutation $\sigma$ of the set $\{1,2,\ldots,n\}$, we set $P(\sigma)=[a_{\sigma(n)},a_{\sigma(n-1)},\ldots,a_{\sigma(1)}]$. Find the permutations $\sigma$ for which $P(\sigma)$ is minimal or maximal.
(b) Find all integers $a,b,c,d$, greater than or equal to $2$, for which $[178,9]\le[a,b,c,d]\le[198,9]$.
Let $\omega,\omega_1,\omega_2$ be three mutually tangent circles such that $\omega_1,\omega_2$ are externally tangent at $P$, $\omega_1,\omega$ are internally tangent at $A$, and $\omega,\omega_2$ are internally tangent at $B$. Let $O,O_1,O_2$ be the centers of $\omega,\omega_1,\omega_2$, respectively. Given that $X$ is the foot of the perpendicular from $P$ to $AB$, prove that $\angle{O_1XP}=\angle{O_2XP}$.
[i]David Yang.[/i]
[b]p1.[/b] Solve the equation: $\sqrt{x} +\sqrt{x + 1} - \sqrt{x + 2} = 0$.
[b]p2.[/b] Solve the inequality: $\ln (x^2 + 3x + 2) \le 0$.
[b]p3.[/b] In the trapezoid $ABCD$ ($AD \parallel BC$) $|AD|+|AB| = |BC|+|CD|$. Find the ratio of the length of the sides $AB$ and $CD$ ($|AB|/|CD|$).
[b]p4.[/b] Gollum gave Bilbo a new riddle. He put $64$ stones that are either white or black on an $8 \times 8$ chess board (one piece per each of $64$ squares). At every move Bilbo can replace all stones of any horizontal or vertical row by stones of the opposite color (white by black and black by white). Bilbo can make as many moves as he needs. Bilbo needs to get a position when in every horizontal and in every vertical row the number of white stones is greater than or equal to the number of black stones. Can Bilbo solve the riddle and what should be his solution?
[b]p5.[/b] Two trolls Tom and Bert caught Bilbo and offered him a game. Each player got a bag with white, yellow, and black stones. The game started with Tom putting some number of stones from his bag on the table, then Bert added some number of stones from his bag, and then Bilbo added some stones from his bag. After that three players started making moves. At each move a player chooses two stones of different colors, takes them away from the table, and puts on the table a stone of the color different from the colors of chosen stones. Game ends when stones of one color only remain on the table. If the remaining stones are white Tom wins and eats Bilbo, if they are yellow, Bert wins and eats Bilbo, if they are black, Bilbo wins and is set free. Can you help Bilbo to save his life by offering him a winning strategy?
[b]p6.[/b] There are four roads in Mirkwood that are straight lines. Bilbo, Gandalf, Legolas, and Thorin were travelling along these roads, each along a different road, at a different constant speed. During their trips Bilbo met Gandalf, and both Bilbo and Gandalf met Legolas and Thorin, but neither three of them met at the same time. When meeting they did not stop and did not change the road, the speed, and the direction. Did Legolas meet Thorin? Justify your answer.
PS. You should use hide for answers.
For any prime $p$, prove that there exists integer $x_0$ such that $p | (x^2_0 - x_0 + 3)$ $\Leftrightarrow$ there exists integer $y_0$ such that $p | (y^2_0 - y_0 + 25).$
On each cell of a $200 \times 200$ grid, we place a car, which faces in one of the four cardinal directions.In a move, one chooses a car that does not have a car immediately in front of it, and slides it one cellforward. If a move would cause a car to exit the grid, the car is removed instead. The cars are placedso that there exists a sequence of moves that eventually removes all the cars from the grid. Across all
such starting configurations, determine the maximum possible number of moves to do so.
A square of side $1$ is divided into rectangles . We choose one of the two smaller sides of each rectangle (if the rectangle is a square, then we choose any of the four sides) . Prove that the sum of the lengths of all the chosen sides is at least $1$ .
(Folklore)
Prove that for any positive integer $ m$ there exist an infinite number of pairs of integers $(x,y)$ such that
$(\text{i})$ $x$ and $y$ are relatively prime;
$(\text{ii})$ $x$ divides $y^2+m;$
$(\text{iii})$ $y$ divides $x^2+m.$
Take two points $A\ (-1,\ 0),\ B\ (1,\ 0)$ on the $xy$-plane. Let $F$ be the figure by which the whole points $P$ on the plane satisfies $\frac{\pi}{4}\leq \angle{APB}\leq \pi$ and the figure formed by $A,\ B$.
Answer the following questions:
(1) Illustrate $F$.
(2) Find the volume of the solid generated by a rotation of $F$ around the $x$-axis.
In an acute triangle $ABC$, $AB<AC$. $AD$ is the altitude dropped onto $BC$ and $P$ is a point on $AD$. Let $PE\perp AC$ at $E$, $PF\perp AB$ at $F$ and let $J,K$ be the circumcentres of triangles $BDF, CDE$ respectively. Prove that $J,K,E,F$ are concyclic if and only if $P$ is the orthocentre of triangle $ABC$.
Compute the number of possible words $w=w_1w_2\dots w_{100}$ satisfying:
$\bullet$ $w$ has exactly $50$ $A$'s and $50$ $B$'s (and no other letter).
$\bullet$ For $i=1,2,\dots,100$, the number of $A$'s among $w_1, w_2, \dots, w_i$ is at most the number of $B$'s among $w_1, w_2, \dots, w_i$.
$\bullet$ For all $i=44,45,\dots,57$, if $w_i$ is a $B$, then $w_{i+1}$ must be a $B$.