Found problems: 85335
Let $a,b,c$ be positive real numbers such that $2a^2 +b^2=9c^2$.Prove that $\displaystyle \frac{2c}{a}+\frac cb \ge\sqrt 3$.
Integers $1, 2,...,100$ are written on a circle, not necessarily in that order. Can it be that the absolute value of the di erence between any two adjacent integers is at least $30$ and at most $50$?
Prove: out of $ 79$ consecutive positive integers, one can find at least one whose sum of digits is divisible by $ 13$. Show that this isn't true for $ 78$ consecutive integers.
Triangle $ABC$ has side lengths $AB=18$, $BC=36$, and $CA=24$. The circle $\Gamma$ passes through point $C$ and is tangent to segment $AB$ at point $A$.
Let $X$, distinct from $C$, be the second intersection of $\Gamma$ with $BC$. Moreover, let $Y$ be the point on $\Gamma$ such that segment $AY$ is an angle bisector of $\angle XAC$.
Suppose the length of segment $AY$ can be written in the form $AY=\frac{p\sqrt{r}}{q}$ where $p$, $q$, and $r$ are positive integers such that $gcd(p, q)=1$ and $r$ is square free.
Find the value of $p+q+r$.
Circles $\omega_1$, $\omega_2$, and $\omega_3$ each have radius $4$ and are placed in the plane so that each circle is externally tangent to the other two. Points $P_1$, $P_2$, and $P_3$ lie on $\omega_1$, $\omega_2$, and $\omega_3$ respectively such that $P_1P_2=P_2P_3=P_3P_1$ and line $P_iP_{i+1}$ is tangent to $\omega_i$ for each $i=1,2,3$, where $P_4 = P_1$. See the figure below. The area of $\triangle P_1P_2P_3$ can be written in the form $\sqrt{a}+\sqrt{b}$ for positive integers $a$ and $b$. What is $a+b$?
[asy]
unitsize(12);
pair A = (0, 8/sqrt(3)), B = rotate(-120)*A, C = rotate(120)*A;
real theta = 41.5;
pair P1 = rotate(theta)*(2+2*sqrt(7/3), 0), P2 = rotate(-120)*P1, P3 = rotate(120)*P1;
filldraw(P1--P2--P3--cycle, gray(0.9));
draw(Circle(A, 4));
draw(Circle(B, 4));
draw(Circle(C, 4));
dot(P1);
dot(P2);
dot(P3);
defaultpen(fontsize(10pt));
label("$P_1$", P1, E*1.5);
label("$P_2$", P2, SW*1.5);
label("$P_3$", P3, N);
label("$\omega_1$", A, W*17);
label("$\omega_2$", B, E*17);
label("$\omega_3$", C, W*17);
[/asy]
$\textbf{(A) }546\qquad\textbf{(B) }548\qquad\textbf{(C) }550\qquad\textbf{(D) }552\qquad\textbf{(E) }554$
In quadrilateral $ABCD$ , $AC$ is bisector of $\hat{A}$ and $\widehat{ADC}=\widehat{ACB}$. $X$ and $Y$ are feet of perpendicular from $A$ to $BC$ and $CD$,respectively.Prove that orthocenter of triangle $AXY$ is on $BD$.
There are some players in a Ping Pong tournament, where every $2$ players play with each other at most once. Given:
\\(1) Each player wins at least $a$ players, and loses to at least $b$ players. ($a,b\geq 1$)
\\(2) For any two players $A,B$, there exist some players $P_1,...,P_k$ ($k\geq 2$) (where $P_1=A$,$P_k=B$), such that $P_i$ wins $P_{i+1}$ ($i=1,2...,k-1$).
\\Prove that there exist $a+b+1$ distinct players $Q_1,...Q_{a+b+1}$, such that $Q_i$ wins $Q_{i+1}$ ($i=1,...,a+b$)
It is known about a given rectangle that it can be divided into nine squares which are situated relative to each other as shown. The black rectangle has side length $1$. Are there more than one possibility for the side lengths of the rectangle?
[img]https://cdn.artofproblemsolving.com/attachments/1/0/af6bc5b867541c04586e4b03db0a7f97f8fe87.png[/img]
Consider systems of three linear equations with unknowns $x,$ $y,$ and $z,$
\begin{align*}
a_1 x + b_1 y + c_1 z = 0 \\
a_2 x + b_2 y + c_2 z = 0 \\
a_3 x + b_3 y + c_3 z = 0
\end{align*}
where each of the coefficients is either $0$ or $1$ and the system has a solution other than $x = y = z = 0.$ For example, one such system is $\{1x + 1y + 0z = 0, 0x + 1y + 1z = 0, 0x + 0y + 0z = 0\}$ with a nonzero solution of $\{x, y, z\} = \{1, -1, 1\}.$ How many such systems are there? (The equations in a system need not be distinct, and two systems containing the same equations in a different order are considered different.)
$\textbf{(A) } 302 \qquad \textbf{(B) } 338 \qquad \textbf{(C) } 340 \qquad \textbf{(D) } 343 \qquad \textbf{(E) } 344$
Find all real numbers $ t $ not less than $1 $ that satisfy the following requirements: for any $a,b\in [-1,t]$ , there always exists $c,d \in [-1,t ]$ such that $ (a+c)(b+d)=1.$
In triangle $ABC$ with $AB=23$, $AC=27$, and $BC=20$, let $D$ be the foot of the $A$ altitude. Let $\mathcal{P}$ be the parabola with focus $A$ passing through $B$ and $C$, and denote by $T$ the intersection point of $AD$ with the directrix of $\mathcal P$. Determine the value of $DT^2-DA^2$. (Recall that a parabola $\mathcal P$ is the set of points which are equidistant from a point, called the $\textit{focus}$ of $\mathcal P$, and a line, called the $\textit{directrix}$ of $\mathcal P$.)
Find the number of positive integers $n$ for which
(i) $n \leq 1991$;
(ii) 6 is a factor of $(n^2 + 3n +2)$.
Let $ABC$ be a scalene triangle with incenter $I$. The incircle of $ABC$ touches $\overline{BC},\overline{CA},\overline{AB}$ at points $D,E,F$, respectively. Let $P$ be the foot of the altitude from $D$ to $\overline{EF}$, and let $M$ be the midpoint of $\overline{BC}$. The rays $AP$ and $IP$ intersect the circumcircle of triangle $ABC$ again at points $G$ and $Q$, respectively. Show that the incenter of triangle $GQM$ coincides with $D$.
[i]Zack Chroman and Daniel Liu[/i]
Concentric circles $\Omega_1$ and $\Omega_2$ with radii $1$ and $100$, respectively, are drawn with center $O$. Points $A$ and $B$ are chosen independently at random on the circumferences of $\Omega_1$ and $\Omega_2$, respectively. Denote by $\ell$ the tangent line to $\Omega_1$ passing through $A$, and denote by $P$ the reflection of $B$ across $\ell$. Compute the expected value of $OP^2$.
[i]Proposed by Lewis Chen[/i]
Determine the last three digits of \[2003^{2002^{2001}}.\]
[b]p1. [/b] In basketball, teams can score $1, 2$, or $3$ points each time. Suppose that Duke basketball have scored $8$ points so far. What is the total number of possible ways (ordered) that they have scored?
For example, $(1, 2, 2, 2, 1)$,$(1, 1, 2, 2, 2)$ are two different ways.
[b]p2.[/b] All the positive integers that are coprime to $2021$ are grouped in increasing order, such that the nth group contains $2n - 1$ numbers. Hence the first three groups are $\{1\}$, $\{2, 3, 4\}$, $\{5, 6, 7, 8, 9\}$. Suppose that $2022$ belongs to the $k$th group. Find $k$.
[b]p3.[/b] Let $A = (0, 0)$ and $B = (3, 0)$ be points in the Cartesian plane. If $R$ is the set of all points $X$ such that $\angle AXB \ge 60^o$ (all angles are between $0^o$ and $180^o$), find the integer that is closest to the area of $R$.
[b]p4.[/b] What is the smallest positive integer greater than $9$ such that when its left-most digit is erased, the resulting number is one twenty-ninth of the original number?
[b]p5. [/b] Jonathan is operating a projector in the cartesian plane. He sets up $2$ infinitely long mirrors represented by the lines $y = \tan(15^o)x$ and $y = 0$, and he places the projector at $(1, 0)$ pointed perpendicularly to the $x$-axis in the positive $y$ direction. Jonathan furthermore places a screen on one of the mirrors such that light from the projector reflects off the mirrors a total of three times before hitting the screen. Suppose that the coordinates of the screen is $(a, b)$. Find $10a^2 + 5b^2$.
[b]p6.[/b] Dr Kraines has a cube of size $5 \times 5 \times 5$, which is made from $5^3$ unit cubes. He then decides to choose $m$ unit cubes that have an outside face such that any two different cubes don’t share a common vertex. What is the maximum value of $m$?
[b]p7.[/b] Let $a_n = \tan^{-1}(n)$ for all positive integers $n$. Suppose that $$\sum_{k=4}^{\infty}(-1)^{\lfloor \frac{k}{2} \rfloor +1} \tan(2a_k)$$ is equals to $a/b$ , where $a, b$ are relatively prime. Find $a + b$.
[b]p8.[/b] Rishabh needs to settle some debts. He owes $90$ people and he must pay \$ $(101050 + n)$ to the $n$th person where $1 \le n \le 90$. Rishabh can withdraw from his account as many coins of values \$ $2021$ and \$ $x$ for some fixed positive integer $x$ as is necessary to pay these debts. Find the sum of the four least values of $x$ so that there exists a person to whom Rishabh is unable to pay the exact amount owed using coins.
[b]p9.[/b] A frog starts at $(1, 1)$. Every second, if the frog is at point $(x, y)$, it moves to $(x + 1, y)$ with probability $\frac{x}{x+y}$ and moves to $(x, y + 1)$ with probability $\frac{y}{x+y}$ . The frog stops moving when its $y$ coordinate is $10$. Suppose the probability that when the frog stops its $x$-coordinate is strictly less than $16$, is given by $m/n$ where $m, n$ are positive integers that are relatively prime. Find $m + n.$
[b]p10.[/b] In the triangle $ABC$, $AB = 585$, $BC = 520$, $CA = 455$. Define $X, Y$ to be points on the segment $BC$. Let $Z \ne A$ be the intersection of $AY$ with the circumcircle of $ABC$. Suppose that $XZ$ is parallel to $AC$ and the circumcircle of $XYZ$ is tangent to the circumcircle of $ABC$ at $Z$. Find the length of $XY$ .
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Country $\mathcal{A}$ has $c\%$ of the world's population and owns $d\%$ of the world's wealth. Country $\mathcal{B}$ has $e\%$ of the world's population and $f\%$ of its wealth. Assume that the citizens of $\mathcal{A}$ share the wealth of $\mathcal{A}$ equally, and assume that those of $\mathcal{B}$ share the wealth of $\mathcal{B}$ equally. Find the ratio of the wealth of a citizen of $\mathcal{A}$ to the wealth of a citizen of $\mathcal{B}$.
$ \textbf{(A)}\ \frac{cd}{ef} \qquad\textbf{(B)}\ \frac{ce}{df} \qquad\textbf{(C)}\ \frac{cf}{de} \qquad\textbf{(D)}\ \frac{de}{cf} \qquad\textbf{(E)}\ \frac{df}{ce} $
Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple:
\begin{align*}
\mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\
\mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022}))
\end{align*}
and then write this tuple on the blackboard.
It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?
[b]p1.[/b] Susan plays a game in which she rolls two fair standard six-sided dice with sides labeled one through six. She wins if the number on one of the dice is three times the number on the other die. If Susan plays this game three times, compute the probability that she wins at least once.
[b]p2.[/b] In triangles $\vartriangle ABC$ and $\vartriangle DEF$, $DE = 4AB$, $EF = 4BC$, and $FD = 4CA$. The area of $\vartriangle DEF$ is $360$ units more than the area of $\vartriangle ABC$. Compute the area of $\vartriangle ABC$.
[b]p3.[/b] Andy has $2010$ square tiles, each of which has a side length of one unit. He plans to arrange the tiles in an $m\times n$ rectangle, where $mn = 2010$. Compute the sum of the perimeters of all of the different possible rectangles he can make. Two rectangles are considered to be the same if one can be rotated to become the other, so, for instance, a $1\times 2010$ rectangle is considered to be the same as a $2010\times 1$ rectangle.
[b]p4.[/b] Let $$S = \log_2 9 \log_3 16 \log_4 25 ... \log_{999} 1000000.$$
Compute the greatest integer less than or equal to $\log_2 S$.
[b]p5.[/b] Let $A$ and $B$ be fixed points in the plane with distance $AB = 1$. An ant walks on a straight line from point $A$ to some point $C$ in the plane and notices that the distance from itself to B always decreases at any time during this walk. Compute the area of the region in the plane containing all points where point $C$ could possibly be located.
[b]p6.[/b] Lisette notices that $2^{10} = 1024$ and $2^{20} = 1 048 576$. Based on these facts, she claims that every number of the form $2^{10k}$ begins with the digit $1$, where k is a positive integer. Compute the smallest $k$ such that Lisette's claim is false. You may or may not find it helpful to know that $ln 2 \approx 0.69314718$, $ln 5 \approx 1.60943791$, and $log_{10} 2 \approx 0:30103000$.
[b]p7.[/b] Let $S$ be the set of all positive integers relatively prime to $6$. Find the value of $\sum_{k\in S}\frac{1}{2^k}$ .
[b]p8.[/b] Euclid's algorithm is a way of computing the greatest common divisor of two positive integers $a$ and $b$ with $a > b$. The algorithm works by writing a sequence of pairs of integers as follows.
1. Write down $(a, b)$.
2. Look at the last pair of integers you wrote down, and call it $(c, d)$.
$\bullet$ If $d \ne 0$, let r be the remainder when c is divided by d. Write down $(d, r)$.
$\bullet$ If $d = 0$, then write down c. Once this happens, you're done, and the number you just wrote down is the greatest common divisor of a and b.
3. Repeat step 2 until you're done.
For example, with $a = 7$ and $b = 4$, Euclid's algorithm computes the greatest common divisor in $4$ steps:
$$(7, 4) \to (4, 3) \to (3, 1) \to (1, 0) \to 1$$
For $a > b > 0,$ compute the least value of a such that Euclid's algorithm takes $10$ steps to compute the greatest common divisor of $a$ and $b$.
[b]p9.[/b] Let $ABCD$ be a square of unit side length. Inscribe a circle $C_0$ tangent to all of the sides of the square. For each positive integer $n$, draw a circle Cn that is externally tangent to $C_{n-1}$ and also tangent to sides $AB$ and $AD$. Suppose $r_i$ is the radius of circle $C_i$ for every nonnegative integer $i$. Compute $\sqrt[200]{r_0/r_{100}}$.
[b]p10.[/b] Rachel and Mike are playing a game. They start at $0$ on the number line. At each positive integer on the number line, there is a carrot. At the beginning of the game, Mike picks a positive integer $n$ other than $30$. Every minute, Rachel moves to the next multiple of $30$ on the number line that has a carrot on it and eats that carrot. At the same time, every minute, Mike moves to the next multiple of $n$ on the number line that has a carrot on it and eats that carrot. Mike wants to pick an $n$ such that, as the game goes on, he is always within $1000$ units of Rachel. Compute the average (arithmetic mean) of all such $n$.
[b]p11.[/b] Darryl has a six-sided die with faces $1, 2, 3, 4, 5, 6$. He knows the die is weighted so that one face comes up with probability $1/2$ and the other five faces have equal probability of coming up. He unfortunately does not know which side is weighted, but he knows each face is equally likely to be the weighted one. He rolls the die 5 times and gets a $1$, $2$, $3$, $4$ and $5$ in some unspecified order. Compute the probability that his next roll is a $6$.
[b]p12.[/b] Let $F_0 = 1$, $F_1 = 1$ and $F_k = F_{k-1} + F_{k-2}$. Let $P(x) =\sum^{99}_{k=0} x^{F_k}$ . The remainder when $P(x)$ is divided by $x^3 - 1$ can be expressed as $ax^2 + bx + c$. Find $2a + b$.
[b]p13.[/b] Let $\theta \ne 0$ be the smallest acute angle for which $\sin \theta$, $\sin (2\theta)$, $\sin (3\theta)$, when sorted in increasing order, form an arithmetic progression. Compute $\cos (\theta/2)$.
[b]p14.[/b] A $4$-dimensional hypercube of edge length 1 is constructed in $4$-space with its edges parallel to the coordinate axes and one vertex at the origin. The coordinates of its sixteen vertices are given by $(a, b, c, d)$, where each of $a$, $b$, $c$, and $d$ is either $0$ or $1$. The $3$-dimensional hyperplane given by $x + y + z + w = 2$ intersects the hypercube at $6$ of its vertices. Compute the $3$-dimensional volume of the solid formed by the intersection.
[b]p15.[/b] A student puts $2010$ red balls and $1957$ blue balls into a box. Weiqing draws randomly from the box one ball at a time without replacement. She wins if, at anytime, the total number of blue balls drawn is more than the total number of red balls drawn. Assuming Weiqing keeps drawing balls until she either wins or runs out, ompute the probability that she eventually wins.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $ f(t)$ be a continuous function on the interval $ 0 \leq t \leq 1$, and define the two sets of points \[ A_t\equal{}\{(t,0): t\in[0,1]\} , B_t\equal{}\{(f(t),1): t\in [0,1]\}.\] Show that the union of all segments $ \overline{A_tB_t}$ is Lebesgue-measurable, and find the minimum of its measure with respect to all functions $ f$. [A. Csaszar]
A customer who intends to purchase an appliance has three coupons, only one of which may be used:
Coupon 1: $10\%$ off the listed price if the listed price is at least $\$50$
Coupon 2: $\$20$ off the listed price if the listed price is at least $\$100$
Coupon 3: $18\%$ off the amount by which the listed price exceeds $\$100$
For which of the following listed prices will coupon $1$ offer a greater price reduction than either coupon $2$ or coupon $3$?
$\textbf{(A) }\$179.95\qquad
\textbf{(B) }\$199.95\qquad
\textbf{(C) }\$219.95\qquad
\textbf{(D) }\$239.95\qquad
\textbf{(E) }\$259.95\qquad$
For any positive integer $n{}$ define $a_n=\{n/s(n)\}$ where $s(\cdot)$ denotes the sum of the digits and $\{\cdot\}$ denotes the fractional part.[list=a]
[*]Prove that there exist infinitely many positive integers $n$ such that $a_n=1/2.$
[*]Determine the smallest positive integer $n$ such that $a_n=1/6.$
[/list]
[i]Marius Burtea[/i]
Let $ABC$ be a triangle, $H_a, H_b$ and $H_c$ the feet of its altitudes from $A, B$ and $C$, respectively, $T_a, T_b, T_c$ its touchpoints of the incircle with the sides $BC, CA$ and $AB$, respectively. The circumcircles of triangles $AH_bH_c$ and $AT_bT_c$ intersect again at $A'$. The circumcircles of triangles $BH_cH_a$ and $BT_cT_a$ intersect again at $B'$. The circumcircles of triangles $CH_aH_b$ and $CT_aT_b$ intersect again at $C'$. Prove that the points $A',B',C'$ are collinear.
Malik Talbi
In the beginning, the number 1 is written on the board 9999 times. We are allowed to perform the following actions:
[list]
[*] Erase four numbers of the form $x,x,y,y$, and instead write the two numbers $x+y,x-y$. (The order or location of the erased numbers does not matter)
[*] Erase the number 0 from the board, if it's there.
[/list]
Is it possible to reach a state where:
[list=a]
[*] Only one number remains on the board?
[*] At most three numbers remain on the board?
[/list]
Suppose for some positive integers $r$ and $s$, $2^r$ is obtained by permuting the digits of $2^s$ in decimal expansion. Prove that $r=s$.