problem
stringlengths 10
5.15k
| solution
stringlengths 2
11.1k
| answer
stringlengths 0
1.22k
| difficulty
float64 1
9.5
| formatted_input
stringlengths 159
5.3k
|
|---|---|---|---|---|
Let $\triangle ABC$ be an acute scalene triangle with circumcircle $\omega$. The tangents to $\omega$ at $B$ and $C$ intersect at $T$. Let $X$ and $Y$ be the projections of $T$ onto lines $AB$ and $AC$, respectively. Suppose $BT = CT = 16$, $BC = 22$, and $TX^2 + TY^2 + XY^2 = 1143$. Find $XY^2$. | Using the Claim (below) we get $\triangle ABC \sim \triangle XTM \sim \triangle YMT.$
Corresponding sides of similar $\triangle XTM \sim \triangle YMT$ is $MT,$ so
$\triangle XTM = \triangle YMT \implies MY = XT, MX = TY \implies XMYT$ – parallelogram.
\[4 TD^2 = MT^2 = \sqrt{BT^2 - BM^2} =\sqrt{153}.\] The formula for median $DT$ of triangle $XYT$ is \[2 DT^2 = XT^2 + TY^2 – \frac{XY^2}{2},\] \[3 \cdot XY^2 = 2XT^2 + 2TY^2 + 2XY^2 – 4 DT^2,\] \[3 \cdot XY^2 = 2 \cdot 1143-153 = 2151 \implies XY^2 = \boxed{717}.\]
Clime
Let $\triangle ABC$ be an acute scalene triangle with circumcircle $\omega$. The tangents to $\omega$ at $B$ and $C$ intersect at $T$. Let $X$ be the projections of $T$ onto line $AB$. Let M be midpoint BC. Then triangle ABC is similar to triangle XTM.
Proof
$\angle BXT = \angle BMT = 90^o \implies$ the quadrilateral $MBXT$ is cyclic.
$BM \perp MT, TX \perp AB \implies \angle MTX = \angle MBA.$
$\angle CBT = \angle BAC = \frac {\overset{\Large\frown} {BC}}{ 2} \implies \triangle ABC \sim \triangle XTM.$
vladimir.shelomovskii@gmail.com, vvsss | 717 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $\triangle ABC$ be an acute scalene triangle with circumcircle $\omega$. The tangents to $\omega$ at $B$ and $C$ intersect at $T$. Let $X$ and $Y$ be the projections of $T$ onto lines $AB$ and $AC$, respectively. Suppose $BT = CT = 16$, $BC = 22$, and $TX^2 + TY^2 + XY^2 = 1143$. Find $XY^2$.<|im_end|>
<|im_start|>assistant |
Zou and Chou are practicing their $100$-meter sprints by running $6$ races against each other. Zou wins the first race, and after that, the probability that one of them wins a race is $\frac23$ if they won the previous race but only $\frac13$ if they lost the previous race. The probability that Zou will win exactly $5$ of the $6$ races is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | Note that Zou wins one race. The probability that he wins the last race is $\left(\frac{2}{3}\right)^4\left(\frac{1}{3}\right)=\frac{16}{243}.$ Now, if he doesn't win the last race, then there must be two races where the winner of the previous race loses. We can choose any $4$ of the middle races for Zou to win. So the probability for this case is $4\left(\frac{2}{3}\right)^3\left(\frac{1}{3}\right)^2=\frac{32}{243}.$ Thus, the answer is $\frac{16}{243}+\frac{32}{243}=\frac{16}{81}\implies\boxed{097}.$
~pinkpig | 97 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Zou and Chou are practicing their $100$-meter sprints by running $6$ races against each other. Zou wins the first race, and after that, the probability that one of them wins a race is $\frac23$ if they won the previous race but only $\frac13$ if they lost the previous race. The probability that Zou will win exactly $5$ of the $6$ races is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$<|im_end|>
<|im_start|>assistant |
In the diagram below, $ABCD$ is a rectangle with side lengths $AB=3$ and $BC=11$, and $AECF$ is a rectangle with side lengths $AF=7$ and $FC=9,$ as shown. The area of the shaded region common to the interiors of both rectangles is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] pair A, B, C, D, E, F; A=(0,3); B=(0,0); C=(11,0); D=(11,3); E=foot(C, A, (9/4,0)); F=foot(A, C, (35/4,3)); draw(A--B--C--D--cycle); draw(A--E--C--F--cycle); filldraw(A--(9/4,0)--C--(35/4,3)--cycle,gray*0.5+0.5*lightgray); dot(A^^B^^C^^D^^E^^F); label("$A$", A, W); label("$B$", B, W); label("$C$", C, (1,0)); label("$D$", D, (1,0)); label("$F$", F, N); label("$E$", E, S); [/asy] | Let the intersection of $AE$ and $BC$ be $G$, and let $BG=x$, so $CG=11-x$.
By the Pythagorean theorem, ${AG}^2={AB}^2+{BG}^2$, so $AG=\sqrt{x^2+9}$, and thus $EG=9-\sqrt{x^2+9}$.
By the Pythagorean theorem again, ${CG}^2={EG}^2+{CE}^2$: \[11-x=\sqrt{7^2+(9-\sqrt{x^2+9})^2}.\]
Solving, we get $x=\frac{9}{4}$, so the area of the parallelogram is $3\cdot\left(11-\frac{9}{4}\right)=\frac{105}{4}$, and $105+4=\boxed{109}$.
~JulianaL25 | 109 | 2 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
In the diagram below, $ABCD$ is a rectangle with side lengths $AB=3$ and $BC=11$, and $AECF$ is a rectangle with side lengths $AF=7$ and $FC=9,$ as shown. The area of the shaded region common to the interiors of both rectangles is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] pair A, B, C, D, E, F; A=(0,3); B=(0,0); C=(11,0); D=(11,3); E=foot(C, A, (9/4,0)); F=foot(A, C, (35/4,3)); draw(A--B--C--D--cycle); draw(A--E--C--F--cycle); filldraw(A--(9/4,0)--C--(35/4,3)--cycle,gray*0.5+0.5*lightgray); dot(A^^B^^C^^D^^E^^F); label("$A$", A, W); label("$B$", B, W); label("$C$", C, (1,0)); label("$D$", D, (1,0)); label("$F$", F, N); label("$E$", E, S); [/asy]<|im_end|>
<|im_start|>assistant |
Find the number of positive integers less than $1000$ that can be expressed as the difference of two integral powers of $2.$ | We look for all positive integers of the form $2^a-2^b<1000,$ where $0\leq b<a.$ Performing casework on $a,$ we can enumerate all possibilities in the table below: \[\begin{array}{c|c} & \\ [-2.25ex] \boldsymbol{a} & \boldsymbol{b} \\ \hline & \\ [-2ex] 1 & 0 \\ 2 & 0,1 \\ 3 & 0,1,2 \\ 4 & 0,1,2,3 \\ 5 & 0,1,2,3,4 \\ 6 & 0,1,2,3,4,5 \\ 7 & 0,1,2,3,4,5,6 \\ 8 & 0,1,2,3,4,5,6,7 \\ 9 & 0,1,2,3,4,5,6,7,8 \\ 10 & \xcancel{0},\xcancel{1},\xcancel{2},\xcancel{3},\xcancel{4},5,6,7,8,9 \\ [0.5ex] \end{array}\] As indicated by the X-marks, the ordered pairs $(a,b)=(10,0),(10,1),(10,2),(10,3),(10,4)$ generate $2^a-2^b>1000,$ which are invalid.
Note that each of the remaining ordered pairs generates one unique desired positive integer.
We prove this statement as follows:
The positive integers generated for each value of $a$ are clearly different.
For all integers $k$ such that $1\leq k\leq9,$ the largest positive integer generated for $a=k$ is $1$ less than the smallest positive integer generated for $a=k+1.$
Together, we have justified our claim in bold. The answer is \[1+2+3+4+5+6+7+8+9+5=\boxed{050}.\]
~MRENTHUSIASM | 50 | 3 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of positive integers less than $1000$ that can be expressed as the difference of two integral powers of $2.$<|im_end|>
<|im_start|>assistant |
Find the number of ways $66$ identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile than in the second pile and fewer coins in the second pile than in the third pile. | Suppose we have $1$ coin in the first pile. Then $(1, 2, 63), (1, 3, 62), \ldots, (1, 32, 33)$ all work for a total of $31$ piles. Suppose we have $2$ coins in the first pile, then $(2, 3, 61), (2, 4, 60), \ldots, (2, 31, 33)$ all work, for a total of $29$. Continuing this pattern until $21$ coins in the first pile, we have the sum \begin{align*} 31+29+28+26+25+\cdots+4+2+1 &= (31+28+25+22+\cdots+1)+(29+26+23+\cdots+2) \\ &= 176+155 \\ &= \boxed{331}. \end{align*} | 331 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of ways $66$ identical coins can be separated into three nonempty piles so that there are fewer coins in the first pile than in the second pile and fewer coins in the second pile than in the third pile.<|im_end|>
<|im_start|>assistant |
Call a three-term strictly increasing arithmetic sequence of integers special if the sum of the squares of the three terms equals the product of the middle term and the square of the common difference. Find the sum of the third terms of all special sequences. | Proceed as in solution 2, until we reach \[3x^2+2d^2=xd^2,\] Write
$d^2=\frac{3x^2}{x-2}$, it follows that $x-2=3k^2$ for some (positive) integer k and $k \mid x$.
Taking both sides modulo $k$, $-2 \equiv 0 \pmod{k}$, so $k \mid 2 \rightarrow k=1,2$.
When $k=1$, we have $x=5$ and $d=5$. When $k=2$, we have $x=14$ and $d=7$. Summing the two cases, we have $10+21=\boxed{031}$.
-Ross Gao | 31 | 5.25 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Call a three-term strictly increasing arithmetic sequence of integers special if the sum of the squares of the three terms equals the product of the middle term and the square of the common difference. Find the sum of the third terms of all special sequences.<|im_end|>
<|im_start|>assistant |
Segments $\overline{AB}, \overline{AC},$ and $\overline{AD}$ are edges of a cube and $\overline{AG}$ is a diagonal through the center of the cube. Point $P$ satisfies $BP=60\sqrt{10}$, $CP=60\sqrt{5}$, $DP=120\sqrt{2}$, and $GP=36\sqrt{7}$. Find $AP.$ | Let $E$ be the vertex of the cube such that $ABED$ is a square. By the British Flag Theorem, we can easily we can show that \[PA^2 + PE^2 = PB^2 + PD^2\] and \[PA^2 + PG^2 = PC^2 + PE^2\] Hence, adding the two equations together, we get $2PA^2 + PG^2 = PB^2 + PC^2 + PD^2$. Substituting in the values we know, we get $2PA^2 + 7\cdot 36^2 =10\cdot60^2 + 5\cdot 60^2 + 2\cdot 120^2$.
Thus, we can solve for $PA$, which ends up being $\boxed{192}$.
(Lokman GÖKÇE) | 192 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Segments $\overline{AB}, \overline{AC},$ and $\overline{AD}$ are edges of a cube and $\overline{AG}$ is a diagonal through the center of the cube. Point $P$ satisfies $BP=60\sqrt{10}$, $CP=60\sqrt{5}$, $DP=120\sqrt{2}$, and $GP=36\sqrt{7}$. Find $AP.$<|im_end|>
<|im_start|>assistant |
Find the number of pairs $(m,n)$ of positive integers with $1\le m<n\le 30$ such that there exists a real number $x$ satisfying \[\sin(mx)+\sin(nx)=2.\] | We know that the range of $sin$ is between $-1$ and $1$.
Thus, the only way for the sum to be $2$ is for $sin$ of $mx$ and $nx$ to both be $1$.
The $sin$ of $(90+360k)$ is equal to 1.
Assuming $mx$ and $nm$ are both positive, m and n could be $1,5,9,13,17,21,25,29$. There are $8$ ways, so $\dbinom{8}{2}$.
If both are negative, m and n could be $3,7,11,15,19,23,27$. There are $7$ ways, so $\dbinom{7}{2}$.
However, the pair $(1,5)$ could also be $(2, 10)$ and so on. The same goes for some other pairs.
In total there are $14$ of these extra pairs.
The answer is $28+21+14 = \boxed{063}$
Remark
The graphs of $r\leq\sin(m\theta)+\sin(n\theta)$ and $r=2$ are shown here in Desmos: https://www.desmos.com/calculator/busxadywja
Move the sliders around for $1\leq m \leq 29$ and $2\leq m+1\leq n\leq30$ to observe the geometric representation generated by each pair $(m,n).$
~MRENTHUSIASM (inspired by TheAMCHub)
~mathproblemsolvingskills
~Mathematical Dexterity | 63 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of pairs $(m,n)$ of positive integers with $1\le m<n\le 30$ such that there exists a real number $x$ satisfying \[\sin(mx)+\sin(nx)=2.\]<|im_end|>
<|im_start|>assistant |
Find the number of integers $c$ such that the equation \[\left||20|x|-x^2|-c\right|=21\]has $12$ distinct real solutions. | Graph $y=|20|x|-x^2|$ (If you are having trouble, look at the description in the next two lines and/or the diagram in Solution 1). Notice that we want this to be equal to $c-21$ and $c+21$.
We see that from left to right, the graph first dips from very positive to $0$ at $x=-20$, then rebounds up to $100$ at $x=-10$, then falls back down to $0$ at $x=0$.
The positive $x$ are symmetric, so the graph re-ascends to $100$ at $x=10$, falls back to $0$ at $x=10$, and rises to arbitrarily large values afterwards.
Now we analyze the $y$ (varied by $c$) values. At $y=k<0$, we will have no solutions, as the line $y=k$ will have no intersections with our graph.
At $y=0$, we will have exactly $3$ solutions for the three zeroes.
At $y=n$ for any $n$ strictly between $0$ and $100$, we will have exactly $6$ solutions.
At $y=100$, we will have $4$ solutions, because local maxima are reached at $x= \pm 10$.
At $y=m>100$, we will have exactly $2$ solutions.
To get $12$ distinct solutions for $y=|20|x|-x^2|=c \pm 21$, both $c +21$ and $c-21$ must produce $6$ solutions.
Thus $0<c-21$ and $c+21<100$, so $c \in \{ 22, 23, \dots , 77, 78 \}$ is required.
It is easy to verify that all of these choices of $c$ produce $12$ distinct solutions (none overlap), so our answer is $\boxed{057}$. | 57 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of integers $c$ such that the equation \[\left||20|x|-x^2|-c\right|=21\]has $12$ distinct real solutions.<|im_end|>
<|im_start|>assistant |
Let $ABCD$ be an isosceles trapezoid with $AD=BC$ and $AB<CD.$ Suppose that the distances from $A$ to the lines $BC,CD,$ and $BD$ are $15,18,$ and $10,$ respectively. Let $K$ be the area of $ABCD.$ Find $\sqrt2 \cdot K.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(250); pair A, B, C, D, E, F, G, H; A = (-45sqrt(2)/8,18); B = (45sqrt(2)/8,18); C = (81sqrt(2)/8,0); D = (-81sqrt(2)/8,0); E = foot(A,C,B); F = foot(A,C,D); G = foot(A,B,D); H = intersectionpoint(A--F,B--D); markscalefactor=0.1; draw(rightanglemark(A,E,B),red); draw(rightanglemark(A,F,C),red); draw(rightanglemark(A,G,D),red); dot("$A$",A,1.5*NW,linewidth(4)); dot("$B$",B,1.5*NE,linewidth(4)); dot("$C$",C,1.5*SE,linewidth(4)); dot("$D$",D,1.5*SW,linewidth(4)); dot(E,linewidth(4)); dot(F,linewidth(4)); dot(G,linewidth(4)); draw(A--B--C--D--cycle^^B--D^^B--E); draw(A--E^^A--F^^A--G,dashed); label("$10$",midpoint(A--G),1.5*(1,0)); label("$15$",midpoint(A--E),1.5*N); Label L = Label("$18$", align=(0,0), position=MidPoint, filltype=Fill(0,3,white)); draw(C+(5,0)--(81sqrt(2)/8,18)+(5,0), L=L, arrow=Arrows(),bar=Bars(15)); [/asy] ~MRENTHUSIASM | Draw the distances in terms of $B$, as shown in the diagram. By similar triangles, $\triangle{AEC}\sim\triangle{BIC}$. As a result, let $AB=u$, then $BC=AD=\frac{6}{5}u$ and $2AC=3BC$. The triangle $ABC$ is $6-5-9$ which $\cos(\angle{ABC})=-\frac{1}{3}$. By angle subtraction, $\cos(180-\theta)=-\cos\theta$. Therefore, $AB=\frac{45}{2\sqrt{2}}=\frac{45\sqrt{2}}{4}$ and $AD=BC=\frac{27}{\sqrt{2}}$. By trapezoid area formula, the area of $ABCD$ is equal to $(AB+DF)\cdot 18=567\cdot \frac{\sqrt{2}}{2}$ which $\sqrt{2}\cdot k=\boxed{567}$.
~math2718281828459 | 567 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $ABCD$ be an isosceles trapezoid with $AD=BC$ and $AB<CD.$ Suppose that the distances from $A$ to the lines $BC,CD,$ and $BD$ are $15,18,$ and $10,$ respectively. Let $K$ be the area of $ABCD.$ Find $\sqrt2 \cdot K.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(250); pair A, B, C, D, E, F, G, H; A = (-45sqrt(2)/8,18); B = (45sqrt(2)/8,18); C = (81sqrt(2)/8,0); D = (-81sqrt(2)/8,0); E = foot(A,C,B); F = foot(A,C,D); G = foot(A,B,D); H = intersectionpoint(A--F,B--D); markscalefactor=0.1; draw(rightanglemark(A,E,B),red); draw(rightanglemark(A,F,C),red); draw(rightanglemark(A,G,D),red); dot("$A$",A,1.5*NW,linewidth(4)); dot("$B$",B,1.5*NE,linewidth(4)); dot("$C$",C,1.5*SE,linewidth(4)); dot("$D$",D,1.5*SW,linewidth(4)); dot(E,linewidth(4)); dot(F,linewidth(4)); dot(G,linewidth(4)); draw(A--B--C--D--cycle^^B--D^^B--E); draw(A--E^^A--F^^A--G,dashed); label("$10$",midpoint(A--G),1.5*(1,0)); label("$15$",midpoint(A--E),1.5*N); Label L = Label("$18$", align=(0,0), position=MidPoint, filltype=Fill(0,3,white)); draw(C+(5,0)--(81sqrt(2)/8,18)+(5,0), L=L, arrow=Arrows(),bar=Bars(15)); [/asy] ~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
Consider the sequence $(a_k)_{k\ge 1}$ of positive rational numbers defined by $a_1 = \frac{2020}{2021}$ and for $k\ge 1$, if $a_k = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, then
\[a_{k+1} = \frac{m + 18}{n+19}.\]Determine the sum of all positive integers $j$ such that the rational number $a_j$ can be written in the form $\frac{t}{t+1}$ for some positive integer $t$. | We know that $a_{1}=\tfrac{t}{t+1}$ when $t=2020$ so $1$ is a possible value of $j$. Note also that $a_{2}=\tfrac{2038}{2040}=\tfrac{1019}{1020}=\tfrac{t}{t+1}$ for $t=1019$. Then $a_{2+q}=\tfrac{1019+18q}{1020+19q}$ unless $1019+18q$ and $1020+19q$ are not relatively prime which happens when $q+1$ divides $18q+1019$ or $q+1$ divides $1001$, so the least value of $q$ is $6$ and $j=2+6=8$. We know $a_{8}=\tfrac{1019+108}{1020+114}=\tfrac{1127}{1134}=\tfrac{161}{162}$. Now $a_{8+q}=\tfrac{161+18q}{162+19q}$ unless $18q+161$ and $19q+162$ are not relatively prime which happens the first time $q+1$ divides $18q+161$ or $q+1$ divides $143$ or $q=10$, and $j=8+10=18$. We have $a_{18}=\tfrac{161+180}{162+190}=\tfrac{341}{352}=\tfrac{31}{32}$. Now $a_{18+q}=\tfrac{31+18q}{32+19q}$ unless $18q+31$ and $19q+32$ are not relatively prime. This happens the first time $q+1$ divides $18q+31$ implying $q+1$ divides $13$, which is prime so $q=12$ and $j=18+12=30$. We have $a_{30}=\tfrac{31+216}{32+228}=\tfrac{247}{260}=\tfrac{19}{20}$. We have $a_{30+q}=\tfrac{18q+19}{19q+20}$, which is always reduced by EA, so the sum of all $j$ is $1+2+8+18+30=\boxed{059}$. | 59 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Consider the sequence $(a_k)_{k\ge 1}$ of positive rational numbers defined by $a_1 = \frac{2020}{2021}$ and for $k\ge 1$, if $a_k = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, then
\[a_{k+1} = \frac{m + 18}{n+19}.\]Determine the sum of all positive integers $j$ such that the rational number $a_j$ can be written in the form $\frac{t}{t+1}$ for some positive integer $t$.<|im_end|>
<|im_start|>assistant |
Let $ABCD$ be a cyclic quadrilateral with $AB=4,BC=5,CD=6,$ and $DA=7.$ Let $A_1$ and $C_1$ be the feet of the perpendiculars from $A$ and $C,$ respectively, to line $BD,$ and let $B_1$ and $D_1$ be the feet of the perpendiculars from $B$ and $D,$ respectively, to line $AC.$ The perimeter of $A_1B_1C_1D_1$ is $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(300); pair A, B, C, D, A1, B1, C1, D1; A = origin; C = (sqrt(53041)/31,0); B = intersectionpoints(Circle(A,4),Circle(C,5))[0]; D = intersectionpoints(Circle(A,7),Circle(C,6))[1]; A1 = foot(A,B,D); C1 = foot(C,B,D); B1 = foot(B,A,C); D1 = foot(D,A,C); markscalefactor=0.025; draw(rightanglemark(A,A1,B),red); draw(rightanglemark(B,B1,A),red); draw(rightanglemark(C,C1,D),red); draw(rightanglemark(D,D1,C),red); draw(A1--B1--C1--D1--cycle,green); dot("$A$",A,1.5*W,linewidth(4)); dot("$B$",B,1.5*dir(180-aCos(11/59)),linewidth(4)); dot("$C$",C,1.5*E,linewidth(4)); dot("$D$",D,1.5*dir(-aCos(11/59)),linewidth(4)); dot("$A_1$",A1,1.5*dir(A1-A),linewidth(4)); dot("$B_1$",B1,1.5*S,linewidth(4)); dot("$C_1$",C1,1.5*dir(C1-C),linewidth(4)); dot("$D_1$",D1,1.5*N,linewidth(4)); draw(A--B--C--D--cycle^^A--C^^B--D^^circumcircle(A,B,C)); draw(A--A1^^B--B1^^C--C1^^D--D1,dashed); [/asy] ~MRENTHUSIASM | The angle $\theta$ between diagonals satisfies \[\tan{\frac{\theta}{2}}=\sqrt{\frac{(s-b)(s-d)}{(s-a)(s-c)}}\] (see https://en.wikipedia.org/wiki/Cyclic_quadrilateral#Angle_formulas). Thus, \[\tan{\frac{\theta}{2}}=\sqrt{\frac{(11-4)(11-6)}{(11-5)(11-7)}}\text{ or }\tan{\frac{\theta}{2}}=\sqrt{\frac{(11-5)(11-7)}{(11-4)(11-6)}}.\] That is, $\tan^2{\frac{\theta}{2}}=\frac{1-\cos^2{\frac{\theta}{2}}}{\cos^2{\frac{\theta}{2}}}=\frac{24}{35}$ or $\frac{35}{24}$. Thus, $\cos^2{\frac{\theta}{2}}=\frac{35}{59}$ or $\frac{24}{59}$. So, \[\cos{\theta}=2\cos^2{\frac{\theta}{2}}-1=\pm\frac{11}{59}.\] In this context, $\cos{\theta}>0$. Thus, $\cos{\theta}=\frac{11}{59}$. The perimeter of $A_1B_1C_1D_1$ is \[22\cdot\cos{\theta}=22\cdot\frac{11}{59}=\frac{242}{59},\] and the answer is $m+n=242+59=\boxed{301}$.
~y.grace.yu | 301 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $ABCD$ be a cyclic quadrilateral with $AB=4,BC=5,CD=6,$ and $DA=7.$ Let $A_1$ and $C_1$ be the feet of the perpendiculars from $A$ and $C,$ respectively, to line $BD,$ and let $B_1$ and $D_1$ be the feet of the perpendiculars from $B$ and $D,$ respectively, to line $AC.$ The perimeter of $A_1B_1C_1D_1$ is $\frac mn,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(300); pair A, B, C, D, A1, B1, C1, D1; A = origin; C = (sqrt(53041)/31,0); B = intersectionpoints(Circle(A,4),Circle(C,5))[0]; D = intersectionpoints(Circle(A,7),Circle(C,6))[1]; A1 = foot(A,B,D); C1 = foot(C,B,D); B1 = foot(B,A,C); D1 = foot(D,A,C); markscalefactor=0.025; draw(rightanglemark(A,A1,B),red); draw(rightanglemark(B,B1,A),red); draw(rightanglemark(C,C1,D),red); draw(rightanglemark(D,D1,C),red); draw(A1--B1--C1--D1--cycle,green); dot("$A$",A,1.5*W,linewidth(4)); dot("$B$",B,1.5*dir(180-aCos(11/59)),linewidth(4)); dot("$C$",C,1.5*E,linewidth(4)); dot("$D$",D,1.5*dir(-aCos(11/59)),linewidth(4)); dot("$A_1$",A1,1.5*dir(A1-A),linewidth(4)); dot("$B_1$",B1,1.5*S,linewidth(4)); dot("$C_1$",C1,1.5*dir(C1-C),linewidth(4)); dot("$D_1$",D1,1.5*N,linewidth(4)); draw(A--B--C--D--cycle^^A--C^^B--D^^circumcircle(A,B,C)); draw(A--A1^^B--B1^^C--C1^^D--D1,dashed); [/asy] ~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
Let $A_1A_2A_3\ldots A_{12}$ be a dodecagon ($12$-gon). Three frogs initially sit at $A_4,A_8,$ and $A_{12}$. At the end of each minute, simultaneously, each of the three frogs jumps to one of the two vertices adjacent to its current position, chosen randomly and independently with both choices being equally likely. All three frogs stop jumping as soon as two frogs arrive at the same vertex at the same time. The expected number of minutes until the frogs stop jumping is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | We can solve the problem by removing $1$ frog, and calculate the expected time for the remaining $2$ frogs. In the original problem, when the movement stops, $2$ of the $3$ frogs meet. Because the $3$ frogs cannot meet at one vertex, the probability that those two specific frogs meet is $\frac13$. If the expected time for the two frog problem is $E'$, then the expected time for the original problem is $\frac{E'}{3}$.
The distance between the two frogs can only be $0$, $2$, $4$, $6$. We use the distances as the states to draw the following Markov Chain. This Markov Chain is much simpler than that of Solution 1 Supplement in the Remark section.
\begin{align*} E(2) &= 1 + \frac12 \cdot E(2) + \frac14 \cdot E(4)\\ E(4) &= 1 + \frac14 \cdot E(2) + \frac12 \cdot E(4) + \frac14 \cdot E(6)\\ E(6) &= 1 + \frac12 \cdot E(4) + \frac12 \cdot E(6) \end{align*}
By solving the above system of equations, $E(4) = 16$. The answer for the original problem is $\frac{16}{3}$, $16 + 3 = \boxed{019}$
~isabelchen
Remark (Markov Chain) | 19 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $A_1A_2A_3\ldots A_{12}$ be a dodecagon ($12$-gon). Three frogs initially sit at $A_4,A_8,$ and $A_{12}$. At the end of each minute, simultaneously, each of the three frogs jumps to one of the two vertices adjacent to its current position, chosen randomly and independently with both choices being equally likely. All three frogs stop jumping as soon as two frogs arrive at the same vertex at the same time. The expected number of minutes until the frogs stop jumping is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.<|im_end|>
<|im_start|>assistant |
Circles $\omega_1$ and $\omega_2$ with radii $961$ and $625$, respectively, intersect at distinct points $A$ and $B$. A third circle $\omega$ is externally tangent to both $\omega_1$ and $\omega_2$. Suppose line $AB$ intersects $\omega$ at two points $P$ and $Q$ such that the measure of minor arc $\widehat{PQ}$ is $120^{\circ}$. Find the distance between the centers of $\omega_1$ and $\omega_2$. | Suppose we label the points as shown here. By radical axis, the tangents to $\omega$ at $D$ and $E$ intersect on $AB$. Thus $PDQE$ is harmonic, so the tangents to $\omega$ at $P$ and $Q$ intersect at $X \in DE$. Moreover, $OX \parallel O_1O_2$ because both $OX$ and $O_1O_2$ are perpendicular to $AB$, and $OX = 2OP$ because $\angle POQ = 120^{\circ}$. Thus\[O_1O_2 = O_1Y - O_2Y = 2 \cdot 961 - 2\cdot 625 = \boxed{672}\]by similar triangles.
~mathman3880 | 672 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Circles $\omega_1$ and $\omega_2$ with radii $961$ and $625$, respectively, intersect at distinct points $A$ and $B$. A third circle $\omega$ is externally tangent to both $\omega_1$ and $\omega_2$. Suppose line $AB$ intersects $\omega$ at two points $P$ and $Q$ such that the measure of minor arc $\widehat{PQ}$ is $120^{\circ}$. Find the distance between the centers of $\omega_1$ and $\omega_2$.<|im_end|>
<|im_start|>assistant |
For any positive integer $a, \sigma(a)$ denotes the sum of the positive integer divisors of $a$. Let $n$ be the least positive integer such that $\sigma(a^n)-1$ is divisible by $2021$ for all positive integers $a$. Find the sum of the prime factors in the prime factorization of $n$. | Since the problem works for all positive integers $a$, let's plug in $a=2$ and see what we get. Since $\sigma({2^n}) = 2^{n+1}-1,$ we have $2^{n+1} \equiv 2 \pmod{2021}.$ Simplifying using CRT and Fermat's Little Theorem, we get that $2^n \equiv 0 \pmod{42}$ and $2^n \equiv 0 \pmod{46}.$ Then, we can look at $a=2022$ just like in Solution 1 to find that $43$ and $47$ also divide $n$. There don't seem to be any other odd "numbers" to check, so we can hopefully assume that the answer is the sum of the prime factors of $\text{lcm(42, 43, 46, 47)}.$ From here, follow solution 1 to get the final answer $\boxed{125}$.
-PureSwag | 125 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
For any positive integer $a, \sigma(a)$ denotes the sum of the positive integer divisors of $a$. Let $n$ be the least positive integer such that $\sigma(a^n)-1$ is divisible by $2021$ for all positive integers $a$. Find the sum of the prime factors in the prime factorization of $n$.<|im_end|>
<|im_start|>assistant |
Let $S$ be the set of positive integers $k$ such that the two parabolas\[y=x^2-k~~\text{and}~~x=2(y-20)^2-k\]intersect in four distinct points, and these four points lie on a circle with radius at most $21$. Find the sum of the least element of $S$ and the greatest element of $S$.
Diagram
Graph in Desmos: https://www.desmos.com/calculator/gz8igmkykn
~MRENTHUSIASM | Make the translation $y \rightarrow y+20$ to obtain $20+y=x^2-k$ and $x=2y^2-k$. Multiply the first equation by $2$ and sum, we see that $2(x^2+y^2)=3k+40+2y+x$. Completing the square gives us $\left(y- \frac{1}{2}\right)^2+\left(x - \frac{1}{4}\right)^2 = \frac{325+24k}{16}$; this explains why the two parabolas intersect at four points that lie on a circle*. For the upper bound, observe that $LHS \leq 21^2=441 \rightarrow 24k \leq 6731$, so $k \leq 280$.
For the lower bound, we need to ensure there are $4$ intersections to begin with. (Here I'm using the un-translated coordinates.) Draw up a graph, and realize that two intersections are guaranteed, on the so called "right branch" of $y=x^2-k$. As we increase the value of $k$, two more intersections appear on the "left branch":
$k=4$ does not work because the "leftmost" point of $x=2(y-20)^2-4$ is $(-4,20)$ which lies to the right of $\left(-\sqrt{24}, 20\right)$, which is on the graph $y=x^2-4$. While technically speaking this doesn't prove that there are no intersections (why?), drawing the graph should convince you that this is the case. Clearly, $k<4$ does not work.
$k=5$ does work because the two graphs intersect at $(-5,20)$, and by drawing the graph, you realize this is not a tangent point and there is in fact another intersection nearby, due to slope. Therefore, the answer is $5+280=\boxed{285}$.
In general (assuming four intersections exist), when two conics intersect, if one conic can be written as $ax^2+by^2=f(x,y)$ and the other as $cx^2+dy^2=g(x,y)$ for polynomials $f$ and $g$ of degree at most $1$, whenever $(a,b),(c,d)$ are linearly independent (L.I.), we can combine the two equations and then complete the square to achieve $(x-p)^2+(y-q)^2=r^2$. We can also combine these two equations to form a parabola, or a hyperbola, or an ellipse. When $(a,b),(c,d)$ are not L.I., the intersection points instead lie on a line, which is a circle of radius infinity. When the two conics only have $3,2$ or $1$ intersection point(s), the statement that all these points lie on a circle is trivially true.
~Ross Gao | 285 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $S$ be the set of positive integers $k$ such that the two parabolas\[y=x^2-k~~\text{and}~~x=2(y-20)^2-k\]intersect in four distinct points, and these four points lie on a circle with radius at most $21$. Find the sum of the least element of $S$ and the greatest element of $S$.
Diagram
Graph in Desmos: https://www.desmos.com/calculator/gz8igmkykn
~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
Find the arithmetic mean of all the three-digit palindromes. (Recall that a palindrome is a number that reads the same forward and backward, such as $777$ or $383$.) | Recall that the arithmetic mean of all the $n$ digit palindromes is just the average of the largest and smallest $n$ digit palindromes, and in this case the $2$ palindromes are $101$ and $999$ and $\frac{101+999}{2}=\boxed{550},$ which is the final answer.
~ math31415926535 | 550 | 2 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the arithmetic mean of all the three-digit palindromes. (Recall that a palindrome is a number that reads the same forward and backward, such as $777$ or $383$.)<|im_end|>
<|im_start|>assistant |
Equilateral triangle $ABC$ has side length $840$. Point $D$ lies on the same side of line $BC$ as $A$ such that $\overline{BD} \perp \overline{BC}$. The line $\ell$ through $D$ parallel to line $BC$ intersects sides $\overline{AB}$ and $\overline{AC}$ at points $E$ and $F$, respectively. Point $G$ lies on $\ell$ such that $F$ is between $E$ and $G$, $\triangle AFG$ is isosceles, and the ratio of the area of $\triangle AFG$ to the area of $\triangle BED$ is $8:9$. Find $AF$.
Diagram
[asy] pair A,B,C,D,E,F,G; B=origin; A=5*dir(60); C=(5,0); E=0.6*A+0.4*B; F=0.6*A+0.4*C; G=rotate(240,F)*A; D=extension(E,F,B,dir(90)); draw(D--G--A,grey); draw(B--0.5*A+rotate(60,B)*A*0.5,grey); draw(A--B--C--cycle,linewidth(1.5)); dot(A^^B^^C^^D^^E^^F^^G); label("$A$",A,dir(90)); label("$B$",B,dir(225)); label("$C$",C,dir(-45)); label("$D$",D,dir(180)); label("$E$",E,dir(-45)); label("$F$",F,dir(225)); label("$G$",G,dir(0)); label("$\ell$",midpoint(E--F),dir(90)); [/asy] | Since $\triangle AFG$ is isosceles, $AF = FG$, and since $\triangle AEF$ is equilateral, $AF = EF$. Thus, $EF = FG$, and since these triangles share an altitude, they must have the same area.
Drop perpendiculars from $E$ and $F$ to line $BC$; call the meeting points $P$ and $Q$, respectively. $\triangle BEP$ is clearly congruent to both $\triangle BED$ and $\triangle FQC$, and thus each of these new triangles has the same area as $\triangle BED$. But we can "slide" $\triangle BEP$ over to make it adjacent to $\triangle FQC$, thus creating an equilateral triangle whose area has a ratio of $18:8$ when compared to $\triangle AEF$ (based on our conclusion from the first paragraph). Since these triangles are both equilateral, they are similar, and since the area ratio $18:8$ reduces to $9:4$, the ratio of their sides must be $3:2$. So, because $FC$ and $AF$ represent sides of these triangles, and they add to $840$, $AF$ must equal two-fifths of $840$, or $\boxed{336}$.
~Interstigation | 336 | 2.625 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Equilateral triangle $ABC$ has side length $840$. Point $D$ lies on the same side of line $BC$ as $A$ such that $\overline{BD} \perp \overline{BC}$. The line $\ell$ through $D$ parallel to line $BC$ intersects sides $\overline{AB}$ and $\overline{AC}$ at points $E$ and $F$, respectively. Point $G$ lies on $\ell$ such that $F$ is between $E$ and $G$, $\triangle AFG$ is isosceles, and the ratio of the area of $\triangle AFG$ to the area of $\triangle BED$ is $8:9$. Find $AF$.
Diagram
[asy] pair A,B,C,D,E,F,G; B=origin; A=5*dir(60); C=(5,0); E=0.6*A+0.4*B; F=0.6*A+0.4*C; G=rotate(240,F)*A; D=extension(E,F,B,dir(90)); draw(D--G--A,grey); draw(B--0.5*A+rotate(60,B)*A*0.5,grey); draw(A--B--C--cycle,linewidth(1.5)); dot(A^^B^^C^^D^^E^^F^^G); label("$A$",A,dir(90)); label("$B$",B,dir(225)); label("$C$",C,dir(-45)); label("$D$",D,dir(180)); label("$E$",E,dir(-45)); label("$F$",F,dir(225)); label("$G$",G,dir(0)); label("$\ell$",midpoint(E--F),dir(90)); [/asy]<|im_end|>
<|im_start|>assistant |
Find the number of permutations $x_1, x_2, x_3, x_4, x_5$ of numbers $1, 2, 3, 4, 5$ such that the sum of five products \[x_1x_2x_3 + x_2x_3x_4 + x_3x_4x_5 + x_4x_5x_1 + x_5x_1x_2\] is divisible by $3$. | Since $3$ is one of the numbers, a product with a $3$ in it is automatically divisible by $3,$ so WLOG $x_3=3,$ we will multiply by $5$ afterward since any of $x_1, x_2, \ldots, x_5$ would be $3,$ after some cancelation we see that now all we need to find is the number of ways that $x_5x_1(x_4+x_2)$ is divisible by $3,$ since $x_5x_1$ is never divisible by $3,$ now we just need to find the number of ways $x_4+x_2$ is divisible by $3.$ Note that $x_2$ and $x_4$ can be $(1, 2), (2, 1), (1, 5), (5, 1), (2, 4), (4, 2), (4, 5),$ or $(5, 4).$ We have $2$ ways to designate $x_1$ and $x_5$ for a total of $8 \cdot 2 = 16.$ So the desired answer is $16 \cdot 5=\boxed{080}.$
~math31415926535
~MathFun1000 (Rephrasing for clarity) | 80 | 5 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of permutations $x_1, x_2, x_3, x_4, x_5$ of numbers $1, 2, 3, 4, 5$ such that the sum of five products \[x_1x_2x_3 + x_2x_3x_4 + x_3x_4x_5 + x_4x_5x_1 + x_5x_1x_2\] is divisible by $3$.<|im_end|>
<|im_start|>assistant |
There are real numbers $a, b, c,$ and $d$ such that $-20$ is a root of $x^3 + ax + b$ and $-21$ is a root of $x^3 + cx^2 + d.$ These two polynomials share a complex root $m + \sqrt{n} \cdot i,$ where $m$ and $n$ are positive integers and $i = \sqrt{-1}.$ Find $m+n.$ | We plug -20 into the equation obtaining $(-20)^3-20a+b$, likewise, plugging -21 into the second equation gets $(-21)^3+441c+d$.
Both equations must have 3 solutions exactly, so the other two solutions must be $m + \sqrt{n} \cdot i$ and $m - \sqrt{n} \cdot i$.
By Vieta's, the sum of the roots in the first equation is $0$, so $m$ must be $10$.
Next, using Vieta's theorem on the second equation, you get $x1x2+x2x3+x1x3 = 0$. However, since we know that the sum of the roots with complex numbers are 20, we can factor out the terms with -21, so $-21*(20)+(m^2+n)=0$.
Given that $m$ is $10$, then $n$ is equal to $320$.
Therefore, the answer to the equation is $\boxed{330}$ | 330 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
There are real numbers $a, b, c,$ and $d$ such that $-20$ is a root of $x^3 + ax + b$ and $-21$ is a root of $x^3 + cx^2 + d.$ These two polynomials share a complex root $m + \sqrt{n} \cdot i,$ where $m$ and $n$ are positive integers and $i = \sqrt{-1}.$ Find $m+n.$<|im_end|>
<|im_start|>assistant |
For positive real numbers $s$, let $\tau(s)$ denote the set of all obtuse triangles that have area $s$ and two sides with lengths $4$ and $10$. The set of all $s$ for which $\tau(s)$ is nonempty, but all triangles in $\tau(s)$ are congruent, is an interval $[a,b)$. Find $a^2+b^2$. | Note: Archimedes15 Solution which I added an answer here are two cases. Either the $4$ and $10$ are around an obtuse angle or the $4$ and $10$ are around an acute triangle. If they are around the obtuse angle, the area of that triangle is $<20$ as we have $\frac{1}{2} \cdot 40 \cdot \sin{\alpha}$ and $\sin$ is at most $1$. Note that for the other case, the side lengths around the obtuse angle must be $4$ and $x$ where we have $16+x^2 < 100 \rightarrow x < 2\sqrt{21}$. Using the same logic as the other case, the area is at most $4\sqrt{21}$. Square and add $4\sqrt{21}$ and $20$ to get the right answer \[a^2+b^2= \boxed{736}\Box\] | 736 | 4.375 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
For positive real numbers $s$, let $\tau(s)$ denote the set of all obtuse triangles that have area $s$ and two sides with lengths $4$ and $10$. The set of all $s$ for which $\tau(s)$ is nonempty, but all triangles in $\tau(s)$ are congruent, is an interval $[a,b)$. Find $a^2+b^2$.<|im_end|>
<|im_start|>assistant |
For any finite set $S$, let $|S|$ denote the number of elements in $S$. Find the number of ordered pairs $(A,B)$ such that $A$ and $B$ are (not necessarily distinct) subsets of $\{1,2,3,4,5\}$ that satisfy \[|A| \cdot |B| = |A \cap B| \cdot |A \cup B|\] | The answer is \begin{align*} \sum_{k=0}^{5}\left[2\binom{5}{k}2^{5-k}-\binom{5}{k}\right] &= 2\sum_{k=0}^{5}\binom{5}{k}2^{5-k}-\sum_{k=0}^{5}\binom{5}{k} \\ &=2(2+1)^5-(1+1)^5 \\ &=2(243)-32 \\ &=\boxed{454}. \end{align*} ~MRENTHUSIASM | 454 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
For any finite set $S$, let $|S|$ denote the number of elements in $S$. Find the number of ordered pairs $(A,B)$ such that $A$ and $B$ are (not necessarily distinct) subsets of $\{1,2,3,4,5\}$ that satisfy \[|A| \cdot |B| = |A \cap B| \cdot |A \cup B|\]<|im_end|>
<|im_start|>assistant |
Let $a, b, c,$ and $d$ be real numbers that satisfy the system of equations \begin{align*} a + b &= -3, \\ ab + bc + ca &= -4, \\ abc + bcd + cda + dab &= 14, \\ abcd &= 30. \end{align*} There exist relatively prime positive integers $m$ and $n$ such that \[a^2 + b^2 + c^2 + d^2 = \frac{m}{n}.\]Find $m + n$. | From the fourth equation we get $d=\frac{30}{abc}.$ substitute this into the third equation and you get $abc + \frac{30(ab + bc + ca)}{abc} = abc - \frac{120}{abc} = 14$. Hence $(abc)^2 - 14(abc)-120 = 0$. Solving we get $abc = -6$ or $abc = 20$. From the first and second equation we get $ab + bc + ca = ab-3c = -4 \Longrightarrow ab = 3c-4$, if $abc=-6$, substituting we get $c(3c-4)=-6$. If you try solving this you see that this does not have real solutions in $c$, so $abc$ must be $20$. So $d=\frac{3}{2}$. Since $c(3c-4)=20$, $c=-2$ or $c=\frac{10}{3}$. If $c=\frac{10}{3}$, then the system $a+b=-3$ and $ab = 6$ does not give you real solutions. So $c=-2$. Since you already know $d=\frac{3}{2}$ and $c=-2$, so you can solve for $a$ and $b$ pretty easily and see that $a^{2}+b^{2}+c^{2}+d^{2}=\frac{141}{4}$. So the answer is $\boxed{145}$.
~math31415926535 | 145 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $a, b, c,$ and $d$ be real numbers that satisfy the system of equations \begin{align*} a + b &= -3, \\ ab + bc + ca &= -4, \\ abc + bcd + cda + dab &= 14, \\ abcd &= 30. \end{align*} There exist relatively prime positive integers $m$ and $n$ such that \[a^2 + b^2 + c^2 + d^2 = \frac{m}{n}.\]Find $m + n$.<|im_end|>
<|im_start|>assistant |
An ant makes a sequence of moves on a cube where a move consists of walking from one vertex to an adjacent vertex along an edge of the cube. Initially the ant is at a vertex of the bottom face of the cube and chooses one of the three adjacent vertices to move to as its first move. For all moves after the first move, the ant does not return to its previous vertex, but chooses to move to one of the other two adjacent vertices. All choices are selected at random so that each of the possible moves is equally likely. The probability that after exactly $8$ moves that ant is at a vertex of the top face on the cube is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n.$ | Note that we don't care which exact vertex the ant is located at, just which level (either top face or bottom face). Consider the ant to be on any of the two levels and having moved at least one move. Define $p_i$ to be the probability that after $i$ moves, the ant ends up on the level it started on.
On the first move, the ant can stay on the bottom level with $\frac{2}{3}$ chance and $7$ moves left. Or, it can move to the top level with $\frac{1}{3}$ chance and $6$ moves left (it has to spend another on the top as it can not return immediately). So the requested probability is $P = \frac{2}{3}(1 - p_7) + \frac{1}{3}p_6$.
Consider when the ant has $i$ moves left (and it's not the ant's first move). It can either stay on its current level with $\frac{1}{2}$ chance and $i - 1$ moves left, or travel to the opposite level with $\frac{1}{2}$ chance, then move to another vertex on the opposite level, to have $i - 2$ moves left. Thus we obtain the recurrence \[p_i = \frac{1}{2}p_{i - 1} + \frac{1}{2}(1 - p_{i - 2})\]
Computing $p_i$ with the starting conditions $p_0 = 1$ and $p_1 = \frac{1}{2}$, we obtain $p_6 = \frac{33}{64}$ and $p_7 = \frac{59}{128}$. Hence $P = \frac{2}{3}(1 - p_7) + \frac{1}{3}p_6= \frac{17}{32}$ as desired; $\boxed{049}$.
~polarity | 49 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
An ant makes a sequence of moves on a cube where a move consists of walking from one vertex to an adjacent vertex along an edge of the cube. Initially the ant is at a vertex of the bottom face of the cube and chooses one of the three adjacent vertices to move to as its first move. For all moves after the first move, the ant does not return to its previous vertex, but chooses to move to one of the other two adjacent vertices. All choices are selected at random so that each of the possible moves is equally likely. The probability that after exactly $8$ moves that ant is at a vertex of the top face on the cube is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n.$<|im_end|>
<|im_start|>assistant |
Find the number of ordered pairs $(m, n)$ such that $m$ and $n$ are positive integers in the set $\{1, 2, ..., 30\}$ and the greatest common divisor of $2^m + 1$ and $2^n - 1$ is not $1$. | This solution refers to the Remarks section.
By the Euclidean Algorithm, we have \[\gcd\left(2^m+1,2^m-1\right)=\gcd\left(2,2^m-1\right)=1.\] We are given that $\gcd\left(2^m+1,2^n-1\right)>1.$ Multiplying both sides by $\gcd\left(2^m-1,2^n-1\right)$ gives \begin{align*} \gcd\left(2^m+1,2^n-1\right)\cdot\gcd\left(2^m-1,2^n-1\right)&>\gcd\left(2^m-1,2^n-1\right) \\ \gcd\left(\left(2^m+1\right)\left(2^m-1\right),2^n-1\right)&>\gcd\left(2^m-1,2^n-1\right) \hspace{12mm} &&\text{by }\textbf{Claim 1} \\ \gcd\left(2^{2m}-1,2^n-1\right)&>\gcd\left(2^m-1,2^n-1\right) \\ 2^{\gcd(2m,n)}-1&>2^{\gcd(m,n)}-1 &&\text{by }\textbf{Claim 2} \\ \gcd(2m,n)&>\gcd(m,n), \end{align*} which implies that $n$ must have more factors of $2$ than $m$ does.
We construct the following table for the first $30$ positive integers: \[\begin{array}{c|c|c} && \\ [-2.5ex] \boldsymbol{\#}\textbf{ of Factors of }\boldsymbol{2} & \textbf{Numbers} & \textbf{Count} \\ \hline && \\ [-2.25ex] 0 & 1,3,5,7,9,11,13,15,17,19,21,23,25,27,29 & 15 \\ && \\ [-2.25ex] 1 & 2,6,10,14,18,22,26,30 & 8 \\ && \\ [-2.25ex] 2 & 4,12,20,28 & 4 \\ && \\ [-2.25ex] 3 & 8,24 & 2 \\ && \\ [-2.25ex] 4 & 16 & 1 \\ \end{array}\] To count the ordered pairs $(m,n),$ we perform casework on the number of factors of $2$ that $m$ has:
If $m$ has $0$ factors of $2,$ then $m$ has $15$ options and $n$ has $8+4+2+1=15$ options. So, this case has $15\cdot15=225$ ordered pairs.
If $m$ has $1$ factor of $2,$ then $m$ has $8$ options and $n$ has $4+2+1=7$ options. So, this case has $8\cdot7=56$ ordered pairs.
If $m$ has $2$ factors of $2,$ then $m$ has $4$ options and $n$ has $2+1=3$ options. So, this case has $4\cdot3=12$ ordered pairs.
If $m$ has $3$ factors of $2,$ then $m$ has $2$ options and $n$ has $1$ option. So, this case has $2\cdot1=2$ ordered pairs.
Together, the answer is $225+56+12+2=\boxed{295}.$
~Lcz ~MRENTHUSIASM
Remarks
Claim 1 (GCD Property)
If $\boldsymbol{r,s,}$ and $\boldsymbol{t}$ are positive integers such that $\boldsymbol{\gcd(r,s)=1,}$ then $\boldsymbol{\gcd(r,t)\cdot\gcd(s,t)=\gcd(rs,t).}$
As $r$ and $s$ are relatively prime (have no prime divisors in common), this property is intuitive.
~MRENTHUSIASM
Claim 2 (Olympiad Number Theory Lemma)
If $\boldsymbol{u,a,}$ and $\boldsymbol{b}$ are positive integers such that $\boldsymbol{u\geq2,}$ then $\boldsymbol{\gcd\left(u^a-1,u^b-1\right)=u^{\gcd(a,b)}-1.}$
There are two proofs to this claim, as shown below.
~MRENTHUSIASM
Claim 2 Proof 1 (Euclidean Algorithm)
If $a=b,$ then $\gcd(a,b)=a=b,$ from which the claim is clearly true.
Otherwise, let $a>b$ without the loss of generality. For all integers $p$ and $q$ such that $p>q>0,$ the Euclidean Algorithm states that \[\gcd(p,q)=\gcd(p-q,q)=\cdots=\gcd(p\operatorname{mod}q,q).\] We apply this result repeatedly to reduce the larger number: \[\gcd\left(u^a-1,u^b-1\right)=\gcd\left(u^a-1-u^{a-b}\left(u^b-1\right),u^b-1\right)=\gcd\left(u^{a-b}-1,u^b-1\right).\] Continuing, we have \begin{align*} \gcd\left(u^a-1,u^b-1\right)&=\gcd\left(u^{a-b}-1,u^b-1\right) \\ & \ \vdots \\ &=\gcd\left(u^{\gcd(a,b)}-1,u^{\gcd(a,b)}-1\right) \\ &=u^{\gcd(a,b)}-1, \end{align*} from which the proof is complete.
~MRENTHUSIASM
Claim 2 Proof 2 (Bézout's Identity)
Let $d=\gcd\left(u^a-1,u^b-1\right).$ It follows that $u^a\equiv1\pmod{d}$ and $u^b\equiv1\pmod{d}.$
By Bézout's Identity, there exist integers $x$ and $y$ such that $ax+by=\gcd(a,b),$ so \[u^{\gcd(a,b)}=u^{ax+by}=(u^a)^x\cdot(u^b)^y\equiv1\pmod{d},\] from which $u^{\gcd(a,b)}-1\equiv0\pmod{d}.$ We know that $u^{\gcd(a,b)}-1\geq d.$
Next, we notice that \begin{align*} u^a-1&=\left(u^{\gcd(a,b)}-1\right)\left(u^{a-\gcd{(a,b)}}+u^{a-2\gcd{(a,b)}}+u^{a-3\gcd{(a,b)}}+\cdots+1\right), \\ u^b-1&=\left(u^{\gcd(a,b)}-1\right)\left(u^{b-\gcd{(a,b)}}+u^{b-2\gcd{(a,b)}}+u^{b-3\gcd{(a,b)}}+\cdots+1\right). \end{align*} Since $u^{\gcd(a,b)}-1$ is a common divisor of $u^a-1$ and $u^b-1,$ we conclude that $u^{\gcd(a,b)}-1=d,$ from which the proof is complete.
~MRENTHUSIASM
~MathProblemSolvingSkills.com
~Interstigation | 295 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of ordered pairs $(m, n)$ such that $m$ and $n$ are positive integers in the set $\{1, 2, ..., 30\}$ and the greatest common divisor of $2^m + 1$ and $2^n - 1$ is not $1$.<|im_end|>
<|im_start|>assistant |
Two spheres with radii $36$ and one sphere with radius $13$ are each externally tangent to the other two spheres and to two different planes $\mathcal{P}$ and $\mathcal{Q}$. The intersection of planes $\mathcal{P}$ and $\mathcal{Q}$ is the line $\ell$. The distance from line $\ell$ to the point where the sphere with radius $13$ is tangent to plane $\mathcal{P}$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Diagram
[asy] size(275); import graph3; import solids; currentprojection=orthographic((1,0.9,0)); triple O1, O2, O3, T1, T2, T3, A, L1, L2; O1 = (0,-36,0); O2 = (0,36,0); O3 = (0,0,-sqrt(1105)); T1 = (864*sqrt(1105)/1105,-36,-828*sqrt(1105)/1105); T2 = (864*sqrt(1105)/1105,36,-828*sqrt(1105)/1105); T3 = (24*sqrt(1105)/85,0,-108*sqrt(1105)/85); A = (0,0,-36*sqrt(1105)/23); L1 = shift(0,-80,0)*A; L2 = shift(0,80,0)*A; draw(surface(L1--L2--(-T2.x,L2.y,T2.z)--(-T1.x,L1.y,T1.z)--cycle),pink); draw(shift(O2)*rotate(-90,O1,O2)*scale3(36)*unithemisphere,yellow,light=Viewport); draw(surface(L1--L2--(L2.x,L2.y,40)--(L1.x,L1.y,40)--cycle),gray); draw(shift(O1)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O2)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O3)*rotate(90,O1,O2)*scale3(13)*unithemisphere,yellow,light=White); draw(surface((-T1.x,L1.y,L1.z-abs(T1.z))--(-T2.x,L2.y,L2.z-abs(T2.z))--(T2.x,L2.y,T2.z)--(T1.x,L1.y,T1.z)--cycle),palegreen); draw(surface(L1--L2--(L2.x,L2.y,L2.z-abs(T1.z))--(L1.x,L1.y,L1.z-abs(T2.z))--cycle),gray); draw(surface(L1--L2--(T2.x,L2.y,L2.z-abs(T1.z))--(T1.x,L1.y,L1.z-abs(T2.z))--cycle),pink); draw(L1--L2,L=Label("$\ell$",position=EndPoint,align=3*E),red); label("$\mathcal{P}$",midpoint(L1--(T1.x,L1.y,T1.z)),(0,-3,0),heavygreen); label("$\mathcal{Q}$",midpoint(L1--(T1.x,L1.y,L1.z-abs(T2.z))),(0,-3,0),heavymagenta); dot(O1,linewidth(4.5)); dot(O2,linewidth(4.5)); dot(O3,linewidth(4.5)); dot(T1,heavygreen+linewidth(4.5)); dot(T2,heavygreen+linewidth(4.5)); dot(T3,heavygreen+linewidth(4.5)); dot(A,red+linewidth(4.5)); [/asy] ~MRENTHUSIASM | The isosceles triangle of centers $O_1 O_2 O$ ($O$ is the center of sphere of radii $13$) has sides $O_1 O = O_2 O = 36 + 13 = 49,$ and $O_1 O_2 = 36 + 36 = 72.$
Let $N$ be the midpoint $O_1 O_2$.
The isosceles triangle of points of tangency $T_1 T_2 T$ has sides $T_1 T = T_2 T = 2 \sqrt{13 \cdot 36} = 12 \sqrt{13}$ and $T_1 T_2 = 72.$
Let M be the midpoint $T_1 T_2.$
The height $TM$ is $\sqrt {12^2 \cdot 13 - 36^2} = 12 \sqrt {13-9} = 24.$
The tangens of the half-angle between the planes is $\frac {TO}{AT} = \frac {MN - TO}{TM},$ so $\frac {13}{AT} = \frac {36 - 13}{24},$ \[AT = \frac{24\cdot 13}{23} = \frac {312}{23} \implies 312 + 23 = \boxed{335}.\] vladimir.shelomovskii@gmail.com, vvsss
~Interstigation | 335 | 5.5 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Two spheres with radii $36$ and one sphere with radius $13$ are each externally tangent to the other two spheres and to two different planes $\mathcal{P}$ and $\mathcal{Q}$. The intersection of planes $\mathcal{P}$ and $\mathcal{Q}$ is the line $\ell$. The distance from line $\ell$ to the point where the sphere with radius $13$ is tangent to plane $\mathcal{P}$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Diagram
[asy] size(275); import graph3; import solids; currentprojection=orthographic((1,0.9,0)); triple O1, O2, O3, T1, T2, T3, A, L1, L2; O1 = (0,-36,0); O2 = (0,36,0); O3 = (0,0,-sqrt(1105)); T1 = (864*sqrt(1105)/1105,-36,-828*sqrt(1105)/1105); T2 = (864*sqrt(1105)/1105,36,-828*sqrt(1105)/1105); T3 = (24*sqrt(1105)/85,0,-108*sqrt(1105)/85); A = (0,0,-36*sqrt(1105)/23); L1 = shift(0,-80,0)*A; L2 = shift(0,80,0)*A; draw(surface(L1--L2--(-T2.x,L2.y,T2.z)--(-T1.x,L1.y,T1.z)--cycle),pink); draw(shift(O2)*rotate(-90,O1,O2)*scale3(36)*unithemisphere,yellow,light=Viewport); draw(surface(L1--L2--(L2.x,L2.y,40)--(L1.x,L1.y,40)--cycle),gray); draw(shift(O1)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O2)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O3)*rotate(90,O1,O2)*scale3(13)*unithemisphere,yellow,light=White); draw(surface((-T1.x,L1.y,L1.z-abs(T1.z))--(-T2.x,L2.y,L2.z-abs(T2.z))--(T2.x,L2.y,T2.z)--(T1.x,L1.y,T1.z)--cycle),palegreen); draw(surface(L1--L2--(L2.x,L2.y,L2.z-abs(T1.z))--(L1.x,L1.y,L1.z-abs(T2.z))--cycle),gray); draw(surface(L1--L2--(T2.x,L2.y,L2.z-abs(T1.z))--(T1.x,L1.y,L1.z-abs(T2.z))--cycle),pink); draw(L1--L2,L=Label("$\ell$",position=EndPoint,align=3*E),red); label("$\mathcal{P}$",midpoint(L1--(T1.x,L1.y,T1.z)),(0,-3,0),heavygreen); label("$\mathcal{Q}$",midpoint(L1--(T1.x,L1.y,L1.z-abs(T2.z))),(0,-3,0),heavymagenta); dot(O1,linewidth(4.5)); dot(O2,linewidth(4.5)); dot(O3,linewidth(4.5)); dot(T1,heavygreen+linewidth(4.5)); dot(T2,heavygreen+linewidth(4.5)); dot(T3,heavygreen+linewidth(4.5)); dot(A,red+linewidth(4.5)); [/asy] ~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$, and a different number in $S$ was divisible by $7$. The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.
However, upon hearing that all four students replied no, each student was able to determine the elements of $S$. Find the sum of all possible values of the greatest element of $S$. | We know right away that $42\not\in S$ and $84\not\in S$ as stated in Solution 1.
To get a feel for the problem, let’s write out some possible values of $S$ based on the teacher’s remarks. The first multiple of 7 that is two-digit is 14. The closest multiple of six from 14 is 12, and therefore there are two possible sets of four consecutive integers containing 12 and 14; $\{11,12,13,14\}$ and $\{12,13,14,15\}$. Here we get our first crucial idea; that if the multiples of 6 and 7 differ by two, there will be 2 possible sets of $S$ without any student input. Similarly, if they differ by 3, there will be only 1 possible set, and if they differ by 1, 3 possible sets.
Now we read the student input. Each student says they can’t figure out what $S$ is just based on the teacher’s information, which means each student has to have a number that would be in 2 or 3 of the possible sets (This is based off of the first line of student input). However, now that each student knows that all of them have numbers that fit into more than one possible set, this means that S cannot have two possible sets because otherwise, when shifting from one set to the other, one of the end numbers would not be in the shifted set, but we know each number has to fall in two or more possible sets. For example, take $\{11,12,13,14\}$ and $\{12,13,14,15\}$. The numbers at the end, 11 and 15, only fall in one set, but each number must fall in at least two sets. This means that there must be three possible sets of S, in which case the actual S would be the middle S. Take for example $\{33,34,35,36\}$, $\{34,35,36,37\}$, and $\{35,36,37,38\}$. 37 and 34 fall in two sets while 35 and 36 fall in all three sets, so the condition is met. Now, this means that the multiple of 6 and 7 must differ by 1. Since 42 means the difference is 0, when you add/subtract 6 and 7, you will obtain the desired difference of 1, and similarly adding/subtracting 6 or 7 from 84 will also obtain the difference of 1. Thus there are four possible sets of $S$; $\{34,35,36,37\}$, $\{47,48,49,50\}$, $\{76,77,78,79\}$ and $\{89,90,91,92.\}$. Therefore the sum of the greatest elements of the possible sets $S$ is $37+50+79+92=\boxed{258}$
~KingRavi | 258 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$, and a different number in $S$ was divisible by $7$. The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.
However, upon hearing that all four students replied no, each student was able to determine the elements of $S$. Find the sum of all possible values of the greatest element of $S$.<|im_end|>
<|im_start|>assistant |
A convex quadrilateral has area $30$ and side lengths $5, 6, 9,$ and $7,$ in that order. Denote by $\theta$ the measure of the acute angle formed by the diagonals of the quadrilateral. Then $\tan \theta$ can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. | By Bretschneider's Formula, \[30=\tfrac{1}{4}\sqrt{4u^2v^2-(b^2+d^2-a^2-c^2)^2}=\tfrac{1}{4}\sqrt{4u^2v^2-441}.\] Thus, $uv=3\sqrt{1649}$. Also, \[[ABCD]=\tfrac 12 \cdot uv\sin{\theta};\] solving for $\sin{\theta}$ yields $\sin{\theta}=\tfrac{40}{\sqrt{1649}}$. Since $\theta$ is acute, $\cos{\theta}$ is positive, from which $\cos{\theta}=\tfrac{7}{\sqrt{1649}}$. Solving for $\tan{\theta}$ yields \[\tan{\theta}=\frac{\sin{\theta}}{\cos{\theta}}=\frac{40}{7},\] for a final answer of $\boxed{047}$.
~ Leo.Euler | 47 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
A convex quadrilateral has area $30$ and side lengths $5, 6, 9,$ and $7,$ in that order. Denote by $\theta$ the measure of the acute angle formed by the diagonals of the quadrilateral. Then $\tan \theta$ can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.<|im_end|>
<|im_start|>assistant |
Find the least positive integer $n$ for which $2^n + 5^n - n$ is a multiple of $1000$. | \[5^n \equiv n \pmod{8}\] Note that $5^n \equiv 5,1,5,1,...$ and $n \equiv 0,..,7$ so $n$ is periodic every $[2,8]=8$. Easy to check that only $n\equiv 5 \pmod{8}$ satisfy. Let $n=8a+5$. Note that by binomial theorem, \[2^{8a+5}=32\cdot 2^{8a} \equiv 7(1+15)^{2a} \equiv 7(1+30a)\pmod{25}\] So we have $7(1+30a) \equiv 8a+5\pmod{25} \implies 202a \equiv 23 \implies 2a \equiv 23+25 \implies a \equiv 24 \pmod{25}$. Combining $a\equiv 24\pmod{25}$ with $n \equiv 5 \pmod{8}$ gives that $n$ is in the form of $197+200k$, $n=197,397,597,797$. Note that since $\phi(125)=100$ \[2^{197+200k} \equiv 2^{197} \equiv 2^{-3} \equiv \underbrace{47}_{\text{Extended Euclidean Algorithm}}\pmod{125}\] Easy to check that only $\boxed{797}\equiv 47\pmod{125},{1797}\equiv 47\pmod{125},{2797}\equiv 47\pmod{125},...$
~Afo | 797 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the least positive integer $n$ for which $2^n + 5^n - n$ is a multiple of $1000$.<|im_end|>
<|im_start|>assistant |
Let $\Delta ABC$ be an acute triangle with circumcenter $O$ and centroid $G$. Let $X$ be the intersection of the line tangent to the circumcircle of $\Delta ABC$ at $A$ and the line perpendicular to $GO$ at $G$. Let $Y$ be the intersection of lines $XG$ and $BC$. Given that the measures of $\angle ABC, \angle BCA,$ and $\angle XOY$ are in the ratio $13 : 2 : 17,$ the degree measure of $\angle BAC$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Diagram
[asy] /* Made by MRENTHUSIASM */ size(375); pair A, B, C, O, G, X, Y; A = origin; B = (1,0); C = extension(A,A+10*dir(585/7),B,B+10*dir(180-585/7)); O = circumcenter(A,B,C); G = centroid(A,B,C); Y = intersectionpoint(G--G+(100,0),B--C); X = intersectionpoint(G--G-(100,0),A--scale(100)*rotate(90)*dir(O-A)); markscalefactor=3/160; draw(rightanglemark(O,G,X),red); dot("$A$",A,1.5*dir(180+585/7),linewidth(4)); dot("$B$",B,1.5*dir(-585/7),linewidth(4)); dot("$C$",C,1.5N,linewidth(4)); dot("$O$",O,1.5N,linewidth(4)); dot("$G$",G,1.5S,linewidth(4)); dot("$Y$",Y,1.5E,linewidth(4)); dot("$X$",X,1.5W,linewidth(4)); draw(A--B--C--cycle^^X--O--Y--cycle^^A--X^^O--G^^circumcircle(A,B,C)); [/asy] ~MRENTHUSIASM | Notice that $\triangle ABC$ looks isosceles, so we assume it's isosceles. Then, let $\angle BAC = \angle ABC = 13x$ and $\angle BCA = 2x.$ Taking the sum of the angles in the triangle gives $28x=180,$ so $13x = \frac{13}{28} \cdot 180 = \frac{585}{7}$ so the answer is $\boxed{592}.$ | 592 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $\Delta ABC$ be an acute triangle with circumcenter $O$ and centroid $G$. Let $X$ be the intersection of the line tangent to the circumcircle of $\Delta ABC$ at $A$ and the line perpendicular to $GO$ at $G$. Let $Y$ be the intersection of lines $XG$ and $BC$. Given that the measures of $\angle ABC, \angle BCA,$ and $\angle XOY$ are in the ratio $13 : 2 : 17,$ the degree measure of $\angle BAC$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Diagram
[asy] /* Made by MRENTHUSIASM */ size(375); pair A, B, C, O, G, X, Y; A = origin; B = (1,0); C = extension(A,A+10*dir(585/7),B,B+10*dir(180-585/7)); O = circumcenter(A,B,C); G = centroid(A,B,C); Y = intersectionpoint(G--G+(100,0),B--C); X = intersectionpoint(G--G-(100,0),A--scale(100)*rotate(90)*dir(O-A)); markscalefactor=3/160; draw(rightanglemark(O,G,X),red); dot("$A$",A,1.5*dir(180+585/7),linewidth(4)); dot("$B$",B,1.5*dir(-585/7),linewidth(4)); dot("$C$",C,1.5N,linewidth(4)); dot("$O$",O,1.5N,linewidth(4)); dot("$G$",G,1.5S,linewidth(4)); dot("$Y$",Y,1.5E,linewidth(4)); dot("$X$",X,1.5W,linewidth(4)); draw(A--B--C--cycle^^X--O--Y--cycle^^A--X^^O--G^^circumcircle(A,B,C)); [/asy] ~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
Let $f(n)$ and $g(n)$ be functions satisfying \[f(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 1 + f(n+1) & \text{ otherwise} \end{cases}\]and \[g(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 2 + g(n+2) & \text{ otherwise} \end{cases}\]for positive integers $n$. Find the least positive integer $n$ such that $\tfrac{f(n)}{g(n)} = \tfrac{4}{7}$. | Since $n$ isn't a perfect square, let $n=m^2+k$ with $0<k<2m+1$. If $m$ is odd, then $f(n)=g(n)$. If $m$ is even, then \begin{align*} f(n)&=(m+1)^2-(m^2+k)+(m+1)=3m+2-k, \\ g(n)&=(m+2)^2-(m^2+k)+(m+2)=5m+6-k, \end{align*} from which \begin{align*} 7(3m+2-k)&=4(5m+6-k) \\ m&=3k+10. \end{align*} Since $m$ is even, $k$ is even. Since $k\neq 0$, the smallest $k$ is $2$ which produces the smallest $n$: \[k=2 \implies m=16 \implies n=16^2+2=\boxed{258}.\] ~Afo | 258 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $f(n)$ and $g(n)$ be functions satisfying \[f(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 1 + f(n+1) & \text{ otherwise} \end{cases}\]and \[g(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 2 + g(n+2) & \text{ otherwise} \end{cases}\]for positive integers $n$. Find the least positive integer $n$ such that $\tfrac{f(n)}{g(n)} = \tfrac{4}{7}$.<|im_end|>
<|im_start|>assistant |
Quadratic polynomials $P(x)$ and $Q(x)$ have leading coefficients $2$ and $-2,$ respectively. The graphs of both polynomials pass through the two points $(16,54)$ and $(20,53).$ Find $P(0) + Q(0).$ | Let $R(x)=P(x)+Q(x).$ Since the $x^2$-terms of $P(x)$ and $Q(x)$ cancel, we conclude that $R(x)$ is a linear polynomial.
Note that \begin{alignat*}{8} R(16) &= P(16)+Q(16) &&= 54+54 &&= 108, \\ R(20) &= P(20)+Q(20) &&= 53+53 &&= 106, \end{alignat*} so the slope of $R(x)$ is $\frac{106-108}{20-16}=-\frac12.$
It follows that the equation of $R(x)$ is \[R(x)=-\frac12x+c\] for some constant $c,$ and we wish to find $R(0)=c.$
We substitute $x=20$ into this equation to get $106=-\frac12\cdot20+c,$ from which $c=\boxed{116}.$
~MRENTHUSIASM | 116 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Quadratic polynomials $P(x)$ and $Q(x)$ have leading coefficients $2$ and $-2,$ respectively. The graphs of both polynomials pass through the two points $(16,54)$ and $(20,53).$ Find $P(0) + Q(0).$<|im_end|>
<|im_start|>assistant |
Find the three-digit positive integer $\underline{a}\,\underline{b}\,\underline{c}$ whose representation in base nine is $\underline{b}\,\underline{c}\,\underline{a}_{\,\text{nine}},$ where $a,$ $b,$ and $c$ are (not necessarily distinct) digits. | As shown in Solution 1, we get $99a = 71b+8c$.
We can see that $99$ is $28$ larger than $71$, and we have an $8c$. We can clearly see that $56$ is a multiple of $8$, and any larger than $56$ would result in $c$ being larger than $9$. Therefore, our only solution is $a = 2, b = 2, c = 7$. Our answer is $\underline{a}\,\underline{b}\,\underline{c}=\boxed{227}$.
~Arcticturn | 227 | 2.625 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the three-digit positive integer $\underline{a}\,\underline{b}\,\underline{c}$ whose representation in base nine is $\underline{b}\,\underline{c}\,\underline{a}_{\,\text{nine}},$ where $a,$ $b,$ and $c$ are (not necessarily distinct) digits.<|im_end|>
<|im_start|>assistant |
In isosceles trapezoid $ABCD$, parallel bases $\overline{AB}$ and $\overline{CD}$ have lengths $500$ and $650$, respectively, and $AD=BC=333$. The angle bisectors of $\angle{A}$ and $\angle{D}$ meet at $P$, and the angle bisectors of $\angle{B}$ and $\angle{C}$ meet at $Q$. Find $PQ$.
Diagram
[asy] /* Made by MRENTHUSIASM */ size(300); pair A, B, C, D, A1, B1, C1, D1, P, Q; A = (-250,6*sqrt(731)); B = (250,6*sqrt(731)); C = (325,-6*sqrt(731)); D = (-325,-6*sqrt(731)); A1 = bisectorpoint(B,A,D); B1 = bisectorpoint(A,B,C); C1 = bisectorpoint(B,C,D); D1 = bisectorpoint(A,D,C); P = intersectionpoint(A--300*(A1-A)+A,D--300*(D1-D)+D); Q = intersectionpoint(B--300*(B1-B)+B,C--300*(C1-C)+C); draw(anglemark(P,A,B,1000),red); draw(anglemark(D,A,P,1000),red); draw(anglemark(A,B,Q,1000),red); draw(anglemark(Q,B,C,1000),red); draw(anglemark(P,D,A,1000),red); draw(anglemark(C,D,P,1000),red); draw(anglemark(Q,C,D,1000),red); draw(anglemark(B,C,Q,1000),red); add(pathticks(anglemark(P,A,B,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(D,A,P,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(A,B,Q,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(Q,B,C,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(P,D,A,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); add(pathticks(anglemark(C,D,P,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); add(pathticks(anglemark(Q,C,D,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); add(pathticks(anglemark(B,C,Q,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); dot("$A$",A,1.5*dir(A),linewidth(4)); dot("$B$",B,1.5*dir(B),linewidth(4)); dot("$C$",C,1.5*dir(C),linewidth(4)); dot("$D$",D,1.5*dir(D),linewidth(4)); dot("$P$",P,1.5*NE,linewidth(4)); dot("$Q$",Q,1.5*NW,linewidth(4)); draw(A--B--C--D--cycle^^A--P--D^^B--Q--C^^P--Q); label("$500$",midpoint(A--B),1.25N); label("$650$",midpoint(C--D),1.25S); label("$333$",midpoint(A--D),1.25W); label("$333$",midpoint(B--C),1.25E); [/asy] ~MRENTHUSIASM ~ihatemath123 | This will be my first solution on AoPS. My apologies in advance for any errors.
Angle bisectors can be thought of as the locus of all points equidistant from the lines whose angle they bisect. It can thus be seen that $P$ is equidistant from $AB, AD,$ and $CD$ and $Q$ is equidistant from $AB, BC,$ and $CD.$ If we let the feet of the altitudes from $P$ to $AB, AD,$ and $CD$ be called $E, F,$ and $G$ respectively, we can say that $PE = PF = PG.$ Analogously, we let the feet of the altitudes from $Q$ to $AB, BC,$ and $CD$ be $H, I,$ and $J$ respectively. Thus, $QH = QI = QJ.$ Because $ABCD$ is an isosceles trapezoid, we can say that all of the altitudes are equal to each other.
By SA as well as SS congruence for right triangles, we find that triangles $AEP, AFP, BHQ,$ and $BIQ$ are congruent. Similarly, $DFP, DGP, CJQ,$ and $CIQ$ by the same reasoning. Additionally, $EH = GJ = PQ$ since $EHQP$ and $GJQP$ are congruent rectangles.
If we then let $x = AE = AF = BH = BI,$ let $y = CI = CJ = DG = DF,$ and let $z = EH = GJ = PQ,$ we can create the following system of equations with the given side length information: \begin{align*} 2x + z &= 500, \\ 2y + z &= 650, \\ x + y &= 333. \end{align*} Adding the first two equations, subtracting by twice the second, and dividing by $2$ yields $z = PQ = \boxed{242}.$
~regular | 242 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
In isosceles trapezoid $ABCD$, parallel bases $\overline{AB}$ and $\overline{CD}$ have lengths $500$ and $650$, respectively, and $AD=BC=333$. The angle bisectors of $\angle{A}$ and $\angle{D}$ meet at $P$, and the angle bisectors of $\angle{B}$ and $\angle{C}$ meet at $Q$. Find $PQ$.
Diagram
[asy] /* Made by MRENTHUSIASM */ size(300); pair A, B, C, D, A1, B1, C1, D1, P, Q; A = (-250,6*sqrt(731)); B = (250,6*sqrt(731)); C = (325,-6*sqrt(731)); D = (-325,-6*sqrt(731)); A1 = bisectorpoint(B,A,D); B1 = bisectorpoint(A,B,C); C1 = bisectorpoint(B,C,D); D1 = bisectorpoint(A,D,C); P = intersectionpoint(A--300*(A1-A)+A,D--300*(D1-D)+D); Q = intersectionpoint(B--300*(B1-B)+B,C--300*(C1-C)+C); draw(anglemark(P,A,B,1000),red); draw(anglemark(D,A,P,1000),red); draw(anglemark(A,B,Q,1000),red); draw(anglemark(Q,B,C,1000),red); draw(anglemark(P,D,A,1000),red); draw(anglemark(C,D,P,1000),red); draw(anglemark(Q,C,D,1000),red); draw(anglemark(B,C,Q,1000),red); add(pathticks(anglemark(P,A,B,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(D,A,P,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(A,B,Q,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(Q,B,C,1000), n = 1, r = 0.15, s = 750, red)); add(pathticks(anglemark(P,D,A,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); add(pathticks(anglemark(C,D,P,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); add(pathticks(anglemark(Q,C,D,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); add(pathticks(anglemark(B,C,Q,1000), n = 2, r = 0.12, spacing = 150, s = 750, red)); dot("$A$",A,1.5*dir(A),linewidth(4)); dot("$B$",B,1.5*dir(B),linewidth(4)); dot("$C$",C,1.5*dir(C),linewidth(4)); dot("$D$",D,1.5*dir(D),linewidth(4)); dot("$P$",P,1.5*NE,linewidth(4)); dot("$Q$",Q,1.5*NW,linewidth(4)); draw(A--B--C--D--cycle^^A--P--D^^B--Q--C^^P--Q); label("$500$",midpoint(A--B),1.25N); label("$650$",midpoint(C--D),1.25S); label("$333$",midpoint(A--D),1.25W); label("$333$",midpoint(B--C),1.25E); [/asy] ~MRENTHUSIASM ~ihatemath123<|im_end|>
<|im_start|>assistant |
Let $w = \dfrac{\sqrt{3} + i}{2}$ and $z = \dfrac{-1 + i\sqrt{3}}{2},$ where $i = \sqrt{-1}.$ Find the number of ordered pairs $(r,s)$ of positive integers not exceeding $100$ that satisfy the equation $i \cdot w^r = z^s.$ | We rewrite $w$ and $z$ in polar form: \begin{align*} w &= e^{i\cdot\frac{\pi}{6}}, \\ z &= e^{i\cdot\frac{2\pi}{3}}. \end{align*} The equation $i \cdot w^r = z^s$ becomes \begin{align*} e^{i\cdot\frac{\pi}{2}} \cdot \left(e^{i\cdot\frac{\pi}{6}}\right)^r &= \left(e^{i\cdot\frac{2\pi}{3}}\right)^s \\ e^{i\left(\frac{\pi}{2}+\frac{\pi}{6}r\right)} &= e^{i\left(\frac{2\pi}{3}s\right)} \\ \frac{\pi}{2}+\frac{\pi}{6}r &= \frac{2\pi}{3}s+2\pi k \\ 3+r &= 4s+12k \\ 3+r &= 4(s+3k). \end{align*} for some integer $k.$
Since $4\leq 3+r\leq 103$ and $4\mid 3+r,$ we conclude that \begin{align*} 3+r &\in \{4,8,12,\ldots,100\}, \\ s+3k &\in \{1,2,3,\ldots,25\}. \end{align*} Note that the values for $s+3k$ and the values for $r$ have one-to-one correspondence.
We apply casework to the values for $s+3k:$
$s+3k\equiv0\pmod{3}$
There are $8$ values for $s+3k,$ so there are $8$ values for $r.$ It follows that $s\equiv0\pmod{3},$ so there are $33$ values for $s.$
There are $8\cdot33=264$ ordered pairs $(r,s)$ in this case.
$s+3k\equiv1\pmod{3}$
There are $9$ values for $s+3k,$ so there are $9$ values for $r.$ It follows that $s\equiv1\pmod{3},$ so there are $34$ values for $s.$
There are $9\cdot34=306$ ordered pairs $(r,s)$ in this case.
$s+3k\equiv2\pmod{3}$
There are $8$ values for $s+3k,$ so there are $8$ values for $r.$ It follows that $s\equiv2\pmod{3},$ so there are $33$ values for $s.$
There are $8\cdot33=264$ ordered pairs $(r,s)$ in this case.
Together, the answer is $264+306+264=\boxed{834}.$
~MRENTHUSIASM | 834 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $w = \dfrac{\sqrt{3} + i}{2}$ and $z = \dfrac{-1 + i\sqrt{3}}{2},$ where $i = \sqrt{-1}.$ Find the number of ordered pairs $(r,s)$ of positive integers not exceeding $100$ that satisfy the equation $i \cdot w^r = z^s.$<|im_end|>
<|im_start|>assistant |
A straight river that is $264$ meters wide flows from west to east at a rate of $14$ meters per minute. Melanie and Sherry sit on the south bank of the river with Melanie a distance of $D$ meters downstream from Sherry. Relative to the water, Melanie swims at $80$ meters per minute, and Sherry swims at $60$ meters per minute. At the same time, Melanie and Sherry begin swimming in straight lines to a point on the north bank of the river that is equidistant from their starting positions. The two women arrive at this point simultaneously. Find $D$. | Claim
Median $AM$ and altitude $AH$ are drawn in triangle $ABC$. $AB = c, AC = b < c, BC = a$ are known. Let's denote $MH = x$.
Prove that \begin{align*}2ax = c^{2} – b^{2}\end{align*}
Proof \[BH + CH = a,\] \begin{align*} BH^{2} – CH^{2} = c^{2} – b^{2}\implies BH - CH &= \frac{c^{2} – b^{2}} {a},\end{align*} \[BH = \frac{c^{2} – b^{2}}{2a} + \frac{a}{2},\] \begin{align*}MH = BH - BM &= \frac{c^{2} – b^{2}} {2a}.\end{align*}
Solution
In the coordinate system associated with water, the movement is described by the scheme in the form of a triangle, the side on which Melanie floats is $80t$, where t is the time of Melanie's movement, the side along which Sherry floats is $60t$.
The meeting point floated away at a distance of $14t$ from the midpoint between the starting points of Melanie and Sherry.
In the notation of the Claim, \begin{align*} c = 80t, b = 60t, x = 14t \implies a = \frac{(80t)^2-(60t)^2}{2 \cdot 14t}=\frac{20^2}{4}\cdot \frac{16-9}{7}t = 100t.\end{align*} Hence, \begin{align*} AH = \sqrt{BC^2-BH^2}= \sqrt{(80t)^2-(50t+14t)^2}=16t \cdot \sqrt{5^2-4^2}= 48t = 264 \implies t = 5.5.\end{align*} \[D = a = 100t = \boxed{550}\] vladimir.shelomovskii@gmail.com, vvsss | 550 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
A straight river that is $264$ meters wide flows from west to east at a rate of $14$ meters per minute. Melanie and Sherry sit on the south bank of the river with Melanie a distance of $D$ meters downstream from Sherry. Relative to the water, Melanie swims at $80$ meters per minute, and Sherry swims at $60$ meters per minute. At the same time, Melanie and Sherry begin swimming in straight lines to a point on the north bank of the river that is equidistant from their starting positions. The two women arrive at this point simultaneously. Find $D$.<|im_end|>
<|im_start|>assistant |
Find the number of ordered pairs of integers $(a, b)$ such that the sequence\[3, 4, 5, a, b, 30, 40, 50\]is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression. | divide cases into $7\leq a<20; 21\leq a\leq28$.(Notice that $a$ can't be equal to $6,20$, that's why I divide them into two parts. There are three cases that arithmetic sequence forms: $3,12,21,30;4,16,28,40;3,5,7,9$.(NOTICE that $5,20,35,50$ IS NOT A VALID SEQUENCE!) So when $7\leq a<20$, there are $10+11+12+...+22-3-13=192$ possible ways( 3 means the arithmetic sequence and 13 means there are 13 "a" s and b cannot be 20)
When $21\leq a \leq 28$, there are $1+2+\cdots+8=36$ ways.
In all, there are $192+36=\boxed{228}$ possible sequences.
~bluesoul | 228 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of ordered pairs of integers $(a, b)$ such that the sequence\[3, 4, 5, a, b, 30, 40, 50\]is strictly increasing and no set of four (not necessarily consecutive) terms forms an arithmetic progression.<|im_end|>
<|im_start|>assistant |
Let $a,b,c,d,e,f,g,h,i$ be distinct integers from $1$ to $9.$ The minimum possible positive value of \[\dfrac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i}\] can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | To minimize a positive fraction, we minimize its numerator and maximize its denominator. It is clear that $\frac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i} \geq \frac{1}{7\cdot8\cdot9}.$
If we minimize the numerator, then $a \cdot b \cdot c - d \cdot e \cdot f = 1.$ Note that $a \cdot b \cdot c \cdot d \cdot e \cdot f = (a \cdot b \cdot c) \cdot (a \cdot b \cdot c - 1) \geq 6! = 720,$ so $a \cdot b \cdot c \geq 28.$ It follows that $a \cdot b \cdot c$ and $d \cdot e \cdot f$ are consecutive composites with prime factors no other than $2,3,5,$ and $7.$ The smallest values for $a \cdot b \cdot c$ and $d \cdot e \cdot f$ are $36$ and $35,$ respectively. So, we have $\{a,b,c\} = \{2,3,6\}, \{d,e,f\} = \{1,5,7\},$ and $\{g,h,i\} = \{4,8,9\},$ from which $\frac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i} = \frac{1}{288}.$
If we do not minimize the numerator, then $a \cdot b \cdot c - d \cdot e \cdot f > 1.$ Note that $\frac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i} \geq \frac{2}{7\cdot8\cdot9} > \frac{1}{288}.$
Together, we conclude that the minimum possible positive value of $\frac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i}$ is $\frac{1}{288}.$ Therefore, the answer is $1+288=\boxed{289}.$
~MRENTHUSIASM ~jgplay | 289 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $a,b,c,d,e,f,g,h,i$ be distinct integers from $1$ to $9.$ The minimum possible positive value of \[\dfrac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i}\] can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$<|im_end|>
<|im_start|>assistant |
Equilateral triangle $\triangle ABC$ is inscribed in circle $\omega$ with radius $18.$ Circle $\omega_A$ is tangent to sides $\overline{AB}$ and $\overline{AC}$ and is internally tangent to $\omega.$ Circles $\omega_B$ and $\omega_C$ are defined analogously. Circles $\omega_A,$ $\omega_B,$ and $\omega_C$ meet in six points---two points for each pair of circles. The three intersection points closest to the vertices of $\triangle ABC$ are the vertices of a large equilateral triangle in the interior of $\triangle ABC,$ and the other three intersection points are the vertices of a smaller equilateral triangle in the interior of $\triangle ABC.$ The side length of the smaller equilateral triangle can be written as $\sqrt{a} - \sqrt{b},$ where $a$ and $b$ are positive integers. Find $a+b.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(250); pair A, B, C, W, WA, WB, WC, X, Y, Z; A = 18*dir(90); B = 18*dir(210); C = 18*dir(330); W = (0,0); WA = 6*dir(270); WB = 6*dir(30); WC = 6*dir(150); X = (sqrt(117)-3)*dir(270); Y = (sqrt(117)-3)*dir(30); Z = (sqrt(117)-3)*dir(150); filldraw(X--Y--Z--cycle,green,dashed); draw(Circle(WA,12)^^Circle(WB,12)^^Circle(WC,12),blue); draw(Circle(W,18)^^A--B--C--cycle); dot("$A$",A,1.5*dir(A),linewidth(4)); dot("$B$",B,1.5*dir(B),linewidth(4)); dot("$C$",C,1.5*dir(C),linewidth(4)); dot("$\omega$",W,1.5*dir(270),linewidth(4)); dot("$\omega_A$",WA,1.5*dir(-WA),linewidth(4)); dot("$\omega_B$",WB,1.5*dir(-WB),linewidth(4)); dot("$\omega_C$",WC,1.5*dir(-WC),linewidth(4)); [/asy] ~MRENTHUSIASM ~ihatemath123 | Let $O$ be the center, $R = 18$ be the radius, and $CC'$ be the diameter of $\omega.$ Let $r$ be the radius, $E,D,F$ are the centers of $\omega_A, \omega_B,\omega_C.$ Let $KGH$ be the desired triangle with side $x.$ We find $r$ using \[CC' = 2R = C'K + KC = r + \frac{r}{\sin 30^\circ} = 3r.\] \[r = \frac{2R}{3} = 12.\] \[OE = R – r = 6.\] Triangles $\triangle DEF$ and $\triangle KGH$ – are equilateral triangles with a common center $O,$ therefore in the triangle $OEH$ $OE = 6, \angle EOH = 120^\circ, OH = \frac{x}{\sqrt3}.$
We apply the Law of Cosines to $\triangle OEH$ and get \[OE^2 + OH^2 + OE \cdot OH = EH^2.\] \[6^2 + \frac{x^2}{3} + \frac{6x}{\sqrt3} = 12^2.\] \[x^2 + 6x \sqrt{3} = 3\cdot {6^2}.\] \[x= \sqrt{351} - \sqrt{27} \implies 351 + 27 = \boxed{378}\]
vladimir.shelomovskii@gmail.com, vvsss | 378 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Equilateral triangle $\triangle ABC$ is inscribed in circle $\omega$ with radius $18.$ Circle $\omega_A$ is tangent to sides $\overline{AB}$ and $\overline{AC}$ and is internally tangent to $\omega.$ Circles $\omega_B$ and $\omega_C$ are defined analogously. Circles $\omega_A,$ $\omega_B,$ and $\omega_C$ meet in six points---two points for each pair of circles. The three intersection points closest to the vertices of $\triangle ABC$ are the vertices of a large equilateral triangle in the interior of $\triangle ABC,$ and the other three intersection points are the vertices of a smaller equilateral triangle in the interior of $\triangle ABC.$ The side length of the smaller equilateral triangle can be written as $\sqrt{a} - \sqrt{b},$ where $a$ and $b$ are positive integers. Find $a+b.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(250); pair A, B, C, W, WA, WB, WC, X, Y, Z; A = 18*dir(90); B = 18*dir(210); C = 18*dir(330); W = (0,0); WA = 6*dir(270); WB = 6*dir(30); WC = 6*dir(150); X = (sqrt(117)-3)*dir(270); Y = (sqrt(117)-3)*dir(30); Z = (sqrt(117)-3)*dir(150); filldraw(X--Y--Z--cycle,green,dashed); draw(Circle(WA,12)^^Circle(WB,12)^^Circle(WC,12),blue); draw(Circle(W,18)^^A--B--C--cycle); dot("$A$",A,1.5*dir(A),linewidth(4)); dot("$B$",B,1.5*dir(B),linewidth(4)); dot("$C$",C,1.5*dir(C),linewidth(4)); dot("$\omega$",W,1.5*dir(270),linewidth(4)); dot("$\omega_A$",WA,1.5*dir(-WA),linewidth(4)); dot("$\omega_B$",WB,1.5*dir(-WB),linewidth(4)); dot("$\omega_C$",WC,1.5*dir(-WC),linewidth(4)); [/asy] ~MRENTHUSIASM ~ihatemath123<|im_end|>
<|im_start|>assistant |
Ellina has twelve blocks, two each of red ($\textbf{R}$), blue ($\textbf{B}$), yellow ($\textbf{Y}$), green ($\textbf{G}$), orange ($\textbf{O}$), and purple ($\textbf{P}$). Call an arrangement of blocks $\textit{even}$ if there is an even number of blocks between each pair of blocks of the same color. For example, the arrangement \[\textbf{R B B Y G G Y R O P P O}\] is even. Ellina arranges her blocks in a row in random order. The probability that her arrangement is even is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | We can simply use constructive counting. First, let us place the red balls; choose the first slot in $12$ ways, and the second in $6$ ways, because the number is cut in half due to the condition in the problem. This gives $12 \cdot 6$ ways to place the blue balls. Similarly, there are $10 \cdot 5$ ways to place the blue balls, and so on, until there are $2 \cdot 1$ ways to place the purple balls. Thus, the probability is \[\frac{12 \cdot 6 \cdot 10 \cdot 5 \cdot 8 \cdot 4 \cdot 6 \cdot 3 \cdot 4 \cdot 2 \cdot 2 \cdot 1}{12!}=\frac{16}{231},\] and the desired answer extraction is $16+231=\boxed{247}$.
~A1001 | 247 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Ellina has twelve blocks, two each of red ($\textbf{R}$), blue ($\textbf{B}$), yellow ($\textbf{Y}$), green ($\textbf{G}$), orange ($\textbf{O}$), and purple ($\textbf{P}$). Call an arrangement of blocks $\textit{even}$ if there is an even number of blocks between each pair of blocks of the same color. For example, the arrangement \[\textbf{R B B Y G G Y R O P P O}\] is even. Ellina arranges her blocks in a row in random order. The probability that her arrangement is even is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$<|im_end|>
<|im_start|>assistant |
Three spheres with radii $11$, $13$, and $19$ are mutually externally tangent. A plane intersects the spheres in three congruent circles centered at $A$, $B$, and $C$, respectively, and the centers of the spheres all lie on the same side of this plane. Suppose that $AB^2 = 560$. Find $AC^2$.
Diagrams
[asy] size(500); pair A, B, OA, OB; B = (0,0); A = (-23.6643191,0); OB = (0,-8); OA = (-23.6643191,-4); draw(circle(OB,13)); draw(circle(OA,11)); draw((-48,0)--(24,0)); label("$l$",(-42,1),N); label("$A$",A,N); label("$B$",B,N); label("$O_A$",OA,S); label("$O_B$",OB,S); draw(A--OA); draw(B--OB); draw(OA--OB); draw(OA--(0,-4)); draw(OA--(-33.9112699,0)); draw(OB--(10.2469508,0)); label("$24$",midpoint(OA--OB),S); label("$\sqrt{560}$",midpoint(A--B),N); label("$11$",midpoint(OA--(-33.9112699,0)),S); label("$13$",midpoint(OB--(10.2469508,0)),S); label("$r$",midpoint(midpoint(A--B)--A),N); label("$r$",midpoint(midpoint(A--B)--B),N); label("$r$",midpoint(A--(-33.9112699,0)),N); label("$r$",midpoint(B--(10.2469508,0)),N); label("$x$",midpoint(midpoint(B--OB)--OB),E); label("$D$",midpoint(B--OB),E); [/asy]
[asy] size(500); pair A, C, OA, OC; C = (0,0); A = (-27.4954541697,0); OC = (0,-16); OA = (-27.4954541697,-4); draw(circle(OC,19)); draw(circle(OA,11)); draw((-48,0)--(24,0)); label("$l$",(-42,1),N); label("$A$",A,N); label("$C$",C,N); label("$O_A$",OA,S); label("$O_C$",OC,S); draw(A--OA); draw(C--OC); draw(OA--OC); draw(OA--(0,-4)); draw(OA--(-37.8877590151,0)); draw(OC--(10.2469508,0)); label("$30$",midpoint(OA--OC),S); label("$11$",midpoint(OA--(-37.8877590151,0)),S); label("$19$",midpoint(OC--(10.2469508,0)),E); label("$r$",midpoint(midpoint(A--C)--A),N); label("$r$",midpoint(midpoint(A--C)--C),N); label("$r$",midpoint(A--(-37.8877590151,0)),N); label("$r$",midpoint(C--(10.2469508,0)),N); label("$E$",(0,-4),E); [/asy] | Let the distance between the center of the sphere to the center of those circular intersections as $a,b,c$ separately. $a-11,b-13,c-19$. According to the problem, we have $a^2-11^2=b^2-13^2=c^2-19^2;(11+13)^2-(b-a)^2=560$. After solving we have $b-a=4$, plug this back to $11^2-a^2=13^2-b^2; a=4,b=8,c=16$
The desired value is $(11+19)^2-(16-4)^2=\boxed{756}$
~bluesoul | 756 | 5.5 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Three spheres with radii $11$, $13$, and $19$ are mutually externally tangent. A plane intersects the spheres in three congruent circles centered at $A$, $B$, and $C$, respectively, and the centers of the spheres all lie on the same side of this plane. Suppose that $AB^2 = 560$. Find $AC^2$.
Diagrams
[asy] size(500); pair A, B, OA, OB; B = (0,0); A = (-23.6643191,0); OB = (0,-8); OA = (-23.6643191,-4); draw(circle(OB,13)); draw(circle(OA,11)); draw((-48,0)--(24,0)); label("$l$",(-42,1),N); label("$A$",A,N); label("$B$",B,N); label("$O_A$",OA,S); label("$O_B$",OB,S); draw(A--OA); draw(B--OB); draw(OA--OB); draw(OA--(0,-4)); draw(OA--(-33.9112699,0)); draw(OB--(10.2469508,0)); label("$24$",midpoint(OA--OB),S); label("$\sqrt{560}$",midpoint(A--B),N); label("$11$",midpoint(OA--(-33.9112699,0)),S); label("$13$",midpoint(OB--(10.2469508,0)),S); label("$r$",midpoint(midpoint(A--B)--A),N); label("$r$",midpoint(midpoint(A--B)--B),N); label("$r$",midpoint(A--(-33.9112699,0)),N); label("$r$",midpoint(B--(10.2469508,0)),N); label("$x$",midpoint(midpoint(B--OB)--OB),E); label("$D$",midpoint(B--OB),E); [/asy]
[asy] size(500); pair A, C, OA, OC; C = (0,0); A = (-27.4954541697,0); OC = (0,-16); OA = (-27.4954541697,-4); draw(circle(OC,19)); draw(circle(OA,11)); draw((-48,0)--(24,0)); label("$l$",(-42,1),N); label("$A$",A,N); label("$C$",C,N); label("$O_A$",OA,S); label("$O_C$",OC,S); draw(A--OA); draw(C--OC); draw(OA--OC); draw(OA--(0,-4)); draw(OA--(-37.8877590151,0)); draw(OC--(10.2469508,0)); label("$30$",midpoint(OA--OC),S); label("$11$",midpoint(OA--(-37.8877590151,0)),S); label("$19$",midpoint(OC--(10.2469508,0)),E); label("$r$",midpoint(midpoint(A--C)--A),N); label("$r$",midpoint(midpoint(A--C)--C),N); label("$r$",midpoint(A--(-37.8877590151,0)),N); label("$r$",midpoint(C--(10.2469508,0)),N); label("$E$",(0,-4),E); [/asy]<|im_end|>
<|im_start|>assistant |
Let $ABCD$ be a parallelogram with $\angle BAD < 90^{\circ}$. A circle tangent to sides $\overline{DA}$, $\overline{AB}$, and $\overline{BC}$ intersects diagonal $\overline{AC}$ at points $P$ and $Q$ with $AP < AQ$, as shown. Suppose that $AP = 3$, $PQ = 9$, and $QC = 16$. Then the area of $ABCD$ can be expressed in the form $m\sqrt n$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$.
[asy] defaultpen(linewidth(0.6)+fontsize(11)); size(8cm); pair A,B,C,D,P,Q; A=(0,0); label("$A$", A, SW); B=(6,15); label("$B$", B, NW); C=(30,15); label("$C$", C, NE); D=(24,0); label("$D$", D, SE); P=(5.2,2.6); label("$P$", (5.8,2.6), N); Q=(18.3,9.1); label("$Q$", (18.1,9.7), W); draw(A--B--C--D--cycle); draw(C--A); draw(Circle((10.95,7.45), 7.45)); dot(A^^B^^C^^D^^P^^Q); [/asy] | Let $\omega$ be the circle, let $r$ be the radius of $\omega$, and let the points at which $\omega$ is tangent to $AB$, $BC$, and $AD$ be $H$, $K$, and $T$, respectively. PoP on $A$ and $C$ with respect to $\omega$ yields \[AT=6, CK=20.\]
Let $TG = AC, CG||AT.$
In $\triangle KGT$ $KT \perp BC,$ $KT = \sqrt{GT^2 – (KC + AT)^2} = 6 \sqrt{3}=2r.$
$\angle AOB = 90^{\circ}, OH \perp AB, OH = r = \frac{KT}{2},$ \[OH^2 = AH \cdot BH \implies BH = \frac {9}{2}.\]
Area is \[(BK + KC) \cdot KT = (BH + KC) \cdot 2r = \frac{49}{2} \cdot 6\sqrt{3} = 147 \sqrt{3} \implies 147+3 = \boxed{150}.\]
vladimir.shelomovskii@gmail.com, vvsss
~Steven Chen (www.professorchenedu.com) | 150 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $ABCD$ be a parallelogram with $\angle BAD < 90^{\circ}$. A circle tangent to sides $\overline{DA}$, $\overline{AB}$, and $\overline{BC}$ intersects diagonal $\overline{AC}$ at points $P$ and $Q$ with $AP < AQ$, as shown. Suppose that $AP = 3$, $PQ = 9$, and $QC = 16$. Then the area of $ABCD$ can be expressed in the form $m\sqrt n$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$.
[asy] defaultpen(linewidth(0.6)+fontsize(11)); size(8cm); pair A,B,C,D,P,Q; A=(0,0); label("$A$", A, SW); B=(6,15); label("$B$", B, NW); C=(30,15); label("$C$", C, NE); D=(24,0); label("$D$", D, SE); P=(5.2,2.6); label("$P$", (5.8,2.6), N); Q=(18.3,9.1); label("$Q$", (18.1,9.7), W); draw(A--B--C--D--cycle); draw(C--A); draw(Circle((10.95,7.45), 7.45)); dot(A^^B^^C^^D^^P^^Q); [/asy]<|im_end|>
<|im_start|>assistant |
For any finite set $X$, let $| X |$ denote the number of elements in $X$. Define \[ S_n = \sum | A \cap B | , \] where the sum is taken over all ordered pairs $(A, B)$ such that $A$ and $B$ are subsets of $\left\{ 1 , 2 , 3, \cdots , n \right\}$ with $|A| = |B|$. For example, $S_2 = 4$ because the sum is taken over the pairs of subsets \[ (A, B) \in \left\{ (\emptyset, \emptyset) , ( \{1\} , \{1\} ), ( \{1\} , \{2\} ) , ( \{2\} , \{1\} ) , ( \{2\} , \{2\} ) , ( \{1 , 2\} , \{1 , 2\} ) \right\} , \] giving $S_2 = 0 + 1 + 0 + 0 + 1 + 2 = 4$. Let $\frac{S_{2022}}{S_{2021}} = \frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find the remainder when $p + q$ is divided by 1000. | We take cases based on the number of values in each of the subsets in the pair. Suppose we have $k$ elements in each of the subsets in a pair (for a total of n elements in the set). The expected number of elements in any random pair will be $n \cdot \frac{k}{n} \cdot \frac{k}{n}$ by linearity of expectation because for each of the $n$ elements, there is a $\frac{k}{n}$ probability that the element will be chosen. To find the sum over all such values, we multiply this quantity by $\binom{n}{k}^2$. Summing, we get \[\sum_{k=1}^{n} \frac{k^2}{n} \binom{n}{k}^2\] Notice that we can rewrite this as \[\sum_{k=1}^{n} \frac{1}{n} \left(\frac{k \cdot n!}{(k)!(n - k)!}\right)^2 = \sum_{k=1}^{n} \frac{1}{n} n^2 \left(\frac{(n-1)!}{(k - 1)!(n - k)!}\right)^2 = n \sum_{k=1}^{n} \binom{n - 1}{k - 1}^2 = n \sum_{k=1}^{n} \binom{n - 1}{k - 1}\binom{n - 1}{n - k}\] We can simplify this using Vandermonde's identity to get $n \binom{2n - 2}{n - 1}$. Evaluating this for $2022$ and $2021$ gives \[\frac{2022\binom{4042}{2021}}{2021\binom{4040}{2020}} = \frac{2022 \cdot 4042 \cdot 4041}{2021^3} = \frac{2022 \cdot 2 \cdot 4041}{2021^2}\] Evaluating the numerators and denominators mod $1000$ gives $804 + 441 = 1\boxed{245}$
- pi_is_3.14 | 245 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
For any finite set $X$, let $| X |$ denote the number of elements in $X$. Define \[ S_n = \sum | A \cap B | , \] where the sum is taken over all ordered pairs $(A, B)$ such that $A$ and $B$ are subsets of $\left\{ 1 , 2 , 3, \cdots , n \right\}$ with $|A| = |B|$. For example, $S_2 = 4$ because the sum is taken over the pairs of subsets \[ (A, B) \in \left\{ (\emptyset, \emptyset) , ( \{1\} , \{1\} ), ( \{1\} , \{2\} ) , ( \{2\} , \{1\} ) , ( \{2\} , \{2\} ) , ( \{1 , 2\} , \{1 , 2\} ) \right\} , \] giving $S_2 = 0 + 1 + 0 + 0 + 1 + 2 = 4$. Let $\frac{S_{2022}}{S_{2021}} = \frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find the remainder when $p + q$ is divided by 1000.<|im_end|>
<|im_start|>assistant |
Let $S$ be the set of all rational numbers that can be expressed as a repeating decimal in the form $0.\overline{abcd},$ where at least one of the digits $a,$ $b,$ $c,$ or $d$ is nonzero. Let $N$ be the number of distinct numerators obtained when numbers in $S$ are written as fractions in lowest terms. For example, both $4$ and $410$ are counted among the distinct numerators for numbers in $S$ because $0.\overline{3636} = \frac{4}{11}$ and $0.\overline{1230} = \frac{410}{3333}.$ Find the remainder when $N$ is divided by $1000.$ | $0.abcd=\frac{\overline{abcd}}{9999}$, $9999=9\times 11\times 101$.
Then we need to find the number of positive integers less than $10000$ that can meet the requirement. Suppose the number is $x$.
Case $1$: $(9999, x)=1$. Clearly $x$ satisfies. \[\varphi \left( 9999 \right) =9999\times \left( 1-\frac{1}{3} \right) \times \left( 1-\frac{1}{11} \right) \times \left( 1-\frac{1}{101} \right)=6000\]
Case $2$: $3|x$ but $x$ is not a multiple of $11$ or $101.$ Then the least value of $abcd$ is $9x$, so that $x\le 1111$, $334$ values from $3$ to $1110.$
Case $3$: $11|x$ but $x$ is not a multiple of $3$ or $101$. Then the least value of $abcd$ is $11x$, so that $x\le 909$, $55$ values from $11$ to $902$.
Case $4$: $101|x$. None.
Case $5$: $3, 11|x$. Then the least value of $abcd$ is $11x$, $3$ values from $33$ to $99.$
To sum up, the answer is \[6000+334+55+3=\boxed{392}\] mod $1000$. | 392 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $S$ be the set of all rational numbers that can be expressed as a repeating decimal in the form $0.\overline{abcd},$ where at least one of the digits $a,$ $b,$ $c,$ or $d$ is nonzero. Let $N$ be the number of distinct numerators obtained when numbers in $S$ are written as fractions in lowest terms. For example, both $4$ and $410$ are counted among the distinct numerators for numbers in $S$ because $0.\overline{3636} = \frac{4}{11}$ and $0.\overline{1230} = \frac{410}{3333}.$ Find the remainder when $N$ is divided by $1000.$<|im_end|>
<|im_start|>assistant |
Given $\triangle ABC$ and a point $P$ on one of its sides, call line $\ell$ the $\textit{splitting line}$ of $\triangle ABC$ through $P$ if $\ell$ passes through $P$ and divides $\triangle ABC$ into two polygons of equal perimeter. Let $\triangle ABC$ be a triangle where $BC = 219$ and $AB$ and $AC$ are positive integers. Let $M$ and $N$ be the midpoints of $\overline{AB}$ and $\overline{AC},$ respectively, and suppose that the splitting lines of $\triangle ABC$ through $M$ and $N$ intersect at $30^\circ.$ Find the perimeter of $\triangle ABC.$ | We wish to solve the Diophantine equation $a^2+ab+b^2=3^2 \cdot 73^2$. It can be shown that $3|a$ and $3|b$, so we make the substitution $a=3x$ and $b=3y$ to obtain $x^2+xy+y^2=73^2$ as our new equation to solve for.
Notice that $r^2+r+1=(r-\omega)(r-{\omega}^2)$, where $\omega=e^{i\frac{2\pi}{3}}$. Thus, \[x^2+xy+y^2 = y^2((x/y)^2+(x/y)+1) = y^2 (\frac{x}{y}-\omega)(\frac{x}{y}-{\omega}^2) = (x-y\omega)(x-y{\omega}^2).\]
Note that $8^2+1^2+8 \cdot 1=73$. Thus, $(8-\omega)(8-{\omega}^2)=73$. Squaring both sides yields \begin{align} (8-\omega)^2(8-{\omega}^2)^2&=73^2\\ (63-17\omega)(63-17{\omega}^2)&=73^2. \end{align} Thus, by $(2)$, $(63, 17)$ is a solution to $x^2+xy+y^2=73^2$. This implies that $a=189$ and $b=51$, so our final answer is $189+51+219=\boxed{459}$.
~ Leo.Euler | 459 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Given $\triangle ABC$ and a point $P$ on one of its sides, call line $\ell$ the $\textit{splitting line}$ of $\triangle ABC$ through $P$ if $\ell$ passes through $P$ and divides $\triangle ABC$ into two polygons of equal perimeter. Let $\triangle ABC$ be a triangle where $BC = 219$ and $AB$ and $AC$ are positive integers. Let $M$ and $N$ be the midpoints of $\overline{AB}$ and $\overline{AC},$ respectively, and suppose that the splitting lines of $\triangle ABC$ through $M$ and $N$ intersect at $30^\circ.$ Find the perimeter of $\triangle ABC.$<|im_end|>
<|im_start|>assistant |
Let $x,$ $y,$ and $z$ be positive real numbers satisfying the system of equations: \begin{align*} \sqrt{2x-xy} + \sqrt{2y-xy} &= 1 \\ \sqrt{2y-yz} + \sqrt{2z-yz} &= \sqrt2 \\ \sqrt{2z-zx} + \sqrt{2x-zx} &= \sqrt3. \end{align*} Then $\left[ (1-x)(1-y)(1-z) \right]^2$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | Let $1-x=a;1-y=b;1-z=c$, rewrite those equations
$\sqrt{(1-a)(1+b)}+\sqrt{(1+a)(1-b)}=1$;
$\sqrt{(1-b)(1+c)}+\sqrt{(1+b)(1-c)}=\sqrt{2}$
$\sqrt{(1-a)(1+c)}+\sqrt{(1-c)(1+a)}=\sqrt{3}$
square both sides, get three equations:
$2ab-1=2\sqrt{(1-a^2)(1-b^2)}$
$2bc=2\sqrt{(1-b^2)(1-c^2)}$
$2ac+1=2\sqrt{(1-c^2)(1-a^2)}$
Getting that $a^2+b^2-ab=\frac{3}{4}$
$b^2+c^2=1$
$a^2+c^2+ac=\frac{3}{4}$
Subtract first and third equation, getting $(b+c)(b-c)=a(b+c)$, $a=b-c$
Put it in first equation, getting $b^2-2bc+c^2+b^2-b(b-c)=b^2+c^2-bc=\frac{3}{4}$, $bc=\frac{1}{4}$
Since $a^2=b^2+c^2-2bc=\frac{1}{2}$, the final answer is $\frac{1}{4}*\frac{1}{4}*\frac{1}{2}=\frac{1}{32}$ the final answer is $\boxed{033}$
~bluesoul | 33 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $x,$ $y,$ and $z$ be positive real numbers satisfying the system of equations: \begin{align*} \sqrt{2x-xy} + \sqrt{2y-xy} &= 1 \\ \sqrt{2y-yz} + \sqrt{2z-yz} &= \sqrt2 \\ \sqrt{2z-zx} + \sqrt{2x-zx} &= \sqrt3. \end{align*} Then $\left[ (1-x)(1-y)(1-z) \right]^2$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$<|im_end|>
<|im_start|>assistant |
Adults made up $\frac5{12}$ of the crowd of people at a concert. After a bus carrying $50$ more people arrived, adults made up $\frac{11}{25}$ of the people at the concert. Find the minimum number of adults who could have been at the concert after the bus arrived. | Let $x$ be the number of people at the party before the bus arrives. We know that $x\equiv 0\pmod {12}$, as $\frac{5}{12}$ of people at the party before the bus arrives are adults. Similarly, we know that $x + 50 \equiv 0 \pmod{25}$, as $\frac{11}{25}$ of the people at the party are adults after the bus arrives. $x + 50 \equiv 0 \pmod{25}$ can be reduced to $x \equiv 0 \pmod{25}$, and since we are looking for the minimum amount of people, $x$ is $300$. That means there are $350$ people at the party after the bus arrives, and thus there are $350 \cdot \frac{11}{25} = \boxed{154}$ adults at the party.
~eamo | 154 | 2 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Adults made up $\frac5{12}$ of the crowd of people at a concert. After a bus carrying $50$ more people arrived, adults made up $\frac{11}{25}$ of the people at the concert. Find the minimum number of adults who could have been at the concert after the bus arrived.<|im_end|>
<|im_start|>assistant |
Azar, Carl, Jon, and Sergey are the four players left in a singles tennis tournament. They are randomly assigned opponents in the semifinal matches, and the winners of those matches play each other in the final match to determine the winner of the tournament. When Azar plays Carl, Azar will win the match with probability $\frac23$. When either Azar or Carl plays either Jon or Sergey, Azar or Carl will win the match with probability $\frac34$. Assume that outcomes of different matches are independent. The probability that Carl will win the tournament is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. | Let $A$ be Azar, $C$ be Carl, $J$ be Jon, and $S$ be Sergey. The $4$ circles represent the $4$ players, and the arrow is from the winner to the loser with the winning probability as the label.
This problem can be solved by using $2$ cases.
$\textbf{Case 1:}$ $C$'s opponent for the semifinal is $A$
The probability $C$'s opponent is $A$ is $\frac13$. Therefore the probability $C$ wins the semifinal in this case is $\frac13 \cdot \frac13$. The other semifinal game is played between $J$ and $S$, it doesn't matter who wins because $C$ has the same probability of winning either one. The probability of $C$ winning in the final is $\frac34$, so the probability of $C$ winning the tournament in case 1 is $\frac13 \cdot \frac13 \cdot \frac34$
$\textbf{Case 2:}$ $C$'s opponent for the semifinal is $J$ or $S$
It doesn't matter if $C$'s opponent is $J$ or $S$ because $C$ has the same probability of winning either one. The probability $C$'s opponent is $J$ or $S$ is $\frac23$. Therefore the probability $C$ wins the semifinal in this case is $\frac23 \cdot \frac34$. The other semifinal game is played between $A$ and $J$ or $S$. In this case it matters who wins in the other semifinal game because the probability of $C$ winning $A$ and $J$ or $S$ is different.
$\textbf{Case 2.1:}$ $C$'s opponent for the final is $A$
For this to happen, $A$ must have won $J$ or $S$ in the semifinal, the probability is $\frac34$. Therefore, the probability that $C$ won $A$ in the final is $\frac34 \cdot \frac13$.
$\textbf{Case 2.1:}$ $C$'s opponent for the final is $J$ or $S$
For this to happen, $J$ or $S$ must have won $A$ in the semifinal, the probability is $\frac14$. Therefore, the probability that $C$ won $J$ or $S$ in the final is $\frac14 \cdot \frac34$.
In Case 2 the probability of $C$ winning the tournament is $\frac23 \cdot \frac34 \cdot (\frac34 \cdot \frac13 + \frac14 \cdot \frac34)$
Adding case 1 and case 2 together we get $\frac13 \cdot \frac13 \cdot \frac34 + \frac23 \cdot \frac34 \cdot (\frac34 \cdot \frac13 + \frac14 \cdot \frac34) = \frac{29}{96},$ so the answer is $29 + 96 = \boxed{125}$.
~isabelchen | 125 | 2 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Azar, Carl, Jon, and Sergey are the four players left in a singles tennis tournament. They are randomly assigned opponents in the semifinal matches, and the winners of those matches play each other in the final match to determine the winner of the tournament. When Azar plays Carl, Azar will win the match with probability $\frac23$. When either Azar or Carl plays either Jon or Sergey, Azar or Carl will win the match with probability $\frac34$. Assume that outcomes of different matches are independent. The probability that Carl will win the tournament is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.<|im_end|>
<|im_start|>assistant |
A right square pyramid with volume $54$ has a base with side length $6.$ The five vertices of the pyramid all lie on a sphere with radius $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | Although I can't draw the exact picture of this problem, but it is quite easy to imagine that four vertices of the base of this pyramid is on a circle (Radius $\frac{6}{\sqrt{2}} = 3\sqrt{2}$). Since all five vertices are on the sphere, the distances of the spherical center and the vertices are the same: $l$. Because of the symmetrical property of the pyramid, we can imagine that the line of the apex and the (sphere's) center will intersect the square at the (base's) center.
Since the volume is $54 = \frac{1}{3} \cdot S \cdot h = \frac{1}{3} \cdot 6^2 \cdot h$, where $h=\frac{9}{2}$ is the height of this pyramid, we have: $l^2=\left(\frac{9}{2}-l\right)^2+\left(3\sqrt{2}\right)^2$ according to the Pythagorean theorem.
Solve this equation will give us $l = \frac{17}{4},$ therefore $m+n=\boxed{21}.$
~DSAERF-CALMIT (https://binaryphi.site) | 21 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
A right square pyramid with volume $54$ has a base with side length $6.$ The five vertices of the pyramid all lie on a sphere with radius $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.<|im_end|>
<|im_start|>assistant |
There is a positive real number $x$ not equal to either $\tfrac{1}{20}$ or $\tfrac{1}{2}$ such that\[\log_{20x} (22x)=\log_{2x} (202x).\]The value $\log_{20x} (22x)$ can be written as $\log_{10} (\tfrac{m}{n})$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | By the change of base rule, we have $\frac{\log 22x}{\log 20x}=\frac{\log 202x}{\log 2x}$, or $\frac{\log 22 +\log x}{\log 20 +\log x}=\frac{\log 202 +\log x}{\log 2 +\log x}=k$. We also know that if $a/b=c/d$, then this also equals $\frac{a-b}{c-d}$. We use this identity and find that $k=\frac{\log 202 -\log 22}{\log 2 -\log 20}=-\log\frac{202}{22}=\log\frac{11}{101}$. The requested sum is $11+101=\boxed{112}.$
~MathIsFun286
~Hayabusa1 | 112 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
There is a positive real number $x$ not equal to either $\tfrac{1}{20}$ or $\tfrac{1}{2}$ such that\[\log_{20x} (22x)=\log_{2x} (202x).\]The value $\log_{20x} (22x)$ can be written as $\log_{10} (\tfrac{m}{n})$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.<|im_end|>
<|im_start|>assistant |
Twenty distinct points are marked on a circle and labeled $1$ through $20$ in clockwise order. A line segment is drawn between every pair of points whose labels differ by a prime number. Find the number of triangles formed whose vertices are among the original $20$ points. | Let $a$, $b$, and $c$ be the vertex of a triangle that satisfies this problem, where $a > b > c$. \[a - b = p_1\] \[b - c = p_2\] \[a - c = p_3\]
$p_3 = a - c = a - b + b - c = p_1 + p_2$. Because $p_3$ is the sum of two primes, $p_1$ and $p_2$, $p_1$ or $p_2$ must be $2$. Let $p_1 = 2$, then $p_3 = p_2 + 2$. There are only $8$ primes less than $20$: $2, 3, 5, 7, 11, 13, 17, 19$. Only $3, 5, 11, 17$ plus $2$ equals another prime. $p_2 \in \{ 3, 5, 11, 17 \}$.
Once $a$ is determined, $a = b+2$ and $b = c + p_2$. There are $18$ values of $b$ where $b+2 \le 20$, and $4$ values of $p_2$. Therefore the answer is $18 \cdot 4 = \boxed{072}$
~isabelchen | 72 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Twenty distinct points are marked on a circle and labeled $1$ through $20$ in clockwise order. A line segment is drawn between every pair of points whose labels differ by a prime number. Find the number of triangles formed whose vertices are among the original $20$ points.<|im_end|>
<|im_start|>assistant |
Let $x_1\leq x_2\leq \cdots\leq x_{100}$ be real numbers such that $|x_1| + |x_2| + \cdots + |x_{100}| = 1$ and $x_1 + x_2 + \cdots + x_{100} = 0$. Among all such $100$-tuples of numbers, the greatest value that $x_{76} - x_{16}$ can achieve is $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. | To find the greatest value of $x_{76} - x_{16}$, $x_{76}$ must be as large as possible, and $x_{16}$ must be as small as possible. If $x_{76}$ is as large as possible, $x_{76} = x_{77} = x_{78} = \dots = x_{100} > 0$. If $x_{16}$ is as small as possible, $x_{16} = x_{15} = x_{14} = \dots = x_{1} < 0$. The other numbers between $x_{16}$ and $x_{76}$ equal to $0$. Let $a = x_{76}$, $b = x_{16}$. Substituting $a$ and $b$ into $|x_1| + |x_2| + \cdots + |x_{100}| = 1$ and $x_1 + x_2 + \cdots + x_{100} = 0$ we get: \[25a - 16b = 1\] \[25a + 16b = 0\] $a = \frac{1}{50}$, $b = -\frac{1}{32}$
$x_{76} - x_{16} = a - b = \frac{1}{50} + \frac{1}{32} = \frac{41}{800}$. $m+n = \boxed{841}$
~isabelchen | 841 | 5.25 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $x_1\leq x_2\leq \cdots\leq x_{100}$ be real numbers such that $|x_1| + |x_2| + \cdots + |x_{100}| = 1$ and $x_1 + x_2 + \cdots + x_{100} = 0$. Among all such $100$-tuples of numbers, the greatest value that $x_{76} - x_{16}$ can achieve is $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.<|im_end|>
<|im_start|>assistant |
A circle with radius $6$ is externally tangent to a circle with radius $24$. Find the area of the triangular region bounded by the three common tangent lines of these two circles. | [asy] //Created by isabelchen size(12cm, 12cm); draw(circle((0,0),24)); draw(circle((30,0),6)); draw((72/5, 96/5) -- (40,0)); draw((72/5, -96/5) -- (40,0)); draw((24, 12) -- (24, -12)); draw((0, 0) -- (40, 0)); draw((72/5, 96/5) -- (0,0)); draw((168/5, 24/5) -- (30,0)); draw((54/5, 72/5) -- (30,0)); dot((72/5, 96/5)); label("$A$",(72/5, 96/5),NE); dot((168/5, 24/5)); label("$B$",(168/5, 24/5),NE); dot((24,0)); label("$C$",(24,0),NW); dot((40, 0)); label("$D$",(40, 0),NE); dot((24, 12)); label("$E$",(24, 12),NE); dot((24, -12)); label("$F$",(24, -12),SE); dot((54/5, 72/5)); label("$G$",(54/5, 72/5),NW); dot((0, 0)); label("$O_1$",(0, 0),S); dot((30, 0)); label("$O_2$",(30, 0),S); [/asy]
$r_1 = O_1A = 24$, $r_2 = O_2B = 6$, $AG = BO_2 = r_2 = 6$, $O_1G = r_1 - r_2 = 24 - 6 = 18$, $O_1O_2 = r_1 + r_2 = 30$
$\triangle O_2BD \sim \triangle O_1GO_2$, $\frac{O_2D}{O_1O_2} = \frac{BO_2}{GO_1}$, $\frac{O_2D}{30} = \frac{6}{18}$, $O_2D = 10$
$CD = O_2D + r_1 = 10 + 6 = 16$,
$EF = 2EC = EA + EB = AB = GO_2 = \sqrt{(O_1O_2)^2-(O_1G)^2} = \sqrt{30^2-18^2} = 24$
$DEF = \frac12 \cdot EF \cdot CD = \frac12 \cdot 24 \cdot 16 = \boxed{192}$
~isabelchen | 192 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
A circle with radius $6$ is externally tangent to a circle with radius $24$. Find the area of the triangular region bounded by the three common tangent lines of these two circles.<|im_end|>
<|im_start|>assistant |
Find the number of positive integers $n \le 600$ whose value can be uniquely determined when the values of $\left\lfloor \frac n4\right\rfloor$, $\left\lfloor\frac n5\right\rfloor$, and $\left\lfloor\frac n6\right\rfloor$ are given, where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to the real number $x$. | 1. For $n$ to be uniquely determined, $n$ AND $n + 1$ both need to be a multiple of $4, 5,$ or $6.$ Since either $n$ or $n + 1$ is odd, we know that either $n$ or $n + 1$ has to be a multiple of $5.$ We can state the following cases:
1. $n$ is a multiple of $4$ and $n+1$ is a multiple of $5$
2. $n$ is a multiple of $6$ and $n+1$ is a multiple of $5$
3. $n$ is a multiple of $5$ and $n+1$ is a multiple of $4$
4. $n$ is a multiple of $5$ and $n+1$ is a multiple of $6$
Solving for each case, we see that there are $30$ possibilities for cases 1 and 3 each, and $20$ possibilities for cases 2 and 4 each. However, we over-counted the cases where
1. $n$ is a multiple of $24$ and $n+1$ is a multiple of $5$
2. $n$ is a multiple of $5$ and $n+1$ is a multiple of $24$
Each case has $10$ possibilities.
Adding all the cases and correcting for over-counting, we get $30 + 20 + 30 + 20 - 10 - 10 = \boxed{080}.$
~Lucasfunnyface | 80 | 3.875 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of positive integers $n \le 600$ whose value can be uniquely determined when the values of $\left\lfloor \frac n4\right\rfloor$, $\left\lfloor\frac n5\right\rfloor$, and $\left\lfloor\frac n6\right\rfloor$ are given, where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to the real number $x$.<|im_end|>
<|im_start|>assistant |
Let $\ell_A$ and $\ell_B$ be two distinct perpendicular lines. For positive integers $m$ and $n$, distinct points $A_1, A_2, \allowbreak A_3, \allowbreak \ldots, \allowbreak A_m$ lie on $\ell_A$, and distinct points $B_1, B_2, B_3, \ldots, B_n$ lie on $\ell_B$. Additionally, when segments $\overline{A_iB_j}$ are drawn for all $i=1,2,3,\ldots, m$ and $j=1,\allowbreak 2,\allowbreak 3, \ldots, \allowbreak n$, no point strictly between $\ell_A$ and $\ell_B$ lies on more than 1 of the segments. Find the number of bounded regions into which this figure divides the plane when $m=7$ and $n=5$. The figure shows that there are 8.0 regions when $m=3$ and $n=2$ [asy] import geometry; size(10cm); draw((-2,0)--(13,0)); draw((0,4)--(10,4)); label("$\ell_A$",(-2,0),W); label("$\ell_B$",(0,4),W); point A1=(0,0),A2=(5,0),A3=(11,0),B1=(2,4),B2=(8,4),I1=extension(B1,A2,A1,B2),I2=extension(B1,A3,A1,B2),I3=extension(B1,A3,A2,B2); draw(B1--A1--B2); draw(B1--A2--B2); draw(B1--A3--B2); label("$A_1$",A1,S); label("$A_2$",A2,S); label("$A_3$",A3,S); label("$B_1$",B1,N); label("$B_2$",B2,N); label("1",centroid(A1,B1,I1)); label("2",centroid(B1,I1,I3)); label("3",centroid(B1,B2,I3)); label("4",centroid(A1,A2,I1)); label("5",(A2+I1+I2+I3)/4); label("6",centroid(B2,I2,I3)); label("7",centroid(A2,A3,I2)); label("8",centroid(A3,B2,I2)); dot(A1); dot(A2); dot(A3); dot(B1); dot(B2); [/asy] | We want to derive a general function $f(m,n)$ that indicates the number of bounded regions. Observing symmetry, we know this is a symmetric function about $m$ and $n$. Now let's focus on $f(m+1, n)-f(m, n)$, which is the difference caused by adding one point to the existing $m$ points of line $\ell_A$. This new point, call it #m, when connected to point #1 on $\ell_B$, crosses $m*(n-1)$ lines, thus making additional $m*(n-1)+1$ bounded regions; when connected to point #2 on $\ell_B$, it crosses $m*(n-2)$ lines, thus making additional $m*(n-2)+1$ bounded regions; etc. By simple algebra/recursion methods, we see
$f(m+1, n)-f(m, n)=m*\frac{n(n-1)}{2} +n$
Notice $f(1,n)=n-1$. Not very difficult to figure out:
$f(m, n)=\frac{m(m-1)n(n-1)}{4} +mn-1$
The fact that $f(3,2)=8$ makes us more confident about the formula. Now plug in $m=5, n=7$, we get the final answer of $\boxed{244}$. | 244 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $\ell_A$ and $\ell_B$ be two distinct perpendicular lines. For positive integers $m$ and $n$, distinct points $A_1, A_2, \allowbreak A_3, \allowbreak \ldots, \allowbreak A_m$ lie on $\ell_A$, and distinct points $B_1, B_2, B_3, \ldots, B_n$ lie on $\ell_B$. Additionally, when segments $\overline{A_iB_j}$ are drawn for all $i=1,2,3,\ldots, m$ and $j=1,\allowbreak 2,\allowbreak 3, \ldots, \allowbreak n$, no point strictly between $\ell_A$ and $\ell_B$ lies on more than 1 of the segments. Find the number of bounded regions into which this figure divides the plane when $m=7$ and $n=5$. The figure shows that there are 8.0 regions when $m=3$ and $n=2$ [asy] import geometry; size(10cm); draw((-2,0)--(13,0)); draw((0,4)--(10,4)); label("$\ell_A$",(-2,0),W); label("$\ell_B$",(0,4),W); point A1=(0,0),A2=(5,0),A3=(11,0),B1=(2,4),B2=(8,4),I1=extension(B1,A2,A1,B2),I2=extension(B1,A3,A1,B2),I3=extension(B1,A3,A2,B2); draw(B1--A1--B2); draw(B1--A2--B2); draw(B1--A3--B2); label("$A_1$",A1,S); label("$A_2$",A2,S); label("$A_3$",A3,S); label("$B_1$",B1,N); label("$B_2$",B2,N); label("1",centroid(A1,B1,I1)); label("2",centroid(B1,I1,I3)); label("3",centroid(B1,B2,I3)); label("4",centroid(A1,A2,I1)); label("5",(A2+I1+I2+I3)/4); label("6",centroid(B2,I2,I3)); label("7",centroid(A2,A3,I2)); label("8",centroid(A3,B2,I2)); dot(A1); dot(A2); dot(A3); dot(B1); dot(B2); [/asy]<|im_end|>
<|im_start|>assistant |
Find the remainder when\[\binom{\binom{3}{2}}{2} + \binom{\binom{4}{2}}{2} + \dots + \binom{\binom{40}{2}}{2}\]is divided by $1000$.
~ pi_is_3.14 | Doing simple algebra calculation will give the following equation: \begin{align*} \binom{\binom{n}{2}}{2} = \frac{\frac{n(n-1)}{2} \cdot (\frac{n(n-1)}{2}-1)}{2} \\ = \frac{n(n-1)(n^2-n-2)}{8} \\ = \frac{(n+1)n(n-1)(n-2)}{8} \\ = \frac{(n+1)!}{8\cdot (n-3)!} = 3 \cdot \frac{(n+1)!}{4!\cdot (n-3)!} \\ = 3 \binom{n+1}{4} \end{align*}
Next, by using Hockey-Stick Identity, we have: \[3 \cdot \sum_{i=3}^{40} \binom{n+1}{4} = 3 \binom{42}{5} = 42 \cdot 41 \cdot 39 \cdot 38\] \[=(40^2-2^2)(40^2-1^2) \equiv \boxed{004} (mod 1000)\]
~DSAERF-CALMIT (https://binaryphi.site) | 4 | 4.375 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the remainder when\[\binom{\binom{3}{2}}{2} + \binom{\binom{4}{2}}{2} + \dots + \binom{\binom{40}{2}}{2}\]is divided by $1000$.
~ pi_is_3.14<|im_end|>
<|im_start|>assistant |
Let $ABCD$ be a convex quadrilateral with $AB=2$, $AD=7$, and $CD=3$ such that the bisectors of acute angles $\angle{DAB}$ and $\angle{ADC}$ intersect at the midpoint of $\overline{BC}$. Find the square of the area of $ABCD$. | 2022 AIME II Q11(Hand-drawn picture)
According to the problem, we have $AB=AB'=2$, $DC=DC'=3$, $MB=MB'$, $MC=MC'$, and $B'C'=7-2-3=2$
Because $M$ is the midpoint of $BC$, we have $BM=MC$, so: \[MB=MB'=MC'=MC.\]
Then, we can see that $\bigtriangleup{MB'C'}$ is an isosceles triangle with $MB'=MC'$
Therefore, we could start our angle chasing: $\angle{MB'C'}=\angle{MC'B'}=180^\circ-\angle{MC'D}=180^\circ-\angle{MCD}$.
This is when we found that points $M$, $C$, $D$, and $B'$ are on a circle. Thus, $\angle{BMB'}=\angle{CDC'} \Rightarrow \angle{B'MA}=\angle{C'DM}$. This is the time we found that $\bigtriangleup{AB'M} \sim \bigtriangleup{MC'D}$.
Thus, $\frac{AB'}{B'M}=\frac{MC'}{C'D} \Longrightarrow (B'M)^2=AB' \cdot C'D = 6$
Point $H$ is the midpoint of $B'C'$, and $MH \perp AD$. $B'H=HC'=1 \Longrightarrow MH=\sqrt{B'M^2-B'H^2}=\sqrt{6-1}=\sqrt{5}$.
The area of this quadrilateral is the sum of areas of triangles: \[S_{\bigtriangleup{ABM}}+S_{\bigtriangleup{AB'M}}+S_{\bigtriangleup{CDM}}+S_{\bigtriangleup{CD'M}}+S_{\bigtriangleup{B'C'M}}\] \[=S_{\bigtriangleup{AB'M}}\cdot 2 + S_{\bigtriangleup{B'C'M}} + S_{\bigtriangleup{C'DM}}\cdot 2\] \[=2 \cdot \frac{1}{2} \cdot AB' \cdot MH + \frac{1}{2} \cdot B'C' \cdot MH + 2 \cdot \frac{1}{2} \cdot C'D \cdot MH\] \[=2\sqrt{5}+\sqrt{5}+3\sqrt{5}=6\sqrt{5}\]
Finally, the square of the area is $(6\sqrt{5})^2=\boxed{180}$
~DSAERF-CALMIT (https://binaryphi.site) | 180 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $ABCD$ be a convex quadrilateral with $AB=2$, $AD=7$, and $CD=3$ such that the bisectors of acute angles $\angle{DAB}$ and $\angle{ADC}$ intersect at the midpoint of $\overline{BC}$. Find the square of the area of $ABCD$.<|im_end|>
<|im_start|>assistant |
Let $a, b, x,$ and $y$ be real numbers with $a>4$ and $b>1$ such that\[\frac{x^2}{a^2}+\frac{y^2}{a^2-16}=\frac{(x-20)^2}{b^2-1}+\frac{(y-11)^2}{b^2}=1.\]Find the least possible value of $a+b.$ | Denote $P = \left( x , y \right)$.
Because $\frac{x^2}{a^2}+\frac{y^2}{a^2-16} = 1$, $P$ is on an ellipse whose center is $\left( 0 , 0 \right)$ and foci are $\left( - 4 , 0 \right)$ and $\left( 4 , 0 \right)$.
Hence, the sum of distance from $P$ to $\left( - 4 , 0 \right)$ and $\left( 4 , 0 \right)$ is equal to twice the semi-major axis of this ellipse, $2a$.
Because $\frac{(x-20)^2}{b^2-1}+\frac{(y-11)^2}{b^2} = 1$, $P$ is on an ellipse whose center is $\left( 20 , 11 \right)$ and foci are $\left( 20 , 10 \right)$ and $\left( 20 , 12 \right)$.
Hence, the sum of distance from $P$ to $\left( 20 , 10 \right)$ and $\left( 20 , 12 \right)$ is equal to twice the semi-major axis of this ellipse, $2b$.
Therefore, $2a + 2b$ is the sum of the distance from $P$ to four foci of these two ellipses. To make this minimized, $P$ is the intersection point of the line that passes through $\left( - 4 , 0 \right)$ and $\left( 20 , 10 \right)$, and the line that passes through $\left( 4 , 0 \right)$ and $\left( 20 , 12 \right)$.
The distance between $\left( - 4 , 0 \right)$ and $\left( 20 , 10 \right)$ is $\sqrt{\left( 20 + 4 \right)^2 + \left( 10 - 0 \right)^2} = 26$.
The distance between $\left( 4 , 0 \right)$ and $\left( 20 , 12 \right)$ is $\sqrt{\left( 20 - 4 \right)^2 + \left( 12 - 0 \right)^2} = 20$.
Hence, $2 a + 2 b = 26 + 20 = 46$.
Therefore, $a + b >= 23$.
The straight line connecting the points $\left(–4, 0 \right)$ and $\left(20, 10 \right)$ has the equation $5x+20=12y$. The straight line connecting the points $\left(4, 0 \right)$ and $\left(20, 12 \right)$ has the equation $3x-12=4y$. These lines intersect at the point $\left(14, 15/2 \right)$. This point satisfies both equations for $a = 16, b = 7$. Hence, $a + b = 23$ is possible.
Therefore, $a + b = \boxed{023}.$
~Steven Chen (www.professorchenedu.com) | 23 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $a, b, x,$ and $y$ be real numbers with $a>4$ and $b>1$ such that\[\frac{x^2}{a^2}+\frac{y^2}{a^2-16}=\frac{(x-20)^2}{b^2-1}+\frac{(y-11)^2}{b^2}=1.\]Find the least possible value of $a+b.$<|im_end|>
<|im_start|>assistant |
There is a polynomial $P(x)$ with integer coefficients such that\[P(x)=\frac{(x^{2310}-1)^6}{(x^{105}-1)(x^{70}-1)(x^{42}-1)(x^{30}-1)}\]holds for every $0<x<1.$ Find the coefficient of $x^{2022}$ in $P(x)$. | Note that $2022 = 210\cdot 9 +132$. Since the only way to express $132$ in terms of $105$, $70$, $42$, or $30$ is $135 = 30+30+30+42$, we are essentially just counting the number of ways to express $210*9$ in terms of these numbers. Since $210 = 2*105=3*70=5*42=7*30$, it can only be expressed as a sum in terms of only one of the numbers ($105$, $70$, $42$, or $30$). Thus, the answer is (by sticks and stones) \[\binom{12}{3} = \boxed{220}\]
~Bigbrain123 | 220 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
There is a polynomial $P(x)$ with integer coefficients such that\[P(x)=\frac{(x^{2310}-1)^6}{(x^{105}-1)(x^{70}-1)(x^{42}-1)(x^{30}-1)}\]holds for every $0<x<1.$ Find the coefficient of $x^{2022}$ in $P(x)$.<|im_end|>
<|im_start|>assistant |
For positive integers $a$, $b$, and $c$ with $a < b < c$, consider collections of postage stamps in denominations $a$, $b$, and $c$ cents that contain at least one stamp of each denomination. If there exists such a collection that contains sub-collections worth every whole number of cents up to $1000$ cents, let $f(a, b, c)$ be the minimum number of stamps in such a collection. Find the sum of the three least values of $c$ such that $f(a, b, c) = 97$ for some choice of $a$ and $b$. | Notice that we must have $a = 1$, otherwise $1$ cent stamp cannot be represented. At least $b-1$ numbers of $1$ cent stamps are needed to represent the values less than $b$. Using at most $c-1$ stamps of value $1$ and $b$, it can have all the values from $1$ to $c-1$ cents. Plus $\lfloor \frac{999}{c} \rfloor$ stamps of value $c$, every value up to $1000$ can be represented. Therefore using $\lfloor \frac{999}{c} \rfloor$ stamps of value $c$, $\lfloor \frac{c-1}{b} \rfloor$ stamps of value $b$, and $b-1$ stamps of value $1$, all values up to $1000$ can be represented in sub-collections, while minimizing the number of stamps.
So, $f(a, b, c) = \lfloor \frac{999}{c} \rfloor + \lfloor \frac{c-1}{b} \rfloor + b-1$, $b<c-1$
$\lfloor \frac{999}{c} \rfloor + \lfloor \frac{c-1}{b} \rfloor + b-1 = 97$. We can get the answer by solving this equation.
$c > \lfloor \frac{c-1}{b} \rfloor + b-1$
$\frac{999}{c} + c > \lfloor \frac{999}{c} \rfloor + \lfloor \frac{c-1}{b} \rfloor + b-1 = 97$
$c^2 - 97c + 999 > 0$, $c > 85.3$ or $c < 11.7$
$\lfloor \frac{999}{c} \rfloor + \lfloor \frac{c-1}{b} \rfloor + b-1 > \frac{999}{c}$
$97 > \frac{999}{c}$, $c>10.3$
$\textbf{Case 1:}$ For $10.3 < c < 11.7$, $c = 11$, $\lfloor \frac{999}{11} \rfloor + \lfloor \frac{10}{b} \rfloor + b-1 = 97$
$\lfloor \frac{10}{b} \rfloor + b = 8$, $b=7$
$\textbf{Case 2:}$ For $c>85.3$,
$\textbf{Case 2.1:}$ $c = 86$, $\lfloor \frac{999}{86} \rfloor + \lfloor \frac{85}{b} \rfloor + b-1 = 97$
$\lfloor \frac{85}{b} \rfloor + b = 87$, $b=87 > c$, no solution
$\textbf{Case 2.2:}$ $c = 87$, $\lfloor \frac{999}{87} \rfloor + \lfloor \frac{86}{b} \rfloor + b-1 = 97$
$\lfloor \frac{86}{b} \rfloor + b = 87$, $b=86$ or $1$, neither values satisfy $a < b < c-1$, no solution
$\textbf{Case 2.3:}$ $c = 88$, $\lfloor \frac{999}{88} \rfloor + \lfloor \frac{87}{b} \rfloor + b-1 = 97$
$\lfloor \frac{87}{b} \rfloor + b = 87$, $b=86$
$\textbf{Case 2.4:}$ $c = 89$, $\lfloor \frac{999}{89} \rfloor + \lfloor \frac{88}{b} \rfloor + b-1 = 97$
$\lfloor \frac{88}{b} \rfloor + b = 87$, $b=86$
The $3$ least values of $c$ are $11$, $88$, $89$. $11 + 88+ 89 = \boxed{188}$
~isabelchen | 188 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
For positive integers $a$, $b$, and $c$ with $a < b < c$, consider collections of postage stamps in denominations $a$, $b$, and $c$ cents that contain at least one stamp of each denomination. If there exists such a collection that contains sub-collections worth every whole number of cents up to $1000$ cents, let $f(a, b, c)$ be the minimum number of stamps in such a collection. Find the sum of the three least values of $c$ such that $f(a, b, c) = 97$ for some choice of $a$ and $b$.<|im_end|>
<|im_start|>assistant |
Two externally tangent circles $\omega_1$ and $\omega_2$ have centers $O_1$ and $O_2$, respectively. A third circle $\Omega$ passing through $O_1$ and $O_2$ intersects $\omega_1$ at $B$ and $C$ and $\omega_2$ at $A$ and $D$, as shown. Suppose that $AB = 2$, $O_1O_2 = 15$, $CD = 16$, and $ABO_1CDO_2$ is a convex hexagon. Find the area of this hexagon. [asy] import geometry; size(10cm); point O1=(0,0),O2=(15,0),B=9*dir(30); circle w1=circle(O1,9),w2=circle(O2,6),o=circle(O1,O2,B); point A=intersectionpoints(o,w2)[1],D=intersectionpoints(o,w2)[0],C=intersectionpoints(o,w1)[0]; filldraw(A--B--O1--C--D--O2--cycle,0.2*red+white,black); draw(w1); draw(w2); draw(O1--O2,dashed); draw(o); dot(O1); dot(O2); dot(A); dot(D); dot(C); dot(B); label("$\omega_1$",8*dir(110),SW); label("$\omega_2$",5*dir(70)+(15,0),SE); label("$O_1$",O1,W); label("$O_2$",O2,E); label("$B$",B,N+1/2*E); label("$A$",A,N+1/2*W); label("$C$",C,S+1/4*W); label("$D$",D,S+1/4*E); label("$15$",midpoint(O1--O2),N); label("$16$",midpoint(C--D),N); label("$2$",midpoint(A--B),S); label("$\Omega$",o.C+(o.r-1)*dir(270)); [/asy] | Let points $A'$ and $B'$ be the reflections of $A$ and $B,$ respectively, about the perpendicular bisector of $O_1 O_2.$ \[B'O_2 = BO_1 = O_1 P = O_1 C,\] \[A'O_1 = AO_2 = O_2 P = O_2 D.\] We establish the equality of the arcs and conclude that the corresponding chords are equal \[\overset{\Large\frown} {CO_1} + \overset{\Large\frown} {A'O_1} +\overset{\Large\frown} {A'B'} = \overset{\Large\frown} {B'O_2} +\overset{\Large\frown} {A'O_1} +\overset{\Large\frown} {A'B'} =\overset{\Large\frown} {B'O_2} +\overset{\Large\frown} {DO_2} +\overset{\Large\frown} {A'B'}\] \[\implies A'D = B'C = O_1 O_2 = 15.\] Similarly $A'C = B'D \implies \triangle A'CO_1 = \triangle B'DO_2.$
Ptolmey's theorem on $A'CDB'$ yields \[B'D \cdot A'C + A'B' \cdot CD = A'D \cdot B'C \implies\] \[B'D^2 + 2 \cdot 16 = 15^2 \implies B'D = A'C = \sqrt{193}.\] The area of the trapezoid $A'CDB'$ is equal to the area of an isosceles triangle with sides $A'D = B'C = 15$ and $A'B' + CD = 18.$
The height of this triangle is $\sqrt{15^2-9^2} = 12.$ The area of $A'CDB'$ is $108.$
\[\sin \angle B'CD = \frac{12}{15} = \frac{4}{5},\] \[\angle B'CD + \angle B'O_2 D = 180^o \implies \sin \angle B'O_2 D = \frac{4}{5}.\]
Denote $\angle B'O_2 D = 2\alpha.$ $\angle B'O_2 D > \frac{\pi}{2},$ hence $\cos \angle B'O_2 D = \cos 2\alpha = -\frac{3}{5}.$ \[\tan \alpha =\frac { \sin 2 \alpha}{1+\cos 2 \alpha} = \frac {4/5}{1 - 3/5}=2.\]
Semiperimeter of $\triangle B'O_2 D$ is $s = \frac {15 + \sqrt{193}}{2}.$
The distance from the vertex $O_2$ to the tangent points of the inscribed circle of the triangle $B'O_2 D$ is equal $s – B'D = \frac{15 – \sqrt{193}}{2}.$
The radius of the inscribed circle is $r = (s – B'D) \tan \alpha.$
The area of triangle $B'O_2 D$ is $[B'O_2 D] = sr = s (s – B'D) \tan \alpha = \frac {15^2 – 193}{2} = 16.$
The hexagon $ABO_1 CDO_2$ has the same area as hexagon $B'A'O_1 CDO_2.$
The area of hexagon $B'A'O_1 CDO_2$ is equal to the sum of the area of the trapezoid $A'CDB'$ and the areas of two equal triangles $B'O_2 D$ and $A'O_1 C,$ so the area of the hexagon $ABO_1 CDO_2$ is \[108 + 16 + 16 = \boxed{140}.\]
vladimir.shelomovskii@gmail.com, vvsss | 140 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Two externally tangent circles $\omega_1$ and $\omega_2$ have centers $O_1$ and $O_2$, respectively. A third circle $\Omega$ passing through $O_1$ and $O_2$ intersects $\omega_1$ at $B$ and $C$ and $\omega_2$ at $A$ and $D$, as shown. Suppose that $AB = 2$, $O_1O_2 = 15$, $CD = 16$, and $ABO_1CDO_2$ is a convex hexagon. Find the area of this hexagon. [asy] import geometry; size(10cm); point O1=(0,0),O2=(15,0),B=9*dir(30); circle w1=circle(O1,9),w2=circle(O2,6),o=circle(O1,O2,B); point A=intersectionpoints(o,w2)[1],D=intersectionpoints(o,w2)[0],C=intersectionpoints(o,w1)[0]; filldraw(A--B--O1--C--D--O2--cycle,0.2*red+white,black); draw(w1); draw(w2); draw(O1--O2,dashed); draw(o); dot(O1); dot(O2); dot(A); dot(D); dot(C); dot(B); label("$\omega_1$",8*dir(110),SW); label("$\omega_2$",5*dir(70)+(15,0),SE); label("$O_1$",O1,W); label("$O_2$",O2,E); label("$B$",B,N+1/2*E); label("$A$",A,N+1/2*W); label("$C$",C,S+1/4*W); label("$D$",D,S+1/4*E); label("$15$",midpoint(O1--O2),N); label("$16$",midpoint(C--D),N); label("$2$",midpoint(A--B),S); label("$\Omega$",o.C+(o.r-1)*dir(270)); [/asy]<|im_end|>
<|im_start|>assistant |
Five men and nine women stand equally spaced around a circle in random order. The probability that every man stands diametrically opposite a woman is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | We get around the condition that each man can't be opposite to another man by simply considering all $7$ diagonals, and choosing $5$ where there will be a single man. For each diagonal, the man can go on either side, and there are $\binom{14}{5}$ ways to arrange the men and the women in total. Thus our answer is $\frac{\binom{7}{5}\cdot 2^5}{\binom{14}{5}} = \frac{48}{143}.$ We get $48 + 143 = \boxed{191}$
~AtharvNaphade | 191 | 5 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Five men and nine women stand equally spaced around a circle in random order. The probability that every man stands diametrically opposite a woman is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$<|im_end|>
<|im_start|>assistant |
Positive real numbers $b \not= 1$ and $n$ satisfy the equations \[\sqrt{\log_b n} = \log_b \sqrt{n} \qquad \text{and} \qquad b \cdot \log_b n = \log_b (bn).\] The value of $n$ is $\frac{j}{k},$ where $j$ and $k$ are relatively prime positive integers. Find $j+k.$ | Denote $x = \log_b n$. Hence, the system of equations given in the problem can be rewritten as \begin{align*} \sqrt{x} & = \frac{1}{2} x , \\ bx & = 1 + x . \end{align*} Solving the system gives $x = 4$ and $b = \frac{5}{4}$. Therefore, \[n = b^x = \frac{625}{256}.\] Therefore, the answer is $625 + 256 = \boxed{881}$.
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | 881 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Positive real numbers $b \not= 1$ and $n$ satisfy the equations \[\sqrt{\log_b n} = \log_b \sqrt{n} \qquad \text{and} \qquad b \cdot \log_b n = \log_b (bn).\] The value of $n$ is $\frac{j}{k},$ where $j$ and $k$ are relatively prime positive integers. Find $j+k.$<|im_end|>
<|im_start|>assistant |
A plane contains $40$ lines, no $2$ of which are parallel. Suppose that there are $3$ points where exactly $3$ lines intersect, $4$ points where exactly $4$ lines intersect, $5$ points where exactly $5$ lines intersect, $6$ points where exactly $6$ lines intersect, and no points where more than $6$ lines intersect. Find the number of points where exactly $2$ lines intersect. | In this solution, let $\boldsymbol{n}$-line points be the points where exactly $n$ lines intersect. We wish to find the number of $2$-line points.
There are $\binom{40}{2}=780$ pairs of lines. Among them:
The $3$-line points account for $3\cdot\binom32=9$ pairs of lines.
The $4$-line points account for $4\cdot\binom42=24$ pairs of lines.
The $5$-line points account for $5\cdot\binom52=50$ pairs of lines.
The $6$-line points account for $6\cdot\binom62=90$ pairs of lines.
It follows that the $2$-line points account for $780-9-24-50-90=\boxed{607}$ pairs of lines, where each pair intersect at a single point.
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
~MRENTHUSIASM
~IceMatrix | 607 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
A plane contains $40$ lines, no $2$ of which are parallel. Suppose that there are $3$ points where exactly $3$ lines intersect, $4$ points where exactly $4$ lines intersect, $5$ points where exactly $5$ lines intersect, $6$ points where exactly $6$ lines intersect, and no points where more than $6$ lines intersect. Find the number of points where exactly $2$ lines intersect.<|im_end|>
<|im_start|>assistant |
The sum of all positive integers $m$ such that $\frac{13!}{m}$ is a perfect square can be written as $2^a3^b5^c7^d11^e13^f,$ where $a,b,c,d,e,$ and $f$ are positive integers. Find $a+b+c+d+e+f.$ | We first rewrite $13!$ as a prime factorization, which is $2^{10}\cdot3^5\cdot5^2\cdot7\cdot11\cdot13.$
For the fraction to be a square, it needs each prime to be an even power. This means $m$ must contain $7\cdot11\cdot13$. Also, $m$ can contain any even power of $2$ up to $2^{10}$, any odd power of $3$ up to $3^{5}$, and any even power of $5$ up to $5^{2}$. The sum of $m$ is \[(2^0+2^2+2^4+2^6+2^8+2^{10})(3^1+3^3+3^5)(5^0+5^2)(7^1)(11^1)(13^1) =\] \[1365\cdot273\cdot26\cdot7\cdot11\cdot13 = 2\cdot3^2\cdot5\cdot7^3\cdot11\cdot13^4.\] Therefore, the answer is $1+2+1+3+1+4=\boxed{012}$.
~chem1kall | 012 | 4.5 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
The sum of all positive integers $m$ such that $\frac{13!}{m}$ is a perfect square can be written as $2^a3^b5^c7^d11^e13^f,$ where $a,b,c,d,e,$ and $f$ are positive integers. Find $a+b+c+d+e+f.$<|im_end|>
<|im_start|>assistant |
Let $P$ be a point on the circle circumscribing square $ABCD$ that satisfies $PA \cdot PC = 56$ and $PB \cdot PD = 90.$ Find the area of $ABCD.$ | WLOG, let $P$ be on minor arc $\overarc {AB}$. Let $r$ and $O$ be the radius and center of the circumcircle respectively, and let $\theta = \angle AOP$.
By the Pythagorean Theorem, the area of the square is $2r^2$. We can use the Law of Cosines on isosceles triangles $\triangle AOP, \, \triangle COP, \, \triangle BOP, \, \triangle DOP$ to get
\begin{align*} PA^2 &= 2r^2(1 - \cos \theta), \\ PC^2 &= 2r^2(1 - \cos (180 - \theta)) = 2r^2(1 + \cos \theta), \\ PB^2 &= 2r^2(1 - \cos (90 - \theta)) = 2r^2(1 - \sin \theta), \\ PD^2 &= 2r^2(1 - \cos (90 + \theta)) = 2r^2(1 + \sin \theta). \end{align*}
Taking the products of the first two and last two equations, respectively, \[56^2 = (PA \cdot PC)^2 = 4r^4(1 - \cos \theta)(1 + \cos \theta) = 4r^4(1 - \cos^2 \theta) = 4r^4 \sin^2 \theta,\] and \[90^2 = (PB \cdot PD)^2 = 4r^4(1 - \sin \theta)(1 + \sin \theta) = 4r^4(1 - \sin^2 \theta) = 4r^4 \cos^2 \theta.\] Adding these equations, \[56^2 + 90^2 = 4r^4,\] so \[2r^2 = \sqrt{56^2+90^2} = 2\sqrt{28^2+45^2} = 2\sqrt{2809} = 2 \cdot 53 = \boxed{106}.\] ~OrangeQuail9 | 106 | 4.625 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $P$ be a point on the circle circumscribing square $ABCD$ that satisfies $PA \cdot PC = 56$ and $PB \cdot PD = 90.$ Find the area of $ABCD.$<|im_end|>
<|im_start|>assistant |
Alice knows that $3$ red cards and $3$ black cards will be revealed to her one at a time in random order. Before each card is revealed, Alice must guess its color. If Alice plays optimally, the expected number of cards she will guess correctly is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | Denote by $N_{i,j}$ the optimal expected number of cards that Alice guesses correctly, where the number of cards are $i$ and $j \ge i.$
If $i = 0$ then Alice guesses correctly all cards, so $N_{0,j} = j.$
If $j = i$ then Alice guesses next card with probability $\frac {1}{2} \implies N_{i,i} = \frac {1}{2} + N_{i-1,i}.$
If $j = i+1$ then Alice guesses next card with probability $\frac {i+1}{2i+1} \implies N_{i,i+1} = \frac {i+1}{2i+1} (1+ N_{i,i}) + \frac{i}{2i+1} N_{i-1,i+1}.$
If $j = i+2$ then Alice guesses next card with probability $\frac {i+2}{2i+2} \implies N_{i,i+2} = \frac {i+2}{2i+2} (1+ N_{i,i+1}) + \frac{i}{2i+2} N_{i-1,i+2}.$
One can find consistently: $N_{1,1} = \frac {1}{2} + N_{0,1} = \frac {3}{2},$ \[N_{1,2} = \frac {2}{3} (1 + N_{1,1}) + \frac {1}{3} N_{0,2} = \frac {7}{3}.\] \[N_{2,2} = \frac {1}{2} + N_{1,2} = \frac {17}{6}.\] \[N_{1,3} = \frac {3}{4} (1 + N_{1,2}) + \frac {1}{4} N_{0,3} = \frac {13}{4}.\] \[N_{2,3} = \frac {3}{5} (1 + N_{2,2}) + \frac {2}{5} N_{1,3} = \frac {18}{5}.\] \[N_{3,3} = \frac {1}{2} + N_{2,3} = \frac {41}{10}.\] Therefore, the answer is $41 + 10 = \boxed{\textbf{(051) }}$.
vladimir.shelomovskii@gmail.com, vvsss | 051 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Alice knows that $3$ red cards and $3$ black cards will be revealed to her one at a time in random order. Before each card is revealed, Alice must guess its color. If Alice plays optimally, the expected number of cards she will guess correctly is $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$<|im_end|>
<|im_start|>assistant |
Call a positive integer $n$ extra-distinct if the remainders when $n$ is divided by $2, 3, 4, 5,$ and $6$ are distinct. Find the number of extra-distinct positive integers less than $1000$. | Because the LCM of all of the numbers we are dividing by is $60$, we know that all of the remainders are $0$ again at $60$, meaning that we have a cycle that repeats itself every $60$ numbers.
After listing all of the remainders up to $60$, we find that $35$, $58$, and $59$ are extra-distinct. So, we have $3$ numbers every $60$ which are extra-distinct. $60\cdot16 = 960$ and $3\cdot16 = 48$, so we have $48$ extra-distinct numbers in the first $960$ numbers. Because of our pattern, we know that the numbers from $961$ thru $1000$ will have the same remainders as $1$ thru $40$, so we have $1$ other extra-distinct number ($35$).
$48 + 1 = \boxed{049}$.
~Algebraik | 049 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Call a positive integer $n$ extra-distinct if the remainders when $n$ is divided by $2, 3, 4, 5,$ and $6$ are distinct. Find the number of extra-distinct positive integers less than $1000$.<|im_end|>
<|im_start|>assistant |
Rhombus $ABCD$ has $\angle BAD < 90^\circ.$ There is a point $P$ on the incircle of the rhombus such that the distances from $P$ to the lines $DA,AB,$ and $BC$ are $9,$ $5,$ and $16,$ respectively. Find the perimeter of $ABCD.$
Diagram
[asy] /* Made by MRENTHUSIASM; inspired by Math Jams. */ size(300); pair A, B, C, D, O, P, R, S, T; A = origin; B = (125/4,0); C = B + 125/4 * dir((3,4)); D = A + 125/4 * dir((3,4)); O = (25,25/2); P = (15,5); R = foot(P,A,D); S = foot(P,A,B); T = foot(P,B,C); markscalefactor=0.15; draw(rightanglemark(P,R,D)^^rightanglemark(P,S,B)^^rightanglemark(P,T,C),red); draw(Circle(O,25/2)^^A--B--C--D--cycle^^B--T); draw(P--R^^P--S^^P--T,red+dashed); dot("$A$",A,1.5*dir(225),linewidth(4.5)); dot("$B$",B,1.5*dir(-45),linewidth(4.5)); dot("$C$",C,1.5*dir(45),linewidth(4.5)); dot("$D$",D,1.5*dir(135),linewidth(4.5)); dot("$P$",P,1.5*dir(60),linewidth(4.5)); dot(R^^S^^T,linewidth(4.5)); dot(O,linewidth(4.5)); label("$9$",midpoint(P--R),dir(A-D),red); label("$5$",midpoint(P--S),dir(180),red); label("$16$",midpoint(P--T),dir(A-D),red); [/asy] ~MRENTHUSIASM | Notation is shown on diagram, $RT \perp AD, FG \perp AB, E = AD \cap \omega, E' = FG \cap AD.$ $RT = 9 + 16 = 25 = FG$ as hights of rhombus. \[RP = QT = 9, PQ = 16 - 9 = 7, GE' = PF = 5,\] \[PE' = 25 - 5 - 5 = 15, RE = \sqrt{RP \cdot RQ} = \sqrt{9 \cdot 16} = 12.\] \[PE = \sqrt{RP^2 + RE^2} = 15 \implies E = E'.\] \[\sin \alpha = \frac {RE}{PE} = \frac {GF}{AD} \implies AD = \frac {15 \cdot 25}{12} = \frac {125}{4}.\] The perimeter of $ABCD$ is $\frac{125}{4}\cdot4=\boxed{125}.$
vladimir.shelomovskii@gmail.com, vvsss
~MathProblemSolvingSkills.com | 125 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Rhombus $ABCD$ has $\angle BAD < 90^\circ.$ There is a point $P$ on the incircle of the rhombus such that the distances from $P$ to the lines $DA,AB,$ and $BC$ are $9,$ $5,$ and $16,$ respectively. Find the perimeter of $ABCD.$
Diagram
[asy] /* Made by MRENTHUSIASM; inspired by Math Jams. */ size(300); pair A, B, C, D, O, P, R, S, T; A = origin; B = (125/4,0); C = B + 125/4 * dir((3,4)); D = A + 125/4 * dir((3,4)); O = (25,25/2); P = (15,5); R = foot(P,A,D); S = foot(P,A,B); T = foot(P,B,C); markscalefactor=0.15; draw(rightanglemark(P,R,D)^^rightanglemark(P,S,B)^^rightanglemark(P,T,C),red); draw(Circle(O,25/2)^^A--B--C--D--cycle^^B--T); draw(P--R^^P--S^^P--T,red+dashed); dot("$A$",A,1.5*dir(225),linewidth(4.5)); dot("$B$",B,1.5*dir(-45),linewidth(4.5)); dot("$C$",C,1.5*dir(45),linewidth(4.5)); dot("$D$",D,1.5*dir(135),linewidth(4.5)); dot("$P$",P,1.5*dir(60),linewidth(4.5)); dot(R^^S^^T,linewidth(4.5)); dot(O,linewidth(4.5)); label("$9$",midpoint(P--R),dir(A-D),red); label("$5$",midpoint(P--S),dir(180),red); label("$16$",midpoint(P--T),dir(A-D),red); [/asy] ~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
Find the number of cubic polynomials $p(x) = x^3 + ax^2 + bx + c,$ where $a, b,$ and $c$ are integers in $\{-20,-19,-18,\ldots,18,19,20\},$ such that there is a unique integer $m \not= 2$ with $p(m) = p(2).$ | $p(x)-p(2)$ is a cubic with at least two integral real roots, therefore it has three real roots, which are all integers.
There are exactly two distinct roots, so either $p(x)=p(2)+(x-2)^2(x-m)$ or $p(x)=p(2)+(x-2)(x-m)^2$, with $m\neq 2$.
In the first case $p(x)=x^3-(4+m)x^2+(4+4m)x-4m+p(2)$, with $|4+4m|\leq 20$ (which entails $|4+m|\leq 20$), so $m$ can be $-6,-5,-4,-3,-2,-1,0,1, (\textbf{not 2}!), 3,4$ and $-4m+p(2)$ can be any integer from $-20$ to $20$, giving $410$ polynomials (since the coefficients are given by linear functions of $m$ and thus are distinct).
In the second case $p(x)=x^3-(2+2m)x^2+(4m+m^2)x-2m^2+p(2)$, and $m$ can be $-6,-5,-4,-3,-2,-1,0,1$ and $-4m+p(2)$ can be any integer from $-20$ to $20$, giving $328$ polynomials.
The total is $\boxed{738}$.
~EVIN-
~MathProblemSolvingSkills.com | 738 | 5 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of cubic polynomials $p(x) = x^3 + ax^2 + bx + c,$ where $a, b,$ and $c$ are integers in $\{-20,-19,-18,\ldots,18,19,20\},$ such that there is a unique integer $m \not= 2$ with $p(m) = p(2).$<|im_end|>
<|im_start|>assistant |
There exists a unique positive integer $a$ for which the sum \[U=\sum_{n=1}^{2023}\left\lfloor\dfrac{n^{2}-na}{5}\right\rfloor\] is an integer strictly between $-1000$ and $1000$. For that unique $a$, find $a+U$.
(Note that $\lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $x$.) | Consider the integral \[\int_{0}^{2023} \dfrac{n^2-na}{5} \, dn.\] We hope this will give a good enough appoximation of $U$ to find $a.$ However, this integral can be easily evaluated(if you know calculus) to be \[\dfrac{1}{15}2023^3-\dfrac{a}{10}2023^2=2023^2\left(\dfrac{2023}{15}-\dfrac{a}{10}\right).\] Because we want this to be as close to $0$ as possible, we find that $a$ should equal $1349.$ Then, evaluating the sum becomes trivial. Set \[U'=\sum_{n=1}^{2023}\dfrac{n^2-1349n}{5}\] and \[U''=\sum_{n=1}^{2023}\{\dfrac{n^2-1349n}{5}\}.\] Then $U=U'-U''.$ We can evaluate $U'$ to be $0$ and $U''$ to be $-405$ (using some basic number theory). Thus, $U=-405$ and the answer is \[1349+(-405)=\boxed{944}.\] ~BS2012 | 944 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
There exists a unique positive integer $a$ for which the sum \[U=\sum_{n=1}^{2023}\left\lfloor\dfrac{n^{2}-na}{5}\right\rfloor\] is an integer strictly between $-1000$ and $1000$. For that unique $a$, find $a+U$.
(Note that $\lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $x$.)<|im_end|>
<|im_start|>assistant |
Find the number of subsets of $\{1,2,3,\ldots,10\}$ that contain exactly one pair of consecutive integers. Examples of such subsets are $\{\mathbf{1},\mathbf{2},5\}$ and $\{1,3,\mathbf{6},\mathbf{7},10\}.$ | The problem is the same as laying out a line of polynomoes to cover spots $0,1,...10$: 1 triomino ($RGG$), $n$ dominoes ($RG$), and $8-2n$ monominoes ($R$). The $G$ spots cover the members of the subset. The total number spots is 11, because one $R$ spot always covers the 0, and the other spots cover 1 through 10.
There are 5 ways to choose polyomino sets, and many ways to order each set:
$R + RG + RGG =$ Polyominoes $\rightarrow$ Orderings
$0 + 4 + 1 = 5 \rightarrow 5! / 0!4!1! = ~~~5$
$2 + 3 + 1 = 6 \rightarrow 6! / 2!3!1! = ~60$
$4 + 2 + 1 = 7 \rightarrow 7! / 4!2!1! = 105$
$6 + 1 + 1 = 8 \rightarrow 8! / 6!1!1! = ~56$
$8 + 0 + 1 = 9 \rightarrow 9! / 8!0!1! = ~~~9$
The sum is $\boxed{235}$.
~BraveCobra22aops | 235 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of subsets of $\{1,2,3,\ldots,10\}$ that contain exactly one pair of consecutive integers. Examples of such subsets are $\{\mathbf{1},\mathbf{2},5\}$ and $\{1,3,\mathbf{6},\mathbf{7},10\}.$<|im_end|>
<|im_start|>assistant |
Let $\triangle ABC$ be an equilateral triangle with side length $55.$ Points $D,$ $E,$ and $F$ lie on $\overline{BC},$ $\overline{CA},$ and $\overline{AB},$ respectively, with $BD = 7,$ $CE=30,$ and $AF=40.$ Point $P$ inside $\triangle ABC$ has the property that \[\angle AEP = \angle BFP = \angle CDP.\] Find $\tan^2(\angle AEP).$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(300); pair A, B, C, D, E, F, P; A = 55*sqrt(3)/3 * dir(90); B = 55*sqrt(3)/3 * dir(210); C = 55*sqrt(3)/3 * dir(330); D = B + 7*dir(0); E = A + 25*dir(C-A); F = A + 40*dir(B-A); P = intersectionpoints(Circle(D,54*sqrt(19)/19),Circle(F,5*sqrt(19)/19))[0]; draw(anglemark(A,E,P,20),red); draw(anglemark(B,F,P,20),red); draw(anglemark(C,D,P,20),red); add(pathticks(anglemark(A,E,P,20), n = 1, r = 0.2, s = 12, red)); add(pathticks(anglemark(B,F,P,20), n = 1, r = 0.2, s = 12, red)); add(pathticks(anglemark(C,D,P,20), n = 1, r = 0.2, s = 12, red)); draw(A--B--C--cycle^^P--E^^P--F^^P--D); dot("$A$",A,1.5*dir(A),linewidth(4)); dot("$B$",B,1.5*dir(B),linewidth(4)); dot("$C$",C,1.5*dir(C),linewidth(4)); dot("$D$",D,1.5*S,linewidth(4)); dot("$E$",E,1.5*dir(30),linewidth(4)); dot("$F$",F,1.5*dir(150),linewidth(4)); dot("$P$",P,1.5*dir(-30),linewidth(4)); label("$7$",midpoint(B--D),1.5*S,red); label("$30$",midpoint(C--E),1.5*dir(30),red); label("$40$",midpoint(A--F),1.5*dir(150),red); [/asy] ~MRENTHUSIASM | We begin by using the fact stated in Solution 3 that, for any point in an equilateral triangle, the lengths of the three perpendicular lines dropped to the sides of the triangle add up to the altitude of that triangle. To make things simple, let's assign $\angle AEP = \angle BFP = \angle CDP = \alpha$. We can label these three perpendiculars as: \[PD\cdot\sin{\alpha} + PE\cdot\sin{\alpha} + PF\cdot\sin{\alpha} = \dfrac{55 \sqrt{3}}{2}\] Simplifying, we get \[PD + PE + PF = \dfrac{55 \sqrt{3}}{2\cdot\sin{\alpha}}\] Now, as stated and quoting Solution 4, "Draw line segments from $P$ to points $A$, $B$, and $C$. [We know that] the angle measure of $\angle{AEP}$, $\angle{BFP}$, and $\angle{CDP}$ is $\alpha$
Using Law of Cosines (note that $\cos{\angle{AFP}}=\cos{\angle{BDP}}=\cos{\angle{CEP}}=\cos{180^\circ-\alpha}=-\cos{\alpha}$)
\begin{align*} (1) \ BP^2 &= FP^2+15^2-2\cdot FP\cdot15\cdot\cos(\alpha)\\ (2) \ BP^2 &= DP^2+7^2+2\cdot DP\cdot7\cdot\cos(\alpha)\\ (3) \ CP^2 &= DP^2+48^2-2\cdot DP\cdot48\cdot\cos(\alpha)\\ (4) \ CP^2 &= EP^2+30^2+2\cdot EP\cdot30\cdot\cos(\alpha)\\ (5) \ AP^2 &= EP^2+25^2-2\cdot EP\cdot25\cdot\cos(\alpha)\\ (6) \ AP^2 &= FP^2+40^2+2\cdot FP\cdot40\cdot\cos(\alpha)\\ \end{align*}
We can perform this operation $(1) - (2) + (3) - (4) + (5) - (6)$:
Leaving us with (after combining and simplifying) \[PD + PE + PF=\frac{11}{2\cdot\cos{\alpha}}\]".
Now, we can use our previous equation along with this one to get: \[\frac{11}{2\cdot\cos{\alpha}} = \dfrac{55 \sqrt{3}}{2\cdot\sin{\alpha}}\].
This equation becomes: \[\tan{\alpha} = 5\sqrt{3}\] As so, our answer is \[\left(5\sqrt3\right)^2=\boxed{075}.\] ~Solution by armang32324 (Mathemagics Club) | 075 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $\triangle ABC$ be an equilateral triangle with side length $55.$ Points $D,$ $E,$ and $F$ lie on $\overline{BC},$ $\overline{CA},$ and $\overline{AB},$ respectively, with $BD = 7,$ $CE=30,$ and $AF=40.$ Point $P$ inside $\triangle ABC$ has the property that \[\angle AEP = \angle BFP = \angle CDP.\] Find $\tan^2(\angle AEP).$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(300); pair A, B, C, D, E, F, P; A = 55*sqrt(3)/3 * dir(90); B = 55*sqrt(3)/3 * dir(210); C = 55*sqrt(3)/3 * dir(330); D = B + 7*dir(0); E = A + 25*dir(C-A); F = A + 40*dir(B-A); P = intersectionpoints(Circle(D,54*sqrt(19)/19),Circle(F,5*sqrt(19)/19))[0]; draw(anglemark(A,E,P,20),red); draw(anglemark(B,F,P,20),red); draw(anglemark(C,D,P,20),red); add(pathticks(anglemark(A,E,P,20), n = 1, r = 0.2, s = 12, red)); add(pathticks(anglemark(B,F,P,20), n = 1, r = 0.2, s = 12, red)); add(pathticks(anglemark(C,D,P,20), n = 1, r = 0.2, s = 12, red)); draw(A--B--C--cycle^^P--E^^P--F^^P--D); dot("$A$",A,1.5*dir(A),linewidth(4)); dot("$B$",B,1.5*dir(B),linewidth(4)); dot("$C$",C,1.5*dir(C),linewidth(4)); dot("$D$",D,1.5*S,linewidth(4)); dot("$E$",E,1.5*dir(30),linewidth(4)); dot("$F$",F,1.5*dir(150),linewidth(4)); dot("$P$",P,1.5*dir(-30),linewidth(4)); label("$7$",midpoint(B--D),1.5*S,red); label("$30$",midpoint(C--E),1.5*dir(30),red); label("$40$",midpoint(A--F),1.5*dir(150),red); [/asy] ~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
Each face of two noncongruent parallelepipeds is a rhombus whose diagonals have lengths $\sqrt{21}$ and $\sqrt{31}$. The ratio of the volume of the larger of the two polyhedra to the volume of the smaller is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. A parallelepiped is a solid with six parallelogram faces such as the one shown below.
[asy] unitsize(2cm); pair o = (0, 0), u = (1, 0), v = 0.8*dir(40), w = dir(70); draw(o--u--(u+v)); draw(o--v--(u+v), dotted); draw(shift(w)*(o--u--(u+v)--v--cycle)); draw(o--w); draw(u--(u+w)); draw(v--(v+w), dotted); draw((u+v)--(u+v+w)); [/asy] | Let us inscribe a tetrahedron $ACB'D'$ in given parallelepiped so that its edges coincide with the diagonals of the faces of the parallelepiped. Note that the three edges outgoing from the vertex $B'$ have the same length $b$, and the three edges at the base have a different length $a.$
The volume of the tetrahedron $V= \frac {a^2}{12}\sqrt{3b^2 - a^2}$ is three times less than the volume of the parallelepiped.
In second parallelepiped $a$ and $b$ change the positions.
Required ratio is $\frac {a^2 \cdot \sqrt {3b^2 - a^2}}{b^2 \cdot \sqrt {3a^2 - b^2}} = \frac {21 \sqrt {3 \cdot 31 - 21}}{31 \cdot \sqrt{3 \cdot 21 - 31}} = \frac {21 \sqrt {72}}{31 \sqrt {32}}= \frac {63}{62}.$
Claim
Let $ABCD$ be the regular pyramid, $AB = AC = AD = b, BC = BD = CD = a.$
The area of $\triangle BCD = \frac {a^2 \sqrt {3}}{4}.$
Height $AO^2 = AB^2 - OB^2 = {b^2 - \frac {a^2}{3}}.$
Volume $V= \frac {a^2}{12}\sqrt{3b^2 - a^2}.$
vladimir.shelomovskii@gmail.com, vvsss
~MathProblemSolvingSkills.com
~Star League (https://starleague.us)
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. | 125 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Each face of two noncongruent parallelepipeds is a rhombus whose diagonals have lengths $\sqrt{21}$ and $\sqrt{31}$. The ratio of the volume of the larger of the two polyhedra to the volume of the smaller is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. A parallelepiped is a solid with six parallelogram faces such as the one shown below.
[asy] unitsize(2cm); pair o = (0, 0), u = (1, 0), v = 0.8*dir(40), w = dir(70); draw(o--u--(u+v)); draw(o--v--(u+v), dotted); draw(shift(w)*(o--u--(u+v)--v--cycle)); draw(o--w); draw(u--(u+w)); draw(v--(v+w), dotted); draw((u+v)--(u+v+w)); [/asy]<|im_end|>
<|im_start|>assistant |
The following analog clock has two hands that can move independently of each other. [asy] unitsize(2cm); draw(unitcircle,black+linewidth(2)); for (int i = 0; i < 12; ++i) { draw(0.9*dir(30*i)--dir(30*i)); } for (int i = 0; i < 4; ++i) { draw(0.85*dir(90*i)--dir(90*i),black+linewidth(2)); } for (int i = 1; i < 13; ++i) { label("\small" + (string) i, dir(90 - i * 30) * 0.75); } draw((0,0)--0.6*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); draw((0,0)--0.4*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); [/asy] Initially, both hands point to the number $12$. The clock performs a sequence of hand movements so that on each movement, one of the two hands moves clockwise to the next number on the clock face while the other hand does not move.
Let $N$ be the number of sequences of $144$ hand movements such that during the sequence, every possible positioning of the hands appears exactly once, and at the end of the $144$ movements, the hands have returned to their initial position. Find the remainder when $N$ is divided by $1000$. | This is more of a solution sketch and lacks rigorous proof for interim steps, but illustrates some key observations that lead to a simple solution.
Note that one can visualize this problem as walking on a $N \times N$ grid where the edges warp. Your goal is to have a single path across all nodes on the grid leading back to $(0,\ 0)$. For convenience, any grid position are presumed to be in $\mod N$.
Note that there are exactly two ways to reach node $(i,\ j)$, namely $(i - 1,\ j)$ and $(i,\ j - 1)$.
As a result, if a path includes a step from $(i,\ j)$ to $(i + 1,\ j)$, there cannot be a step from $(i,\ j)$ to $(i,\ j + 1)$. However, a valid solution must reach $(i,\ j + 1)$, and the only valid step is from $(i - 1,\ j + 1)$.
So a solution that includes a step from $(i,\ j)$ to $(i + 1,\ j)$ dictates a step from $(i - 1,\ j + 1)$ to $(i,\ j + 1)$ and by extension steps from $(i - a,\ j + a)$ to $(i - a + 1,\ j + a)$. We observe the equivalent result for steps in the orthogonal direction.
This means that in constructing a valid solution, taking one step in fact dictates N steps, thus it's sufficient to count valid solutions with $N = a + b$ moves of going right $a$ times and $b$ times up the grid. The number of distinct solutions can be computed by permuting 2 kinds of indistinguishable objects $\binom{N}{a}$.
Here we observe, without proof, that if $\gcd(a, b) \neq 1$, then we will return to the origin prematurely. For $N = 12$, we only want to count the number of solutions associated with $12 = 1 + 11 = 5 + 7 = 7 + 5 = 11 + 1$.
(For those attempting a rigorous proof, note that $\gcd(a, b) = \gcd(a + b, b) = \gcd(N, b) = \gcd(N, a)$).
The total number of solutions, noting symmetry, is thus
\[2\cdot\left(\binom{12}{1} + \binom{12}{5}\right) = 1608\]
This yields $\boxed{\textbf{608}}$ as our desired answer.
~ cocoa @ https://www.corgillogical.com/ | 608 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
The following analog clock has two hands that can move independently of each other. [asy] unitsize(2cm); draw(unitcircle,black+linewidth(2)); for (int i = 0; i < 12; ++i) { draw(0.9*dir(30*i)--dir(30*i)); } for (int i = 0; i < 4; ++i) { draw(0.85*dir(90*i)--dir(90*i),black+linewidth(2)); } for (int i = 1; i < 13; ++i) { label("\small" + (string) i, dir(90 - i * 30) * 0.75); } draw((0,0)--0.6*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); draw((0,0)--0.4*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); [/asy] Initially, both hands point to the number $12$. The clock performs a sequence of hand movements so that on each movement, one of the two hands moves clockwise to the next number on the clock face while the other hand does not move.
Let $N$ be the number of sequences of $144$ hand movements such that during the sequence, every possible positioning of the hands appears exactly once, and at the end of the $144$ movements, the hands have returned to their initial position. Find the remainder when $N$ is divided by $1000$.<|im_end|>
<|im_start|>assistant |
Find the largest prime number $p<1000$ for which there exists a complex number $z$ satisfying
the real and imaginary part of $z$ are both integers;
$|z|=\sqrt{p},$ and
there exists a triangle whose three side lengths are $p,$ the real part of $z^{3},$ and the imaginary part of $z^{3}.$ | Assume that $z=a+bi$. Then, \[z^3=(a^3-3ab^2)+(3a^2b-b^3)i\]Note that by the Triangle Inequality, \[|(a^3-3ab^2)-(3a^2b-b^3)|<p\implies |a^3+b^3-3ab^2-3a^2b|<a^2+b^2\]Thus, we know \[|a+b||a^2+b^2-4ab|<a^2+b^2\]Without loss of generality, assume $a>b$ (as otherwise, consider $i^3\overline z=b+ai$). If $|a/b|\geq 4$, then \[17b^2\geq a^2+b^2>|a+b||a^2+b^2-4ab|\geq |b-4b||16b^2-16b^2+b^2|=3b^3\]`Thus, this means $b\leq\frac{17}3$ or $b\leq 5$. Also note that the roots of $x^2-4x+1$ are $2\pm\sqrt 3$, so thus if $b\geq 6$, \[2\sqrt 3b=(2(2-\sqrt 3)-4)b<a<4b\]Note that \[1000>p=a^2+b^2\geq 12b^2+b^2=13b^2\]so $b^2<81$, and $b<9$. If $b=8$, then $16\sqrt 3\leq a\leq 32$. Note that $\gcd(a,b)=1$, and $a\not\equiv b\pmod 2$, so $a=29$ or $31$. However, then $5\mid a^2+b^2$, absurd.
If $b=7$, by similar logic, we have that $14\sqrt 3 <a< 28$, so $b=26$. However, once again, $5\mid a^2+b^2$. If $b=6$, by the same logic, $12\sqrt3<a<24$, so $a=23$, where we run into the same problem. Thus $b\leq 5$ indeed.
If $b=5$, note that \[(a+5)(a^2+25-20a)<a^2+25\implies a<20\]We note that $p=5^2+18^2=349$ works. Thus, we just need to make sure that if $b\leq 4$, $a\leq 18$. But this is easy, as \[p>(a+b)(a^2+b^2-4ab)\geq (4+18)(4^2+18^2-4\cdot 4\cdot 18)>1000\]absurd. Thus, the answer is $\boxed{349}$. | 349 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the largest prime number $p<1000$ for which there exists a complex number $z$ satisfying
the real and imaginary part of $z$ are both integers;
$|z|=\sqrt{p},$ and
there exists a triangle whose three side lengths are $p,$ the real part of $z^{3},$ and the imaginary part of $z^{3}.$<|im_end|>
<|im_start|>assistant |
The numbers of apples growing on each of six apple trees form an arithmetic sequence where the greatest number of apples growing on any of the six trees is double the least number of apples growing on any of the six trees. The total number of apples growing on all six trees is $990.$ Find the greatest number of apples growing on any of the six trees. | Let the terms in the sequence be defined as \[a_1, a_2, ..., a_6.\]
Since this is an arithmetic sequence, we have $a_1+a_6=a_2+a_5=a_3+a_4.$ So, \[\sum_{i=1}^6 a_i=3(a_1+a_6)=990.\] Hence, $(a_1+a_6)=330.$ And, since we are given that $a_6=2a_1,$ we get $3a_1=330\implies a_1=110$ and $a_6=\boxed{220}.$
~Kiran | 220 | 2.25 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
The numbers of apples growing on each of six apple trees form an arithmetic sequence where the greatest number of apples growing on any of the six trees is double the least number of apples growing on any of the six trees. The total number of apples growing on all six trees is $990.$ Find the greatest number of apples growing on any of the six trees.<|im_end|>
<|im_start|>assistant |
Recall that a palindrome is a number that reads the same forward and backward. Find the greatest integer less than $1000$ that is a palindrome both when written in base ten and when written in base eight, such as $292 = 444_{\text{eight}}.$ | Assuming that such palindrome is greater than $777_8 = 511,$ we conclude that the palindrome has four digits when written in base $8.$ Let such palindrome be \[(\underline{ABBA})_8 = 512A + 64B + 8B + A = 513A + 72B.\]
It is clear that $A=1,$ so we repeatedly add $72$ to $513$ until we get palindromes less than $1000:$ \begin{align*} 513+72\cdot0 &= 513, \\ 513+72\cdot1 &= \boxed{585}, \\ 513+72\cdot2 &= 657, \\ 513+72\cdot3 &= 729, \\ 513+72\cdot4 &= 801, \\ 513+72\cdot5 &= 873, \\ 513+72\cdot6 &= 945, \\ 513+72\cdot7 &= 1017. \\ \end{align*}
~MRENTHUSIASM
~MathProblemSolvingSkills.com | 585 | 2 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Recall that a palindrome is a number that reads the same forward and backward. Find the greatest integer less than $1000$ that is a palindrome both when written in base ten and when written in base eight, such as $292 = 444_{\text{eight}}.$<|im_end|>
<|im_start|>assistant |
Let $\triangle ABC$ be an isosceles triangle with $\angle A = 90^\circ.$ There exists a point $P$ inside $\triangle ABC$ such that $\angle PAB = \angle PBC = \angle PCA$ and $AP = 10.$ Find the area of $\triangle ABC.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(200); pair A, B, C, P; A = origin; B = (0,10*sqrt(5)); C = (10*sqrt(5),0); P = intersectionpoints(Circle(A,10),Circle(C,20))[0]; dot("$A$",A,1.5*SW,linewidth(4)); dot("$B$",B,1.5*NW,linewidth(4)); dot("$C$",C,1.5*SE,linewidth(4)); dot("$P$",P,1.5*NE,linewidth(4)); markscalefactor=0.125; draw(rightanglemark(B,A,C,10),red); draw(anglemark(P,A,B,25),red); draw(anglemark(P,B,C,25),red); draw(anglemark(P,C,A,25),red); add(pathticks(anglemark(P,A,B,25), n = 1, r = 0.1, s = 10, red)); add(pathticks(anglemark(P,B,C,25), n = 1, r = 0.1, s = 10, red)); add(pathticks(anglemark(P,C,A,25), n = 1, r = 0.1, s = 10, red)); draw(A--B--C--cycle^^P--A^^P--B^^P--C); label("$10$",midpoint(A--P),dir(-30),blue); [/asy] ~MRENTHUSIASM | Denote the area of $X$ by $[X].$ As in previous solutions, we see that $\angle APC = 90 ^\circ, \triangle BPC \sim \triangle APB$ with ratio $k = \sqrt{2}\implies$ \[\frac {PC}{PB} = \frac {PB}{PA} = k \implies PC = k^2 \cdot AP = 20 \implies [APC] = \frac {AP \cdot PC}{2} = 100.\] \[[BPC] = k^2 [APB] = 2 [APB].\] \[AB = BC, \angle PCA = \angle PAB \implies \frac {[APC]}{[APB]} = \frac {PC}{PA} = 2 \implies\] \[[ABC] = [APB] + [APC] + [BPC] = [APC] \cdot (\frac {1}{2} + 1 + 2 \cdot \frac {1}{2}) = \frac {5}{2} \cdot [APC] = \boxed{250}.\] vladimir.shelomovskii@gmail.com, vvsss | 250 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $\triangle ABC$ be an isosceles triangle with $\angle A = 90^\circ.$ There exists a point $P$ inside $\triangle ABC$ such that $\angle PAB = \angle PBC = \angle PCA$ and $AP = 10.$ Find the area of $\triangle ABC.$
Diagram
[asy] /* Made by MRENTHUSIASM */ size(200); pair A, B, C, P; A = origin; B = (0,10*sqrt(5)); C = (10*sqrt(5),0); P = intersectionpoints(Circle(A,10),Circle(C,20))[0]; dot("$A$",A,1.5*SW,linewidth(4)); dot("$B$",B,1.5*NW,linewidth(4)); dot("$C$",C,1.5*SE,linewidth(4)); dot("$P$",P,1.5*NE,linewidth(4)); markscalefactor=0.125; draw(rightanglemark(B,A,C,10),red); draw(anglemark(P,A,B,25),red); draw(anglemark(P,B,C,25),red); draw(anglemark(P,C,A,25),red); add(pathticks(anglemark(P,A,B,25), n = 1, r = 0.1, s = 10, red)); add(pathticks(anglemark(P,B,C,25), n = 1, r = 0.1, s = 10, red)); add(pathticks(anglemark(P,C,A,25), n = 1, r = 0.1, s = 10, red)); draw(A--B--C--cycle^^P--A^^P--B^^P--C); label("$10$",midpoint(A--P),dir(-30),blue); [/asy] ~MRENTHUSIASM<|im_end|>
<|im_start|>assistant |
Let $x,y,$ and $z$ be real numbers satisfying the system of equations \begin{align*} xy + 4z &= 60 \\ yz + 4x &= 60 \\ zx + 4y &= 60. \end{align*} Let $S$ be the set of possible values of $x.$ Find the sum of the squares of the elements of $S.$ | We first subtract the second equation from the first, noting that they both equal $60$. \begin{align*} xy+4z-yz-4x&=0 \\ 4(z-x)-y(z-x)&=0 \\ (z-x)(4-y)&=0 \end{align*}
Case 1: Let $y=4$.
The first and third equations simplify to: \begin{align*} x+z&=15 \\ xz&=44 \end{align*} from which it is apparent that $x=4$ and $x=11$ are solutions.
Case 2: Let $x=z$.
The first and third equations simplify to: \begin{align*} xy+4x&=60 \\ x^2+4y&=60 \end{align*}
We subtract the following equations, yielding: \begin{align*} x^2+4y-xy-4x&=0 \\ x(x-4)-y(x-4)&=0 \\ (x-4)(x-y)&=0 \end{align*}
We thus have $x=4$ and $x=y$, substituting in $x=y=z$ and solving yields $x=6$ and $x=-10$.
Then, we just add the squares of the solutions (make sure not to double count the $4$), and get \[4^2+11^2+(-6)^2+10^2=16+121+36+100=\boxed{273}.\] ~SAHANWIJETUNGA | 273 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $x,y,$ and $z$ be real numbers satisfying the system of equations \begin{align*} xy + 4z &= 60 \\ yz + 4x &= 60 \\ zx + 4y &= 60. \end{align*} Let $S$ be the set of possible values of $x.$ Find the sum of the squares of the elements of $S.$<|im_end|>
<|im_start|>assistant |
Let $S$ be the set of all positive rational numbers $r$ such that when the two numbers $r$ and $55r$ are written as fractions in lowest terms, the sum of the numerator and denominator of one fraction is the same as the sum of the numerator and denominator of the other fraction. The sum of all the elements of $S$ can be expressed in the form $\frac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$ | Denote $r = \frac{a}{b}$, where $\left( a, b \right) = 1$. We have $55 r = \frac{55a}{b}$. Suppose $\left( 55, b \right) = 1$, then the sum of the numerator and the denominator of $55r$ is $55a + b$. This cannot be equal to the sum of the numerator and the denominator of $r$, $a + b$. Therefore, $\left( 55, b \right) \neq 1$.
Case 1: $b$ can be written as $5c$ with $\left( c, 11 \right) = 1$.
Thus, $55r = \frac{11a}{c}$.
Because the sum of the numerator and the denominator of $r$ and $55r$ are the same, \[ a + 5c = 11a + c . \]
Hence, $2c = 5 a$.
Because $\left( a, b \right) = 1$, $\left( a, c \right) = 1$. Thus, $a = 2$ and $c = 5$. Therefore, $r = \frac{a}{5c} = \frac{2}{25}$.
Case 2: $b$ can be written as $11d$ with $\left( d, 5 \right) = 1$.
Thus, $55r = \frac{5a}{c}$.
Because the sum of the numerator and the denominator of $r$ and $55r$ are the same, \[ a + 11c = 5a + c . \]
Hence, $2a = 5 c$.
Because $\left( a, b \right) = 1$, $\left( a, c \right) = 1$. Thus, $a = 5$ and $c = 2$. Therefore, $r = \frac{a}{11c} = \frac{5}{22}$.
Case 3: $b$ can be written as $55 e$.
Thus, $55r = \frac{a}{c}$.
Because the sum of the numerator and the denominator of $r$ and $55r$ are the same, \[ a + 55c = a + c . \]
Hence, $c = 0$. This is infeasible. Thus, there is no solution in this case.
Putting all cases together, $S = \left\{ \frac{2}{25}, \frac{5}{22} \right\}$. Therefore, the sum of all numbers in $S$ is \[ \frac{2}{25} + \frac{5}{22} = \frac{169}{550} . \]
Therefore, the answer is $169 + 550 = \boxed{\textbf{(719) }}$.
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | 719 | 5.625 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $S$ be the set of all positive rational numbers $r$ such that when the two numbers $r$ and $55r$ are written as fractions in lowest terms, the sum of the numerator and denominator of one fraction is the same as the sum of the numerator and denominator of the other fraction. The sum of all the elements of $S$ can be expressed in the form $\frac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$<|im_end|>
<|im_start|>assistant |
Consider the L-shaped region formed by three unit squares joined at their sides, as shown below. Two points $A$ and $B$ are chosen independently and uniformly at random from inside the region. The probability that the midpoint of $\overline{AB}$ also lies inside this L-shaped region can be expressed as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ [asy] unitsize(2cm); draw((0,0)--(2,0)--(2,1)--(1,1)--(1,2)--(0,2)--cycle); draw((0,1)--(1,1)--(1,0),dashed); [/asy] | Consider this diagram:
First, the one of points must be in the uppermost box and the other in the rightmost box. This happens with probability 2/3*1/3=2/9.
We need the midpoints of the $x$ coordinates to be greater than $1$ but less than $2.$
We need the midpoints of the $y$ coordinates to be greater than $1$ but less than $2.$
Thus, we set up: \[1<\frac{x_1+x_2}{2}<2\] \[1<\frac{y_1+y_2}{2}<2\]
Using geometric probability, as shown below, we get that the probability of happening is 1/2. This is for both. So we have probability 1/2*1/2=1/4.
Thus, the desired is 2/9*1/4=1/18 => 1-1/18=17/18.
mathboy282 | 035 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Consider the L-shaped region formed by three unit squares joined at their sides, as shown below. Two points $A$ and $B$ are chosen independently and uniformly at random from inside the region. The probability that the midpoint of $\overline{AB}$ also lies inside this L-shaped region can be expressed as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ [asy] unitsize(2cm); draw((0,0)--(2,0)--(2,1)--(1,1)--(1,2)--(0,2)--cycle); draw((0,1)--(1,1)--(1,0),dashed); [/asy]<|im_end|>
<|im_start|>assistant |
Each vertex of a regular dodecagon ($12$-gon) is to be colored either red or blue, and thus there are $2^{12}$ possible colorings. Find the number of these colorings with the property that no four vertices colored the same color are the four vertices of a rectangle. | Note that the condition is equivalent to stating that there are no 2 pairs of oppositely spaced vertices with the same color.
Case 1: There are no pairs. This yields $2$ options for each vertices 1-6, and the remaining vertices 7-12 are set, yielding $2^6=64$ cases.
Case 2: There is one pair. Again start with 2 options for each vertex in 1-6, but now multiply by 6 since there are 6 possibilities for which pair can have the same color assigned instead of the opposite. Thus, the cases are: $2^6*6=384$
case 3: There are two pairs, but oppositely colored. Start with $2^6$ for assigning 1-6, then multiply by 6C2=15 for assigning which have repeated colors. Divide by 2 due to half the cases having the same colored opposites. $2^6*15/2=480$
It is apparent that no other cases exist, as more pairs would force there to be 2 pairs of same colored oppositely spaced vertices with the same color. Thus, the answer is: $64+384+480=\boxed{928}$
~SAHANWIJETUNGA | 928 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Each vertex of a regular dodecagon ($12$-gon) is to be colored either red or blue, and thus there are $2^{12}$ possible colorings. Find the number of these colorings with the property that no four vertices colored the same color are the four vertices of a rectangle.<|im_end|>
<|im_start|>assistant |
Let $\omega = \cos\frac{2\pi}{7} + i \cdot \sin\frac{2\pi}{7},$ where $i = \sqrt{-1}.$ Find the value of the product\[\prod_{k=0}^6 \left(\omega^{3k} + \omega^k + 1\right).\] | The product can be factored into $-(r-1)(s-1)(t-1)(r-w)(s-w)(t-w)(r-w^2)(s-w^2)(t-w^2)....(r-w^6)(s-w^6)(t-w^6)$,
where $r,s,t$ are the roots of the polynomial $x^3+x+1=0$.
This is then $-(r^7-1)(s^7-1)(t^7-1)$ because $(r^7-1)$ and $(r-1)(r-w)(r-w^2)...(r-w^6)$ share the same roots.
To find $-(r^7-1)(s^7-1)(t^7-1)$,
Notice that $(r^7-1)=(r-1)(r^6+r^5+r^4+r^3+r^2+r+1)$. Since r satisfies $x^3+x+1=0$, $r^6+r^4+r^3=0$
Substituting, you are left with $r^5+r^2+r+1$. This is $r^2(r^3+1)+r+1$, and after repeatedly substituting $r^3+x+1=0$ you are left with $-2r^3$.
So now the problem is reduced to finding $-(r-1)(s-1)(t-1)(-2r^3)(-2s^3)(-2t^3)=8(rst)^3(r-1)(s-1)(t-1)$, and vietas gives you the result of $\boxed{24}$ -resources | 024 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $\omega = \cos\frac{2\pi}{7} + i \cdot \sin\frac{2\pi}{7},$ where $i = \sqrt{-1}.$ Find the value of the product\[\prod_{k=0}^6 \left(\omega^{3k} + \omega^k + 1\right).\]<|im_end|>
<|im_start|>assistant |
Circles $\omega_1$ and $\omega_2$ intersect at two points $P$ and $Q,$ and their common tangent line closer to $P$ intersects $\omega_1$ and $\omega_2$ at points $A$ and $B,$ respectively. The line parallel to $AB$ that passes through $P$ intersects $\omega_1$ and $\omega_2$ for the second time at points $X$ and $Y,$ respectively. Suppose $PX=10,$ $PY=14,$ and $PQ=5.$ Then the area of trapezoid $XABY$ is $m\sqrt{n},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m+n.$ | Notice that line $\overline{PQ}$ is the radical axis of circles $\omega_1$ and $\omega_2$. By the radical axis theorem, we know that the tangents of any point on line $\overline{PQ}$ to circles $\omega_1$ and $\omega_2$ are equal. Therefore, line $\overline{PQ}$ must pass through the midpoint of $\overline{AB}$, call this point M. In addition, we know that $AM=MB=6$ by circle properties and midpoint definition.
Then, by Power of Point,
\begin{align*} AM^2&=MP*MQ \\ 36&=MP(MP+5) \\ MP&=4 \\ \end{align*}
Call the intersection point of line $\overline{A\omega_1}$ and $\overline{XY}$ be C, and the intersection point of line $\overline{B\omega_2}$ and $\overline{XY}$ be D. $ABCD$ is a rectangle with segment $MP=4$ drawn through it so that $AM=MB=6$, $CP=5$, and $PD=7$. Dropping the altitude from $M$ to $\overline{XY}$, we get that the height of trapezoid $XABY$ is $\sqrt{15}$. Therefore the area of trapezoid $XABY$ is
\begin{align*} \frac{1}{2}\cdot(12+24)\cdot(\sqrt{15})=18\sqrt{15} \end{align*}
Giving us an answer of $\boxed{033}$.
~Danielzh | 033 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Circles $\omega_1$ and $\omega_2$ intersect at two points $P$ and $Q,$ and their common tangent line closer to $P$ intersects $\omega_1$ and $\omega_2$ at points $A$ and $B,$ respectively. The line parallel to $AB$ that passes through $P$ intersects $\omega_1$ and $\omega_2$ for the second time at points $X$ and $Y,$ respectively. Suppose $PX=10,$ $PY=14,$ and $PQ=5.$ Then the area of trapezoid $XABY$ is $m\sqrt{n},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m+n.$<|im_end|>
<|im_start|>assistant |
Let $N$ be the number of ways to place the integers $1$ through $12$ in the $12$ cells of a $2 \times 6$ grid so that for any two cells sharing a side, the difference between the numbers in those cells is not divisible by $3.$ One way to do this is shown below. Find the number of positive integer divisors of $N.$ \[\begin{array}{|c|c|c|c|c|c|} \hline \,1\, & \,3\, & \,5\, & \,7\, & \,9\, & 11 \\ \hline \,2\, & \,4\, & \,6\, & \,8\, & 10 & 12 \\ \hline \end{array}\] | We replace the numbers which are 0 mod(3) to 0, 1 mod(3) to 1, and 2 mod(3) to 2.
Then, the problem is equivalent to arranging 4 0's,4 1's, and 4 2's into the grid (and then multiplying by $4!^3$ to account for replacing the remainder numbers with actual numbers) such that no 2 of the same numbers are adjacent.
Then, the numbers which are vertically connected must be different. 2 1s must be connected with 2 2s, and 2 1s must be connected with 2 2s (vertically), as if there are less 1s connected with either, then there will be 2s or 3s which must be connected within the same number. For instance if we did did: - 12 x 3 - 13 x 1 Then we would be left with 23 x1, and 2 remaining 3s which aren't supposed to be connected, so it is impossible. Similar logic works for why all 1s can't be connected with all 2s.
Thus, we are left with the problem of re-arranging 2x 12 pairs, 2x 13 pairs, 2x 23 pairs. Notice that the pairs can be re-arranged horizontally in any configuration, but when 2 pairs are placed adjacent there is only 1 configuration for the rightmost pair to be set after the leftmost one has been placed.
We have $\frac{6!}{2!2!2!}=90$ ways to horizontally re-arrange the pairs, with 2 ways to set the initial leftmost column. Thus, there are 180 ways to arrange the pairs. Accounting for the initial simplification of the problem with 1-12 -> 0-3, we obtain the answer is:
\[2488320=2^{11}\cdot3^5\cdot5^1\]
The number of divisors is: $12\cdot6\cdot2=\boxed{144}.$ ~SAHANWIJETUNGA | 144 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $N$ be the number of ways to place the integers $1$ through $12$ in the $12$ cells of a $2 \times 6$ grid so that for any two cells sharing a side, the difference between the numbers in those cells is not divisible by $3.$ One way to do this is shown below. Find the number of positive integer divisors of $N.$ \[\begin{array}{|c|c|c|c|c|c|} \hline \,1\, & \,3\, & \,5\, & \,7\, & \,9\, & 11 \\ \hline \,2\, & \,4\, & \,6\, & \,8\, & 10 & 12 \\ \hline \end{array}\]<|im_end|>
<|im_start|>assistant |
Find the number of collections of $16$ distinct subsets of $\{1,2,3,4,5\}$ with the property that for any two subsets $X$ and $Y$ in the collection, $X \cap Y \not= \emptyset.$ | Denote the $A$ as $\{ 1,2,3,4,5 \}$ and the collection of subsets as $S$.
Case 1: There are only sets of size $3$ or higher in $S$: Any two sets in $S$ must have at least one element common to both of them (since $3+3>5$). Since there are $16$ subsets of $A$ that have size $3$ or higher, there is only one possibility for this case.
Case 2: There are only sets of size $2$ or higher in $S$: Firstly, there cannot be a no size $2$ set $S$, or it will be overcounting the first case.
If there is only one such size $2$ set, there are $10$ ways to choose it. That size $2$ set, say $X$, cannot be in $S$ with $Y = A/X$ (a three element set). Thus, there are only $15$ possible size $3$ subsets that can be in $S$, giving us $10$ for this case.
If there are two sets with size $2$ in $S$, we can choose the common elements of these two subsets in $5$ ways, giving us a total of $5\cdot 6 = 30$.
If there are three sets with size $2$, they can either share one common element, which can be done in $5 \cdot 4 = 20$ ways, or they can share pairwise common elements (sort of like a cycle), which can be done $\binom{5}{2} = 10$ ways. In total, we have $30$ possibilities.
If there are four sets with size $2$, they all have to share one common element, which can be done in $5\cdot 1$ ways.
Thus, summing everything up, this will give us $75$ possible sets $S$
Case 3: There is a set with size $1$ in $S$: Notice that be at most one size $1$ subset. There are $5$ ways to choose that single element set. Say it's $\{ 1\}$. All other subsets in $S$ must have a $1$ in them, but there are only $2^4-1 = 15$ of them. Thus this case yields $5\cdot 1 = 5$ possibilities.
Thus, the total number of sets $S$ would be $1+75+5 = \boxed{\textbf{(081)}}$.
~sml1809 | 081 | 5.75 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Find the number of collections of $16$ distinct subsets of $\{1,2,3,4,5\}$ with the property that for any two subsets $X$ and $Y$ in the collection, $X \cap Y \not= \emptyset.$<|im_end|>
<|im_start|>assistant |
In $\triangle ABC$ with side lengths $AB = 13,$ $BC = 14,$ and $CA = 15,$ let $M$ be the midpoint of $\overline{BC}.$ Let $P$ be the point on the circumcircle of $\triangle ABC$ such that $M$ is on $\overline{AP}.$ There exists a unique point $Q$ on segment $\overline{AM}$ such that $\angle PBQ = \angle PCQ.$ Then $AQ$ can be written as $\frac{m}{\sqrt{n}},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | We use the law of Cosine and get \[AB^2 = AM^2 + BM^2 - 2 AM \cdot BM \cos \angle AMB,\] \[AC^2 = AM^2 + CM^2 + 2 AM \cdot CM \cos \angle AMB \implies\] \[AM^2 = \frac {AB^2 + AC^2}{2}- BM^2 = \sqrt{148} \approx 12.\] We use the power of point $M$ with respect circumcircle $\triangle ABC$ and get \[AM \cdot MP = BM \cdot CM = BM^2 \implies\] \[PM = \frac {49}{\sqrt {148}} \approx \frac {48}{12} \approx 4 < AM.\] It is clear that if $Q = P,$ then $\angle PBQ = \angle PCQ = 0 \implies$
if $Q$ is symmetric to $P$ with respect $M$ then $\angle PBQ = \angle PCQ.$
There exists a unique point $Q$ on segment $\overline{AM}, PM < AM \implies$ \[PQ = AM - PM = \frac{99}{\sqrt{148}} \implies \boxed{247}.\] vladimir.shelomovskii@gmail.com, vvsss | 247 | 5.875 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
In $\triangle ABC$ with side lengths $AB = 13,$ $BC = 14,$ and $CA = 15,$ let $M$ be the midpoint of $\overline{BC}.$ Let $P$ be the point on the circumcircle of $\triangle ABC$ such that $M$ is on $\overline{AP}.$ There exists a unique point $Q$ on segment $\overline{AM}$ such that $\angle PBQ = \angle PCQ.$ Then $AQ$ can be written as $\frac{m}{\sqrt{n}},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$<|im_end|>
<|im_start|>assistant |
Let $A$ be an acute angle such that $\tan A = 2 \cos A.$ Find the number of positive integers $n$ less than or equal to $1000$ such that $\sec^n A + \tan^n A$ is a positive integer whose units digit is $9.$ | \[\tan A = 2 \cos A \implies \sin A = 2 \cos^2 A \implies \sin^2 A + \cos^2 A = 4 \cos^4 A + \cos^2 A = 1\] \[\implies \cos^2 A = \frac {\sqrt {17} - 1}{8}.\] \[c_n = \sec^n A + \tan^n A = \frac {1}{\cos^n A} + 2^n \cos^n A = (4\cos^2 A +1)^{\frac {n}{2}}+(4 \cos^2 A)^{\frac {n}{2}} =\] \[= \left(\frac {\sqrt {17} + 1}{2}\right)^{\frac {n}{2}}+ \left(\frac {\sqrt {17} - 1}{2}\right)^{\frac {n}{2}}.\]
It is clear, that $c_n$ is not integer if $n \ne 4k, k > 0.$
Denote $x = \frac {\sqrt {17} + 1}{2}, y = \frac {\sqrt {17} - 1}{2} \implies$ \[x \cdot y = 4, x + y = \sqrt{17}, x - y = 1 \implies x^2 + y^2 = (x - y)^2 + 2xy = 9 = c_4.\]
\[c_8 = x^4 + y^4 = (x^2 + y^2)^2 - 2x^2 y^2 = 9^2 - 2 \cdot 16 = 49.\] \[c_{4k+4} = x^{4k+4} + y^{4k+4} = (x^{4k} + y^{4k})(x^2+y^2)- (x^2 y^2)(x^{4k-2}+y^{4k-2}) = 9 c_{4k}- 16 c_{4k – 4} \implies\] \[c_{12} = 9 c_8 - 16 c_4 = 9 \cdot 49 - 16 \cdot 9 = 9 \cdot 33 = 297.\] \[c_{16} = 9 c_{12} - 16 c_8 = 9 \cdot 297 - 16 \cdot 49 = 1889.\] \[c_{12m + 4} \pmod{10} = 9 \cdot c_{12m} \pmod{10} - 16 \pmod{10} \cdot c_{12m - 4} \pmod{10} =\] \[= (9 \cdot 7 - 6 \cdot 9) \pmod{10} = (3 - 4) \pmod{10} = 9.\] \[c_{12m + 8}\pmod{10} = 9 \cdot c_{12m+4} \pmod{10} - 16 \pmod{10} \cdot c_{12m } \pmod{10} =\] \[= (9 \cdot 9 - 6 \cdot 7) \pmod{10} = (1 - 2)\pmod{10} = 9.\] \[c_{12m + 12} \pmod{10} = 9 \cdot c_{12m + 8} \pmod{10} - 16 \pmod{10} \cdot c_{12m + 4} \pmod{10} =\] \[= (9 \cdot 9 - 6 \cdot 9) \pmod{10} = (1 - 4) \pmod{10} = 7 \implies\]
The condition is satisfied iff $n = 12 k + 4$ or $n = 12k + 8.$
If $n \le N$ then the number of possible n is $\left\lfloor \frac{N}{4} \right\rfloor - \left\lfloor \frac{N}{12} \right\rfloor.$
For $N = 1000$ we get $\left\lfloor \frac{1000}{4} \right\rfloor - \left\lfloor \frac{1000}{12} \right\rfloor = 250 - 83 = \boxed{167}.$
vladimir.shelomovskii@gmail.com, vvsss
~MathProblemSolvingSkills.com | 167 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
Let $A$ be an acute angle such that $\tan A = 2 \cos A.$ Find the number of positive integers $n$ less than or equal to $1000$ such that $\sec^n A + \tan^n A$ is a positive integer whose units digit is $9.$<|im_end|>
<|im_start|>assistant |
A cube-shaped container has vertices $A,$ $B,$ $C,$ and $D,$ where $\overline{AB}$ and $\overline{CD}$ are parallel edges of the cube, and $\overline{AC}$ and $\overline{BD}$ are diagonals of faces of the cube, as shown. Vertex $A$ of the cube is set on a horizontal plane $\mathcal{P}$ so that the plane of the rectangle $ABDC$ is perpendicular to $\mathcal{P},$ vertex $B$ is $2$ meters above $\mathcal{P},$ vertex $C$ is $8$ meters above $\mathcal{P},$ and vertex $D$ is $10$ meters above $\mathcal{P}.$ The cube contains water whose surface is parallel to $\mathcal{P}$ at a height of $7$ meters above $\mathcal{P}.$ The volume of water is $\frac{m}{n}$ cubic meters, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
Diagram
[asy] //Made by Djmathman size(250); defaultpen(linewidth(0.6)); pair A = origin, B = (6,3), X = rotate(40)*B, Y = rotate(70)*X, C = X+Y, Z = X+B, D = B+C, W = B+Y; pair P1 = 0.8*C+0.2*Y, P2 = 2/3*C+1/3*X, P3 = 0.2*D+0.8*Z, P4 = 0.63*D+0.37*W; pair E = (-20,6), F = (-6,-5), G = (18,-2), H = (9,8); filldraw(E--F--G--H--cycle,rgb(0.98,0.98,0.2)); fill(A--Y--P1--P4--P3--Z--B--cycle,rgb(0.35,0.7,0.9)); draw(A--B--Z--X--A--Y--C--X^^C--D--Z); draw(P1--P2--P3--P4--cycle^^D--P4); dot("$A$",A,S); dot("$B$",B,S); dot("$C$",C,N); dot("$D$",D,N); label("$\mathcal P$",(-13,4.5)); [/asy] | Denote $h(X)$ the distance from point $X$ to $\mathcal{P}, h(A) = 0, h(B) = 2,$ $h(C) = 8, h(D) = 10, h(G) = h(I) = h(H) = 7, AB = a, AC = a \sqrt{2}.$
Let slope $AB$ to $\mathcal{P}$ be $\alpha.$ Notation is shown in the diagram. \[\tan \alpha = \frac {\sin \alpha}{\cos \alpha} = \frac {h(B)}{AB}\cdot \frac {AC}{h(C)} = \frac {\sqrt{2}}{4} \implies a = 6.\] Let $S = GI \cap CD \implies h(S) = h(G) = 7.$ \[h(C) – h(G) = 8 - 7 = 1, h(D)- h(I) = 10 - 7 = 3.\] \[h(E) = h(F) = \frac {h(D) +h(B)}{2} = 6 \implies\] \[\frac {DI}{DE} = \frac {h(D) - h(I)}{h(D)-h(E)} = \frac {3}{4} \implies DI = DH = \frac {9}{2}.\]
Similarly $CG = \frac {3}{2} \implies SD = 9.$
Let the volume without water be $V,$ volume of the pyramid $SCGJ$ be $U.$
It is clear that $U + V = 27U = \frac {SD}{6} \cdot DI^2 = \frac {243}{8} \implies$ $V = \frac {243 \cdot 26}{8 \cdot 27 } = \frac {117}{4} = 6^3 - \frac {747}{4}$ from which $\boxed{751}.$
vladimir.shelomovskii@gmail.com, vvsss | 751 | 6 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
A cube-shaped container has vertices $A,$ $B,$ $C,$ and $D,$ where $\overline{AB}$ and $\overline{CD}$ are parallel edges of the cube, and $\overline{AC}$ and $\overline{BD}$ are diagonals of faces of the cube, as shown. Vertex $A$ of the cube is set on a horizontal plane $\mathcal{P}$ so that the plane of the rectangle $ABDC$ is perpendicular to $\mathcal{P},$ vertex $B$ is $2$ meters above $\mathcal{P},$ vertex $C$ is $8$ meters above $\mathcal{P},$ and vertex $D$ is $10$ meters above $\mathcal{P}.$ The cube contains water whose surface is parallel to $\mathcal{P}$ at a height of $7$ meters above $\mathcal{P}.$ The volume of water is $\frac{m}{n}$ cubic meters, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
Diagram
[asy] //Made by Djmathman size(250); defaultpen(linewidth(0.6)); pair A = origin, B = (6,3), X = rotate(40)*B, Y = rotate(70)*X, C = X+Y, Z = X+B, D = B+C, W = B+Y; pair P1 = 0.8*C+0.2*Y, P2 = 2/3*C+1/3*X, P3 = 0.2*D+0.8*Z, P4 = 0.63*D+0.37*W; pair E = (-20,6), F = (-6,-5), G = (18,-2), H = (9,8); filldraw(E--F--G--H--cycle,rgb(0.98,0.98,0.2)); fill(A--Y--P1--P4--P3--Z--B--cycle,rgb(0.35,0.7,0.9)); draw(A--B--Z--X--A--Y--C--X^^C--D--Z); draw(P1--P2--P3--P4--cycle^^D--P4); dot("$A$",A,S); dot("$B$",B,S); dot("$C$",C,N); dot("$D$",D,N); label("$\mathcal P$",(-13,4.5)); [/asy]<|im_end|>
<|im_start|>assistant |
For each positive integer $n$ let $a_n$ be the least positive integer multiple of $23$ such that $a_n \equiv 1 \pmod{2^n}.$ Find the number of positive integers $n$ less than or equal to $1000$ that satisfy $a_n = a_{n+1}.$ | Observe that if $a_{n-1} - 1$ is divisible by $2^n$, $a_n = a_{n-1}$. If not, $a_n = a_{n-1} + 23 \cdot 2^{n-1}$.
This encourages us to let $b_n = \frac{a_n - 1}{2^n}$. Rewriting the above equations, we have \[b_n = \begin{cases} \frac{b_{n-1}}{2} & \text{if } 2 \text{ } \vert \text{ } b_{n-1} \\ \frac{b_{n-1}+23}{2} &\text{if } 2 \not\vert \text{ } b_{n-1} \end{cases}\] The first few values of $b_n$ are $11, 17, 20, 10, 5, 14, 7, 15, 19, 21,$ and $22$. We notice that $b_{12} = b_1 = 11$, and thus the sequence is periodic with period $11$.
Note that $a_n = a_{n+1}$ if and only if $b_n$ is even. This occurs when $n$ is congruent to $0, 3, 4$ or $6$ mod $11$, giving four solutions for each period.
From $1$ to $1001$ (which is $91 \times 11$), there are $91 \times 4 = 364$ values of $n$. We subtract $1$ from the total since $1001$ satisfies the criteria but is greater than $1000$ to get a final answer of $\fbox{363}$ . ~Bxiao31415
(small changes by bobjoebilly and IraeVid13) | 363 | 4 | <|im_start|>system
Please reason step by step, and put your final answer within \boxed{}.<|im_end|>
<|im_start|>user
For each positive integer $n$ let $a_n$ be the least positive integer multiple of $23$ such that $a_n \equiv 1 \pmod{2^n}.$ Find the number of positive integers $n$ less than or equal to $1000$ that satisfy $a_n = a_{n+1}.$<|im_end|>
<|im_start|>assistant |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.