Found problems: 603
Pyramid $OABCD$ has square base $ABCD,$ congruent edges $\overline{OA}, \overline{OB}, \overline{OC},$ and $\overline{OD},$ and $\angle AOB=45^\circ.$ Let $\theta$ be the measure of the dihedral angle formed by faces $OAB$ and $OBC.$ Given that $\cos \theta=m+\sqrt{n},$ where $m$ and $n$ are integers, find $m+n.$
Let $ABCD$ be a rectangle with $AB=a >CD =b$. Given circles $(K_1,r_1) , (K_2,r_2)$ with $r_1<r_2$ tangent externally at point $K$ and also tangent to the sides of the rectangle, circle $(K_1,r_1)$ tangent to both $AD$ and $AB$, circle $(K_2,r_2)$ tangent to both $AB$ and $BC$. Let also the internal common tangent of those circles pass through point $D$.
(i) Express sidelengths $a$ and $b$ in terms of $r_1$ and $r_2$.
(ii) Calculate the ratios $\frac{r_1}{r_2}$ and $\frac{a}{b}$ .
(iii) Find the length of $DK$ in terms of $r_1$ and $r_2$.
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$.
Let $y = x^2 + ax + b$ be a parabola that cuts the coordinate axes at three distinct points. Show that the circle passing through these three points also passes through $(0,1)$.
A scanning code consists of a $7 \times 7$ grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of $49$ squares. A scanning code is called [i]symmetric[/i] if its look does not change when the entire square is rotated by a multiple of $90 ^{\circ}$ counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes?
$\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$
For $ x\in\mathbb{R} , $ determine the minimum of $ \sqrt{(x-1)^2+\left( x^2-5\right)^2} +\sqrt{(x+2)^2+\left( x^2+1 \right)^2} $ and the maximum of $ \sqrt{(x-1)^2+\left( x^2-5\right)^2} -\sqrt{(x+2)^2+\left( x^2+1 \right)^2} . $
[i]Vasile Pop[/i]
Equilateral $\triangle ABC$ is inscribed in a circle of radius 2. Extend $\overline{AB}$ through $B$ to point $D$ so that $AD=13$, and extend $\overline{AC}$ through $C$ to point $E$ so that $AE=11$. Through $D$, draw a line $l_1$ parallel to $\overline{AE}$, and through $E$, draw a line ${l}_2$ parallel to $\overline{AD}$. Let $F$ be the intersection of ${l}_1$ and ${l}_2$. Let $G$ be the point on the circle that is collinear with $A$ and $F$ and distinct from $A$. Given that the area of $\triangle CBG$ can be expressed in the form $\frac{p\sqrt{q}}{r}$, where $p$, $q$, and $r$ are positive integers, $p$ and $r$ are relatively prime, and $q$ is not divisible by the square of any prime, find $p+q+r$.
Jack wants to bike from his house to Jill's house, which is located three blocks east and two blocks north of Jack's house. After biking each block, Jack can continue either east or north, but he needs to avoid a dangerous intersection one block east and one block north of his house. In how many ways can he reach Jill's house by biking a total of five blocks?
$\textbf{(A) }4\qquad\textbf{(B) }5\qquad\textbf{(C) }6\qquad\textbf{(D) }8\qquad \textbf{(E) }10$
Let square $ABCD$ and circle $\Omega$ be on the same plane, and $AA'$, $BB'$, $CC'$, $DD'$ be tangents to $\Omega$. Let $WXY Z$ be a convex quadrilateral with side lengths $WX = AA'$, $XY = BB'$, $Y Z = CC'$, and $ZW = DD'$. If $WXY Z$ has an inscribed circle, prove that the diagonals $WY$ and $XZ$ are perpendicular to each other.
Does there exist a set $S$ of $100$ points in a plane such that the center of mass of any $10$ points in $S$ is also a point in $S$?
A [i]site[/i] is any point $(x, y)$ in the plane such that $x$ and $y$ are both positive integers less than or equal to 20.
Initially, each of the 400 sites is unoccupied. Amy and Ben take turns placing stones with Amy going first. On her turn, Amy places a new red stone on an unoccupied site such that the distance between any two sites occupied by red stones is not equal to $\sqrt{5}$. On his turn, Ben places a new blue stone on any unoccupied site. (A site occupied by a blue stone is allowed to be at any distance from any other occupied site.) They stop as soon as a player cannot place a stone.
Find the greatest $K$ such that Amy can ensure that she places at least $K$ red stones, no matter how Ben places his blue stones.
[i]Proposed by Gurgen Asatryan, Armenia[/i]
Let $n$ be a positive integer. There are $\tfrac{n(n+1)}{2}$ marks, each with a black side and a white side, arranged into an equilateral triangle, with the biggest row containing $n$ marks. Initially, each mark has the black side up. An [i]operation[/i] is to choose a line parallel to the sides of the triangle, and flipping all the marks on that line. A configuration is called [i]admissible [/i] if it can be obtained from the initial configuration by performing a finite number of operations. For each admissible configuration $C$, let $f(C)$ denote the smallest number of operations required to obtain $C$ from the initial configuration. Find the maximum value of $f(C)$, where $C$ varies over all admissible configurations.
The ray of light starts from the center of a square and reflects from its sides with the principle that the angle of reflection is equal to the angle of incidence. After some time the ray returns to the center of the square. The ray never reached the vertex and has never returned to the center of the square before. Prove that the ray reflected from the sides of the square an odd number of times.
Let $ABC$ be an acute triangle.The lines $l_1$ and $l_2$ are perpendicular to $AB$ at the points $A$ and $B$, respectively.The perpendicular lines from the midpoint $M$ of $AB$ to the lines $AC$ and $BC$ intersect $l_1$ and $l_2$ at the points $E$ and $F$, respectively.If $D$ is the intersection point of the lines $EF$ and $MC$, prove that \[\angle ADB = \angle EMF.\]
Every natural number is coloured in one of the $ k$ colors. Prove that there exist four distinct natural numbers $ a, b, c, d$, all coloured in the same colour, such that $ ad \equal{} bc$, $ \displaystyle \frac b a$ is power of 2 and $ \displaystyle \frac c a$ is power of 3.
Let $ABC$ be a right triangle with $A = 90^{\circ}$ and $D \in (AC)$. Denote by $E$ the reflection of $A$ in the line $BD$ and $F$ the intersection point of $CE$ with the perpendicular in $D$ to $BC$. Prove that $AF, DE$ and $BC$ are concurrent.
During a lecture, each of $26$ mathematicians falls asleep exactly once, and stays asleep for a nonzero amount of time. Each mathematician is awake at the moment the lecture starts, and the moment the lecture finishes. Prove that there are either $6$ mathematicians such that no two are asleep at the same time, or $6$ mathematicians such that there is some point in time during which all $6$ are asleep.
For each integer $n \ge 2$, let $A(n)$ be the area of the region in the coordinate plane defined by the inequalities $1\le x \le n$ and $0\le y \le x \left\lfloor \sqrt x \right\rfloor$, where $\left\lfloor \sqrt x \right\rfloor$ is the greatest integer not exceeding $\sqrt x$. Find the number of values of $n$ with $2\le n \le 1000$ for which $A(n)$ is an integer.
Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps.
[list=1]
[*]select a $2\times 2$ square in the grid;
[*]flip the coins in the top-left and bottom-right unit squares;
[*]flip the coin in either the top-right or bottom-left unit square.
[/list]
Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves.
[i]Thanasin Nampaisarn, Thailand[/i]
A transformation of the first quadrant of the coordinate plane maps each point $(x,y)$ to the point $(\sqrt{x},\sqrt{y}).$ The vertices of quadrilateral $ABCD$ are $A=(900,300), B=(1800,600), C=(600,1800),$ and $D=(300,900).$ Let $k$ be the area of the region enclosed by the image of quadrilateral $ABCD.$ Find the greatest integer that does not exceed $k.$
Let $ABC$ be an acute-angled triangle with $AB<AC$ and let $O$ be the centre of its circumcircle $\omega$. Let $D$ be a point on the line segment $BC$ such that $\angle BAD = \angle CAO$. Let $E$ be the second point of intersection of $\omega$ and the line $AD$. If $M$, $N$ and $P$ are the midpoints of the line segments $BE$, $OD$ and $AC$, respectively, show that the points $M$, $N$ and $P$ are collinear.
Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps.
[list=1]
[*]select a $2\times 2$ square in the grid;
[*]flip the coins in the top-left and bottom-right unit squares;
[*]flip the coin in either the top-right or bottom-left unit square.
[/list]
Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves.
[i]Thanasin Nampaisarn, Thailand[/i]
Let $\Omega$ be the circumcircle of an isosceles trapezoid $ABCD$, in which $AD$ is parallel to $BC$. Let $X$ be the reflection point of $D$ with respect to $BC$. Point $Q$ is on the arc $BC$ of $\Omega$ that does not contain $A$. Let $P$ be the intersection of $DQ$ and $BC$. A point $E$ satisfies that $EQ$ is parallel to $PX$, and $EQ$ bisects $\angle BEC$. Prove that $EQ$ also bisects $\angle AEP$.
[i]Proposed by Li4.[/i]
In triangle $ABC$, $AB=13,$ $BC=15$ and $CA=17.$ Point $D$ is on $\overline{AB},$ $E$ is on $\overline{BC},$ and $F$ is on $\overline{CA}.$ Let $AD=p\cdot AB,$ $BE=q\cdot BC,$ and $CF=r\cdot CA,$ where $p,$ $q,$ and $r$ are positive and satisfy $p+q+r=2/3$ and $p^2+q^2+r^2=2/5.$ The ratio of the area of triangle $DEF$ to the area of triangle $ABC$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
In the coordinate plane are finitely many [i]walls[/i]; which are disjoint line segments, none of which are parallel to either axis. A bulldozer starts at an arbitrary point and moves in the $+x$ direction. Every time it hits a wall, it turns at a right angle to its path, away from the wall, and continues moving. (Thus the bulldozer always moves parallel to the axes.)
Prove that it is impossible for the bulldozer to hit both sides of every wall.
[i]Proposed by Linus Hamilton and David Stoner[/i]