Dataset Viewer
problem
stringlengths 16
3.7k
| solution_hint
stringlengths 127
3.05k
| solution
stringlengths 13
56
|
|---|---|---|
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.$ | 1. **Identify the Trapezoid and Points**: Let $ABCD$ be an isosceles trapezoid with $AD = BC$ and $AB < CD$. Define $P$, $Q$, and $R$ as the feet of the perpendiculars from $A$ to $BC$, $CD$, and $BD$, respectively.
2. **Use of Simson Line**: Since $ABCD$ is an isosceles trapezoid, it is also a cyclic quadrilateral. Therefore, $A$ lies on the circumcircle of $\triangle BCD$, and $PRQ$ is the Simson Line from $A$. Given $\angle QAB = 90^\circ$, we have $\angle QAR = 90^\circ - \angle RAB = \angle ABR = \angle APR = \angle APQ$ due to the cyclic nature of quadrilateral $APBR$.
3. **Similar Triangles and Ratios**: From $\triangle QAR \sim \triangle QPA$, we derive the ratio $\frac{AQ}{AR} = \frac{PQ}{PA}$. Substituting the known distances, we get $\frac{18}{10} = \frac{QP}{15}$, which simplifies to $QP = 27$. Further, using the same similar triangles, we find $QR = \frac{25}{3}$ and $RP = \frac{56}{3}$.
4. **Cyclic Quadrilaterals and Spiral Similarity**: Quadrilaterals $APBR$ and $ARQD$ are cyclic. The intersection of their circumcircles at points $A$ and $R$ implies that $DRB$ and $QRP$ are line segments through this intersection. A spiral similarity centered at $A$ maps $\triangle APQ$ to $\triangle APD$.
5. **Finding the Ratio of Similitude**: We know the altitude from $A$ to $BD$ is $10$. To find the height from $A$ to $PQ$, we use $QP = 27$. Dropping the altitude from $A$ to $QP$ at $H$, let $QH = x$ and $HP = 27 - x$. Applying the Pythagorean Theorem in $\triangle AQH$ and $\triangle APH$, we solve:
\[
225 - x^2 = 324 - (x^2 - 54x + 729) \implies 54x = 630 \implies x = \frac{35}{3}.
\]
Then, $RH = QH - QR = \frac{35}{3} - \frac{25}{3} = \frac{10}{3}$. From $\triangle ARH$, we find $AH = \frac{20\sqrt{2}}{3}$, giving the ratio of similitude as $\frac{3\sqrt{2}}{4}$.
6. **Calculating $AB$ and $AD$**: Using the ratio of similitude, we find:
\[
AB = 15 \cdot \frac{3\sqrt{2}}{4} = \frac{45\sqrt{2}}{4}, \quad AD = 18 \cdot \frac{3\sqrt{2}}{4} = \frac{27\sqrt{2}}{2}.
\]
Using the Pythagorean Theorem in $\triangle AQD$, we find:
\[
QD = \sqrt{\left(\frac{27\sqrt{2}}{2}\right)^2 - 18^2} = \frac{9\sqrt{2}}{2}.
\]
7. **Area Calculation**: The height of trapezoid $ABCD$ is $AQ = 18$, the top base $AB = \frac{45\sqrt{2}}{4}$, and the bottom base $CD = \frac{45\sqrt{2}}{4} + 2 \cdot \frac{9\sqrt{2}}{2}$. The area $K$ is:
\[
K = \frac{b_1 + b_2}{2} \cdot h = \frac{63\sqrt{2}}{4} \cdot 18 = \frac{567\sqrt{2}}{2}.
\]
Therefore, $\sqrt{2} \cdot K = \boxed{567}$. | \(\boxed{270}\) |
Find the value of $10\cot(\cot^{-1}3+\cot^{-1}7+\cot^{-1}13+\cot^{-1}21).$ | On the coordinate plane, let $O=(0,0)$, $A_1=(3,0)$, $A_2=(3,1)$, $B_1=(21,7)$, $B_2=(20,10)$, $C_1=(260,130)$, $C_2=(250,150)$, $D_1=(5250,3150)$, $D_2=(5100,3400)$, and $H=(5100,0)$. We see that $\cot^{-1}(\angle A_2OA_1)=3$, $\cot^{-1}(\angle B_2OB_1)=7$, $\cot^{-1}(\angle C_2OC_1)=13$, and $\cot^{-1}(\angle D_2OD_1)=21$. The sum of these four angles forms the angle of triangle $OD_2H$, which has a cotangent of $\frac{5100}{3400}=\frac{3}{2}$, which must mean that $\cot( \cot^{-1}3+\cot^{-1}7+\cot^{-1}13+\cot^{-1}21)=\frac{3}{2}$. So the answer is $10\cdot\left(\frac{3}{2}\right)=\boxed{015}.$ | \(\boxed{15}\) |
Evaluate the product \[\left(\sqrt{5}+\sqrt{6}+\sqrt{7}\right)\left(\sqrt{5}+\sqrt{6}-\sqrt{7}\right)\left(\sqrt{5}-\sqrt{6}+\sqrt{7}\right)\left(-\sqrt{5}+\sqrt{6}+\sqrt{7}\right).\] | We group the first and last factors as well as the two middle factors, then apply the difference of squares repeatedly: \begin{align*} \left(\left(\sqrt{6} + \sqrt{7}\right)^2 - \sqrt{5}^2\right)\left(\sqrt{5}^2 - \left(\sqrt{6} - \sqrt{7}\right)^2\right) &= \left(13 + 2\sqrt{42} - 5\right)\left(5 - \left(13 - 2\sqrt{42}\right)\right) \\ &= \left(2\sqrt{42} + 8\right)\left(2\sqrt{42} - 8\right) \\ &= \left(2\sqrt{42}\right)^2 - 8^2 \\ &= \boxed{104}. \end{align*} ~Azjps (Solution)
~MRENTHUSIASM (Revision) | \(\boxed{104}\) |
The increasing sequence $1,3,4,9,10,12,13\cdots$ consists of all those positive integers which are powers of 3 or sums of distinct powers of 3. Find the $100^{\mbox{th}}$ term of this sequence. | Notice that the first term of the sequence is $1$, the second is $3$, the fourth is $9$, and so on. Thus the $64th$ term of the sequence is $729$. Now out of $64$ terms which are of the form $729$ + $'''S'''$, $32$ of them include $243$ and $32$ do not. The smallest term that includes $243$, i.e. $972$, is greater than the largest term which does not, or $854$. So the $96$th term will be $972$, then $973$, then $975$, then $976$, and finally $\boxed{981}$ | \(\boxed{981}\) |
Let the sum of a set of numbers be the sum of its elements. Let $S$ be a set of positive integers, none greater than 15. Suppose no two disjoint subsets of $S$ have the same sum. What is the largest sum a set $S$ with these properties can have? | By using the greedy algorithm, we obtain $\boxed{061}$, with $S=\{ 15,14,13,11,8\}$. We must now prove that no such set has sum greater than 61. Suppose such a set $S$ existed. Then $S$ must have more than 4 elements, otherwise its sum would be at most $15+14+13+12=54$.
$S$ can't have more than 5 elements. To see why, note that at least $\dbinom{6}{0} + \dbinom{6}{1} + \dbinom{6}{2} + \dbinom{6}{3} + \dbinom{6}{4}=57$ of its subsets have at most four elements (the number of subsets with no elements plus the number of subsets with one element and so on), and each of them have sum at most 54. By the Pigeonhole Principle, two of these subsets would have the same sum. If those subsets were disjoint, we would directly arrive at a contradiction; if not, we could remove the common elements to get two disjoint subsets.
Thus, $S$ would have to have 5 elements. $S$ contains both 15 and 14 (otherwise its sum is at most $10+11+12+13+15=61$). It follows that $S$ cannot contain both $a$ and $a-1$ for any $a\leq 13$, or the subsets $\{a,14\}$ and $\{a-1,15\}$ would have the same sum. So now $S$ must contain 13 (otherwise its sum is at most $15+14+12+10+8=59$), and $S$ cannot contain 12, or the subsets $\{12,15\}$ and $\{13,14\}$ would have the same sum.
Now the only way $S$ could have sum at least $62=15+14+13+11+9$ would be if $S=\{ 15,14,13,11,9\}$. But the subsets $\{9,15\}$ and $\{11,13\}$ have the same sum, so this set does not work. Therefore no $S$ with sum greater than 61 is possible and 61 is indeed the maximum. | \(\boxed{61}\) |
In a sequence of coin tosses, one can keep a record of instances in which a tail is immediately followed by a head, a head is immediately followed by a head, and etc. We denote these by TH, HH, and etc. For example, in the sequence TTTHHTHTTTHHTTH of 15 coin tosses we observe that there are two HH, three HT, four TH, and five TT subsequences. How many different sequences of 15 coin tosses will contain exactly two HH, three HT, four TH, and five TT subsequences? | Let's consider each of the sequences of two coin tosses as an operation instead; this operation takes a string and adds the next coin toss on (eg, THHTH + HT = THHTHT). We examine what happens to the last coin toss. Adding HH or TT is simply an identity for the last coin toss, so we will ignore them for now. However, adding HT or TH switches the last coin. H switches to T three times, but T switches to H four times; hence it follows that our string will have a structure of THTHTHTH.
Now we have to count all of the different ways we can add the identities back in. There are 5 TT subsequences, which means that we have to add 5 T into the strings, as long as the new Ts are adjacent to existing Ts. There are already 4 Ts in the sequence, and since order doesn’t matter between different tail flips this just becomes the ball-and-urn argument. We want to add 5 balls into 4 urns, which is the same as 3 dividers; hence this gives ${{5+3}\choose3} = 56$ combinations. We do the same with 2 Hs to get ${{2+3}\choose3} = 10$ combinations; thus there are $56 \cdot 10 = \boxed{560}$ possible sequences.
Slight Variation
The structure of the final order is T_H_T_H_T_H_T_H_, and there are 4 spots to put the 2 heads in, and 4 spots to put the 5 tails in. By using the formula for distributing r identical objects into n distinct boxes $\dbinom{r+n-1}{r}$ and multiplication, the answer is ${{2+4-1}\choose2}$ * ${{5+4-1}\choose5}$ =560 | \(\boxed{560}\) |
Find the area of the region enclosed by the graph of $|x-60|+|y|=\left|\frac{x}{4}\right|.$ | Since $|y|$ is nonnegative, $\left|\frac{x}{4}\right| \ge |x - 60|$. Solving this gives us two equations: $\frac{x}{4} \ge x - 60\ \mathrm{and} \ -\frac{x}{4} \le x - 60$. Thus, $48 \le x \le 80$. The maximum and minimum y value is when $|x - 60| = 0$, which is when $x = 60$ and $y = \pm 15$. Since the graph is symmetric about the y-axis, we just need casework upon $x$. $\frac{x}{4} > 0$, so we break up the condition $|x-60|$:
$x - 60 > 0$. Then $y = -\frac{3}{4}x+60$.
$x - 60 < 0$. Then $y = \frac{5}{4}x-60$.
The area of the region enclosed by the graph is that of the quadrilateral defined by the points $(48,0),\ (60,15),\ (80,0), \ (60,-15)$. Breaking it up into triangles and solving or using the Shoelace Theorem, we get $2 \cdot \frac{1}{2}(80 - 48)(15) = \boxed{480}$. | \(\boxed{480}\) |
Al walks down to the bottom of an escalator that is moving up and he counts 150 steps. His friend, Bob, walks up to the top of the escalator and counts 75 steps. If Al's speed of walking (in steps per unit time) is three times Bob's walking speed, how many steps are visible on the escalator at a given time? (Assume that this value is constant.) | Let $e$ and $b$ be the speeds of the escalator and Bob, respectively.
When Al was on his way down, he took $150$ steps with a speed of $3b-e$ per step. When Bob was on his way up, he took $75$ steps with a speed of $b+e$ per step. Since Al and Bob were walking the same distance, we have \[150(3b-e)=75(b+e)\] Solving gets the ratio $\frac{e}{b}=\frac{3}{5}$.
Thus while Bob took $75$ steps to go up, the escalator contributed an extra $\frac{3}{5}\cdot75=45$ steps.
Finally, there is a total of $75+45=\boxed{120}$ steps in the length of the escalator. | \(\boxed{120}\) |
Find the largest possible value of $k$ for which $3^{11}$ is expressible as the sum of $k$ consecutive positive integers. | Let us write down one such sum, with $m$ terms and first term $n + 1$:
$3^{11} = (n + 1) + (n + 2) + \ldots + (n + m) = \frac{1}{2} m(2n + m + 1)$.
Thus $m(2n + m + 1) = 2 \cdot 3^{11}$ so $m$ is a divisor of $2\cdot 3^{11}$. However, because $n \geq 0$ we have $m^2 < m(m + 1) \leq 2\cdot 3^{11}$ so $m < \sqrt{2\cdot 3^{11}} < 3^6$. Thus, we are looking for large factors of $2\cdot 3^{11}$ which are less than $3^6$. The largest such factor is clearly $2\cdot 3^5 = 486$; for this value of $m$ we do indeed have the valid expression $3^{11} = 122 + 123 + \ldots + 607$, for which $k=\boxed{486}$. | \(\boxed{486}\) |
Compute \[\frac{(10^4+324)(22^4+324)(34^4+324)(46^4+324)(58^4+324)}{(4^4+324)(16^4+324)(28^4+324)(40^4+324)(52^4+324)}.\] | In both the numerator and the denominator, each factor is of the form $N^4+324=N^4+18^2$ for some positive integer $N.$
We factor $N^4+18^2$ by completing the square, then applying the difference of squares: \begin{align*} N^4+18^2&=\left(N^4+36N^2+18^2\right)-36N^2 \\ &=\left(N^2+18\right)^2-(6N)^2 \\ &=\left(N^2-6N+18\right)\left(N^2+6N+18\right) \\ &=\left((N-3)^2+9\right)\left((N+3)^2+9\right). \end{align*} The original expression now becomes \[\frac{\left[(7^2+9)(13^2+9)\right]\left[(19^2+9)(25^2+9)\right]\left[(31^2+9)(37^2+9)\right]\left[(43^2+9)(49^2+9)\right]\left[(55^2+9)(61^2+9)\right]}{\left[(1^2+9)(7^2+9)\right]\left[(13^2+9)(19^2+9)\right]\left[(25^2+9)(31^2+9)\right]\left[(37^2+9)(43^2+9)\right]\left[(49^2+9)(55^2+9)\right]}=\frac{61^2+9}{1^2+9}=\boxed{373}.\] ~MRENTHUSIASM | \(\boxed{373}\) |
A convex polyhedron has for its faces 12 squares, 8 regular hexagons, and 6 regular octagons. At each vertex of the polyhedron one square, one hexagon, and one octagon meet. How many segments joining vertices of the polyhedron lie in the interior of the polyhedron rather than along an edge or a face? | In the same ways as above, we find that there are 48 vertices. Now, notice that there are $\binom{48}{2}$ total possible ways to choose two vertices. However, we must remove the cases where the segments do not lie in the interior of the polyhedron. We get
\[\binom{48}{2}-12\binom{4}{2}-8\binom{6}{2}-6\binom{8}{2}=768\]
We remover all the possible edges of the squares, hexagons, and octagons. However, we have undercounted! We must add back the number of edges because when we subtracted the three binomials from $\binom{48}{2}$ we removed each edge twice (each edge is shared by two polygons). This means that we need to add back the number of edges, 72. Thus, we get $768+72=\boxed{840}$. | \(\boxed{840}\) |
The increasing sequence $2,3,5,6,7,10,11,\ldots$ consists of all positive integers that are neither the square nor the cube of a positive integer. Find the 500th term of this sequence. | Because there aren't that many perfect squares or cubes, let's look for the smallest perfect square greater than $500$. This happens to be $23^2=529$. Notice that there are $23$ squares and $8$ cubes less than or equal to $529$, but $1$ and $2^6$ are both squares and cubes. Thus, there are $529-23-8+2=500$ numbers in our sequence less than $529$. Magically, we want the $500th$ term, so our answer is the smallest non-square and non-cube less than $529$, which is $\boxed{528}$. | \(\boxed{528}\) |
A biologist wants to calculate the number of fish in a lake. On May 1 she catches a random sample of 60 fish, tags them, and releases them. On September 1 she catches a random sample of 70 fish and finds that 3 of them are tagged. To calculate the number of fish in the lake on May 1, she assumes that 25% of these fish are no longer in the lake on September 1 (because of death and emigrations), that 40% of the fish were not in the lake May 1 (because of births and immigrations), and that the number of untagged fish and tagged fish in the September 1 sample are representative of the total population. What does the biologist calculate for the number of fish in the lake on May 1? | First, we notice that there are 45 tags left, after 25% of the original fish have went away/died. Then, some $x$ percent of fish have been added such that $\frac{x}{x+75} = 40 \%$, or $\frac{2}{5}$. Solving for $x$, we get that $x = 50$, so the total number of fish in September is $125 \%$, or $\frac{5}{4}$ times the total number of fish in May.
Since $\frac{3}{70}$ of the fish in September were tagged, $\frac{45}{5n/4} = \frac{3}{70}$, where $n$ is the number of fish in May. Solving for $n$, we see that $n = \boxed{840}$ | \(\boxed{840}\) |
Find $ax^5 + by^5$ if the real numbers $a,b,x,$ and $y$ satisfy the equations \begin{align*} ax + by &= 3, \\ ax^2 + by^2 &= 7, \\ ax^3 + by^3 &= 16, \\ ax^4 + by^4 &= 42. \end{align*} | A recurrence of the form $T_n=AT_{n-1}+BT_{n-2}$ will have the closed form $T_n=ax^n+by^n$, where $x,y$ are the values of the starting term that make the sequence geometric, and $a,b$ are the appropriately chosen constants such that those special starting terms linearly combine to form the actual starting terms.
Suppose we have such a recurrence with $T_1=3$ and $T_2=7$. Then $T_3=ax^3+by^3=16=7A+3B$, and $T_4=ax^4+by^4=42=16A+7B$.
Solving these simultaneous equations for $A$ and $B$, we see that $A=-14$ and $B=38$. So, $ax^5+by^5=T_5=-14(42)+38(16)= \boxed{020}$. | \(\boxed{20}\) |
Find $x^2+y^2_{}$ if $x_{}^{}$ and $y_{}^{}$ are positive integers such that \begin{align*} xy+x+y&=71, \\ x^2y+xy^2&=880. \end{align*} | Let $a=x+y$, $b=xy$ then we get the equations \begin{align*} a+b&=71\\ ab&=880 \end{align*} After finding the prime factorization of $880=2^4\cdot5\cdot11$, it's easy to obtain the solution $(a,b)=(16,55)$. Thus \[x^2+y^2=(x+y)^2-2xy=a^2-2b=16^2-2\cdot55=\boxed{146}\] Note that if $(a,b)=(55,16)$, the answer would exceed $999$ which is invalid for an AIME answer. ~ Nafer | \(\boxed{146}\) |
Find the sum of all positive rational numbers that are less than 10 and that have denominator 30 when written in lowest terms. | Note that if $x$ is a solution, then $(300-x)$ is a solution. We know that $\phi(300) = 80.$ Therefore the answer is $\frac{80}{2} \cdot\frac{300}{30} = \boxed{400}.$
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. | \(\boxed{400}\) |
Define a positive integer $n^{}_{}$ to be a factorial tail if there is some positive integer $m^{}_{}$ such that the decimal representation of $m!$ ends with exactly $n$ zeroes. How many positive integers less than $1992$ are not factorial tails? | After testing various values of $m$ in $f(m)$ of solution 1 to determine $m$ for which $f(m) = 1992$, we find that $m \in \{7980, 7981, 7982, 7983, 7984\}$. WLOG, we select $7980$. Furthermore, note that every time $k$ reaches a multiple of $25$, $k!$ will gain two or more additional factors of $5$ and will thus skip one or more numbers.
With this logic, we realize that the desired quantity is simply $\left \lfloor \frac{7980}{25} \right \rfloor + \left \lfloor \frac{7980}{125} \right \rfloor \cdots$, where the first term accounts for every time $1$ number is skipped, the second term accounts for each time $2$ numbers are skipped, and so on. Evaluating this gives us $319 + 63 + 12 + 2 = \boxed{396}$. - Spacesam(edited by srisainandan6) | \(\boxed{396}\) |
How many even integers between 4000 and 7000 have four different digits? | The thousands digit is $\in \{4,5,6\}$.
Case $1$: Thousands digit is even
$4, 6$, two possibilities, then there are only $\frac{10}{2} - 1 = 4$ possibilities for the units digit. This leaves $8$ possible digits for the hundreds and $7$ for the tens places, yielding a total of $2 \cdot 8 \cdot 7 \cdot 4 = 448$.
Case $2$: Thousands digit is odd
$5$, one possibility, then there are $5$ choices for the units digit, with $8$ digits for the hundreds and $7$ for the tens place. This gives $1 \cdot 8 \cdot 7 \cdot 5= 280$ possibilities.
Together, the solution is $448 + 280 = \boxed{728}$. | \(\boxed{728}\) |
Jenny and Kenny are walking in the same direction, Kenny at 3 feet per second and Jenny at 1 foot per second, on parallel paths that are 200 feet apart. A tall circular building 100 feet in diameter is centered midway between the paths. At the instant when the building first blocks the line of sight between Jenny and Kenny, they are 200 feet apart. Let $t\,$ be the amount of time, in seconds, before Jenny and Kenny can see each other again. If $t\,$ is written as a fraction in lowest terms, what is the sum of the numerator and denominator? | Consider the unit cicle of radius 50. Assume that they start at points $(-50,100)$ and $(-50,-100).$ Then at time $t$, they end up at points $(-50+t,100)$ and $(-50+3t,-100).$ The equation of the line connecting these points and the equation of the circle are \begin{align}y&=-\frac{100}{t}x+200-\frac{5000}{t}\\50^2&=x^2+y^2\end{align}. When they see each other again, the line connecting the two points will be tangent to the circle at the point $(x,y).$ Since the radius is perpendicular to the tangent we get \[-\frac{x}{y}=-\frac{100}{t}\] or $xt=100y.$ Now substitute \[y= \frac{xt}{100}\] into $(2)$ and get \[x=\frac{5000}{\sqrt{100^2+t^2}}.\] Now substitute this and \[y=\frac{xt}{100}\] into $(1)$ and solve for $t$ to get \[t=\frac{160}{3}.\] Finally, the sum of the numerator and denominator is $160+3=\boxed{163}.$ | \(\boxed{163}\) |
For how many ordered pairs of positive integers $(x,y),$ with $y<x\le 100,$ are both $\frac xy$ and $\frac{x+1}{y+1}$ integers? | We know that $x \equiv 0 \mod y$ and $x+1 \equiv 0 \mod y+1$.
Write $x$ and $ky$ for some integer $k$. Then, $ky+1 \equiv 0\mod y+1$. We can add $k$ to each side in order to factor out a $y+1$. So, $ky+k+1 \equiv k \mod y+1$ or $k(y+1)+1 \equiv k \mod y+1$. We know that $k(y+1) \equiv 0 \mod y+1$. We finally achieve the congruence $1-k \equiv 0 \mod y+1$.
We can now write $k$ as $(y+1)a+1$. Plugging this back in, if we have a value for $y$, then $x = ky = ((y+1)a+1)y = y(y+1)a+y$. We only have to check values of $y$ when $y(y+1)<100$. This yields the equations $x = 2a+1, 6a+2, 12a+3, 20a+4, 30a+5, 42a+6, 56a+7, 72a+8, 90a+9$.
Finding all possible values of $a$ such that $y<x<100$, we get $49 + 16 + 8 + 4 + 3 + 2 + 1 + 1 + 1 = \boxed{085}.$ | \(\boxed{85}\) |
Pyramid $OABCD$ has square base $ABCD,$ congruent edges $\overline{OA}, \overline{OB}, \overline{OC},$ and $\overline{OD},$ and $\angle AOB=45^\circ.$ Let $\theta$ be the measure of the dihedral angle formed by faces $OAB$ and $OBC.$ Given that $\cos \theta=m+\sqrt{n},$ where $m_{}$ and $n_{}$ are integers, find $m+n.$ | [asy] import three; // calculate intersection of line and plane // p = point on line // d = direction of line // q = point in plane // n = normal to plane triple lineintersectplan(triple p, triple d, triple q, triple n) { return (p + dot(n,q - p)/dot(n,d)*d); } // projection of point A onto line BC triple projectionofpointontoline(triple A, triple B, triple C) { return lineintersectplan(B, B - C, A, B - C); } currentprojection=perspective(2,1,1); triple A, B, C, D, O, P; A = (sqrt(2 - sqrt(2)), sqrt(2 - sqrt(2)), 0); B = (-sqrt(2 - sqrt(2)), sqrt(2 - sqrt(2)), 0); C = (-sqrt(2 - sqrt(2)), -sqrt(2 - sqrt(2)), 0); D = (sqrt(2 - sqrt(2)), -sqrt(2 - sqrt(2)), 0); O = (0,0,sqrt(2*sqrt(2))); P = projectionofpointontoline(A,O,B); draw(D--A--B); draw(B--C--D,dashed); draw(A--O); draw(B--O); draw(C--O,dashed); draw(D--O); draw(A--P); draw(P--C,dashed); label("$A$", A, S); label("$B$", B, E); label("$C$", C, NW); label("$D$", D, W); label("$O$", O, N); dot("$P$", P, NE); [/asy]
The angle $\theta$ is the angle formed by two perpendiculars drawn to $BO$, one on the plane determined by $OAB$ and the other by $OBC$. Let the perpendiculars from $A$ and $C$ to $\overline{OB}$ meet $\overline{OB}$ at $P.$ Without loss of generality, let $AP = 1.$ It follows that $\triangle OPA$ is a $45-45-90$ right triangle, so $OP = AP = 1,$ $OB = OA = \sqrt {2},$ and $AB = \sqrt {4 - 2\sqrt {2}}.$ Therefore, $AC = \sqrt {8 - 4\sqrt {2}}.$
From the Law of Cosines, $AC^{2} = AP^{2} + PC^{2} - 2(AP)(PC)\cos \theta,$ so
\[8 - 4\sqrt {2} = 1 + 1 - 2\cos \theta \Longrightarrow \cos \theta = - 3 + 2\sqrt {2} = - 3 + \sqrt{8}.\]
Thus $m + n = \boxed{005}$. | \(\boxed{5}\) |
Let $f(n)$ be the integer closest to $\sqrt[4]{n}.$ Find $\sum_{k=1}^{1995}\frac 1{f(k)}.$ | This is a pretty easy problem just to bash. Since the max number we can get is $7$, we just need to test $n$ values for $1.5,2.5,3.5,4.5,5.5$ and $6.5$. Then just do how many numbers there are times $\frac{1}{\lfloor n \rfloor}$, which should be $5+17+37+65+101+145+30 = \boxed{400}$ | \(\boxed{400}\) |
Two squares of a $7\times 7$ checkerboard are painted yellow, and the rest are painted green. Two color schemes are equivalent if one can be obtained from the other by applying a rotation in the plane board. How many inequivalent color schemes are possible? | There are 4 cases: 1. The center square is occupied, in which there are $12$ cases. 2. The center square isn't occupied and the two squares that are opposite to each other with respect to the center square, in which there are $12$ cases. 3. The center square isn't occupied and the two squares can rotate to each other with a $90^{\circ}$ rotation with each other and with respect to the center square, in which case there are $12$ cases. 4. And finally, the two squares can't rotate to each other with respect to the center square in which case there are $\dbinom{12}{2} \cdot \frac{16}{4} = 264$ cases. Add up all the values for each case to get $\boxed{300}$ as your answer.
~First | \(\boxed{300}\) |
A $150\times 324\times 375$ rectangular solid is made by gluing together $1\times 1\times 1$ cubes. An internal diagonal of this solid passes through the interiors of how many of the $1\times 1\times 1$ cubes? | Consider a point travelling across the internal diagonal, and let the internal diagonal have a length of $d$. The point enters a new unit cube in the $x,y,z$ dimensions at multiples of $\frac{d}{150}, \frac{d}{324}, \frac{d}{375}$ respectively. We proceed by using PIE.
The point enters a new cube in the $x$ dimension $150$ times, in the $y$ dimension $324$ times and in the $z$ dimension, $375$ times.
The point enters a new cube in the $x$ and $y$ dimensions whenever a multiple of $\frac{d}{150}$ equals a multiple of $\frac{d}{324}$. This occurs $\gcd(150, 324)$ times. Similarly, a point enters a new cube in the $y,z$ dimensions $\gcd(324, 375)$ times and a point enters a new cube in the $z,x$ dimensions $\gcd(375, 150)$ times.
The point enters a new cube in the $x,y$ and $z$ dimensions whenever some multiples of $\frac{d}{150}, \frac{d}{324}, \frac{d}{375}$ are equal. This occurs $\gcd(150, 324, 375)$ times.
The total number of unit cubes entered is then $150+324+375-[\gcd(150, 324)+\gcd(324, 375)+\gcd(375, 150))] + \gcd(150, 324, 375) = \boxed{768}$ | \(\boxed{768}\) |
How many of the integers between 1 and 1000, inclusive, can be expressed as the difference of the squares of two nonnegative integers? | Notice that all odd numbers can be obtained by using $(a+1)^2-a^2=2a+1,$ where $a$ is a nonnegative integer. All multiples of $4$ can be obtained by using $(b+1)^2-(b-1)^2 = 4b$, where $b$ is a positive integer. Numbers congruent to $2 \pmod 4$ cannot be obtained because squares are $0, 1 \pmod 4.$ Thus, the answer is $500+250 = \boxed{750}.$ | \(\boxed{750}\) |
How many different $4\times 4$ arrays whose entries are all 1's and -1's have the property that the sum of the entries in each row is 0 and the sum of the entries in each column is 0? | We can think about it as shading a $4 \times 4$ array so that there are exactly two shaded unit squares in each row and each column. Then the answer is $\boxed{90}$. | \(\boxed{90}\) |
Given that $A_k = \frac {k(k - 1)}2\cos\frac {k(k - 1)\pi}2,$ find $|A_{19} + A_{20} + \cdots + A_{98}|.$ | Though the problem may appear to be quite daunting, it is actually not that difficult. $\frac {k(k-1)}2$ always evaluates to an integer (triangular number), and the cosine of $n\pi$ where $n \in \mathbb{Z}$ is 1 if $n$ is even and -1 if $n$ is odd. $\frac {k(k-1)}2$ will be even if $4|k$ or $4|k-1$, and odd otherwise.
So our sum looks something like:
$\left|\sum_{i=19}^{98} A_i\right| =- \frac{19(18)}{2} + \frac{20(19)}{2} + \frac{21(20)}{2} - \frac{22(21)}{2} - \frac{23(22)}{2} + \frac{24(23)}{2} \cdots - \frac{98(97)}{2}$
If we group the terms in pairs, we see that we need a formula for $-\frac{(n)(n-1)}{2} + \frac{(n+1)(n)}{2} = \left(\frac n2\right)(n+1 - (n-1)) = n$. So the first two fractions add up to $19$, the next two to $-21$, and so forth.
If we pair the terms again now, each pair adds up to $-2$. There are $\frac{98-19+1}{2 \cdot 2} = 20$ such pairs, so our answer is $|-2 \cdot 20| = \boxed{040}$. | \(\boxed{40}\) |
Let $n$ be the number of ordered quadruples $(x_1,x_2,x_3,x_4)$ of positive odd integers that satisfy $\sum_{i = 1}^4 x_i = 98.$ Find $\frac n{100}.$ | Define $x_i = 2y_i - 1$. Then $2\left(\sum_{i = 1}^4 y_i\right) - 4 = 98$, so $\sum_{i = 1}^4 y_i = 51$.
So we want to find four natural numbers that sum up to 51; we can imagine this as trying to split up 51 on the number line into 4 ranges. This is equivalent to trying to place 3 markers on the numbers 1 through 50; thus the answer is $n = {50\choose3} = \frac{50 * 49 * 48}{3 * 2} = 19600$, and $\frac n{100} = \boxed{196}$. | \(\boxed{196}\) |
Find the sum of all positive integers $n$ for which $n^2-19n+99$ is a perfect square. | When $n \geq 12$, we have \[(n-10)^2 < n^2 -19n + 99 < (n-8)^2.\]
So if $n \geq 12$ and $n^2 -19n + 99$ is a perfect square, then \[n^2 -19n + 99 = (n-9)^2\]
or $n = 18$.
For $1 \leq n < 12$, it is easy to check that $n^2 -19n + 99$ is a perfect square when $n = 1, 9$ and $10$ ( using the identity $n^2 -19n + 99 = (n-10)^2 + n - 1.)$
We conclude that the answer is $1 + 9 + 10 + 18 = \boxed{38}.$ | \(\boxed{38}\) |
A transformation of the first quadrant of the coordinate plane maps each point $(x,y)$ to the point $(\sqrt{x},\sqrt{y}).$ The vertices of quadrilateral $ABCD$ are $A=(900,300), B=(1800,600), C=(600,1800),$ and $D=(300,900).$ Let $k_{}$ be the area of the region enclosed by the image of quadrilateral $ABCD.$ Find the greatest integer that does not exceed $k_{}.$ | \begin{eqnarray*}A' = & (\sqrt {900}, \sqrt {300})\\ B' = & (\sqrt {1800}, \sqrt {600})\\ C' = & (\sqrt {600}, \sqrt {1800})\\ D' = & (\sqrt {300}, \sqrt {900}) \end{eqnarray*}
First we see that lines passing through $AB$ and $CD$ have equations $y = \frac {1}{3}x$ and $y = 3x$, respectively. Looking at the points above, we see the equations for $A'B'$ and $C'D'$ are $y^2 = \frac {1}{3}x^2$ and $y^2 = 3x^2$, or, after manipulation $y = \frac {x}{\sqrt {3}}$ and $y = \sqrt {3}x$, respectively, which are still linear functions. Basically the square of the image points gives back the original points and we could plug them back into the original equation to get the equation of the image lines.
Now take a look at $BC$ and $AD$, which have the equations $y = - x + 2400$ and $y = - x + 1200$. The image equations hence are $x^2 + y^2 = 2400$ and $x^2 + y^2 = 1200$, respectively, which are the equations for circles.
To find the area between the circles (actually, parts of the circles), we need to figure out the angle of the arc. This could be done by $\arctan \sqrt {3} - \arctan \frac {1}{\sqrt {3}} = 60^\circ - 30^\circ = 30^\circ$. So the requested areas are the area of the enclosed part of the smaller circle subtracted from the area enclosed by the part of the larger circle = $\frac {30^\circ}{360^\circ}(R^2\pi - r^2\pi) = \frac {1}{12}(2400\pi - 1200\pi) = 100\pi$. Hence the answer is $\boxed{314}$. | \(\boxed{314}\) |
Given that $\sum_{k=1}^{35}\sin 5k=\tan \frac mn,$ where angles are measured in degrees, and $m_{}$ and $n_{}$ are relatively prime positive integers that satisfy $\frac mn<90,$ find $m+n.$ | We note that $\sin x = \mbox{Im } e^{ix}$. We thus have that \begin{align*} \sum_{k = 1}^{35} \sin 5k &= \sum_{k = 1}^{35} \mbox{Im } e^{5ki}\\ &= \mbox{Im } \sum_{k = 1}^{35} e^{5ki}\\ &= \mbox{Im } \frac{e^{5i}(1 - e^{180i})}{1 - e^{5i}}\\ &= \mbox{Im } \frac{2\cos5 + 2i \sin 5}{(1 - \cos 5) - i \sin 5}\\ &= \mbox{Im } \frac{(2 \cos 5 + 2i \sin 5)[(1 - \cos 5) + i \sin 5]}{(1 - \cos 5)^2 + \sin^2 5}\\ &= \frac{2 \sin 5}{2 - 2 \cos 5}\\ &= \frac{\sin 5}{1 - \cos 5}\\ &= \frac{\sin 175}{1 + \cos 175} \\ &= \tan \frac{175}{2}.\\ \end{align*} The desired answer is thus $175 + 2 = \boxed{177}$. | \(\boxed{177}\) |
Let the set $\mathcal{S} = \{8, 5, 1, 13, 34, 3, 21, 2\}.$ Susan makes a list as follows: for each two-element subset of $\mathcal{S},$ she writes on her list the greater of the set's two elements. Find the sum of the numbers on the list. | Thinking of this problem algorithmically, one can "sort" the array to give: \[{1, 2, 3, 5, 8, 13, 21, 34}\]
Now, notice that when we consider different pairs, we are only going to fixate one element and look at the all of the next elements in the array, basically the whole $j = i + 1$ shebang. Then, we see that if we set the sum of the whole array to $x,$ we get out answer to be
\[(x-1) + (x-3) + (x-6) + (x-11) + (x-19) + (x-32) + (x-53) = 7x - 125\]
Finding $x$ isn't hard, and we see that it is equal to $609$:
\[609 - 125 = \boxed{484}\] | \(\boxed{484}\) |
Given that $\log_{10} \sin x + \log_{10} \cos x = -1$ and that $\log_{10} (\sin x + \cos x) = \frac{1}{2} (\log_{10} n - 1),$ find $n.$ | Using the properties of logarithms, we can simplify the first equation to $\log_{10} \sin x + \log_{10} \cos x = \log_{10}(\sin x \cos x) = -1$. Therefore, \[\sin x \cos x = \frac{1}{10}.\qquad (*)\]
Now, manipulate the second equation. \begin{align*} \log_{10} (\sin x + \cos x) &= \frac{1}{2}(\log_{10} n - \log_{10} 10) \\ \log_{10} (\sin x + \cos x) &= \left(\log_{10} \sqrt{\frac{n}{10}}\right) \\ \sin x + \cos x &= \sqrt{\frac{n}{10}} \\ (\sin x + \cos x)^{2} &= \left(\sqrt{\frac{n}{10}}\right)^2 \\ \sin^2 x + \cos^2 x +2 \sin x \cos x &= \frac{n}{10} \\ \end{align*}
By the Pythagorean identities, $\sin ^2 x + \cos ^2 x = 1$, and we can substitute the value for $\sin x \cos x$ from $(*)$. $1 + 2\left(\frac{1}{10}\right) = \frac{n}{10} \Longrightarrow n = \boxed{012}$. | \(\boxed{12}\) |
In $\triangle ABC, AB = 360, BC = 507,$ and $CA = 780.$ Let $M$ be the midpoint of $\overline{CA},$ and let $D$ be the point on $\overline{CA}$ such that $\overline{BD}$ bisects angle $ABC.$ Let $F$ be the point on $\overline{BC}$ such that $\overline{DF} \perp \overline{BD}.$ Suppose that $\overline{DF}$ meets $\overline{BM}$ at $E.$ The ratio $DE: EF$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$ | Firstly, angle bisector theorem yields $\frac{CD}{AD} = \frac{507}{360} = \frac{169}{120}$. We're given that $AM=MC$. Therefore, the cross ratio
\[(A,C;M,D) = \frac{AM(CD)}{AD(MC)} = \frac{169}{120}\]
We need a fourth point for this cross ratio to be useful, so reflect point $F$ over angle bisector $BD$ to a point $F'$. Then $\triangle BFF'$ is isosceles and $BD$ is an altitude so $DF = DF'$. Therefore,
\[(A,C;M,D) = (F,F';D,E) \implies \frac{FD(EF')}{EF(DF')} = \frac{EF'}{EF} = \frac{169}{120}\]
All that's left is to fiddle around with the ratios:
\[\frac{EF'}{EF} = \frac{ED+DF'}{EF} = \frac{EF+2DF}{EF} = 1\ +\ 2\left(\frac{DF}{EF}\right) \implies \frac{DF}{EF} = \frac{49}{240} \implies \boxed{289}\] | \(\boxed{289}\) |
In triangle $ABC,$ $AB = 13,$ $BC = 14,$ $AC = 15,$ and point $G$ is the intersection of the medians. Points $A',$ $B',$ and $C',$ are the images of $A,$ $B,$ and $C,$ respectively, after a $180^\circ$ rotation about $G.$ What is the area of the union of the two regions enclosed by the triangles $ABC$ and $A'B'C'?$ | Since a $13-14-15$ triangle is a $5-12-13$ triangle and a $9-12-15$ triangle "glued" together on the $12$ side, $[ABC]=\frac{1}{2}\cdot12\cdot14=84$.
There are six points of intersection between $\Delta ABC$ and $\Delta A'B'C'$. Connect each of these points to $G$.
[asy] size(8cm); pair A,B,C,G,D,E,F,A_1,A_2,B_1,B_2,C_1,C_2; B=(0,0); A=(5,12); C=(14,0); E=(12.6667,8); D=(7.6667,-4); F=(-1.3333,8); G=(6.3333,4); B_1=(4.6667,0); B_2=(1.6667,4); A_1=(3.3333,8); A_2=(8,8); C_1=(11,4); C_2=(9.3333,0); dot(A); dot(B); dot(C); dot(G); dot(D); dot(E); dot(F); dot(A_1); dot(B_1); dot(C_1); dot(A_2); dot(B_2); dot(C_2); draw(B--A--C--cycle); draw(E--D--F--cycle); draw(B_1--A_2); draw(A_1--C_2); draw(C_1--B_2); label("$B$",B,WSW); label("$A$",A,N); label("$C$",C,ESE); label("$G$",G,S); label("$B'$",E,ENE); label("$A'$",D,S); label("$C'$",F,WNW); [/asy]
There are $12$ smaller congruent triangles which make up the desired area. Also, $\Delta ABC$ is made up of $9$ of such triangles. Therefore, $\left[\Delta ABC \bigcup \Delta A'B'C'\right] = \frac{12}{9}[\Delta ABC]= \frac{4}{3}\cdot84=\boxed{112}$. | \(\boxed{112}\) |
Find the eighth term of the sequence $1440,$ $1716,$ $1848,\ldots,$ whose terms are formed by multiplying the corresponding terms of two arithmetic sequences. | If you multiply the corresponding terms of two arithmetic sequences, you get the terms of a quadratic function. Thus, we have a quadratic $ax^2+bx+c$ such that $f(1)=1440$, $f(2)=1716$, and $f(3)=1848$. Plugging in the values for x gives us a system of three equations:
$a+b+c=1440$
$4a+2b+c=1716$
$9a+3b+c=1848$
Solving gives $a=-72, b=492,$ and $c=1020$. Thus, the answer is $-72(8)^2+492\cdot8+1020= \boxed{348}.$ | \(\boxed{348}\) |
Consider the polynomials $P(x) = x^{6} - x^{5} - x^{3} - x^{2} - x$ and $Q(x) = x^{4} - x^{3} - x^{2} - 1.$ Given that $z_{1},z_{2},z_{3},$ and $z_{4}$ are the roots of $Q(x) = 0,$ find $P(z_{1}) + P(z_{2}) + P(z_{3}) + P(z_{4}).$ | Let $S_k=z_1^k+z_2^k+z_3^k+z_4^k$ then by Vieta's Formula we have \[S_{-1}=\frac{z_1z_2z_3+z_1z_3z_4+z_1z_2z_4+z_1z_2z_3}{z_1z_2z_3z_4}=0\] \[S_0=4\] \[S_1=1\] \[S_2=3\] By Newton's Sums we have \[a_4S_k+a_3S_{k-1}+a_2S_{k-2}+a_1S_{k-1}+a_0S_{k-4}=0\]
Applying the formula couples of times yields $P(z_1)+P(z_2)+P(z_3)+P(z_4)=S_6-S_5-S_3-S_2-S_1=\boxed{6}$.
~ Nafer
- AMBRIGGS | \(\boxed{6}\) |
Triangle $ABC$ is a right triangle with $AC = 7,$ $BC = 24,$ and right angle at $C.$ Point $M$ is the midpoint of $AB,$ and $D$ is on the same side of line $AB$ as $C$ so that $AD = BD = 15.$ Given that the area of triangle $CDM$ may be expressed as $\frac {m\sqrt {n}}{p},$ where $m,$ $n,$ and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime, find $m + n + p.$ | We use the Pythagorean Theorem on $ABC$ to determine that $AB=25.$
Let $N$ be the orthogonal projection from $C$ to $AB.$ Thus, $[CDM]=\frac{(DM)(MN)} {2}$, $MN=AM-AN$, and $[ABC]=\frac{24 \cdot 7} {2} =\frac{25 \cdot (CN)} {2}.$
From the third equation, we get $CN=\frac{168} {25}.$
By the Pythagorean Theorem in $\Delta ACN,$ we have
$AN=\sqrt{\left(\frac{24 \cdot 25} {25}\right)^2-\left(\frac{24 \cdot 7} {25}\right)^2}=\frac{24} {25}\sqrt{25^2-7^2}=\frac{576} {25}.$
Thus, $MN=\frac{576} {25}-\frac{25} {2}=\frac{527} {50}.$
In $\Delta ADM$, we use the Pythagorean Theorem to get $DM=\sqrt{15^2-\left(\frac{25} {2}\right)^2}=\frac{5} {2} \sqrt{11}.$
Thus, $[CDM]=\frac{527 \cdot 5\sqrt{11}} {50 \cdot 2 \cdot 2}= \frac{527\sqrt{11}} {40}.$
Hence, the answer is $527+11+40=\boxed{578}.$ | \(\boxed{578}\) |
Let $A = (0,0)$ and $B = (b,2)$ be points on the coordinate plane. Let $ABCDEF$ be a convex equilateral hexagon such that $\angle FAB = 120^\circ,$ $\overline{AB}\parallel \overline{DE},$ $\overline{BC}\parallel \overline{EF,}$ $\overline{CD}\parallel \overline{FA},$ and the y-coordinates of its vertices are distinct elements of the set $\{0,2,4,6,8,10\}.$ The area of the hexagon can be written 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.$ | The y-coordinate of $F$ must be $4$. All other cases yield non-convex and/or degenerate hexagons, which violate the problem statement.
Letting $F = (f,4)$, and knowing that $\angle FAB = 120^\circ$, we can use rewrite $F$ using complex numbers: $f + 4 i = (b + 2 i)\left(e^{i(2 \pi / 3)}\right) = (b + 2 i)\left(-1/2 + \frac{\sqrt{3}}{2} i\right) = -\frac{b}{2}-\sqrt{3}+\left(\frac{b\sqrt{3}}{2}-1\right)i$. We solve for $b$ and $f$ and find that $F = \left(-\frac{8}{\sqrt{3}}, 4\right)$ and that $B = \left(\frac{10}{\sqrt{3}}, 2\right)$.
The area of the hexagon can then be found as the sum of the areas of two congruent triangles ($EFA$ and $BCD$, with height $8$ and base $\frac{8}{\sqrt{3}}$) and a parallelogram ($ABDE$, with height $8$ and base $\frac{10}{\sqrt{3}}$).
$A = 2 \times \frac{1}{2} \times 8 \times \frac{8}{\sqrt{3}} + 8 \times \frac{10}{\sqrt{3}} = \frac{144}{\sqrt{3}} = 48\sqrt{3}$.
Thus, $m+n = \boxed{051}$. | \(\boxed{51}\) |
An integer is called snakelike if its decimal representation $a_1a_2a_3\cdots a_k$ satisfies $a_i<a_{i+1}$ if $i$ is odd and $a_i>a_{i+1}$ if $i$ is even. How many snakelike integers between 1000 and 9999 have four distinct digits? | Let's create the snakelike number from digits $a < b < c < d$, and, if we already picked the digits there are 5 ways to do so, as said in the first solution. And, let's just pick the digits from 0-9. This get's a total count of $5\cdot{10 \choose 4}$ But, this over-counts since it counts numbers like 0213. We can correct for this over-counting. Lock the first digit as 0 and permute 3 other chosen digits $a < b < c$. There are 2 ways to permute to make the number snakelike, b-a-c, or c-a-b. And, we pick a,b,c from 1 to 9, since 0 has already been chosen as one of the digits. So, the amount we have overcounted by is $2\cdot{9 \choose 3}$. Thus our answer is $5\cdot{10 \choose 4} - 2\cdot{9 \choose 3} = \boxed{882}$ | \(\boxed{882}\) |
Let $C$ be the coefficient of $x^2$ in the expansion of the product $(1 - x)(1 + 2x)(1 - 3x)\cdots(1 + 14x)(1 - 15x).$ Find $|C|.$ | Let our polynomial be $P(x)$.
It is clear that the coefficient of $x$ in $P(x)$ is $-1 + 2 - 3 + \ldots + 14 - 15 = -8$, so $P(x) = 1 -8x + Cx^2 + Q(x)$, where $Q(x)$ is some polynomial divisible by $x^3$.
Then $P(-x) = 1 + 8x + Cx^2 + Q(-x)$ and so $P(x)\cdot P(-x) = 1 + (2C - 64)x^2 + R(x)$, where $R(x)$ is some polynomial divisible by $x^3$.
However, we also know $P(x)\cdot P(-x) = (1 - x)(1 + x)(1 +2x)(1 - 2x) \cdots (1 - 15x)(1 + 15x)$ $= (1 - x^2)(1 - 4x^2)\cdots(1 - 225x^2)$ $= 1 - (1 + 4 + \ldots + 225)x^2 + R(x)$.
Equating coefficients, we have $2C - 64 = -(1 + 4 + \ldots + 225) = -1240$, so $-2C = 1176$ and $|C| = \boxed{588}$. | \(\boxed{588}\) |
Let $ABC$ be a triangle with sides 3, 4, and 5, and $DEFG$ be a 6-by-7 rectangle. A segment is drawn to divide triangle $ABC$ into a triangle $U_1$ and a trapezoid $V_1$ and another segment is drawn to divide rectangle $DEFG$ into a triangle $U_2$ and a trapezoid $V_2$ such that $U_1$ is similar to $U_2$ and $V_1$ is similar to $V_2.$ The minimum value of the area of $U_1$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | We let $AB=3, AC=4, DE=6, DG=7$ for the purpose of labeling. Clearly, the dividing segment in $DEFG$ must go through one of its vertices, without loss of generality $D$. The other endpoint ($D'$) of the segment can either lie on $\overline{EF}$ or $\overline{FG}$. $V_2$ is a trapezoid with a right angle then, from which it follows that $V_1$ contains one of the right angles of $\triangle ABC$, and so $U_1$ is similar to $ABC$. Thus $U_1$, and hence $U_2$, are $3-4-5\,\triangle$s.
Suppose we find the ratio $r$ of the smaller base to the larger base for $V_2$, which consequently is the same ratio for $V_1$. By similar triangles, it follows that $U_1 \sim \triangle ABC$ by the same ratio $r$, and since the ratio of the areas of two similar figures is equal to the square of the ratio of their corresponding lengths, it follows that $[U_1] = r^2 \cdot [ABC] = 6r^2$.
[asy] defaultpen(linewidth(0.7)); pair A=(0,0),B=(0,3),C=(4,0); draw(MP("A",A)--MP("B",B,N)--MP("C",C)--cycle); draw((9*4/14,0)--(9*4/14,5*3/14),dashed); label("\(V_1\)",(1,1.2)); label("\(U_1\)",(3,0.3)); [/asy] [asy] defaultpen(linewidth(0.7)); pointpen = black; pair D=(0,0),E=(0,6),F=(7,6),G=(7,0),H=(4.5,6); draw(MP("D",D)--MP("E",E,N)--MP("F",F,N)--MP("G",G)--cycle); draw(D--D(MP("D'",H,N)),dashed); label("\(U_2\)",(1,3)); label("\(V_2\)",(5,3)); MP("7",(D+G)/2,S); MP("6",(D+E)/2,W); MP("9/2",(E+H)/2,N); [/asy]
[asy] defaultpen(linewidth(0.7)); pair A=(0,0),B=(0,3),C=(4,0); draw(MP("A",A)--MP("B",B,N)--MP("C",C)--cycle); draw((3.5,0)--(3.5,3/8),dashed); label("\(V_1\)",(1.5,1)); label("\(U_1\)",(3.8,0.4)); [/asy] [asy] defaultpen(linewidth(0.7)); pointpen = black; pair D=(0,0),E=(0,6),F=(7,6),G=(7,0),H=(7,21/4); draw(MP("D",D)--MP("E",E,N)--MP("F",F,N)--MP("G",G)--cycle); draw(D--D(MP("D'",H,NW)),dashed); label("\(V_2\)",(2,3)); label("\(U_2\)",(5,1)); MP("7",(D+G)/2,S); MP("6",(D+E)/2,W); MP("21/4",(G+H)/2,(-1,0)); [/asy]
If $D'$ lies on $\overline{EF}$, then $ED' = \frac{9}{2},\, 8$; the latter can be discarded as extraneous. Therefore, $D'F = \frac{5}{2}$, and the ratio $r = \frac{D'F}{DG} = \frac{5}{14}$. The area of $[U_1] = 6\left(\frac{5}{14}\right)^2$ in this case.
If $D'$ lies on $\overline{FG}$, then $GD' = \frac{21}{4},\, \frac{28}{3}$; the latter can be discarded as extraneous. Therefore, $D'F = \frac{3}{4}$, and the ratio $r = \frac{D'F}{DE} = \frac{1}{8}$. The area of $[U_1] = 6\left(\frac{1}{8}\right)^2$ in this case.
Of the two cases, the second is smaller; the answer is $\frac{3}{32}$, and $m+n = \boxed{035}$. | \(\boxed{35}\) |
A chord of a circle is perpendicular to a radius at the midpoint of the radius. The ratio of the area of the larger of the two regions into which the chord divides the circle to the smaller can be expressed in the form $\frac{a\pi+b\sqrt{c}}{d\pi-e\sqrt{f}},$ where $a, b, c, d, e,$ and $f$ are positive integers, $a$ and $e$ are relatively prime, and neither $c$ nor $f$ is divisible by the square of any prime. Find the remainder when the product $abcdef$ is divided by 1000. | Let $r$ be the length of the radius of the circle. A right triangle is formed by half of the chord, half of the radius (since the chord bisects it), and the radius. Thus, it is a $30^\circ$ - $60^\circ$ - $90^\circ$ triangle, and the area of two such triangles is $2 \cdot \frac{1}{2} \cdot \frac{r}{2} \cdot \frac{r\sqrt{3}}{2} = \frac{r^2\sqrt{3}}{4}$. The central angle which contains the entire chord is $60 \cdot 2 = 120$ degrees, so the area of the sector is $\frac{1}{3}r^2\pi$; the rest of the area of the circle is then equal to $\frac{2}{3}r^2\pi$.
The smaller area cut off by the chord is equal to the area of the sector minus the area of the triangle. The larger area is equal to the area of the circle not within the sector and the area of the triangle. Thus, the desired ratio is $\frac{\frac{2}{3}r^2\pi + \frac{r^2\sqrt{3}}{4}}{\frac{1}{3}r^2\pi - \frac{r^2\sqrt{3}}{4}} = \frac{8\pi + 3\sqrt{3}}{4\pi - 3\sqrt{3}}$
Therefore, $abcdef = 2^53^4 = 2592 \Longrightarrow \boxed{592}$. | \(\boxed{592}\) |
How many positive integers less than 10,000 have at most two different digits? | We use casework on the number of digits for this problem.
If the number has a single digit, namely the number $n \in [1,9],$ we can clearly all such $n$ work.
If the number has two digits, or the number $n \in [10,99]$ we can clearly see all such $n$ work.
If the number $n$ has three digits, there are a total of $900$ three digit numbers, and there are $9 \cdot 9 \cdot 8$ numbers that have all distinct digits so there are $900 - 9 \cdot 9 \cdot 8$ total three digit numbers that work.
If the number $n$ has four digits, then we have a total of $9 + \displaystyle\binom{9}{2}\left(\displaystyle\binom{4}{1}+ \displaystyle\binom{4}{2} + \displaystyle\binom{4}{3}\right) + 9 \cdot \left(\displaystyle\binom{3}{1}+\displaystyle\binom{3}{2} + \displaystyle\binom{3}{3}\right)$ so in total we get $\boxed{927}$ numbers that work. | \(\boxed{927}\) |
How many positive integer divisors of $2004^{2004}$ are divisible by exactly 2004 positive integers? | Clearly we need to find a group of numbers that multiply to 2004. We can list them all out since we know that 2004 is only $167 * 2^2 * 3$.
167, 2, 2, 3
4, 3, 167
12, 167
4, 501
2, 1002
2, 3, 334
2, 2, 501*
6, 2, 167
3, 668
6, 334
2004*
To begin, the first multiple doesn't work because there are only 3 prime divisors of 2004. We can apply all multiples because the prime factorization of $2004^{2004}$ is $2^{4008} * 3^{2004} * 167^{2004}.$ Every multiple has six ways of distributing numbers to become powers of 167, 3, and 2, except for the ones with a star. For a single power of 2004, we have three choices (2, 3, and 167) to give a power of 2003 to. For 2, 2, 501, there are three choices to give a power of 500 to and the rest get a power of 1.
Therefore we have $5 * 6$ normal multiples and $3 *2$ "half" multiples. Sum to get $\boxed{54}$ as our answer. | \(\boxed{54}\) |
How many positive integers have exactly three proper divisors (positive integral divisors excluding itself), each of which is less than 50? | Suppose $n$ is such an integer. Because $n$ has $3$ proper divisors, it must have $4$ divisors,, so $n$ must be in the form $n=p\cdot q$ or $n=p^3$ for distinct prime numbers $p$ and $q$.
In the first case, the three proper divisors of $n$ are $1$, $p$ and $q$. Thus, we need to pick two prime numbers less than $50$. There are fifteen of these ($2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43$ and $47$) so there are ${15 \choose 2} =105$ ways to choose a pair of primes from the list and thus $105$ numbers of the first type.
In the second case, the three proper divisors of $n$ are 1, $p$ and $p^2$. Thus we need to pick a prime number whose square is less than $50$. There are four of these ($2, 3, 5,$ and $7$) and so four numbers of the second type.
Thus there are $105+4=\boxed{109}$ integers that meet the given conditions.
~lpieleanu (Minor editing) | \(\boxed{109}\) |
The director of a marching band wishes to place the members into a formation that includes all of them and has no unfilled positions. If they are arranged in a square formation, there are 5 members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Find the maximum number of members this band can have. | Let there be $m$ members and $n$ members for the square and $c$ for the number of columns of the other formation. We have $n^2 +5 = c(c+7) \implies n^2+5 = \left(c+\frac{7}{2}\right)^2 -\frac{49}{4} \implies n^2 - \left(c+\frac{7}{2}\right)^2 = -\frac{69}{4} \implies \left(n-c-\frac{7}{2}\right)\left(n + c +\frac{7}{2}\right) \implies (2n-2c-7)(2n+2n+7) = -69.$
To maximize this we let $2n+2c+7 = 68$ and $2n-2c-7 = 1.$ Solving we find $n = 17$ so the desired number of members is $17^2 + 5 = \boxed{294}.$ | \(\boxed{294}\) |
Robert has 4 indistinguishable gold coins and 4 indistinguishable silver coins. Each coin has an engraving of one face on one side, but not on the other. He wants to stack the eight coins on a table into a single stack so that no two adjacent coins are face to face. Find the number of possible distinguishable arrangements of the 8 coins. | There are two separate parts to this problem: one is the color (gold vs silver), and the other is the orientation.
There are ${8\choose4} = 70$ ways to position the gold coins in the stack of 8 coins, which determines the positions of the silver coins.
Create a string of letters H and T to denote the orientation of the top of the coin. To avoid making two faces touch, we cannot have the arrangement HT. Thus, all possible configurations must be a string of tails followed by a string of heads, since after the first H no more tails can appear. The first H can occur in a maximum of eight times different positions, and then there is also the possibility that it doesn’t occur at all, for $9$ total configurations. Thus, the answer is $70 \cdot 9 = \boxed{630}$. | \(\boxed{630}\) |
Let $P$ be the product of the nonreal roots of $x^4-4x^3+6x^2-4x=2005.$ Find $\lfloor P\rfloor.$ | If we don't see the fourth power, we can always factor the LHS to try to create a quadratic substitution. Checking, we find that $x=0$ and $x=2$ are both roots. Synthetic division gives $(x^2-2x)(x^2-2x+2)=2005$. We now have our quadratic substitution of $y=x^2-2x+1=(x-1)^2$, giving us $(y-1)(y+1)=2005$. From here we proceed as in Solution 1 to get $\boxed{045}$. | \(\boxed{45}\) |
A semicircle with diameter $d$ is contained in a square whose sides have length 8. Given the maximum value of $d$ is $m - \sqrt{n},$ find $m+n.$ | It is easy after getting the image, after drawing labeling the lengths of those segments, assume the radius is $x$, we can see $x=\sqrt{2}(8-x)$ and we get $2x=32-\sqrt{512}$ and we have the answer $\boxed{544}$ ~bluesoul | \(\boxed{544}\) |
For positive integers $n,$ let $\tau (n)$ denote the number of positive integer divisors of $n,$ including 1 and $n.$ For example, $\tau (1)=1$ and $\tau(6) =4.$ Define $S(n)$ by $S(n)=\tau(1)+ \tau(2) + \cdots + \tau(n).$ Let $a$ denote the number of positive integers $n \leq 2005$ with $S(n)$ odd, and let $b$ denote the number of positive integers $n \leq 2005$ with $S(n)$ even. Find $|a-b|.$ | Let $\Delta n$ denote the sum $1+2+3+ \dots +n-1+n$. We can easily see from the fact "It is well-known that $\tau(n)$ is odd if and only if $n$ is a perfect square.", that
$a = (2^2-1^2) + (4^2-3^2) \dots (44^2 - 43^2) = (2+1)(2-1)+(4+3)(4-3) \dots (44+43)(44-43) = 1+2+3...44 = \Delta 44$.
$b = 3^2-2^2+5^2-4^2...2006-44^2 = (3+2)(3-2) \dots (43+42)(43-42) + 1 + (2005 - 44^2) = \Delta 43 + 69$.
$a-b = \Delta 44-\Delta 43-69 = 44-69 = -25$. They ask for $|a-b|$, so our answer is $|-25| = \boxed{025}$
-Alexlikemath | \(\boxed{25}\) |
Triangle $ABC$ has $BC=20.$ The incircle of the triangle evenly trisects the median $AD.$ If the area of the triangle is $m \sqrt{n}$ where $m$ and $n$ are integers and $n$ is not divisible by the square of a prime, find $m+n.$ | WLOG let E be be between C & D (as in solution 1). Assume $AD = 3m$. We use power of a point to get that $AG = DE = \sqrt{2}m$ and $AB = AG + GB = AG + BE = 10+2\sqrt{2} m$
Since now we have $AC = 10$, $BC = 20, AB = 10+2\sqrt{2} m$ in triangle $\triangle ABC$ and cevian $AD = 3m$. Now, we can apply Stewart's Theorem.
\[2000 + 180 m^2 = 10(10+2\sqrt{2}m)^{2} + 1000\] \[1000 + 180 m^2 = 1000 + 400\sqrt{2}m + 80 m^{2}\] \[100 m^2 = 400\sqrt{2}m\]
$m = 4\sqrt{2}$ or $m = 0$ if $m = 0$, we get a degenerate triangle, so $m = 4\sqrt{2}$, and thus $AB = 26$. You can now use Heron's Formula to finish. The answer is $24 \sqrt{14}$, or $\boxed{038}$.
-Alexlikemath | \(\boxed{38}\) |
An infinite geometric series has sum 2005. A new series, obtained by squaring each term of the original series, has 10 times the sum of the original series. The common ratio of the original series is $\frac mn$ where $m$ and $n$ are relatively prime integers. Find $m+n.$ | Let's call the first term of the original geometric series $a$ and the common ratio $r$, so $2005 = a + ar + ar^2 + \ldots$. Using the sum formula for infinite geometric series, we have $\;\;\frac a{1 -r} = 2005$. Then we form a new series, $a^2 + a^2 r^2 + a^2 r^4 + \ldots$. We know this series has sum $20050 = \frac{a^2}{1 - r^2}$. Dividing this equation by $\frac{a}{1-r}$, we get $10 = \frac a{1 + r}$. Then $a = 2005 - 2005r$ and $a = 10 + 10r$ so $2005 - 2005r = 10 + 10r$, $1995 = 2015r$ and finally $r = \frac{1995}{2015} = \frac{399}{403}$, so the answer is $399 + 403 = \boxed{802}$.
(We know this last fraction is fully reduced by the Euclidean algorithm -- because $4 = 403 - 399$, $\gcd(403, 399) | 4$. But 403 is odd, so $\gcd(403, 399) = 1$.) | \(\boxed{802}\) |
Find the number of positive integers that are divisors of at least one of $10^{10},15^7,18^{11}.$ | $10^{10} = 2^{10}\cdot 5^{10}$ so $10^{10}$ has $11\cdot11 = 121$ divisors.
$15^7 = 3^7\cdot5^7$ so $15^7$ has $8\cdot8 = 64$ divisors.
$18^{11} = 2^{11}\cdot3^{22}$ so $18^{11}$ has $12\cdot23 = 276$ divisors.
Now, we use the Principle of Inclusion-Exclusion. We have $121 + 64 + 276$ total potential divisors so far, but we've overcounted those factors which divide two or more of our three numbers. Thus, we must subtract off the divisors of their pair-wise greatest common divisors.
$\gcd(10^{10},15^7) = 5^7$ which has 8 divisors.
$\gcd(15^7, 18^{11}) = 3^7$ which has 8 divisors.
$\gcd(18^{11}, 10^{10}) = 2^{10}$ which has 11 divisors.
So now we have $121 + 64 + 276 - 8 -8 -11$ potential divisors. However, we've now undercounted those factors which divide all three of our numbers. Luckily, we see that the only such factor is 1, so we must add 1 to our previous sum to get an answer of $121 + 64 + 276 - 8 - 8 - 11 + 1 = \boxed{435}$. | \(\boxed{435}\) |
Determine the number of ordered pairs $(a,b)$ of integers such that $\log_a b + 6\log_b a=5, 2 \leq a \leq 2005,$ and $2 \leq b \leq 2005.$ | Let $k=\log_a b$. Then our equation becomes $k+\frac{6}{k}=5$. Multiplying through by $k$ and solving the quadratic gives us $k=2$ or $k=3$. Hence $a^2=b$ or $a^3=b$.
For the first case $a^2=b$, $a$ can range from 2 to 44, a total of 43 values. For the second case $a^3=b$, $a$ can range from 2 to 12, a total of 11 values.
Thus the total number of possible values is $43+11=\boxed{54}$. | \(\boxed{54}\) |
Circles $C_1$ and $C_2$ are externally tangent, and they are both internally tangent to circle $C_3.$ The radii of $C_1$ and $C_2$ are 4 and 10, respectively, and the centers of the three circles are all collinear. A chord of $C_3$ is also a common external tangent of $C_1$ and $C_2.$ Given that the length of the chord is $\frac{m\sqrt{n}}p$ where $m,n,$ and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime, find $m+n+p.$ | Call our desired length $x$. Note for any $X$ on $\overline{AB}$ and $Y$ on $\overline{O_1O_2}$ such that $\overline{XY}\perp\overline{AB}$ that the function $f$ such that $f(\overline{O_1Y})=\overline{XY}$ is linear. Since $(0,4)$ and $(14,10)$, we can quickly interpolate that $f(10)=\overline{O_3T}=\frac{58}{7}$. Then, extend $\overline{O_3T}$ until it reaches the circle on both sides; call them $P,Q$. By Power of a Point, $\overline{PT}\cdot\overline{TQ}=\overline{AT}\cdot\overline{TB}$. Since $\overline{AT}=\overline{TB}=\frac{1}{2}x$, \[(\overline{PO_3}-\overline{O_3T})(\overline{QO_3}+\overline{O_3T})=\frac{1}{4}x^2\] \[\left(14+\frac{58}{7}\right)\left(14-\frac{58}{7}\right)=\frac{1}{4}x^2\] After solving for $x$, we get $x=\frac{8\sqrt{390}}{7}$, so our answer is $8+390+7=\boxed{405}$ | \(\boxed{405}\) |
Let $m$ be a positive integer, and let $a_0, a_1,\ldots,a_m$ be a sequence of reals such that $a_0 = 37, a_1 = 72, a_m = 0,$ and $a_{k+1} = a_{k-1} - \frac 3{a_k}$ for $k = 1,2,\ldots, m-1.$ Find $m.$ | For $0 < k < m$, we have
$a_{k}a_{k+1} = a_{k-1}a_{k} - 3$.
Thus the product $a_{k}a_{k+1}$ is a monovariant: it decreases by 3 each time $k$ increases by 1. For $k = 0$ we have $a_{k}a_{k+1} = 37\cdot 72$, so when $k = \frac{37 \cdot 72}{3} = 888$, $a_{k}a_{k+1}$ will be zero for the first time, which implies that $m = \boxed{889}$, our answer.
Note: In order for $a_{m} = 0$ we need $a_{m-2}a_{m-1}=3$ simply by the recursion definition. | \(\boxed{889}\) |
Let $P(x)$ be a polynomial with integer coefficients that satisfies $P(17)=10$ and $P(24)=17.$ Given that $P(n)=n+3$ has two distinct integer solutions $n_1$ and $n_2,$ find the product $n_1\cdot n_2.$ | We define $Q(x)=P(x)-x+7$, noting that it has roots at $17$ and $24$. Hence $P(x)-x+7=A(x-17)(x-24)$. In particular, this means that $P(x)-x-3=A(x-17)(x-24)-10$. Therefore, $x=n_1,n_2$ satisfy $A(x-17)(x-24)=10$, where $A$, $(x-17)$, and $(x-24)$ are integers. This cannot occur if $x\le 17$ or $x\ge 24$ because the product $(x-17)(x-24)$ will either be too large or not be a divisor of $10$. We find that $x=19$ and $x=22$ are the only values that allow $(x-17)(x-24)$ to be a factor of $10$. Hence the answer is $19\cdot 22=\boxed{418}$. | \(\boxed{418}\) |
In triangle $ABC, AB=13, BC=15,$ and $CA = 14.$ Point $D$ is on $\overline{BC}$ with $CD=6.$ Point $E$ is on $\overline{BC}$ such that $\angle BAE\cong \angle CAD.$ Given that $BE=\frac pq$ where $p$ and $q$ are relatively prime positive integers, find $q.$ | Let $ED = x$, such that $BE = 9-x$. Since $\overline{AE}$ and $\overline{AD}$ are isogonal, we get $\frac{9-x}{6+x} \cdot \frac{9}{6} = \frac{13^2}{14^2} \Rightarrow 588(9 - x) = 338(6 + x)$, and we can solve to get $x = \frac{1632}{463}$(and $BE = \frac{1146}{463}$). Hence, our answer is $\boxed{463}$. - Spacesam | \(\boxed{463}\) |
Let $w_1$ and $w_2$ denote the circles $x^2+y^2+10x-24y-87=0$ and $x^2 +y^2-10x-24y+153=0,$ respectively. Let $m$ be the smallest positive value of $a$ for which the line $y=ax$ contains the center of a circle that is externally tangent to $w_2$ and internally tangent to $w_1.$ Given that $m^2=\frac pq,$ where $p$ and $q$ are relatively prime integers, find $p+q.$ | We use the same reflection as in Solution 2. As $OF_1'=OF_2=13$, we know that $\triangle OF_1'F_2$ is isosceles. Hence $\angle F_2F_1'O=\angle F_1'F_2O$. But by symmetry, we also know that $\angle OF_1T=\angle F_2F_1'O$. Hence $\angle OF_1T=\angle F_1'F_2O$. In particular, as $\angle OF_1T=\angle OF_2T$, this implies that $O, F_1, F_2$, and $T$ are concyclic.
Let $X$ be the intersection of $F_2F_1'$ with the $x$-axis. As $F_1F_2$ is parallel to the $x$-axis, we know that \[\angle TXO=180-\angle F_1F_2T.\tag{1}\] But \[180-\angle F_1F_2T=\angle F_2F_1T+\angle F_1TF_2.\tag{2}\] By the fact that $OF_1F_2T$ is cyclic, \[\angle F_2F_1T=\angle F_2OT\qquad\text{and}\qquad \angle F_1TF_2=\angle F_1OF_2.\tag{3}\] Therefore, combining (1), (2), and (3), we find that \[\angle TXO=\angle F_2OT+\angle F_1OF_2=\angle F_1OT.\tag{4}\]
By symmetry, we also know that \[\angle F_1TO=\angle OTF_1'.\tag{5}\] Therefore, (4) and (5) show by AA similarity that $\triangle F_1OT\sim \triangle OXT$. Therefore, $\angle XOT=\angle OF_1T$.
Now as $OF_1=OF_2'=13$, we know that $\triangle OF_1F_2'$ is isosceles, and as $F_1F_2'=20$, we can drop an altitude to $F_1F_2'$ to easily find that $\tan \angle OF_1T=\sqrt{69}/10$. Therefore, $\tan\angle XOT$, which is the desired slope, must also be $\sqrt{69}/10$. As before, we conclude that the answer is $\boxed{169}$. | \(\boxed{169}\) |
Let set $\mathcal{A}$ be a 90-element subset of $\{1,2,3,\ldots,100\},$ and let $S$ be the sum of the elements of $\mathcal{A}.$ Find the number of possible values of $S.$ | The smallest $S$ is $1+2+ \ldots +90 = 91 \cdot 45 = 4095$. The largest $S$ is $11+12+ \ldots +100=111\cdot 45=4995$. All numbers between $4095$ and $4995$ are possible values of S, so the number of possible values of S is $4995-4095+1=901$.
Alternatively, for ease of calculation, let set $\mathcal{B}$ be a 10-element subset of $\{1,2,3,\ldots,100\}$, and let $T$ be the sum of the elements of $\mathcal{B}$. Note that the number of possible $S$ is the number of possible $T=5050-S$. The smallest possible $T$ is $1+2+ \ldots +10 = 55$ and the largest is $91+92+ \ldots + 100 = 955$, so the number of possible values of T, and therefore S, is $955-55+1=\boxed{901}$. | \(\boxed{901}\) |
Let $\mathcal{S}$ be the set of real numbers that can be represented as repeating decimals of the form $0.\overline{abc}$ where $a, b, c$ are distinct digits. Find the sum of the elements of $\mathcal{S}.$ | By symmetry, the average over all $720=(10)(9)(8)$ numbers is $\frac{1}{2}$. Then, their sum is $\frac{1}{2}(720)=\boxed{360}$. | \(\boxed{360}\) |
The sequence $a_1, a_2, \ldots$ is geometric with $a_1=a$ and common ratio $r,$ where $a$ and $r$ are positive integers. Given that $\log_8 a_1+\log_8 a_2+\cdots+\log_8 a_{12} = 2006,$ find the number of possible ordered pairs $(a,r).$ | Using the above method, we can derive that $a^{2}r^{11} = 2^{1003}$. Now, think about what happens when r is an even power of 2. Then $a^{2}$ must be an odd power of 2 in order to satisfy the equation which is clearly not possible. Thus the only restriction r has is that it must be an odd power of 2, so $2^{1}$, $2^{3}$, $2^{5}$ .... all work for r, until r hits $2^{93}$, when it gets greater than $2^{1003}$, so the greatest value for r is $2^{91}$. All that's left is to count the number of odd integers between 1 and 91 (inclusive), which yields $\boxed{046}$. | \(\boxed{46}\) |
Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers $k\ge 1,$ find the minimum possible value of $|x_1+x_2+\cdots+x_{2006}|.$ | Playing around with a couple numbers, we see that we can generate the sequence $0, 3, -6, 3, -6, \cdots$, and we can also generate the sequence $3, 6, 9, 12, \cdots$ after each $-6$ value. Thus, we will apply this to try and find some bounds. We can test if the first $1000$ pairs of numbers each sum up to $-3$, and the rest form an arithmetic sequence, if the first $990$ pairs sum up to $-3$, and so on. When we get to $980$, we find that $980(-3) + 3 + 6 + \cdots + 3\cdot 46 = 303$. If we shift the number of pairs up by $1$, we get $981(-3) + 3 + 6 + \cdots + 3\cdot 44 = \boxed{027}$. - Spacesam | \(\boxed{27}\) |
Square $ABCD$ has sides of length 1. Points $E$ and $F$ are on $\overline{BC}$ and $\overline{CD},$ respectively, so that $\triangle AEF$ is equilateral. A square with vertex $B$ has sides that are parallel to those of $ABCD$ and a vertex on $\overline{AE}.$ The length of a side of this smaller square is $\frac{a-\sqrt{b}}{c},$ where $a, b,$ and $c$ are positive integers and $b$ is not divisible by the square of any prime. Find $a+b+c.$ | Why not solve in terms of the side $x$ only (single-variable beauty)? By similar triangles we obtain that $BE=\frac{x}{1-x}$, therefore $CE=\frac{1-2x}{1-x}$. Then $AE=\sqrt{2}*\frac{1-2x}{1-x}$. Using Pythagorean Theorem on $\triangle{ABE}$ yields $\frac{x^2}{(1-x)^2} + 1 = 2 * \frac{(1-2x)^2}{(1-x)^2}$. This means $6x^2-6x+1=0$, and it's clear we take the smaller root: $x=\frac{3-\sqrt{3}}{6}$. Answer: $\boxed{12}$. | \(\boxed{12}\) |
Find the number of ordered pairs of positive integers $(a,b)$ such that $a+b=1000$ and neither $a$ nor $b$ has a zero digit. | There are $\left\lfloor\frac{999}{10}\right\rfloor = 99$ numbers up to 1000 that have 0 as their units digit. All of the other excluded possibilities are when $a$ or $b$ have a 0 in the tens digit, and since the equation is symmetric, we will just count when $a$ has a 0 in the tens digit and multiply by 2 (notice that the only time both $a$ and $b$ can have a 0 in the tens digit is when they are divisible by 100, which falls into the above category, so we do not have to worry about overcounting).
Excluding the numbers divisible by 100, which were counted already, there are $9$ numbers in every hundred numbers that have a tens digit of 0 (this is true from 100 to 900), totaling $9 \cdot 9 = 81$ such numbers; considering $b$ also and we have $81 \cdot 2 = 162$. Therefore, there are $999 - (99 + 162) = \boxed{738}$ such ordered pairs. | \(\boxed{738}\) |
Circles $\mathcal{C}_1, \mathcal{C}_2,$ and $\mathcal{C}_3$ have their centers at (0,0), (12,0), and (24,0), and have radii 1, 2, and 4, respectively. Line $t_1$ is a common internal tangent to $\mathcal{C}_1$ and $\mathcal{C}_2$ and has a positive slope, and line $t_2$ is a common internal tangent to $\mathcal{C}_2$ and $\mathcal{C}_3$ and has a negative slope. Given that lines $t_1$ and $t_2$ intersect at $(x,y),$ and that $x=p-q\sqrt{r},$ where $p, q,$ and $r$ are positive integers and $r$ is not divisible by the square of any prime, find $p+q+r.$ | Call the centers $O_1, O_2, O_3$, the points of tangency $r_1, r_2, s_1, s_2$ (with $r$ on $t_1$ and $s$ on $t_2$, and $s_2$ on $\mathcal{C}_2$), and the intersection of each common internal tangent to the X-axis $r, s$. $\triangle O_1r_1r \sim \triangle O_2r_2r$ since both triangles have a right angle and have vertical angles, and the same goes for $\triangle O_2s_2s \sim \triangle O_3s_1s$. By proportionality, we find that $O_1r = 4$; solving $\triangle O_1r_1r$ by the Pythagorean theorem yields $r_1r = \sqrt{15}$. On $\mathcal{C}_3$, we can do the same thing to get $O_3s_1 = 4$ and $s_1s = 4\sqrt{3}$.
The vertical altitude of each of $\triangle O_1r_1r$ and $\triangle O_3s_1s$ can each by found by the formula $c \cdot h = a \cdot b$ (as both products equal twice of the area of the triangle). Thus, the respective heights are $\frac{\sqrt{15}}{4}$ and $2\sqrt{3}$. The horizontal distance from each altitude to the intersection of the tangent with the x-axis can also be determined by the Pythagorean theorem: $\sqrt{15 - \frac{15}{16}} = \frac{15}{4}$, and by 30-60-90: $6$.
From this information, the slope of each tangent can be uncovered. The slope of $t_1 = \frac{\Delta y}{\Delta x} = \frac{\frac{\sqrt{15}}{4}}{\frac{15}{4}} = \frac{1}{\sqrt{15}}$. The slope of $t_2 = -\frac{2\sqrt{3}}{6} = -\frac{1}{\sqrt{3}}$.
The equation of $t_1$ can be found by substituting the point $r (4,0)$ into $y = \frac{1}{\sqrt{15}}x + b$, so $y = \frac{1}{\sqrt{15}}x - \frac{4}{\sqrt{15}}$. The equation of $t_2$, found by substituting point $s (16,0)$, is $y = \frac{-1}{\sqrt{3}}x + \frac{16}{\sqrt{3}}$. Putting these two equations together results in the desired $\frac{1}{\sqrt{15}}x - \frac{4}{\sqrt{15}} = -\frac{1}{\sqrt{3}}x + \frac{16}{\sqrt{3}}$ $\Longrightarrow x = \frac{16\sqrt{5} + 4}{\sqrt{5} + 1} \cdot \frac{\sqrt{5}-1}{\sqrt{5}-1}$ $= \frac{76 - 12\sqrt{5}}{4}$ $= 19 - 3\sqrt{5}$. Thus, $p + q + r = 19 + 3 + 5 \Longrightarrow \boxed{027}$. | \(\boxed{27}\) |
Seven teams play a soccer tournament in which each team plays every other team exactly once. No ties occur, each team has a $50\%$ chance of winning each game it plays, and the outcomes of the games are independent. In each game, the winner is awarded a point and the loser gets 0 points. The total points are accumulated to decide the ranks of the teams. In the first game of the tournament, team $A$ beats team $B.$ The probability that team $A$ finishes with more points than team $B$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | After the first game, there are $10$ games we care about-- those involving $A$ or $B$. There are $3$ cases of these $10$ games: $A$ wins more than $B$, $B$ wins more than $A$, or $A$ and $B$ win the same number of games. Also, there are $2^{10} = 1024$ total outcomes. By symmetry, the first and second cases are equally likely, and the third case occurs $\binom{5}{0}^2+\binom{5}{1}^2+\binom{5}{2}^2+\binom{5}{3}^2+\binom{5}{4}^2+\binom{5}{5}^2 = \binom{10}{5} = 252$ times, by a special case of Vandermonde's Identity. There are therefore $\frac{1024-252}{2} = 386$ possibilities for each of the other two cases.
If $B$ has more wins than $A$ in its $5$ remaining games, then $A$ cannot beat $B$ overall. However, if $A$ has more wins or if $A$ and $B$ are tied, $A$ will beat $B$ overall. Therefore, out of the $1024$ possibilites, $386+252 = 638$ ways where $A$ wins, so the desired probability is $\frac{638}{1024} = \frac{319}{512}$, and $m+n=\boxed{831}$. | \(\boxed{831}\) |
A sequence is defined as follows $a_1=a_2=a_3=1,$ and, for all positive integers $n, a_{n+3}=a_{n+2}+a_{n+1}+a_n.$ Given that $a_{28}=6090307, a_{29}=11201821,$ and $a_{30}=20603361,$ find the remainder when $\sum^{28}_{k=1} a_k$ is divided by 1000. | Since the problem only asks for the first 28 terms and we only need to calculate mod 1000, we simply bash the first 28 terms:
$a_{1}\equiv 1 \pmod {1000} \newline a_{2}\equiv 1 \pmod {1000} \newline a_{3}\equiv 1 \pmod {1000} \newline a_{4}\equiv 3 \pmod {1000} \newline a_{5}\equiv 5 \pmod {1000} \newline \cdots \newline a_{25} \equiv 793 \pmod {1000} \newline a_{26} \equiv 281 \pmod {1000} \newline a_{27} \equiv 233 \pmod {1000} \newline a_{28} \equiv 307 \pmod {1000}$
Adding all the residues shows the sum is congruent to $\boxed{834}$ mod 1000.
~ I-_-I | \(\boxed{834}\) |
Let $S_n$ be the sum of the reciprocals of the non-zero digits of the integers from $1$ to $10^n$ inclusive. Find the smallest positive integer $n$ for which $S_n$ is an integer. | Let $K = \sum_{i=1}^{9}{\frac{1}{i}}$. Examining the terms in $S_1$, we see that $S_1 = K + 1$ since each digit $n$ appears once and 1 appears an extra time. Now consider writing out $S_2$. Each term of $K$ will appear 10 times in the units place and 10 times in the tens place (plus one extra 1 will appear), so $S_2 = 20K + 1$.
In general, we will have that
$S_n = (n10^{n-1})K + 1$
because each digit will appear $10^{n - 1}$ times in each place in the numbers $1, 2, \ldots, 10^{n} - 1$, and there are $n$ total places.
The denominator of $K$ is $D = 2^3\cdot 3^2\cdot 5\cdot 7$. For $S_n$ to be an integer, $n10^{n-1}$ must be divisible by $D$. Since $10^{n-1}$ only contains the factors $2$ and $5$ (but will contain enough of them when $n \geq 3$), we must choose $n$ to be divisible by $3^2\cdot 7$. Since we're looking for the smallest such $n$, the answer is $\boxed{063}$. | \(\boxed{63}\) |
Given that $x, y,$ and $z$ are real numbers that satisfy: \begin{align*} x &= \sqrt{y^2-\frac{1}{16}}+\sqrt{z^2-\frac{1}{16}}, \\ y &= \sqrt{z^2-\frac{1}{25}}+\sqrt{x^2-\frac{1}{25}}, \\ z &= \sqrt{x^2 - \frac 1{36}}+\sqrt{y^2-\frac 1{36}}, \end{align*} and that $x+y+z = \frac{m}{\sqrt{n}},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime, find $m+n.$ | Note that none of $x,y,z$ can be zero.
Each of the equations is in the form \[a=\sqrt{b^2-d^2}+\sqrt{c^2-d^2}\]
Isolate a radical and square the equation to get \[b^2-d^2=a^2-2a\sqrt{c^2-d^2}+c^2-d^2\]
Now cancel, and again isolate the radical, and square the equation to get \[a^4+b^4+c^4+2a^2c^2-2a^2b^2-2b^2c^2=4a^2c^2-4a^2d^2\]
Rearranging gives \[a^4+b^4+c^4=2a^2b^2+2a^2c^2+2b^2c^2-4a^2d^2\]
Now note that everything is cyclic but the last term (i.e. $-4a^2d^2$), which implies \[-4x^2\cdot\frac1{16}=-4y^2\cdot\frac1{25}=-4z^2\cdot\frac1{36}\]
Or
\[x: y: z=4: 5: 6 \implies x=\frac{4y}5 \textrm{ and } z=\frac{6y}5\]
Plug these values into the middle equation to get \[\frac{256y^4+625y^4+1296y^4}{625}=\frac{800y^4}{625}+\frac{1800y^4}{625}+\frac{1152y^4}{625}-\frac{100y^2}{625}\]
Simplifying gives \[1575y^4=100y^2 \textrm{ but } y \neq 0 \implies y^2=\frac4{63} \textrm{ or } y=\frac2{3\sqrt7}\]
Substituting the value of $y$ for $x$ and $z$ gives \[x+y+z = \frac{4y+5y+6y}5 = 3y = 3 \cdot \frac{2}{3\sqrt7} = \frac{2}{\sqrt7}\]
And thus the answer is $\boxed{009}$
~phoenixfire | \(\boxed{9}\) |
Rectangle $ABCD$ is given with $AB=63$ and $BC=448.$ Points $E$ and $F$ lie on $AD$ and $BC$ respectively, such that $AE=CF=84.$ The inscribed circle of triangle $BEF$ is tangent to $EF$ at point $P,$ and the inscribed circle of triangle $DEF$ is tangent to $EF$ at point $Q.$ Find $PQ.$ | Several Pythagorean triples exist amongst the numbers given. $BE = DF = \sqrt{63^2 + 84^2} = 21\sqrt{3^2 + 4^2} = 105$. Also, the length of $EF = \sqrt{63^2 + (448 - 2\cdot84)^2} = 7\sqrt{9^2 + 40^2} = 287$.
Use the Two Tangent Theorem on $\triangle BEF$. Since both circles are inscribed in congruent triangles, they are congruent; therefore, $EP = FQ = \frac{287 - PQ}{2}$. By the Two Tangent theorem, note that $EP = EX = \frac{287 - PQ}{2}$, making $BX = 105 - EX = 105 - \left[\frac{287 - PQ}{2}\right]$. Also, $BX = BY$. $FY = 364 - BY = 364 - \left[105 - \left[\frac{287 - PQ}{2}\right]\right]$.
Finally, $FP = FY = 364 - \left[105 - \left[\frac{287 - PQ}{2}\right]\right] = \frac{805 - PQ}{2}$. Also, $FP = FQ + PQ = \frac{287 - PQ}{2} + PQ$. Equating, we see that $\frac{805 - PQ}{2} = \frac{287 + PQ}{2}$, so $PQ = \boxed{259}$. | \(\boxed{259}\) |
Of the students attending a school party, $60\%$ of the students are girls, and $40\%$ of the students like to dance. After these students are joined by $20$ more boy students, all of whom like to dance, the party is now $58\%$ girls. How many students now at the party like to dance? | Let $p$ denote the total number of people at the party. Then, because we know the proportions of boys to $p$ both before and after 20 boys arrived, we can create the following equation: \[0.4p+20 = 0.42(p+20)\] Solving for p gives us $p=580$, so the solution is $0.4p+20 = \boxed{252}$ | \(\boxed{252}\) |
A block of cheese in the shape of a rectangular solid measures $10$ cm by $13$ cm by $14$ cm. Ten slices are cut from the cheese. Each slice has a width of $1$ cm and is cut parallel to one face of the cheese. The individual slices are not necessarily parallel to each other. What is the maximum possible volume in cubic cm of the remaining block of cheese after ten slices have been cut off? | Let the lengths of the three sides of the rectangular solid after the cutting be $a,b,c$, so that the desired volume is $abc$. Note that each cut reduces one of the dimensions by one, so that after ten cuts, $a+b+c = 10 + 13 + 14 - 10 = 27$. By AM-GM, $\frac{a+b+c}{3} = 9 \ge \sqrt[3]{abc} \Longrightarrow abc \le \boxed{729}$. Equality is achieved when $a=b=c=9$, which is possible if we make one slice perpendicular to the $10$ cm edge, four slices perpendicular to the $13$ cm edge, and five slices perpendicular to the $14$ cm edge. | \(\boxed{729}\) |
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left. | Just like in solution 1, we note that all colors will be used equally, except for the pink stripe. This must bring red and white down to $130$ each, so $34$ red and $58$ white are used, making for a total of $92$ for the pink stripe. Thus, the other stripes also use $92$. The answer is $130+164+188-4(92)=\boxed{114}$ | \(\boxed{114}\) |
Find the smallest positive integer $n$ with the property that the polynomial $x^4 - nx + 63$ can be written as a product of two nonconstant polynomials with integer coefficients. | You can factor the polynomial into two quadratic factors or a linear and a cubic factor.
For two quadratic factors, let $x^2+ax+b$ and $x^2+cx+d$ be the two quadratics, so that
\[(x^2 + ax + b )(x^2 + cx + d) = x^4 + (a + c)x^3 + (b + d + ac)x^2 + (ad + bc)x + bd.\]
Therefore, again setting coefficients equal, $a + c = 0\Longrightarrow a=-c$, $b + d + ac = 0\Longrightarrow b+d=a^2$ , $ad + bc = - n$, and so $bd = 63$.
Since $b+d=a^2$, the only possible values for $(b,d)$ are $(1,63)$ and $(7,9)$. From this we find that the possible values for $n$ are $\pm 8 \cdot 62$ and $\pm 4 \cdot 2$.
For the case of one linear and one cubic factor, doing a similar expansion and matching of the coefficients gives the smallest $n$ in that case to be $48$.
Therefore, the answer is $4 \cdot 2 = \boxed{008}$. | \(\boxed{8}\) |
The degree measures of the angles in a convex 18-sided polygon form an increasing arithmetic sequence with integer values. Find the degree measure of the smallest angle. | Each individual angle in a $18$-gon is $\frac {(18-2) \cdot 180^\circ}{18} = 160^\circ$. Since no angle in a convex polygon can be larger than $180^\circ$, the smallest angle possible is in the set $159, 161, 157, 163, 155, 165, 153, 167, 151, 169, 149, 171, 147, 173, 145, 175, 143, 177$.
Our smallest possible angle is $\boxed{143}$
~Arcticturn | \(\boxed{143}\) |
Let $B$ be the set of all binary integers that can be written using exactly $5$ zeros and $8$ ones where leading zeros are allowed. If all possible subtractions are performed in which one element of $B$ is subtracted from another, find the number of times the answer $1$ is obtained. | When $1$ is subtracted from a binary number, the number of digits will remain constant if and only if the original number ended in $10.$ Therefore, every subtraction involving two numbers from $B$ will necessarily involve exactly one number ending in $10.$ To solve the problem, then, we can simply count the instances of such numbers. With the $10$ in place, the seven remaining $1$'s can be distributed in any of the remaining $11$ spaces, so the answer is ${11 \choose 7} = \boxed{330}$.
(Solution by Richard Rusczyk) - AMBRIGGS | \(\boxed{330}\) |
Let $x,$ $y,$ and $z$ be positive real numbers that satisfy \[2\log_{x}(2y) = 2\log_{2x}(4z) = \log_{2x^4}(8yz) \ne 0.\] The value of $xy^5z$ can be expressed in the form $\frac{1}{2^{p/q}},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$ | Since we are given that $xy^5z = 2^{-p/q}$, we may assume that $x, y$, and $z$ are all powers of two. We shall thus let $x = 2^X$, $y = 2^Y$, and $z = 2^Z$. Let $a = \log_{2^X}(2^{Y+1})$. From this we get the system of equations: \[\] $(1)$\[a = \log_{2^X}(2^{Y+1}) \Rightarrow aX = Y + 1\] $(2)$\[a = \log_{2^{X + 1}}(2^{Z + 2}) \Rightarrow aX + a = Z + 2\] $(3)$\[2a = \log_{2^{4X + 1}}(2^{Y + Z + 3}) \Rightarrow 8aX + 2a = Y + Z + 3\]
Plugging equation $(1)$ into equation $(2)$ yields $Y + a = Z + 1$. Plugging equation $(1)$ into equation $(3)$ and simplifying yields $7Y + 2a + 6 = Z + 1$, and substituting $Y + a$ for $Z + 1$ and simplifying yields $Y + 1 = \frac{-a}{6}$. But $Y + 1 = aX$, so $aX = \frac{-a}{6}$, so $X = \frac{-1}{6}$.
Knowing this, we may substitute $\frac{-1}{6}$ for $X$ in equations $(1)$ and $(2)$, yielding $\frac{-a}{6} = Y + 1$ and $\frac{5a}{6} = Z + 2$. Thus, we have that $-5(Y + 1) = Z + 2 \rightarrow 5Y + Z = -7$. We are looking for $xy^5z = 2^{X+ 5Y + Z}$. $X = \frac{-1}{6}$ and $5Y + Z = -7$, so $xy^5z = 2^{-43/6} = \frac{1}{2^{43/6}}$. The answer is $43+6=\boxed{049}$.
https://artofproblemsolving.com/videos/amc/2012aimei/348
~ dolphin7 | \(\boxed{49}\) |
A frog begins at $P_0 = (0,0)$ and makes a sequence of jumps according to the following rule: from $P_n = (x_n, y_n),$ the frog jumps to $P_{n+1},$ which may be any of the points $(x_n + 7, y_n + 2),$ $(x_n + 2, y_n + 7),$ $(x_n - 5, y_n - 10),$ or $(x_n - 10, y_n - 5).$ There are $M$ points $(x, y)$ with $|x| + |y| \le 100$ that can be reached by a sequence of such jumps. Find the remainder when $M$ is divided by $1000.$ | First of all, it is easy to see by induction that for any $P(x,y)$ in the frog's jump sequence, $x+y$ will be a multiple of $3$ and $x-y$ will be a multiple of $5.$ The base case $(x,y) = (0,0)$ obviously satisfies the constraints and if $x+y = 3n$ and $x-y = 5m,$ any of the four transformations will sustain this property:
\begin{align*} (x+7)+(y+2) = x+y+9 \rightarrow 3(n+3) &\text{ and } (x+7)-(y+2) = x-y+5 \rightarrow 5(m+1)\\ (x+2)+(y+7) = x+y+9 \rightarrow 3(n+3) &\text{ and } (x+2)-(y+7) = x-y-5 \rightarrow 5(m-1)\\ (x-5)+(y-10) = x+y-15 \rightarrow 3(n-5) &\text{ and } (x-5)-(y-10) = x-y+5 \rightarrow 5(m+1)\\ (x-10)+(y-5) = x+y-15 \rightarrow 3(n-5) &\text{ and } (x-10)-(y-5) = x-y-5 \rightarrow 5(m-1).\\ \end{align*} So we know that any point the frog can reach will satisfy $x+y = 3n$ and $x-y = 5m.$
$\textbf{Lemma:}$ Any point $(x,y)$ such that there exists 2 integers $m$ and $n$ that satisfy $x+y = 3n$ and $x-y = 5m$ is reachable.
$\textbf{Proof:}$ Denote the total amounts of each specific transformation in the frog's jump sequence to be $a,$ $b,$ $c,$ and $d$ respectively. Then
$x=7a+2b-5c-10d$,
$y=2a+7b-10c-5d$,
$x+y = 9(a+b)-15(c+d) = 3n$, and
$x-y = 5(a-b)+5(c-d) = 5m$
together must have integral solutions. But
$3(a+b)-5(c+d) = n$ implies
$(c+d) \equiv n \mod 3$ and thus
$(a+b) = \lfloor{n/3}\rfloor + 2(c+d).$
Similarly, $(a-b)+(c-d) = m$ implies that $(a-b)$ and $(c-d)$ have the same parity. Now in order for an integral solution to exist, there must always be a way to ensure that the pairs $(a+b)$ and $(a-b)$ and $(c+d)$ and $(c-d)$ have identical parities. The parity of $(a+b)$ is completely dependent on $n,$ so the parities of $(a-b)$ and $(c-d)$ must be chosen to match this value. But the parity of $(c+d)$ can then be adjusted by adding or subtracting $3$ until it is identical to the parity of $(c-d)$ as chosen before, so we conclude that it is always possible to find an integer solution for $(a,b,c,d)$ and thus any point that satisfies $x+y = 3n$ and $x-y = 5m$ can be reached by the frog.
To count the number of such points in the region $|x| + |y| \le 100,$ we first note that any such point will lie on the intersection of one line of the form $y=x-5m$ and another line of the form $y=-x+3n.$ The intersection of two such lines will yield the point $\left(\frac{3n+5m}{2},\frac{3n-5m}{2}\right),$ which will be integral if and only if $m$ and $n$ have the same parity. Now since $|x| + |y| = |x \pm y|,$ we find that
\begin{align*} |x + y| = |3n| \le 100 &\rightarrow -33 \le n \le 33\\ |x - y| = |5m| \le 100 &\rightarrow -20 \le m \le 20. \end{align*}
So there are $34$ possible odd values and $33$ possible even values for $n,$ and $20$ possible odd values and $21$ possible even values for $m.$ Every pair of lines described above will yield a valid accessible point for all pairs of $m$ and $n$ with the same parity, and the number of points $M$ is thus $34 \cdot 20 + 33 \cdot 21 = 1373 \rightarrow \boxed{373}$.
https://artofproblemsolving.com/videos/amc/2012aimei/351
~ dolphin7 | \(\boxed{373}\) |
Let $\triangle ABC$ be a right triangle with right angle at $C.$ Let $D$ and $E$ be points on $\overline{AB}$ with $D$ between $A$ and $E$ such that $\overline{CD}$ and $\overline{CE}$ trisect $\angle C.$ If $\frac{DE}{BE} = \frac{8}{15},$ then $\tan B$ can be written as $\frac{m \sqrt{p}}{n},$ where $m$ and $n$ are relatively prime positive integers, and $p$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | Without loss of generality, set $CB = 1$. Then, by the Angle Bisector Theorem on triangle $DCB$, we have $CD = \frac{8}{15}$. We apply the Law of Cosines to triangle $DCB$ to get $1 + \frac{64}{225} - \frac{8}{15} = BD^{2}$, which we can simplify to get $BD = \frac{13}{15}$.
Now, we have $\cos \angle B = \frac{1 + \frac{169}{225} - \frac{64}{225}}{\frac{26}{15}}$ by another application of the Law of Cosines to triangle $DCB$, so $\cos \angle B = \frac{11}{13}$. In addition, $\sin \angle B = \sqrt{1 - \frac{121}{169}} = \frac{4\sqrt{3}}{13}$, so $\tan \angle B = \frac{4\sqrt{3}}{11}$.
Our final answer is $4+3+11 = \boxed{018}$. | \(\boxed{18}\) |
Three concentric circles have radii $3,$ $4,$ and $5.$ An equilateral triangle with one vertex on each circle has side length $s.$ The largest possible area of the triangle can be written as $a + \tfrac{b}{c} \sqrt{d},$ where $a,$ $b,$ $c,$ and $d$ are positive integers, $b$ and $c$ are relatively prime, and $d$ is not divisible by the square of any prime. Find $a+b+c+d.$ | Reinterpret the problem in the following manner. Equilateral triangle $ABC$ has a point $X$ on the interior such that $AX = 5,$ $BX = 4,$ and $CX = 3.$ A $60^\circ$ counter-clockwise rotation about vertex $A$ maps $X$ to $X'$ and $B$ to $C.$
[asy]import cse5; size(200); defaultpen(linewidth(0.4)+fontsize(8)); pair O = origin; pair A,B,C,Op,Bp,Cp; path c3,c4,c5; c3 = CR(O,3); c4 = CR(O,4); c5 = CR(O,5); draw(c3^^c4^^c5, gray+0.25); A = 5*dir(96.25); Op = rotate(60,A)*O; B = OP(CR(Op,4),c3); Bp = IP(CR(Op,4),c3); C = rotate(-60,A)*B; Cp = rotate(-60,A)*Bp; draw(A--B--C--A, black+0.8); draw(A--Bp--Cp--A, royalblue+0.8); draw(CR(Op,4), heavygreen+0.25); dot("$A$",A,N); dot("$X$",O,E); dot("$X'$",Op,E); dot("$C$",B,SE); dot("$C'$",Bp,NE); dot("$B$",C,2*SW); dot("$B'$",Cp,2*S); [/asy]
Note that angle $XAX'$ is $60$ and $XA = X'A = 5$ which tells us that triangle $XAX'$ is equilateral and that $XX' = 5.$ We now notice that $XC = 3$ and $X'C = 4$ which tells us that angle $XCX'$ is $90$ because there is a $3$-$4$-$5$ Pythagorean triple. Now note that $\angle ABC + \angle ACB = 120^\circ$ and $\angle XCA + \angle XBA = 90^\circ,$ so $\angle XCB+\angle XBC = 30^\circ$ and $\angle BXC = 150^\circ.$ Applying the law of cosines on triangle $BXC$ yields
\[BC^2 = BX^2+CX^2 - 2 \cdot BX \cdot CX \cdot \cos150^\circ = 4^2+3^2-24 \cdot \frac{-\sqrt{3}}{2} = 25+12\sqrt{3}\]
and thus the area of $ABC$ equals \[\frac{\sqrt{3}}{4}\cdot BC^2 = 25\frac{\sqrt{3}}{4}+9.\]
so our final answer is $3+4+25+9 = \boxed{041}.$ | \(\boxed{41}\) |
Complex numbers $a,$ $b,$ and $c$ are zeros of a polynomial $P(z) = z^3 + qz + r,$ and $|a|^2 + |b|^2 + |c|^2 = 250.$ The points corresponding to $a,$ $b,$ and $c$ in the complex plane are the vertices of a right triangle with hypotenuse $h.$ Find $h^2.$ | As noted in the previous solutions, $a+b+c = 0$. Let $a = a_1+a_2 i$, $b = b_1+b_2 i$, $c = c_1+c_2 i$ and we have $a_1 + b_1 + c_1 = a_2 + b_2 + c_2 = 0$. Then the given $|a|^2 + |b|^2 + |c|^2 = 250$ translates to $\sum_{} ( {a_1}^2 + {a_2}^2 ) = 250.$ Note that in a right triangle, the sum of the squares of the three sides is equal to two times the square of the hypotenuse, by the pythagorean theorem. Thus, we have \[2h^2 = (a_1 - b_1)^2 + (a_2 - b_2)^2 + (b_1 - c_1)^2 + (b_2 - c_2)^2 + (a_1 - c_1)^2 + (a_2 - c_2)^2\] \[= 2 \left( \sum_{} ( {a_1}^2 + {a_2}^2 ) \right) - 2 \left( \sum_{cyc} a_1 b_1 + \sum_{cyc} a_2 b_2 \right)\] \[= 500 - \left( (a_1 + b_1 + c_1)^2 + (a_2 + b_2 + c_2)^2 - \sum_{cyc} ( {a_1}^2 + {a_2}^2 ) \right)\] \[= 500 - (0^2 + 0^2 - 250)\] so $h^2 = \boxed{375}$ and we may conclude. ~ rzlng | \(\boxed{375}\) |
The AIME Triathlon consists of a half-mile swim, a 30-mile bicycle ride, and an eight-mile run. Tom swims, bicycles, and runs at constant rates. He runs fives times as fast as he swims, and he bicycles twice as fast as he runs. Tom completes the AIME Triathlon in four and a quarter hours. How many minutes does he spend bicycling? | Let $r$ represent the rate Tom swims in miles per minute. Then we have
$\frac{1/2}{r} + \frac{8}{5r} + \frac{30}{10r} = 255$
Solving for $r$, we find $r = 1/50$, so the time Tom spends biking is $\frac{30}{(10)(1/50)} = \boxed{150}$ minutes.
~Shreyas S | \(\boxed{150}\) |
Let $ABCD$ be a square, and let $E$ and $F$ be points on $\overline{AB}$ and $\overline{BC},$ respectively. The line through $E$ parallel to $\overline{BC}$ and the line through $F$ parallel to $\overline{AB}$ divide $ABCD$ into two squares and two nonsquare rectangles. The sum of the areas of the two squares is $\frac{9}{10}$ of the area of square $ABCD.$ Find $\frac{AE}{EB} + \frac{EB}{AE}.$ | After we get the polynomial $x^2 - 18x + 1,$ we want to find $x + \frac 1 {x}.$ Since the product of the roots of the polynomial is 1, the roots of the polynomial are simply $x, \frac 1 {x}.$ Hence $x + \frac 1 {x}$ is just $18$ by Vieta's formula, or $\boxed{018}$ | \(\boxed{18}\) |
Find the least positive integer $N$ such that the set of $1000$ consecutive integers beginning with $1000\cdot N$ contains no square of an integer. | Let $x$ be the number being squared. Based on the reasoning above, we know that $N$ must be at least $250$, so $x$ has to be at least $500$. Let $k$ be $x-500$. We can write $x^2$ as $(500+k)^2$, or $250000+1000k+k^2$. We can disregard $250000$ and $1000k$, since they won't affect the last three digits, which determines if there are any squares between $\overline{N000}\rightarrow \overline{N999}$. So we must find a square, $k^2$, such that it is under $1000$, but the next square is over $1000$. We find that $k=31$ gives $k^2=961$, and so $(k+1)^2=32^2=1024$. We can be sure that this skips a thousand because the $1000k$ increments it up $1000$ each time. Now we can solve for $x$: $(500+31)^2=281961$, while $(500+32)^2=283024$. We skipped $282000$, so the answer is $\boxed{282}$. | \(\boxed{282}\) |
A group of clerks is assigned the task of sorting $1775$ files. Each clerk sorts at a constant rate of $30$ files per hour. At the end of the first hour, some of the clerks are reassigned to another task; at the end of the second hour, the same number of the remaining clerks are also reassigned to another task, and a similar assignment occurs at the end of the third hour. The group finishes the sorting in $3$ hours and $10$ minutes. Find the number of files sorted during the first one and a half hours of sorting. | We start with the same approach as solution 1 to get $19x-21t=355$. Then notice that $21t + 355 \equiv 0 \pmod{19}$, or $2t-6 \equiv 0 \pmod{19}$, giving the smallest solution at $t=3$. We find that $x=22$. Then the number of files they sorted will be $30x+15(x-t)=660+285=\boxed{945}.$ | \(\boxed{945}\) |
Abe can paint the room in 15 hours, Bea can paint 50 percent faster than Abe, and Coe can paint twice as fast as Abe. Abe begins to paint the room and works alone for the first hour and a half. Then Bea joins Abe, and they work together until half the room is painted. Then Coe joins Abe and Bea, and they work together until the entire room is painted. Find the number of minutes after Abe begins for the three of them to finish painting the room. | From the given information, we can see that Abe can paint $\frac{1}{15}$ of the room in an hour, Bea can paint $\frac{1}{15}\times\frac{3}{2} = \frac{1}{10}$ of the room in an hour, and Coe can paint the room in $\frac{1}{15}\times 2 = \frac{2}{15}$ of the room in an hour. After $90$ minutes, Abe has painted $\frac{1}{15}\times\frac{3}{2}=\frac{1}{10}$ of the room. Working together, Abe and Bea can paint $\frac{1}{15}+\frac{1}{10}=\frac{1}{6}$ of the room in an hour, so it takes then $\frac{2}{5}\div \frac{1}{6}= \frac{12}{5}$ hours to finish the first half of the room. All three working together can paint $\frac{1}{6}+\frac{2}{15}=\frac{3}{10}$ of the room in an hour, and it takes them $\frac{1}{2}\div \frac{3}{10}=\frac{5}{3}$ hours to finish the room. The total amount of time they take is \[90+\frac{12}{5}\times 60+\frac{5}{3}\times 60 = 90+ 144 + 100 = \boxed{334} \text{\ minutes.}\]
~ pi_is_3.14 | \(\boxed{334}\) |
Find the least positive integer $m$ such that $m^2 - m + 11$ is a product of at least four not necessarily distinct primes. | Suppose $p=11$; then $m^2-m+11=11qrs$. Reducing modulo 11, we get $m\equiv 1,0 \pmod{11}$ so $k(11k\pm 1)+1 = qrs$.
Suppose $q=11$. Then we must have $11k^2\pm k + 1 = 11rs$, which leads to $k\equiv \mp 1 \pmod{11}$, i.e., $k\in \{1,10,12,21,23,\ldots\}$.
$k=1$ leads to $rs=1$ (impossible)! Then $k=10$ leads to $rs=103$, a prime (impossible). Finally, for $k=12$ we get $rs=143=11\cdot 13$.
Thus our answer is $m=11k= \boxed{132}$. | \(\boxed{132}\) |
Initially Alex, Betty, and Charlie had a total of $444$ peanuts. Charlie had the most peanuts, and Alex had the least. The three numbers of peanuts that each person had formed a geometric progression. Alex eats $5$ of his peanuts, Betty eats $9$ of her peanuts, and Charlie eats $25$ of his peanuts. Now the three numbers of peanuts each person has forms an arithmetic progression. Find the number of peanuts Alex had initially. | Let $b$ be the finish number of Betty's peanuts. Then \[3b = 444-(5 + 9 + 25) = 405 = 3 \cdot 135 \implies b = 135, b+ 9 = 144.\]
Let $k > 1$ be the common ratio. Then \[\frac{144}{k} + 144 + k \cdot 144 = 444 \implies \frac{144}{k} + k \cdot 144 = 300\implies \frac{12}{k} + k \cdot 12 = 25\implies k = \frac{4}{3} \implies \frac {144\cdot 3}{4} = \boxed{108}.\]
[email protected], vvsss | \(\boxed{108}\) |
An $a \times b \times c$ rectangular box is built from $a \cdot b \cdot c$ unit cubes. Each unit cube is colored red, green, or yellow. Each of the $a$ layers of size $1 \times b \times c$ parallel to the $(b \times c)$ faces of the box contains exactly $9$ red cubes, exactly $12$ green cubes, and some yellow cubes. Each of the $b$ layers of size $a \times 1 \times c$ parallel to the $(a \times c)$ faces of the box contains exactly $20$ green cubes, exactly $25$ yellow cubes, and some red cubes. Find the smallest possible volume of the box. | The total number of green cubes is given by $12a=20b\Longrightarrow a=\frac{5}{3}b$.
Let $r$ be the number of red cubes on each one of the $b$ layers then the total number of red cubes is $9a=br$. Substitute $a=\frac{5}{3}b$ gives $r=15$.
Repeating the procedure on the number of yellow cubes $y$ on each of the $a$ layers gives $y=15$.
Therefore $bc=9+12+15=36$ and $ac=15+20+25=60$. Multiplying yields $abc^2=2160$.
Since $abc^2$ is fixed, $abc$ is minimized when $c$ is maximized, which occurs when $a$, $b$ are minimized (since each of $ac$, $bc$ is fixed). Thus $(a,b,c)=(3,5,12)\Longrightarrow abc=\boxed{180}$
~ Nafer | \(\boxed{180}\) |
Find the sum of all positive integers $n$ such that $\sqrt{n^2+85n+2017}$ is an integer. | Notice that $(n+42)^2= n^2+84n+1764$. Also note that $(n+45)^2= n^2+90n+2025$. Thus, \[(n+42)^2< n^2+85n+2017<(n+45)^2\] where $n^2+85n+2017$ is a perfect square. Hence,\[n^2+85n+2017= (n+43)^2\] or \[n^2+85n+2017= (n+44)^2.\] Solving the two equations yields the two solutions $n= 168, 27$. Therefore, our answer is $\boxed{195}$. | \(\boxed{195}\) |
Find the number of integer values of $k$ in the closed interval $[-500,500]$ for which the equation $\log(kx)=2\log(x+2)$ has exactly one real solution. | [asy] Label f; f.p=fontsize(5); xaxis(-3,3,Ticks(f,1.0)); yaxis(-3,26,Ticks(f,1.0)); real f(real x){return (x+2)^2;} real g(real x){return x*-1;} real h(real x){return x*-2;} real i(real x){return x*-3;} real j(real x){return x*8;} draw(graph(f,-2,3),green); draw(graph(g,-2,2),red); draw(graph(h,-2,1),red); draw(graph(i,-2,1/3),red); draw(graph(j,-0.25,3),red); [/asy] Note the equation $\log(kx)=2\log(x+2)$ is valid for $kx>0$ and $x>-2$. $\log(kx)=2\log(x+2)=\log((x+2)^2)$. The equation $kx=(x+2)^2$ is derived by taking away the outside logs from the previous equation. Because $(x+2)^2$ is always non-negative, $kx$ must also be non-negative; therefore this takes care of the $kx>0$ condition as long as $k\neq0$, i.e. $k$ cannot be $0$. Now, we graph both $(x+2)^2$ (the green graph) and $kx$ (the red graph for $k=-1,k=-2,k=-3,k=8$) for $x>-2$. It is easy to see that all negative values of $k$ make the equation $\log(kx)=2\log(x+2)$ have only one solution. However, there is also one positive value of $k$ that makes the equation only have one solution, as shown by the steepest line in the diagram. We can show that the slope of this line is a positive integer by setting the discriminant of the equation $(x+2)^2=kx$ to be $0$ and solving for $k$. Therefore, there are $500$ negative solutions and $1$ positive solution, for a total of $\boxed{501}$. | \(\boxed{501}\) |
Find the number of positive integers $n$ less than $2017$ such that \[1+n+\frac{n^2}{2!}+\frac{n^3}{3!}+\frac{n^4}{4!}+\frac{n^5}{5!}+\frac{n^6}{6!}\] is an integer. | Note that $1+n+\frac{n^2}{2!}+\frac{n^3}{3!}+\frac{n^4}{4!}+\frac{n^5}{5!}$ will have a denominator that divides $5!$. Therefore, for the expression to be an integer, $\frac{n^6}{6!}$ must have a denominator that divides $5!$. Thus, $6\mid n^6$, and $6\mid n$. Let $n=6m$. Substituting gives $1+6m+\frac{6^2m^2}{2!}+\frac{6^3m^3}{3!}+\frac{6^4m^4}{4!}+\frac{6^5m^5}{5!}+\frac{6^6m^6}{6!}$. Note that the first $5$ terms are integers, so it suffices for $\frac{6^5m^5}{5!}+\frac{6^6m^6}{6!}$ to be an integer. This simplifies to $\frac{6^5}{5!}m^5(m+1)=\frac{324}{5}m^5(m+1)$. It follows that $5\mid m^5(m+1)$. Therefore, $m$ is either $0$ or $4$ modulo $5$. However, we seek the number of $n$, and $n=6m$. By CRT, $n$ is either $0$ or $24$ modulo $30$, and the answer is $67+67=\boxed{134}$.
-TheUltimate123 | \(\boxed{134}\) |
Regular octagon $A_1A_2A_3A_4A_5A_6A_7A_8$ is inscribed in a circle of area $1.$ Point $P$ lies inside the circle so that the region bounded by $\overline{PA_1},\overline{PA_2},$ and the minor arc $\widehat{A_1A_2}$ of the circle has area $\tfrac{1}{7},$ while the region bounded by $\overline{PA_3},\overline{PA_4},$ and the minor arc $\widehat{A_3A_4}$ of the circle has area $\tfrac{1}{9}.$ There is a positive integer $n$ such that the area of the region bounded by $\overline{PA_6},\overline{PA_7},$ and the minor arc $\widehat{A_6A_7}$ of the circle is equal to $\tfrac{1}{8}-\tfrac{\sqrt2}{n}.$ Find $n.$ | The actual size of the diagram doesn't matter. To make calculation easier, we discard the original area of the circle, $1$, and assume the side length of the octagon is $2$. Let $r$ denote the radius of the circle, $O$ be the center of the circle. Then $r^2= 1^2 + (\sqrt{2}+1)^2= 4+2\sqrt{2}$. Now, we need to find the "D"shape, the small area enclosed by one side of the octagon and 1/8 of the circumference of the circle: \[D= \frac{1}{8} \pi r^2 - [A_1 A_2 O]=\frac{1}{8} \pi (4+2\sqrt{2})- (\sqrt{2}+1)\]
Let $PU$ be the height of $\triangle A_1 A_2 P$, $PV$ be the height of $\triangle A_3 A_4 P$, $PW$ be the height of $\triangle A_6 A_7 P$. From the $1/7$ and $1/9$ condition we have \[\triangle P A_1 A_2= \frac{\pi r^2}{7} - D= \frac{1}{7} \pi (4+2\sqrt{2})-(\frac{1}{8} \pi (4+2\sqrt{2})- (\sqrt{2}+1))\]
\[\triangle P A_3 A_4= \frac{\pi r^2}{9} - D= \frac{1}{9} \pi (4+2\sqrt{2})-(\frac{1}{8} \pi (4+2\sqrt{2})- (\sqrt{2}+1))\] which gives $PU= (\frac{1}{7}-\frac{1}{8}) \pi (4+ 2\sqrt{2}) + \sqrt{2}+1$ and $PV= (\frac{1}{9}-\frac{1}{8}) \pi (4+ 2\sqrt{2}) + \sqrt{2}+1$. Now, let $A_1 A_2$ intersects $A_3 A_4$ at $X$, $A_1 A_2$ intersects $A_6 A_7$ at $Y$,$A_6 A_7$ intersects $A_3 A_4$ at $Z$. Clearly, $\triangle XYZ$ is an isosceles right triangle, with right angle at $X$ and the height with regard to which shall be $3+2\sqrt2$. Now $\frac{PU}{\sqrt{2}} + \frac{PV}{\sqrt{2}} + PW = 3+2\sqrt2$ which gives $PW= 3+2\sqrt2-\frac{PU}{\sqrt{2}} - \frac{PV}{\sqrt{2}}$
$=3+2\sqrt{2}-\frac{1}{\sqrt{2}}((\frac{1}{7}-\frac{1}{8}) \pi (4+ 2\sqrt{2}) + \sqrt{2}+1+(\frac{1}{9}-\frac{1}{8}) \pi (4+ 2\sqrt{2}) + \sqrt{2}+1))$
$=1+\sqrt{2}- \frac{1}{\sqrt{2}}(\frac{1}{7}+\frac{1}{9}-\frac{1}{4})\pi(4+2\sqrt{2})$
Now, we have the area for $D$ and the area for $\triangle P A_6 A_7$, so we add them together:
$\text{Target Area} = \frac{1}{8} \pi (4+2\sqrt{2})- (\sqrt{2}+1) + (1+\sqrt{2})- \frac{1}{\sqrt{2}}(\frac{1}{7}+\frac{1}{9}-\frac{1}{4})\pi(4+2\sqrt{2})$
$=(\frac{1}{8} - \frac{1}{\sqrt{2}}(\frac{1}{7}+\frac{1}{9}-\frac{1}{4}))\text{Total Area}$
The answer should therefore be $\frac{1}{8}- \frac{\sqrt{2}}{2}(\frac{16}{63}-\frac{16}{64})=\frac{1}{8}- \frac{\sqrt{2}}{504}$. The answer is $\boxed{504}$.
-By SpecialBeing2017 | \(\boxed{504}\) |
Find the sum of all positive integers $n$ such that, given an unlimited supply of stamps of denominations $5,n,$ and $n+1$ cents, $91$ cents is the greatest postage that cannot be formed. | Obviously $n\le 90$. We see that the problem's condition is equivalent to: 96 is the smallest number that can be formed which is 1 mod 5, and 92, 93, 94 can be formed (95 can always be formed). Now divide this up into cases. If $n\equiv 0\pmod{5}$, then 91 can be formed by using $n+1$ and some 5's, so there are no solutions for this case. If $n\equiv 1\pmod{5}$, then 91 can be formed by using $n$ and some 5's, so there are no solutions for this case either.
For $n\equiv 2\pmod{5}$, $2n+2$ is the smallest value that can be formed which is 1 mod 5, so $2n+2=96$ and $n=47$. We see that $92=45+47$, $93=48+45$, and $94=47+47$, so $n=47$ does work. If $n\equiv 3\pmod{5}$, then the smallest value that can be formed which is 1 mod 5 is $2n$, so $2n=96$ and $n=48$. We see that $94=49+45$ and $93=48+45$, but 92 cannot be formed, so there are no solutions for this case. If $n\equiv 4\pmod{5}$, then we can just ignore $n+1$ since it is a multiple of 5, meaning that the Chicken McNuggest theorem is a both necessary and sufficient condition, and it states that $5n-n-5=91$ meaning $4n=96$ and $n=24$. Hence, the only two $n$ that work are $n=24$ and $n=47$, so our answer is $24+47=\boxed{071}$. -Stormersyle
Video solution by Dr. Osman Nal: | \(\boxed{71}\) |
A positive integer $N$ has base-eleven representation $\underline{a}\kern 0.1em\underline{b}\kern 0.1em\underline{c}$ and base-eight representation $\underline1\kern 0.1em\underline{b}\kern 0.1em\underline{c}\kern 0.1em\underline{a},$ where $a,b,$ and $c$ represent (not necessarily distinct) digits. Find the least such $N$ expressed in base ten. | From the given information, $121a+11b+c=512+64b+8c+a \implies 120a=512+53b+7c$. Since $a$, $b$, and $c$ have to be positive, $a \geq 5$. Since we need to minimize the value of $n$, we want to minimize $a$, so we have $a = 5$. Then we know $88=53b+7c$, and we can see the only solution is $b=1$, $c=5$. Finally, $515_{11} = 621_{10}$, so our answer is $\boxed{621}$.
~ JHawk0224 | \(\boxed{621}\) |
Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | Similar to above, a $1-1$ correspondence between ascending and descending is established by subtracting each number from $7$.
We note that the given condition is equivalent to "cycling" $123456$ for a contiguous subset of it. For example,
$12(345)6 \rightarrow 125346, 124536$
It's not hard to see that no overcount is possible, and that the cycle is either $1$ "right" or $1$ "left." Therefore, we consider how many elements we flip by. If we flip $1$ or $2$ such elements, then there is one way to cycle them. Otherwise, we have $2$ ways. Therefore, the total number of ascending is $1 + 5 + 2(4 + 3 + 2 + 1) = 26$, and multiplying by two gives $\boxed{052}.$
~awang11 | \(\boxed{52}\) |
A club consisting of $11$ men and $12$ women needs to choose a committee from among its members so that the number of women on the committee is one more than the number of men on the committee. The committee could have as few as $1$ member or as many as $23$ members. Let $N$ be the number of such committees that can be formed. Find the sum of the prime numbers that divide $N.$ | Let $k$ be the number of women selected. Then, the number of men not selected is $11-(k-1)=12-k$. Note that the sum of the number of women selected and the number of men not selected is constant at $12$. Each combination of women selected and men not selected corresponds to a committee selection. Since choosing 12 individuals from the total of 23 would give $k$ women and $12-k$ men, the number of committee selections is $\binom{23}{12}$. The answer is $\boxed{081}$. ~awang11's sol | \(\boxed{81}\) |
Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random with replacement from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m.$ | Similar to before, we calculate that there are $190^3$ ways to choose $3$ factors with replacement. Then, we figure out the number of triplets ${a,b,c}$ and ${d,f,g}$, where $a$, $b$, and $c$ represent powers of $2$ and $d$, $f$, and $g$ represent powers of $5$, such that the triplets are in non-descending order. The maximum power of $2$ is $18$, and the maximum power of $5$ is $9$. Using the Hockey Stick identity, we figure out that there are $\dbinom{12}{3}$ ways to choose $d$, $f$ and $g$, and $\dbinom{21}{3}$ ways to choose $a$, $b$, and $c$. Therefore, the probability of choosing $3$ factors which satisfy the conditions is \[\frac{\dbinom{21}{3} \cdot \dbinom{12}{3}}{190^3}.\] This simplifies to $\frac{77}{1805}$, therefore $m =$ $\boxed{077}$. | \(\boxed{77}\) |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 23