problem
stringlengths 14
7.96k
| solution
stringlengths 3
10k
| answer
stringlengths 1
91
| problem_is_valid
stringclasses 1
value | solution_is_valid
stringclasses 1
value | question_type
stringclasses 1
value | problem_type
stringclasses 8
values | problem_raw
stringlengths 14
7.96k
| solution_raw
stringlengths 3
10k
| metadata
dict | uuid
stringlengths 36
36
| id
int64 22.6k
612k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
Two reals $x$ and $y$ are such that $x-y=4$ and $x^{3}-y^{3}=28$. Compute $x y$.
|
$-\mathbf{3}$. We have $28=x^{3}-y^{3}=(x-y)\left(x^{2}+x y+y^{2}\right)=(x-y)\left((x-y)^{2}+3 x y\right)=4 \cdot(16+3 x y)$, from which $x y=-3$.
|
-3
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Two reals $x$ and $y$ are such that $x-y=4$ and $x^{3}-y^{3}=28$. Compute $x y$.
|
$-\mathbf{3}$. We have $28=x^{3}-y^{3}=(x-y)\left(x^{2}+x y+y^{2}\right)=(x-y)\left((x-y)^{2}+3 x y\right)=4 \cdot(16+3 x y)$, from which $x y=-3$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-alg-solutions.jsonl",
"problem_match": "\n2. [3]",
"solution_match": "\nAnswer: "
}
|
abef2ad7-c5a9-58ab-a4ce-f4ae26fd3fcc
| 608,133
|
Three real numbers $x, y$, and $z$ are such that $(x+4) / 2=(y+9) /(z-3)=(x+5) /(z-5)$. Determine the value of $x / y$.
|
1/2. Because the first and third fractions are equal, adding their numerators and denominators produces another fraction equal to the others: $((x+4)+(x+5)) /(2+(z-5))=(2 x+9) /(z-3)$. Then $y+9=2 x+9$, etc.
|
\frac{1}{2}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Three real numbers $x, y$, and $z$ are such that $(x+4) / 2=(y+9) /(z-3)=(x+5) /(z-5)$. Determine the value of $x / y$.
|
1/2. Because the first and third fractions are equal, adding their numerators and denominators produces another fraction equal to the others: $((x+4)+(x+5)) /(2+(z-5))=(2 x+9) /(z-3)$. Then $y+9=2 x+9$, etc.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-alg-solutions.jsonl",
"problem_match": "\n3. [4]",
"solution_match": "\nAnswer: "
}
|
0f433c7e-6cc9-55ff-9ffc-9093ef22aad4
| 608,134
|
Compute
$$
\frac{2^{3}-1}{2^{3}+1} \cdot \frac{3^{3}-1}{3^{3}+1} \cdot \frac{4^{3}-1}{4^{3}+1} \cdot \frac{5^{3}-1}{5^{3}+1} \cdot \frac{6^{3}-1}{6^{3}+1}
$$
|
$\frac{\mathbf{4 3} \text {. }}{63}$ Use the factorizations $n^{3}-1=(n-1)\left(n^{2}+n+1\right)$ and $n^{3}+1=(n+1)\left(n^{2}-n+1\right)$ to write
$$
\frac{1 \cdot 7}{3 \cdot 3} \cdot \frac{2 \cdot 13}{4 \cdot 7} \cdot \frac{3 \cdot 21}{5 \cdot 13} \cdot \frac{4 \cdot 31}{6 \cdot 21} \cdot \frac{5 \cdot 43}{7 \cdot 31}=\frac{1 \cdot 2 \cdot 43}{3 \cdot 6 \cdot 7}=\frac{43}{63}
$$
|
\frac{43}{63}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Compute
$$
\frac{2^{3}-1}{2^{3}+1} \cdot \frac{3^{3}-1}{3^{3}+1} \cdot \frac{4^{3}-1}{4^{3}+1} \cdot \frac{5^{3}-1}{5^{3}+1} \cdot \frac{6^{3}-1}{6^{3}+1}
$$
|
$\frac{\mathbf{4 3} \text {. }}{63}$ Use the factorizations $n^{3}-1=(n-1)\left(n^{2}+n+1\right)$ and $n^{3}+1=(n+1)\left(n^{2}-n+1\right)$ to write
$$
\frac{1 \cdot 7}{3 \cdot 3} \cdot \frac{2 \cdot 13}{4 \cdot 7} \cdot \frac{3 \cdot 21}{5 \cdot 13} \cdot \frac{4 \cdot 31}{6 \cdot 21} \cdot \frac{5 \cdot 43}{7 \cdot 31}=\frac{1 \cdot 2 \cdot 43}{3 \cdot 6 \cdot 7}=\frac{43}{63}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-alg-solutions.jsonl",
"problem_match": "\n4. [4]",
"solution_match": "\nAnswer: "
}
|
eb950a2a-d9ba-5a38-9053-1b3ac9aa8763
| 608,135
|
A convex quadrilateral is determined by the points of intersection of the curves $x^{4}+y^{4}=100$ and $x y=4$; determine its area.
|
$\mathbf{4 \sqrt { 1 7 }}$. By symmetry, the quadrilateral is a rectangle having $x=y$ and $x=-y$ as axes of symmetry. Let $(a, b)$ with $a>b>0$ be one of the vertices. Then the desired area is
$$
(\sqrt{2}(a-b)) \cdot(\sqrt{2}(a+b))=2\left(a^{2}-b^{2}\right)=2 \sqrt{a^{4}-2 a^{2} b^{2}+b^{4}}=2 \sqrt{100-2 \cdot 4^{2}}=4 \sqrt{17}
$$
|
4 \sqrt{17}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
A convex quadrilateral is determined by the points of intersection of the curves $x^{4}+y^{4}=100$ and $x y=4$; determine its area.
|
$\mathbf{4 \sqrt { 1 7 }}$. By symmetry, the quadrilateral is a rectangle having $x=y$ and $x=-y$ as axes of symmetry. Let $(a, b)$ with $a>b>0$ be one of the vertices. Then the desired area is
$$
(\sqrt{2}(a-b)) \cdot(\sqrt{2}(a+b))=2\left(a^{2}-b^{2}\right)=2 \sqrt{a^{4}-2 a^{2} b^{2}+b^{4}}=2 \sqrt{100-2 \cdot 4^{2}}=4 \sqrt{17}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-alg-solutions.jsonl",
"problem_match": "\n5. [5]",
"solution_match": "\nAnswer: "
}
|
09c876fb-35d6-53df-bcbd-12fd2106b9b1
| 608,136
|
An infinite sequence of positive real numbers is defined by $a_{0}=1$ and $a_{n+2}=6 a_{n}-a_{n+1}$ for $n=0,1,2, \cdots$ Find the possible value(s) of $a_{2007}$.
|
$\mathbf{2}^{\mathbf{2 0 0 7}}$. The characteristic equation of the linear homogeneous equation is $m^{2}+m-6=$ $(m+3)(m-2)=0$ with solutions $m=-3$ and $m=2$. Hence the general solution is given by $a_{n}=A(2)^{n}+B(-3)^{n}$ where $A$ and $B$ are constants to be determined. Then we have $a_{n}>0$ for $n \geq 0$, so necessarily $B=0$, and $a_{0}=1 \Rightarrow A=1$. Therefore, the unique solution to the recurrence is $a_{n}=2^{n}$ for all n .
|
2^{2007}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
An infinite sequence of positive real numbers is defined by $a_{0}=1$ and $a_{n+2}=6 a_{n}-a_{n+1}$ for $n=0,1,2, \cdots$ Find the possible value(s) of $a_{2007}$.
|
$\mathbf{2}^{\mathbf{2 0 0 7}}$. The characteristic equation of the linear homogeneous equation is $m^{2}+m-6=$ $(m+3)(m-2)=0$ with solutions $m=-3$ and $m=2$. Hence the general solution is given by $a_{n}=A(2)^{n}+B(-3)^{n}$ where $A$ and $B$ are constants to be determined. Then we have $a_{n}>0$ for $n \geq 0$, so necessarily $B=0$, and $a_{0}=1 \Rightarrow A=1$. Therefore, the unique solution to the recurrence is $a_{n}=2^{n}$ for all n .
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-alg-solutions.jsonl",
"problem_match": "\n7. [5]",
"solution_match": "\nAnswer: "
}
|
2c1135ee-a20b-5477-90dd-22983b628660
| 608,138
|
Let $A:=\mathbb{Q} \backslash\{0,1\}$ denote the set of all rationals other than 0 and 1. A function $f: A \rightarrow \mathbb{R}$ has the property that for all $x \in A$,
$$
f(x)+f\left(1-\frac{1}{x}\right)=\log |x|
$$
Compute the value of $f(2007)$.
|
$\log (\mathbf{2 0 0 7} / \mathbf{2 0 0 6})$. Let $g: A \rightarrow A$ be defined by $g(x):=1-1 / x$; the key property is that
$$
g(g(g(x)))=1-\frac{1}{1-\frac{1}{1-\frac{1}{x}}}=x
$$
The given equation rewrites as $f(x)+f(g(x))=\log |x|$. Substituting $x=g(y)$ and $x=g(g(z))$ gives the further equations $f(g(y))+f(g(g(y)))=\log |g(x)|$ and $f(g(g(z)))+f(z)=\log |g(g(x))|$. Setting $y$ and $z$ to $x$ and solving the system of three equations for $f(x)$ gives
$$
f(x)=\frac{1}{2} \cdot(\log |x|-\log |g(x)|+\log |g(g(x))|)
$$
For $x=2007$, we have $g(x)=\frac{2006}{2007}$ and $g(g(x))=\frac{-1}{2006}$, so that
$$
f(2007)=\frac{\log |2007|-\log \left|\frac{2006}{2007}\right|+\log \left|\frac{-1}{2006}\right|}{2}=\log (2007 / 2006)
$$
|
\log (2007 / 2006)
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Let $A:=\mathbb{Q} \backslash\{0,1\}$ denote the set of all rationals other than 0 and 1. A function $f: A \rightarrow \mathbb{R}$ has the property that for all $x \in A$,
$$
f(x)+f\left(1-\frac{1}{x}\right)=\log |x|
$$
Compute the value of $f(2007)$.
|
$\log (\mathbf{2 0 0 7} / \mathbf{2 0 0 6})$. Let $g: A \rightarrow A$ be defined by $g(x):=1-1 / x$; the key property is that
$$
g(g(g(x)))=1-\frac{1}{1-\frac{1}{1-\frac{1}{x}}}=x
$$
The given equation rewrites as $f(x)+f(g(x))=\log |x|$. Substituting $x=g(y)$ and $x=g(g(z))$ gives the further equations $f(g(y))+f(g(g(y)))=\log |g(x)|$ and $f(g(g(z)))+f(z)=\log |g(g(x))|$. Setting $y$ and $z$ to $x$ and solving the system of three equations for $f(x)$ gives
$$
f(x)=\frac{1}{2} \cdot(\log |x|-\log |g(x)|+\log |g(g(x))|)
$$
For $x=2007$, we have $g(x)=\frac{2006}{2007}$ and $g(g(x))=\frac{-1}{2006}$, so that
$$
f(2007)=\frac{\log |2007|-\log \left|\frac{2006}{2007}\right|+\log \left|\frac{-1}{2006}\right|}{2}=\log (2007 / 2006)
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-alg-solutions.jsonl",
"problem_match": "\n8. [6]",
"solution_match": "\nAnswer: "
}
|
b32fd6b2-5564-5949-b551-c951638f171f
| 608,139
|
The polynomial $f(x)=x^{2007}+17 x^{2006}+1$ has distinct zeroes $r_{1}, \ldots, r_{2007}$. A polynomial $P$ of degree 2007 has the property that $P\left(r_{j}+\frac{1}{r_{j}}\right)=0$ for $j=1, \ldots, 2007$. Determine the value of $P(1) / P(-1)$.
|
| $\mathbf{2 8 9}$. |
| :---: |
| For some constant $k$, we have |
$$
P(z)=k \prod_{j=1}^{2007}\left(z-\left(r_{j}+\frac{1}{r_{j}}\right)\right)
$$
Now writing $\omega^{3}=1$ with $\omega \neq 1$, we have $\omega^{2}+\omega=-1$. Then
$$
\begin{gathered}
P(1) / P(-1)=\frac{k \prod_{j=1}^{2007}\left(1-\left(r_{j}+\frac{1}{r_{j}}\right)\right)}{k \prod_{j=1}^{2007}\left(-1-\left(r_{j}+\frac{1}{r_{j}}\right)\right)}=\prod_{j=1}^{2007} \frac{r_{j}^{2}-r_{j}+1}{r_{j}^{2}+r_{j}+1}=\prod_{j=1}^{2007} \frac{\left(-\omega-r_{j}\right)\left(-\omega^{2}-r_{j}\right)}{\left(\omega-r_{j}\right)\left(\omega^{2}-r_{j}\right)} \\
=\frac{f(-\omega) f\left(-\omega^{2}\right)}{f(\omega) f\left(\omega^{2}\right)}=\frac{\left(-\omega^{2007}+17 \omega^{2006}+1\right)\left(-\left(\omega^{2}\right)^{2007}+17\left(\omega^{2}\right)^{2006}+1\right)}{\left(\omega^{2007}+17 \omega^{2006}+1\right)\left(\left(\omega^{2}\right)^{2007}+17\left(\omega^{2}\right)^{2006}+1\right)}=\frac{\left(17 \omega^{2}\right)(17 \omega)}{\left(2+17 \omega^{2}\right)(2+17 \omega)} \\
=\frac{289}{4+34\left(\omega+\omega^{2}\right)+289}=\frac{289}{259} .
\end{gathered}
$$
|
\frac{289}{259}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
The polynomial $f(x)=x^{2007}+17 x^{2006}+1$ has distinct zeroes $r_{1}, \ldots, r_{2007}$. A polynomial $P$ of degree 2007 has the property that $P\left(r_{j}+\frac{1}{r_{j}}\right)=0$ for $j=1, \ldots, 2007$. Determine the value of $P(1) / P(-1)$.
|
| $\mathbf{2 8 9}$. |
| :---: |
| For some constant $k$, we have |
$$
P(z)=k \prod_{j=1}^{2007}\left(z-\left(r_{j}+\frac{1}{r_{j}}\right)\right)
$$
Now writing $\omega^{3}=1$ with $\omega \neq 1$, we have $\omega^{2}+\omega=-1$. Then
$$
\begin{gathered}
P(1) / P(-1)=\frac{k \prod_{j=1}^{2007}\left(1-\left(r_{j}+\frac{1}{r_{j}}\right)\right)}{k \prod_{j=1}^{2007}\left(-1-\left(r_{j}+\frac{1}{r_{j}}\right)\right)}=\prod_{j=1}^{2007} \frac{r_{j}^{2}-r_{j}+1}{r_{j}^{2}+r_{j}+1}=\prod_{j=1}^{2007} \frac{\left(-\omega-r_{j}\right)\left(-\omega^{2}-r_{j}\right)}{\left(\omega-r_{j}\right)\left(\omega^{2}-r_{j}\right)} \\
=\frac{f(-\omega) f\left(-\omega^{2}\right)}{f(\omega) f\left(\omega^{2}\right)}=\frac{\left(-\omega^{2007}+17 \omega^{2006}+1\right)\left(-\left(\omega^{2}\right)^{2007}+17\left(\omega^{2}\right)^{2006}+1\right)}{\left(\omega^{2007}+17 \omega^{2006}+1\right)\left(\left(\omega^{2}\right)^{2007}+17\left(\omega^{2}\right)^{2006}+1\right)}=\frac{\left(17 \omega^{2}\right)(17 \omega)}{\left(2+17 \omega^{2}\right)(2+17 \omega)} \\
=\frac{289}{4+34\left(\omega+\omega^{2}\right)+289}=\frac{289}{259} .
\end{gathered}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-alg-solutions.jsonl",
"problem_match": "\n10. [8]",
"solution_match": "\nAnswer: "
}
|
74c0c266-96ea-5d45-8bd3-9de9966f0664
| 608,141
|
Compute:
$$
\lim _{x \rightarrow 0} \frac{x^{2}}{1-\cos (x)}
$$
|
2. Since $\sin ^{2}(x)=1-\cos ^{2}(x)$, we multiply the numerator and denominator by $1+\cos (x)$ and use the fact that $x / \sin (x) \rightarrow 1$, obtaining
$$
\lim _{x \rightarrow 0} \frac{x^{2}}{1-\cos (x)}=\lim _{x \rightarrow 0} \frac{x^{2}(1+\cos (x))}{1-\cos ^{2}(x)}=\lim _{x \rightarrow 0}\left(\frac{x}{\sin (x)}\right)^{2} \cdot 2=2
$$
Remarks. Another solution, using L'Hôpital's rule, is possible: $\lim _{x \rightarrow 0} \frac{x^{2}}{1-\cos (x)}=\lim _{x \rightarrow 0} \frac{2 x}{\sin (x)}=2$.
|
2
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
Compute:
$$
\lim _{x \rightarrow 0} \frac{x^{2}}{1-\cos (x)}
$$
|
2. Since $\sin ^{2}(x)=1-\cos ^{2}(x)$, we multiply the numerator and denominator by $1+\cos (x)$ and use the fact that $x / \sin (x) \rightarrow 1$, obtaining
$$
\lim _{x \rightarrow 0} \frac{x^{2}}{1-\cos (x)}=\lim _{x \rightarrow 0} \frac{x^{2}(1+\cos (x))}{1-\cos ^{2}(x)}=\lim _{x \rightarrow 0}\left(\frac{x}{\sin (x)}\right)^{2} \cdot 2=2
$$
Remarks. Another solution, using L'Hôpital's rule, is possible: $\lim _{x \rightarrow 0} \frac{x^{2}}{1-\cos (x)}=\lim _{x \rightarrow 0} \frac{2 x}{\sin (x)}=2$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n1. [3]",
"solution_match": "\nAnswer: "
}
|
9ae826cd-7ec5-5c9d-ab8b-da0da0ffcafe
| 608,142
|
Determine the real number $a$ having the property that $f(a)=a$ is a relative minimum of $f(x)=$ $x^{4}-x^{3}-x^{2}+a x+1$.
|
1. Being a relative minimum, we have $0=f^{\prime}(a)=4 a^{3}-3 a^{2}-2 a+a=a(4 a+1)(a-1)$. Then $a=0,1,-1 / 4$ are the only possibilities. However, it is easily seen that $a=1$ is the only value satisfying $f(a)=a$.
|
1
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Determine the real number $a$ having the property that $f(a)=a$ is a relative minimum of $f(x)=$ $x^{4}-x^{3}-x^{2}+a x+1$.
|
1. Being a relative minimum, we have $0=f^{\prime}(a)=4 a^{3}-3 a^{2}-2 a+a=a(4 a+1)(a-1)$. Then $a=0,1,-1 / 4$ are the only possibilities. However, it is easily seen that $a=1$ is the only value satisfying $f(a)=a$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n2. [3]",
"solution_match": "\nAnswer: "
}
|
5c2ecf8f-5646-502a-9c98-acfd58187741
| 608,143
|
Let $a$ be a positive real number. Find the value of $a$ such that the definite integral
$$
\int_{a}^{a^{2}} \frac{\mathrm{~d} x}{x+\sqrt{x}}
$$
achieves its smallest possible value.
|
$\sqrt[{3-2 \sqrt{2}}]{ }$ Let $F(a)$ denote the given definite integral. Then
$$
F^{\prime}(a)=\frac{\mathrm{d}}{\mathrm{~d} a} \int_{a}^{a^{2}} \frac{\mathrm{~d} x}{x+\sqrt{x}}=2 a \cdot \frac{1}{a^{2}+\sqrt{a^{2}}}-\frac{1}{a+\sqrt{a}} .
$$
Setting $F^{\prime}(a)=0$, we find that $2 a+2 \sqrt{a}=a+1$ or $(\sqrt{a}+1)^{2}=2$. We find $\sqrt{a}= \pm \sqrt{2}-1$, and because $\sqrt{a}>0, a=(\sqrt{2}-1)^{2}=3-2 \sqrt{2}$.
|
3-2\sqrt{2}
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
Let $a$ be a positive real number. Find the value of $a$ such that the definite integral
$$
\int_{a}^{a^{2}} \frac{\mathrm{~d} x}{x+\sqrt{x}}
$$
achieves its smallest possible value.
|
$\sqrt[{3-2 \sqrt{2}}]{ }$ Let $F(a)$ denote the given definite integral. Then
$$
F^{\prime}(a)=\frac{\mathrm{d}}{\mathrm{~d} a} \int_{a}^{a^{2}} \frac{\mathrm{~d} x}{x+\sqrt{x}}=2 a \cdot \frac{1}{a^{2}+\sqrt{a^{2}}}-\frac{1}{a+\sqrt{a}} .
$$
Setting $F^{\prime}(a)=0$, we find that $2 a+2 \sqrt{a}=a+1$ or $(\sqrt{a}+1)^{2}=2$. We find $\sqrt{a}= \pm \sqrt{2}-1$, and because $\sqrt{a}>0, a=(\sqrt{2}-1)^{2}=3-2 \sqrt{2}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n3. [4]",
"solution_match": "\nAnswer: "
}
|
77543215-35ce-5be9-b5d6-cd725fb8a20c
| 608,144
|
Find the real number $\alpha$ such that the curve $f(x)=e^{x}$ is tangent to the curve $g(x)=\alpha x^{2}$.
|
$\mathbf{e}^{\mathbf{2} / 4}$. Suppose tangency occurs at $x=x_{0}$. Then $e^{x_{0}}=\alpha x_{0}^{2}$ and $f^{\prime}\left(x_{0}\right)=2 \alpha x_{0}$. On the other hand, $f^{\prime}(x)=f(x)$, so $\alpha x_{0}^{2}=2 \alpha x_{0}$. Clearly, $\alpha=0$ and $x_{0}=0$ are impossible, so it must be that $x_{0}=2$. Then $\alpha=e^{x_{0}} /\left(x_{0}^{2}\right)=e^{2} / 4$.
|
e^{2} / 4
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
Find the real number $\alpha$ such that the curve $f(x)=e^{x}$ is tangent to the curve $g(x)=\alpha x^{2}$.
|
$\mathbf{e}^{\mathbf{2} / 4}$. Suppose tangency occurs at $x=x_{0}$. Then $e^{x_{0}}=\alpha x_{0}^{2}$ and $f^{\prime}\left(x_{0}\right)=2 \alpha x_{0}$. On the other hand, $f^{\prime}(x)=f(x)$, so $\alpha x_{0}^{2}=2 \alpha x_{0}$. Clearly, $\alpha=0$ and $x_{0}=0$ are impossible, so it must be that $x_{0}=2$. Then $\alpha=e^{x_{0}} /\left(x_{0}^{2}\right)=e^{2} / 4$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n4. [4]",
"solution_match": "\nAnswer: "
}
|
bd9c709f-1b35-5a0f-a507-7eb08569c3bb
| 608,145
|
The function $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfies $f\left(x^{2}\right) f^{\prime \prime}(x)=f^{\prime}(x) f^{\prime}\left(x^{2}\right)$ for all real $x$. Given that $f(1)=1$ and $f^{\prime \prime \prime}(1)=8$, determine $f^{\prime}(1)+f^{\prime \prime}(1)$.
|
6. Let $f^{\prime}(1)=a$ and $f^{\prime \prime}(1)=b$. Then setting $x=1$ in the given equation, $b=a^{2}$. Differentiating the given yields
$$
2 x f^{\prime}\left(x^{2}\right) f^{\prime \prime}(x)+f\left(x^{2}\right) f^{\prime \prime \prime}(x)=f^{\prime \prime}(x) f^{\prime}\left(x^{2}\right)+2 x f^{\prime}(x) f^{\prime \prime}\left(x^{2}\right)
$$
Plugging $x=1$ into this equation gives $2 a b+8=a b+2 a b$, or $a b=8$. Then because $a$ and $b$ are real, we obtain the solution $(a, b)=(2,4)$.
Remarks. A priori, the function needn't exist, but one possibility is $f(x)=e^{2 x-2}$.
|
6
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
The function $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfies $f\left(x^{2}\right) f^{\prime \prime}(x)=f^{\prime}(x) f^{\prime}\left(x^{2}\right)$ for all real $x$. Given that $f(1)=1$ and $f^{\prime \prime \prime}(1)=8$, determine $f^{\prime}(1)+f^{\prime \prime}(1)$.
|
6. Let $f^{\prime}(1)=a$ and $f^{\prime \prime}(1)=b$. Then setting $x=1$ in the given equation, $b=a^{2}$. Differentiating the given yields
$$
2 x f^{\prime}\left(x^{2}\right) f^{\prime \prime}(x)+f\left(x^{2}\right) f^{\prime \prime \prime}(x)=f^{\prime \prime}(x) f^{\prime}\left(x^{2}\right)+2 x f^{\prime}(x) f^{\prime \prime}\left(x^{2}\right)
$$
Plugging $x=1$ into this equation gives $2 a b+8=a b+2 a b$, or $a b=8$. Then because $a$ and $b$ are real, we obtain the solution $(a, b)=(2,4)$.
Remarks. A priori, the function needn't exist, but one possibility is $f(x)=e^{2 x-2}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n5. [5]",
"solution_match": "\nAnswer: "
}
|
e8ce7407-d736-5c07-a36f-0bfa7145c4fe
| 608,146
|
The elliptic curve $y^{2}=x^{3}+1$ is tangent to a circle centered at $(4,0)$ at the point $\left(x_{0}, y_{0}\right)$. Determine the sum of all possible values of $x_{0}$.
|
$\frac{\mathbf{1}}{\mathbf{3}}$. Note that $y^{2} \geq 0$, so $x^{3} \geq-1$ and $x \geq-1$. Let the circle be defined by $(x-4)^{2}+y^{2}=c$ for some $c \geq 0$. Now differentiate the equations with respect to $x$, obtaining $2 y \frac{\mathrm{~d} y}{\mathrm{~d} x}=3 x^{2}$ from the given and $2 y \frac{\mathrm{~d} y}{\mathrm{~d} x}=-2 x+8$ from the circle. For tangency, the two expressions $\frac{\mathrm{d} y}{\mathrm{~d} x}$ must be equal if they are well-defined, and this is almost always the case. Thus, $-2 x_{0}+8=3 x_{0}^{2}$ so $x_{0}=-2$ or $x_{0}=4 / 3$, but only the latter corresponds to a point on $y^{2}=x^{3}+1$. Otherwise, $y_{0}=0$, and this gives the trivial solution $x_{0}=-1$.
|
\frac{1}{3}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
The elliptic curve $y^{2}=x^{3}+1$ is tangent to a circle centered at $(4,0)$ at the point $\left(x_{0}, y_{0}\right)$. Determine the sum of all possible values of $x_{0}$.
|
$\frac{\mathbf{1}}{\mathbf{3}}$. Note that $y^{2} \geq 0$, so $x^{3} \geq-1$ and $x \geq-1$. Let the circle be defined by $(x-4)^{2}+y^{2}=c$ for some $c \geq 0$. Now differentiate the equations with respect to $x$, obtaining $2 y \frac{\mathrm{~d} y}{\mathrm{~d} x}=3 x^{2}$ from the given and $2 y \frac{\mathrm{~d} y}{\mathrm{~d} x}=-2 x+8$ from the circle. For tangency, the two expressions $\frac{\mathrm{d} y}{\mathrm{~d} x}$ must be equal if they are well-defined, and this is almost always the case. Thus, $-2 x_{0}+8=3 x_{0}^{2}$ so $x_{0}=-2$ or $x_{0}=4 / 3$, but only the latter corresponds to a point on $y^{2}=x^{3}+1$. Otherwise, $y_{0}=0$, and this gives the trivial solution $x_{0}=-1$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n6. [5]",
"solution_match": "\nAnswer: "
}
|
b539e798-1d27-5222-90e9-01b9572a83c0
| 608,147
|
Compute
$$
\sum_{n=1}^{\infty} \frac{1}{n \cdot(n+1) \cdot(n+1)!}
$$
|
3-e. We write
$$
\begin{gathered}
\sum_{n=1}^{\infty} \frac{1}{n \cdot(n+1) \cdot(n+1)!}=\sum_{n=1}^{\infty}\left(\frac{1}{n}-\frac{1}{n+1}\right) \frac{1}{(n+1)!}=\sum_{n=1}^{\infty} \frac{1}{n \cdot(n+1)!}-\sum_{n=1}^{\infty} \frac{1}{(n+1) \cdot(n+1)!} \\
\frac{1}{2}+\sum_{n=2}^{\infty} \frac{1}{n \cdot(n+1)!}-\sum_{n=1}^{\infty} \frac{1}{(n+1) \cdot(n+1)!}=\frac{1}{2}+\sum_{n=1}^{\infty} \frac{1}{(n+1) \cdot(n+2)!}-\frac{1}{(n+1) \cdot(n+1)!} \\
\frac{1}{2}+\sum_{n=1}^{\infty} \frac{1-(n+2)}{(n+1) \cdot(n+2)!}=\frac{1}{2}-\left(\frac{1}{3!}+\frac{1}{4!}+\cdots\right)=3-\left(\frac{1}{0!}+\frac{1}{1!}+\frac{1}{2!}+\cdots\right)=3-e .
\end{gathered}
$$
Alternatively, but with considerably less motivation, we can induce telescoping by adding and subtracting $e-2=1 / 2!+1 / 3!+\cdots$, obtaining
$$
\begin{aligned}
2-e & +\sum_{n=1}^{\infty} \frac{n(n+1)+1}{n \cdot(n+1) \cdot(n+1)!}=2-e+\sum_{n=1}^{\infty} \frac{(n+1)^{2}-n}{n \cdot(n+1) \cdot(n+1)!} \\
2 & -e+\sum_{n=1}^{\infty} \frac{1}{n \cdot n!}-\frac{1}{(n+1) \cdot(n+1)!}=3-e
\end{aligned}
$$
|
3-e
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
Compute
$$
\sum_{n=1}^{\infty} \frac{1}{n \cdot(n+1) \cdot(n+1)!}
$$
|
3-e. We write
$$
\begin{gathered}
\sum_{n=1}^{\infty} \frac{1}{n \cdot(n+1) \cdot(n+1)!}=\sum_{n=1}^{\infty}\left(\frac{1}{n}-\frac{1}{n+1}\right) \frac{1}{(n+1)!}=\sum_{n=1}^{\infty} \frac{1}{n \cdot(n+1)!}-\sum_{n=1}^{\infty} \frac{1}{(n+1) \cdot(n+1)!} \\
\frac{1}{2}+\sum_{n=2}^{\infty} \frac{1}{n \cdot(n+1)!}-\sum_{n=1}^{\infty} \frac{1}{(n+1) \cdot(n+1)!}=\frac{1}{2}+\sum_{n=1}^{\infty} \frac{1}{(n+1) \cdot(n+2)!}-\frac{1}{(n+1) \cdot(n+1)!} \\
\frac{1}{2}+\sum_{n=1}^{\infty} \frac{1-(n+2)}{(n+1) \cdot(n+2)!}=\frac{1}{2}-\left(\frac{1}{3!}+\frac{1}{4!}+\cdots\right)=3-\left(\frac{1}{0!}+\frac{1}{1!}+\frac{1}{2!}+\cdots\right)=3-e .
\end{gathered}
$$
Alternatively, but with considerably less motivation, we can induce telescoping by adding and subtracting $e-2=1 / 2!+1 / 3!+\cdots$, obtaining
$$
\begin{aligned}
2-e & +\sum_{n=1}^{\infty} \frac{n(n+1)+1}{n \cdot(n+1) \cdot(n+1)!}=2-e+\sum_{n=1}^{\infty} \frac{(n+1)^{2}-n}{n \cdot(n+1) \cdot(n+1)!} \\
2 & -e+\sum_{n=1}^{\infty} \frac{1}{n \cdot n!}-\frac{1}{(n+1) \cdot(n+1)!}=3-e
\end{aligned}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n7. [5]",
"solution_match": "\nAnswer: "
}
|
f303e767-2b6a-5c9a-b346-94cbd8c8aeb8
| 608,148
|
Suppose that $\omega$ is a primitive $2007^{\text {th }}$ root of unity. Find $\left(2^{2007}-1\right) \sum_{j=1}^{2006} \frac{1}{2-\omega^{j}}$.
For this problem only, you may express your answer in the form $m \cdot n^{k}+p$, where $m, n, k$, and $p$ are positive integers. Note that a number $z$ is a primitive $n^{\text {th }}$ root of unity if $z^{n}=1$ and $n$ is the smallest number amongst $k=1,2, \ldots, n$ such that $z^{k}=1$.
|
$2005 \cdot \mathbf{2}^{2006}+1$. Note that
$$
\begin{aligned}
& \frac{1}{z-\omega}+\cdots+\frac{1}{z-\omega^{2006}}=\frac{\sum_{j=1}^{2006} \prod_{i \neq j}\left(z-\omega^{i}\right)}{(z-\omega) \cdots\left(z-\omega^{2006}\right)} \\
& \quad=\frac{\frac{\mathrm{d}}{\mathrm{~d} z}\left[z^{2006}+z^{2005}+\cdots+1\right]}{z^{2006}+z^{2005}+\cdots+1}=\frac{2006 z^{2005}+2005 z^{2004}+\cdots+1}{z^{2006}+z^{2005}+\cdots+1} \cdot \frac{z-1}{z-1} \\
& \quad=\frac{2006 z^{2006}-z^{2005}-z^{2004}-\cdots-1}{z^{2007}-1} \cdot \frac{z-1}{z-1}=\frac{2006 z^{2007}-2007 z^{2006}+1}{\left(z^{2007}-1\right)(z-1)} .
\end{aligned}
$$
Plugging in $z=2$ gives $\frac{2005 \cdot 2^{2006}+1}{2^{2007}-1}$; whence the answer.
|
2005 \cdot 2^{2006}+1
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Suppose that $\omega$ is a primitive $2007^{\text {th }}$ root of unity. Find $\left(2^{2007}-1\right) \sum_{j=1}^{2006} \frac{1}{2-\omega^{j}}$.
For this problem only, you may express your answer in the form $m \cdot n^{k}+p$, where $m, n, k$, and $p$ are positive integers. Note that a number $z$ is a primitive $n^{\text {th }}$ root of unity if $z^{n}=1$ and $n$ is the smallest number amongst $k=1,2, \ldots, n$ such that $z^{k}=1$.
|
$2005 \cdot \mathbf{2}^{2006}+1$. Note that
$$
\begin{aligned}
& \frac{1}{z-\omega}+\cdots+\frac{1}{z-\omega^{2006}}=\frac{\sum_{j=1}^{2006} \prod_{i \neq j}\left(z-\omega^{i}\right)}{(z-\omega) \cdots\left(z-\omega^{2006}\right)} \\
& \quad=\frac{\frac{\mathrm{d}}{\mathrm{~d} z}\left[z^{2006}+z^{2005}+\cdots+1\right]}{z^{2006}+z^{2005}+\cdots+1}=\frac{2006 z^{2005}+2005 z^{2004}+\cdots+1}{z^{2006}+z^{2005}+\cdots+1} \cdot \frac{z-1}{z-1} \\
& \quad=\frac{2006 z^{2006}-z^{2005}-z^{2004}-\cdots-1}{z^{2007}-1} \cdot \frac{z-1}{z-1}=\frac{2006 z^{2007}-2007 z^{2006}+1}{\left(z^{2007}-1\right)(z-1)} .
\end{aligned}
$$
Plugging in $z=2$ gives $\frac{2005 \cdot 2^{2006}+1}{2^{2007}-1}$; whence the answer.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n8. [6]",
"solution_match": "\nAnswer: "
}
|
0a988be2-63bf-5675-8b6c-87d50ddc39ad
| 608,149
|
g$ is a twice differentiable function over the positive reals such that
$$
\begin{aligned}
g(x)+2 x^{3} g^{\prime}(x)+x^{4} g^{\prime \prime}(x) & =0 \quad \text { for all positive reals } x . \\
\lim _{x \rightarrow \infty} x g(x) & =1
\end{aligned}
$$
Find the real number $\alpha>1$ such that $g(\alpha)=1 / 2$.
|
$\frac{6}{\pi}$. In the first equation, we can convert the expression $2 x^{3} g^{\prime}(x)+x^{4} g^{\prime \prime}(x)$ into the derivative of a product, and in fact a second derivative, by writing $y=1 / x$. Specifically,
$$
\begin{aligned}
0=g(x)+2 x^{3} g^{\prime}(x)+x^{4} g^{\prime \prime}(x) & =g\left(\frac{1}{y}\right)+2 y^{-3} g^{\prime}\left(\frac{1}{y}\right)+y^{-4} g^{\prime \prime}\left(\frac{1}{y}\right) \\
& =g\left(\frac{1}{y}\right)+\frac{\mathrm{d}}{\mathrm{~d} y}\left[-y^{-2} g^{\prime}\left(\frac{1}{y}\right)\right] \\
& =g\left(\frac{1}{y}\right)+\frac{\mathrm{d}^{2}}{\mathrm{~d} y^{2}}\left[g\left(\frac{1}{y}\right)\right]
\end{aligned}
$$
Thus $g\left(\frac{1}{y}\right)=c_{1} \cos (y)+c_{2} \sin (y)$ or $g(x)=c_{1} \cos (1 / x)+c_{2} \sin (1 / x)$. Now the second condition gives
$$
1=\lim _{x \rightarrow \infty} c_{1} x+c_{2} \cdot \frac{\sin (1 / x)}{1 / x}=c_{2}+\lim _{x \rightarrow \infty} c_{1} x
$$
It must be that $c_{1}=0, c_{2}=1$. Now since $0<1 / \alpha<1$, the value of $\alpha$ such that $g(\alpha)=\sin (1 / \alpha)=1 / 2$ is given by $1 / \alpha=\pi / 6$ and so $\alpha=6 / \pi$.
|
\frac{6}{\pi}
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
g$ is a twice differentiable function over the positive reals such that
$$
\begin{aligned}
g(x)+2 x^{3} g^{\prime}(x)+x^{4} g^{\prime \prime}(x) & =0 \quad \text { for all positive reals } x . \\
\lim _{x \rightarrow \infty} x g(x) & =1
\end{aligned}
$$
Find the real number $\alpha>1$ such that $g(\alpha)=1 / 2$.
|
$\frac{6}{\pi}$. In the first equation, we can convert the expression $2 x^{3} g^{\prime}(x)+x^{4} g^{\prime \prime}(x)$ into the derivative of a product, and in fact a second derivative, by writing $y=1 / x$. Specifically,
$$
\begin{aligned}
0=g(x)+2 x^{3} g^{\prime}(x)+x^{4} g^{\prime \prime}(x) & =g\left(\frac{1}{y}\right)+2 y^{-3} g^{\prime}\left(\frac{1}{y}\right)+y^{-4} g^{\prime \prime}\left(\frac{1}{y}\right) \\
& =g\left(\frac{1}{y}\right)+\frac{\mathrm{d}}{\mathrm{~d} y}\left[-y^{-2} g^{\prime}\left(\frac{1}{y}\right)\right] \\
& =g\left(\frac{1}{y}\right)+\frac{\mathrm{d}^{2}}{\mathrm{~d} y^{2}}\left[g\left(\frac{1}{y}\right)\right]
\end{aligned}
$$
Thus $g\left(\frac{1}{y}\right)=c_{1} \cos (y)+c_{2} \sin (y)$ or $g(x)=c_{1} \cos (1 / x)+c_{2} \sin (1 / x)$. Now the second condition gives
$$
1=\lim _{x \rightarrow \infty} c_{1} x+c_{2} \cdot \frac{\sin (1 / x)}{1 / x}=c_{2}+\lim _{x \rightarrow \infty} c_{1} x
$$
It must be that $c_{1}=0, c_{2}=1$. Now since $0<1 / \alpha<1$, the value of $\alpha$ such that $g(\alpha)=\sin (1 / \alpha)=1 / 2$ is given by $1 / \alpha=\pi / 6$ and so $\alpha=6 / \pi$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n9. $[7]",
"solution_match": "\nAnswer: "
}
|
e759af7f-9ea4-5fed-8575-8956888d4652
| 608,150
|
Compute
$$
\int_{0}^{\infty} \frac{e^{-x} \sin (x)}{x} d x
$$
|
$\frac{\pi}{4}$. We can compute the integral by introducing a parameter and exchanging the order of integration:
$$
\begin{aligned}
\int_{0}^{\infty} e^{-x}\left(\frac{\sin (x)}{x}\right) \mathrm{d} x & =\int_{0}^{\infty} e^{-x}\left(\int_{0}^{1} \cos (a x) \mathrm{d} a\right) \mathrm{d} x=\int_{0}^{1}\left(\int_{0}^{\infty} e^{-x} \cos (a x) \mathrm{d} x\right) \mathrm{d} a \\
& =\int_{0}^{1} \operatorname{Re}\left[\int_{0}^{\infty} e^{(-1+a i) x} \mathrm{~d} x\right] \mathrm{d} a=\int_{0}^{1} \operatorname{Re}\left[\left.\frac{e^{(-1+a i) x}}{-1+a i}\right|_{x=0} ^{\infty}\right] \mathrm{d} a \\
& =\int_{0}^{1} \operatorname{Re}\left[\frac{1}{1-a i}\right] \mathrm{d} a=\int_{0}^{1} \operatorname{Re}\left[\frac{1+a i}{1+a^{2}}\right] \mathrm{d} a \\
& =\int_{0}^{1} \frac{1}{1+a^{2}} \mathrm{~d} a=\left.\tan ^{-1}(a)\right|_{a=0} ^{1}=\frac{\pi}{4}
\end{aligned}
$$
|
\frac{\pi}{4}
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
Compute
$$
\int_{0}^{\infty} \frac{e^{-x} \sin (x)}{x} d x
$$
|
$\frac{\pi}{4}$. We can compute the integral by introducing a parameter and exchanging the order of integration:
$$
\begin{aligned}
\int_{0}^{\infty} e^{-x}\left(\frac{\sin (x)}{x}\right) \mathrm{d} x & =\int_{0}^{\infty} e^{-x}\left(\int_{0}^{1} \cos (a x) \mathrm{d} a\right) \mathrm{d} x=\int_{0}^{1}\left(\int_{0}^{\infty} e^{-x} \cos (a x) \mathrm{d} x\right) \mathrm{d} a \\
& =\int_{0}^{1} \operatorname{Re}\left[\int_{0}^{\infty} e^{(-1+a i) x} \mathrm{~d} x\right] \mathrm{d} a=\int_{0}^{1} \operatorname{Re}\left[\left.\frac{e^{(-1+a i) x}}{-1+a i}\right|_{x=0} ^{\infty}\right] \mathrm{d} a \\
& =\int_{0}^{1} \operatorname{Re}\left[\frac{1}{1-a i}\right] \mathrm{d} a=\int_{0}^{1} \operatorname{Re}\left[\frac{1+a i}{1+a^{2}}\right] \mathrm{d} a \\
& =\int_{0}^{1} \frac{1}{1+a^{2}} \mathrm{~d} a=\left.\tan ^{-1}(a)\right|_{a=0} ^{1}=\frac{\pi}{4}
\end{aligned}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-calc-solutions.jsonl",
"problem_match": "\n10. [8]",
"solution_match": "\nAnswer: "
}
|
897d5681-0d32-5d25-8a3e-c0bef45743aa
| 608,151
|
A committee of 5 is to be chosen from a group of 9 people. How many ways can it be chosen, if Biff and Jacob must serve together or not at all, and Alice and Jane refuse to serve with each other?
|
41. If Biff and Jacob are on the committee, there are $\binom{7}{3}=35$ ways for the other members to be chosen. Amongst these 35 possibilities, we reject the $\binom{5}{1}=5$ choices where both Alice and Jane are also serving. If Biff and Jacob are not serving, then there are $\binom{7}{5}=21$ ways to choose the remaining 5 members. Again, we reject the $\binom{5}{3}=10$ instances where Alice and Jane are chosen, so the total is $(35-5)+(21-10)=41$.
|
41
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
A committee of 5 is to be chosen from a group of 9 people. How many ways can it be chosen, if Biff and Jacob must serve together or not at all, and Alice and Jane refuse to serve with each other?
|
41. If Biff and Jacob are on the committee, there are $\binom{7}{3}=35$ ways for the other members to be chosen. Amongst these 35 possibilities, we reject the $\binom{5}{1}=5$ choices where both Alice and Jane are also serving. If Biff and Jacob are not serving, then there are $\binom{7}{5}=21$ ways to choose the remaining 5 members. Again, we reject the $\binom{5}{3}=10$ instances where Alice and Jane are chosen, so the total is $(35-5)+(21-10)=41$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n1. [3]",
"solution_match": "\nAnswer: "
}
|
b73571bd-4935-5a98-b848-57b231db6208
| 608,152
|
How many 5-digit numbers $\overline{a b c d e}$ exist such that digits $b$ and $d$ are each the sum of the digits to their immediate left and right? (That is, $b=a+c$ and $d=c+e$.)
|
330. Note that $a>0$, so that $b>c$, and $e \geq 0$ so that $d \geq c$. Conversely, for each choice of $(b, c, d)$ with $b>c$ and $d \geq c$, there exists a unique pair $(a, e)$ such that $\overline{a b c d e}$ is a number having the desired property. Thus, we compute
$$
\sum_{c=0}^{9}(9-c)(10-c)=\sum_{c=0}^{9} c^{2}-19 c+90=330
$$
|
330
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
How many 5-digit numbers $\overline{a b c d e}$ exist such that digits $b$ and $d$ are each the sum of the digits to their immediate left and right? (That is, $b=a+c$ and $d=c+e$.)
|
330. Note that $a>0$, so that $b>c$, and $e \geq 0$ so that $d \geq c$. Conversely, for each choice of $(b, c, d)$ with $b>c$ and $d \geq c$, there exists a unique pair $(a, e)$ such that $\overline{a b c d e}$ is a number having the desired property. Thus, we compute
$$
\sum_{c=0}^{9}(9-c)(10-c)=\sum_{c=0}^{9} c^{2}-19 c+90=330
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n2. [3]",
"solution_match": "\nAnswer: "
}
|
ce8e9007-4dcf-5796-9a1e-5284d13495d1
| 608,153
|
Jack, Jill, and John play a game in which each randomly picks and then replaces a card from a standard 52 card deck, until a spades card is drawn. What is the probability that Jill draws the spade? (Jack, Jill, and John draw in that order, and the game repeats if no spade is drawn.)
|
$\frac{\mathbf{1 2}}{\mathbf{3 7}}$. The desired probability is the relative probability that Jill draws the spade. In the first round, Jack, Jill, and John draw a spade with probability $1 / 4,3 / 4 \cdot 1 / 4$, and $(3 / 4)^{2} \cdot 1 / 4$ respectively. Thus, the probability that Jill draws the spade is
$$
\frac{3 / 4 \cdot 1 / 4}{1 / 4+3 / 4 \cdot 1 / 4+(3 / 4)^{2} \cdot 1 / 4}=\frac{12}{37}
$$
|
\frac{12}{37}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Jack, Jill, and John play a game in which each randomly picks and then replaces a card from a standard 52 card deck, until a spades card is drawn. What is the probability that Jill draws the spade? (Jack, Jill, and John draw in that order, and the game repeats if no spade is drawn.)
|
$\frac{\mathbf{1 2}}{\mathbf{3 7}}$. The desired probability is the relative probability that Jill draws the spade. In the first round, Jack, Jill, and John draw a spade with probability $1 / 4,3 / 4 \cdot 1 / 4$, and $(3 / 4)^{2} \cdot 1 / 4$ respectively. Thus, the probability that Jill draws the spade is
$$
\frac{3 / 4 \cdot 1 / 4}{1 / 4+3 / 4 \cdot 1 / 4+(3 / 4)^{2} \cdot 1 / 4}=\frac{12}{37}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n3. [4]",
"solution_match": "\nAnswer: "
}
|
cd8ed039-f7c1-52aa-95b1-6b2a7a860daf
| 608,154
|
On the Cartesian grid, Johnny wants to travel from $(0,0)$ to $(5,1)$, and he wants to pass through all twelve points in the set $S=\{(i, j) \mid 0 \leq i \leq 1,0 \leq j \leq 5, i, j \in \mathbb{Z}\}$. Each step, Johnny may go from one point in $S$ to another point in $S$ by a line segment connecting the two points. How many ways are there for Johnny to start at $(0,0)$ and end at $(5,1)$ so that he never crosses his own path?
|
252. Observe that Johnny needs to pass through the points $(0,0),(1,0),(2,0), \ldots,(5,0)$ in that order, and he needs to pass through $(0,1),(1,1),(2,1), \ldots,(5,1)$ in that order, or else he will intersect his own path. Then, the problem is equivalent to interlacing those two sequence together, so that the first term is $(0,0)$ and the final term is $(5,1)$. To do this, we need to select 5 positions out of 10 to have points with $x$-coordinate 0 . Hence the answer is $\binom{10}{5}=252$.
|
252
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
On the Cartesian grid, Johnny wants to travel from $(0,0)$ to $(5,1)$, and he wants to pass through all twelve points in the set $S=\{(i, j) \mid 0 \leq i \leq 1,0 \leq j \leq 5, i, j \in \mathbb{Z}\}$. Each step, Johnny may go from one point in $S$ to another point in $S$ by a line segment connecting the two points. How many ways are there for Johnny to start at $(0,0)$ and end at $(5,1)$ so that he never crosses his own path?
|
252. Observe that Johnny needs to pass through the points $(0,0),(1,0),(2,0), \ldots,(5,0)$ in that order, and he needs to pass through $(0,1),(1,1),(2,1), \ldots,(5,1)$ in that order, or else he will intersect his own path. Then, the problem is equivalent to interlacing those two sequence together, so that the first term is $(0,0)$ and the final term is $(5,1)$. To do this, we need to select 5 positions out of 10 to have points with $x$-coordinate 0 . Hence the answer is $\binom{10}{5}=252$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n4. [4]",
"solution_match": "\nAnswer: "
}
|
b7e14d6b-cba7-5365-a67f-fc554aa6f0a6
| 608,155
|
Determine the number of ways to select a positive number of squares on an $8 \times 8$ chessboard such that no two lie in the same row or the same column and no chosen square lies to the left of and below another chosen square.
|
$12869=\binom{16}{8}$ - 1. If $k$ is the number of squares chosen, then there are $\binom{8}{k}$ ways to choose $k$ columns, and $\binom{8}{k}$ ways to choose $k$ rows, and this would uniquely determine the set of squares selected. Thus the answer is
$$
\sum_{k=1}^{8}\binom{8}{k}\binom{8}{k}=-1+\sum_{k=0}^{8}\binom{8}{k}\binom{8}{k}=-1+\binom{16}{8}=12869
$$
|
12869
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Determine the number of ways to select a positive number of squares on an $8 \times 8$ chessboard such that no two lie in the same row or the same column and no chosen square lies to the left of and below another chosen square.
|
$12869=\binom{16}{8}$ - 1. If $k$ is the number of squares chosen, then there are $\binom{8}{k}$ ways to choose $k$ columns, and $\binom{8}{k}$ ways to choose $k$ rows, and this would uniquely determine the set of squares selected. Thus the answer is
$$
\sum_{k=1}^{8}\binom{8}{k}\binom{8}{k}=-1+\sum_{k=0}^{8}\binom{8}{k}\binom{8}{k}=-1+\binom{16}{8}=12869
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n5. [5]",
"solution_match": "\nAnswer: "
}
|
25c970a6-e73d-598d-8db3-f799bb9fbe84
| 608,156
|
Kevin has four red marbles and eight blue marbles. He arranges these twelve marbles randomly, in a ring. Determine the probability that no two red marbles are adjacent.
|
$\frac{7}{\mathbf{7 3}}$. Select any blue marble and consider the remaining eleven marbles, arranged in a line. The proportion of arrangement for which no two red marbles are adjacent will be the same as for the original twelve marbles, arranged in a ring. The total number of ways of arranging 4 red marbles out of 11 is $\binom{11}{4}=330$. To count the number of arrangements such that no two red marbles are adjacent, there must be one red marble between each two would-be adjacent red marbles. Having fixed the positions of three blue marbles we have four blue marbles to play with. So that we can arrange the remaining four marbles is $\binom{8}{4}=70$ ways. This yields a probability of $70 / 330=7 / 33$ as our final answer.
|
\frac{7}{33}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Kevin has four red marbles and eight blue marbles. He arranges these twelve marbles randomly, in a ring. Determine the probability that no two red marbles are adjacent.
|
$\frac{7}{\mathbf{7 3}}$. Select any blue marble and consider the remaining eleven marbles, arranged in a line. The proportion of arrangement for which no two red marbles are adjacent will be the same as for the original twelve marbles, arranged in a ring. The total number of ways of arranging 4 red marbles out of 11 is $\binom{11}{4}=330$. To count the number of arrangements such that no two red marbles are adjacent, there must be one red marble between each two would-be adjacent red marbles. Having fixed the positions of three blue marbles we have four blue marbles to play with. So that we can arrange the remaining four marbles is $\binom{8}{4}=70$ ways. This yields a probability of $70 / 330=7 / 33$ as our final answer.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n6. [5]",
"solution_match": "\nAnswer: "
}
|
b6bb58bd-86d6-53a4-b25c-e2d2b551ae3a
| 608,157
|
Forty two cards are labeled with the natural numbers 1 through 42 and randomly shuffled into a stack. One by one, cards are taken off of the top of the stack until a card labeled with a prime number is removed. How many cards are removed on average?
|
$\frac{\mathbf{4 3}}{\mathbf{1 4}}$. Note that there are 13 prime numbers amongst the cards. We may view these as separating the remaining 29 cards into 14 groups of nonprimes - those appearing before the first prime, between the first and second, etc. Each of these groups is equally likely to appear first, so 29/14 nonprimes are removed on average. We are done since exactly one prime is always drawn.
|
\frac{43}{14}
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Forty two cards are labeled with the natural numbers 1 through 42 and randomly shuffled into a stack. One by one, cards are taken off of the top of the stack until a card labeled with a prime number is removed. How many cards are removed on average?
|
$\frac{\mathbf{4 3}}{\mathbf{1 4}}$. Note that there are 13 prime numbers amongst the cards. We may view these as separating the remaining 29 cards into 14 groups of nonprimes - those appearing before the first prime, between the first and second, etc. Each of these groups is equally likely to appear first, so 29/14 nonprimes are removed on average. We are done since exactly one prime is always drawn.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n7. [5]",
"solution_match": "\nAnswer: "
}
|
04f00bb0-c6b8-5d71-9361-13e15b39101f
| 608,158
|
A set of six edges of a regular octahedron is called Hamiltonian cycle if the edges in some order constitute a single continuous loop that visits each vertex exactly once. How many ways are there to partition the twelve edges into two Hamiltonian cycles?
|
6. Call the octahedron $A B C D E F$, where $A, B$, and $C$ are opposite $D, E$, and $F$, respectively. Note that each Hamiltonian cycle can be described in terms of the order it visits vertices in exactly 12 different ways. Conversely, listing the six vertices in some order determines a Hamiltonian cycle precisely when no pair of opposite vertices are listed consecutively or first-and-last. Suppose we begin with $A B$. If $D$ is listed third, then the final three letters are $C E F$ or $F E C$. Otherwise, $C$ or $F$ is listed next, and each gives three possibilities for the final three. For example $A B C$ is be followed by $D E F, D F E$, or $E D F$. Thus, there are $6 \cdot 4 \cdot(2+3+3)=192$ listings. These correspond to $192 / 12=16$ Hamiltonian cycles. Finally, the complement of all but four Hamiltonian cycles is a Hamiltonian cycle. For, each vertex has degree four, so is an endpoint of two edges in the complement of a Hamiltonian cycle, so is also a Hamiltonian cycle unless it describes two opposite faces. It follows that there are six pairs of disjoint Hamiltonian cycles.
|
6
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
A set of six edges of a regular octahedron is called Hamiltonian cycle if the edges in some order constitute a single continuous loop that visits each vertex exactly once. How many ways are there to partition the twelve edges into two Hamiltonian cycles?
|
6. Call the octahedron $A B C D E F$, where $A, B$, and $C$ are opposite $D, E$, and $F$, respectively. Note that each Hamiltonian cycle can be described in terms of the order it visits vertices in exactly 12 different ways. Conversely, listing the six vertices in some order determines a Hamiltonian cycle precisely when no pair of opposite vertices are listed consecutively or first-and-last. Suppose we begin with $A B$. If $D$ is listed third, then the final three letters are $C E F$ or $F E C$. Otherwise, $C$ or $F$ is listed next, and each gives three possibilities for the final three. For example $A B C$ is be followed by $D E F, D F E$, or $E D F$. Thus, there are $6 \cdot 4 \cdot(2+3+3)=192$ listings. These correspond to $192 / 12=16$ Hamiltonian cycles. Finally, the complement of all but four Hamiltonian cycles is a Hamiltonian cycle. For, each vertex has degree four, so is an endpoint of two edges in the complement of a Hamiltonian cycle, so is also a Hamiltonian cycle unless it describes two opposite faces. It follows that there are six pairs of disjoint Hamiltonian cycles.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n8. [6]",
"solution_match": "\nAnswer: "
}
|
7ab4211c-65e7-5ffc-b440-59f96ab9d11a
| 608,159
|
Let $S$ denote the set of all triples $(i, j, k)$ of positive integers where $i+j+k=17$. Compute
$$
\sum_{(i, j, k) \in S} i j k .
$$
|
$11628=\binom{\mathbf{1 9}}{\mathbf{5}}$. We view choosing five objects from a row of 19 objects in an unual way. First, remove two of the chosen objects, the second and fourth, which are not adjacent nor at either end, forming three nonempty groups of consecutive objects. We then have $i, j$, and $k$ choices for the first, third, and fifth objects. Because this is a reversible process taking a triple $(i, j, k)$ to $i j k$ choices, the answer is $\binom{19}{5}=11628$.
A simple generating functions argument is also possible. Let $s_{n}=\sum_{i+j+k=n} i j k$. Then
$$
\sum_{n \geq 0} s_{n} x^{n}=\left(\sum_{n \geq 0} n x^{n}\right)^{3}=\left(\frac{x}{(1-x)^{2}}\right)^{3}=\frac{x^{3}}{(1-x)^{6}}
$$
and so $s_{n}=\left(\binom{6}{n-3}\right)=\binom{n+2}{5}$, yielding $s_{17}=\binom{19}{5}$.
|
11628
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Let $S$ denote the set of all triples $(i, j, k)$ of positive integers where $i+j+k=17$. Compute
$$
\sum_{(i, j, k) \in S} i j k .
$$
|
$11628=\binom{\mathbf{1 9}}{\mathbf{5}}$. We view choosing five objects from a row of 19 objects in an unual way. First, remove two of the chosen objects, the second and fourth, which are not adjacent nor at either end, forming three nonempty groups of consecutive objects. We then have $i, j$, and $k$ choices for the first, third, and fifth objects. Because this is a reversible process taking a triple $(i, j, k)$ to $i j k$ choices, the answer is $\binom{19}{5}=11628$.
A simple generating functions argument is also possible. Let $s_{n}=\sum_{i+j+k=n} i j k$. Then
$$
\sum_{n \geq 0} s_{n} x^{n}=\left(\sum_{n \geq 0} n x^{n}\right)^{3}=\left(\frac{x}{(1-x)^{2}}\right)^{3}=\frac{x^{3}}{(1-x)^{6}}
$$
and so $s_{n}=\left(\binom{6}{n-3}\right)=\binom{n+2}{5}$, yielding $s_{17}=\binom{19}{5}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n9. [7]",
"solution_match": "\nAnswer: "
}
|
46d51471-7ace-5214-8660-d3005dd8fbeb
| 608,160
|
A subset $S$ of the nonnegative integers is called supported if it contains 0 , and $k+8, k+9 \in S$ for all $k \in S$. How many supported sets are there?
|
1430. Note that every supported set $S$ contains $0,8,9,16,17,18,24-27,32-36,40-45$, $48-54$, and all $n \geq 55$. Now define $\bar{S}:=\mathbb{Z}^{+} \backslash S$, which is a subset of $\{1-7,10-15,19-23,28-$ $31,37,38,39,46,47,55\}$ satisfying the opposite property that $k \in \bar{S} \Longrightarrow k-8, k-9 \in \bar{S}$.
Consider the above arrangement after removing the numbers not in $\bar{S}$. The condition that $S$ be supported ensures that sets $\bar{S}$ are in bijective correspondence with paths from $(0,0)$ to $(16,0)$ consisting of discrete steps of $\langle 1,1\rangle$ and $\langle 1,-1\rangle$ and lying above the $x$-axis: from the modified version of the above diagram, a unique path passes through the top items left in each column. The number of such paths is the 8th Catalan number, so the answer is $C_{8}=\frac{1}{8+1}\binom{8 \cdot 2}{8}=\frac{12870}{9}=1430$. (Incidentally, 16 choose 8 was computed in an earlier problem.) Without the explicit formula for Catalan numbers, the answer can be computed recursively by filling in the number of ways a path can reach $(16,0)$ from each position in the figure. One works right to left, obtaining the following:
| | | | | | | | | 1 | | | | | | | |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| | | | | | | | 8 | | 1 | | | | | | |
| | | | | | | 35 | | 7 | | 1 | | | | | |
| | | | | | 110 | | 27 | | 6 | | 1 | | | | |
| | | | | 275 | | 75 | | 20 | | 5 | | 1 | | | |
| | | | 572 | | 165 | | 48 | | 14 | | 4 | | 1 | | |
| | | 1001 | | 297 | | 90 | | 28 | | 9 | | 3 | | 1 | |
| | 1430 | | 429 | | 132 | | 42 | | 14 | | 5 | | 2 | | 1 |
| 1430 | | 429 | | 132 | | 42 | | 14 | | 5 | | 2 | | 1 | |
One can exploit symmetry and, having determined the middle column, sum the squares: $1^{2}+7^{2}+$ $20^{2}+28^{2}+14^{2}=1430$.
|
1430
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
A subset $S$ of the nonnegative integers is called supported if it contains 0 , and $k+8, k+9 \in S$ for all $k \in S$. How many supported sets are there?
|
1430. Note that every supported set $S$ contains $0,8,9,16,17,18,24-27,32-36,40-45$, $48-54$, and all $n \geq 55$. Now define $\bar{S}:=\mathbb{Z}^{+} \backslash S$, which is a subset of $\{1-7,10-15,19-23,28-$ $31,37,38,39,46,47,55\}$ satisfying the opposite property that $k \in \bar{S} \Longrightarrow k-8, k-9 \in \bar{S}$.
Consider the above arrangement after removing the numbers not in $\bar{S}$. The condition that $S$ be supported ensures that sets $\bar{S}$ are in bijective correspondence with paths from $(0,0)$ to $(16,0)$ consisting of discrete steps of $\langle 1,1\rangle$ and $\langle 1,-1\rangle$ and lying above the $x$-axis: from the modified version of the above diagram, a unique path passes through the top items left in each column. The number of such paths is the 8th Catalan number, so the answer is $C_{8}=\frac{1}{8+1}\binom{8 \cdot 2}{8}=\frac{12870}{9}=1430$. (Incidentally, 16 choose 8 was computed in an earlier problem.) Without the explicit formula for Catalan numbers, the answer can be computed recursively by filling in the number of ways a path can reach $(16,0)$ from each position in the figure. One works right to left, obtaining the following:
| | | | | | | | | 1 | | | | | | | |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| | | | | | | | 8 | | 1 | | | | | | |
| | | | | | | 35 | | 7 | | 1 | | | | | |
| | | | | | 110 | | 27 | | 6 | | 1 | | | | |
| | | | | 275 | | 75 | | 20 | | 5 | | 1 | | | |
| | | | 572 | | 165 | | 48 | | 14 | | 4 | | 1 | | |
| | | 1001 | | 297 | | 90 | | 28 | | 9 | | 3 | | 1 | |
| | 1430 | | 429 | | 132 | | 42 | | 14 | | 5 | | 2 | | 1 |
| 1430 | | 429 | | 132 | | 42 | | 14 | | 5 | | 2 | | 1 | |
One can exploit symmetry and, having determined the middle column, sum the squares: $1^{2}+7^{2}+$ $20^{2}+28^{2}+14^{2}=1430$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-comb-solutions.jsonl",
"problem_match": "\n10. [8]",
"solution_match": "\nAnswer: "
}
|
a99e085e-9057-5bd9-86c8-694630ced681
| 608,161
|
Michael has 16 white socks, 3 blue socks, and 6 red socks in a drawer. Ever the lazy college student, he has overslept and is late for his favorite team's season-opener. Because he is now in such a rush to get from Harvard to Foxborough, he randomly takes socks from the drawer (one at a time) until he has a pair of the same color. What is the largest number of socks he could possibly withdraw in this fashion?
|
4. It is possible for him to begin with three socks of different colors, but an instance of the Pigeon Hole Principle is that among any four objects of three types some two are the same type.
|
4
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Michael has 16 white socks, 3 blue socks, and 6 red socks in a drawer. Ever the lazy college student, he has overslept and is late for his favorite team's season-opener. Because he is now in such a rush to get from Harvard to Foxborough, he randomly takes socks from the drawer (one at a time) until he has a pair of the same color. What is the largest number of socks he could possibly withdraw in this fashion?
|
4. It is possible for him to begin with three socks of different colors, but an instance of the Pigeon Hole Principle is that among any four objects of three types some two are the same type.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen1-solutions.jsonl",
"problem_match": "\n1. [2]",
"solution_match": "\nAnswer: "
}
|
85f55215-a8ff-58a7-92e4-855841ed2448
| 608,162
|
Rectangle $A B C D$ has side lengths $A B=12$ and $B C=5$. Let $P$ and $Q$ denote the midpoints of segments $A B$ and $D P$, respectively. Determine the area of triangle $C D Q$.
|
15. Note that $[C D P]=\frac{1}{2} \cdot 5 \cdot 12=30$, while the area of triangle $C D Q$ is half of the area of triangle $C D P$.
|
15
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Rectangle $A B C D$ has side lengths $A B=12$ and $B C=5$. Let $P$ and $Q$ denote the midpoints of segments $A B$ and $D P$, respectively. Determine the area of triangle $C D Q$.
|
15. Note that $[C D P]=\frac{1}{2} \cdot 5 \cdot 12=30$, while the area of triangle $C D Q$ is half of the area of triangle $C D P$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen1-solutions.jsonl",
"problem_match": "\n2. [2]",
"solution_match": "\nAnswer: "
}
|
d26326f0-6314-5e17-b9d2-3ca39e7407c6
| 608,163
|
Let $a$ and $b$ be integer solutions to $17 a+6 b=13$. What is the smallest possible positive value for $a-b$ ?
|
17. First group as $17(a-b)+23 b=13$. Taking this equation modulo 23, we get $-6(a-b) \equiv$ $-10(\bmod 23)$. Since -4 is an inverse of -6 modulo 23 , then we multiply to get $(a-b) \equiv 17(\bmod 23)$. Therefore, the smallest possible positive value for $(a-b)$ is 17 . This can be satisfied by $a=5, b=-12$.
|
17
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Let $a$ and $b$ be integer solutions to $17 a+6 b=13$. What is the smallest possible positive value for $a-b$ ?
|
17. First group as $17(a-b)+23 b=13$. Taking this equation modulo 23, we get $-6(a-b) \equiv$ $-10(\bmod 23)$. Since -4 is an inverse of -6 modulo 23 , then we multiply to get $(a-b) \equiv 17(\bmod 23)$. Therefore, the smallest possible positive value for $(a-b)$ is 17 . This can be satisfied by $a=5, b=-12$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen1-solutions.jsonl",
"problem_match": "\n4. [3]",
"solution_match": "\nAnswer: "
}
|
75d1d498-3729-51c1-bbe4-6ac6e0b00dd6
| 608,165
|
Find the smallest positive integer that is twice a perfect square and three times a perfect cube.
|
648. Let $n$ be such a number. If $n$ is divisible by 2 and 3 exactly $e_{2}$ and $e_{3}$ times, then $e_{2}$ is odd and a multiple of three, and $e_{3}$ is even and one more than a multiple of three. The smallest possible exponents are $n_{2}=3$ and $n_{3}=4$. The answer is then $2^{3} \cdot 3^{4}=648$.
|
648
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find the smallest positive integer that is twice a perfect square and three times a perfect cube.
|
648. Let $n$ be such a number. If $n$ is divisible by 2 and 3 exactly $e_{2}$ and $e_{3}$ times, then $e_{2}$ is odd and a multiple of three, and $e_{3}$ is even and one more than a multiple of three. The smallest possible exponents are $n_{2}=3$ and $n_{3}=4$. The answer is then $2^{3} \cdot 3^{4}=648$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen1-solutions.jsonl",
"problem_match": "\n5. [4]",
"solution_match": "\nAnswer: "
}
|
61a6f484-5f49-5842-af25-500075b580bd
| 608,166
|
The positive integer $n$ is such that the numbers $2^{n}$ and $5^{n}$ start with the same digit when written in decimal notation; determine this common leading digit.
|
3. Note $1=1^{2}<2^{2}<3^{2}<10<4^{2}<\cdots<9^{2}<10^{2}=100$. Divide $2^{n}$ and $5^{n}$ by 10 repeatedly until each is reduced to a decimal number less than 10 but at least 1 ; call the resulting numbers $x$ and $y$. Since $\left(5^{n}\right)\left(2^{n}\right)=10^{n}$, either $x y=1$ or $x y=10$. Because $2^{n}$ and $5^{n}$ begin with the same digit, $x$ and $y$ are bounded by the same pair of adjacent integers. It follows that either $x=y=1$ or $3 \leq x, y<4$. Because $n$ is positive, neither $2^{n}$ nor $5^{n}$ is a perfect power of 10 , so the former is impossible.
|
3
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
The positive integer $n$ is such that the numbers $2^{n}$ and $5^{n}$ start with the same digit when written in decimal notation; determine this common leading digit.
|
3. Note $1=1^{2}<2^{2}<3^{2}<10<4^{2}<\cdots<9^{2}<10^{2}=100$. Divide $2^{n}$ and $5^{n}$ by 10 repeatedly until each is reduced to a decimal number less than 10 but at least 1 ; call the resulting numbers $x$ and $y$. Since $\left(5^{n}\right)\left(2^{n}\right)=10^{n}$, either $x y=1$ or $x y=10$. Because $2^{n}$ and $5^{n}$ begin with the same digit, $x$ and $y$ are bounded by the same pair of adjacent integers. It follows that either $x=y=1$ or $3 \leq x, y<4$. Because $n$ is positive, neither $2^{n}$ nor $5^{n}$ is a perfect power of 10 , so the former is impossible.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen1-solutions.jsonl",
"problem_match": "\n6. [4]",
"solution_match": "\nAnswer: "
}
|
d4027b54-e7fe-58b4-b410-1cab2b916b72
| 608,167
|
Determine the largest positive integer $n$ such that there exist positive integers $x, y, z$ so that
$$
n^{2}=x^{2}+y^{2}+z^{2}+2 x y+2 y z+2 z x+3 x+3 y+3 z-6
$$
|
8. The given equation rewrites as $n^{2}=(x+y+z+1)^{2}+(x+y+z+1)-8$. Writing $r=x+y+z+1$, we have $n^{2}=r^{2}+r-8$. Clearly, one possibility is $n=r=8$, which is realized by $x=y=1, z=6$. On the other hand, for $r>8$, we have $r^{2}<r^{2}+r-8<(r+1)^{2}$.
|
8
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Determine the largest positive integer $n$ such that there exist positive integers $x, y, z$ so that
$$
n^{2}=x^{2}+y^{2}+z^{2}+2 x y+2 y z+2 z x+3 x+3 y+3 z-6
$$
|
8. The given equation rewrites as $n^{2}=(x+y+z+1)^{2}+(x+y+z+1)-8$. Writing $r=x+y+z+1$, we have $n^{2}=r^{2}+r-8$. Clearly, one possibility is $n=r=8$, which is realized by $x=y=1, z=6$. On the other hand, for $r>8$, we have $r^{2}<r^{2}+r-8<(r+1)^{2}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen1-solutions.jsonl",
"problem_match": "\n8. [5]",
"solution_match": "\nAnswer: "
}
|
49632b03-9809-54c4-8e12-95cd6b625f22
| 608,168
|
I have four distinct rings that I want to wear on my right hand hand (five distinct fingers.) One of these rings is a Canadian ring that must be worn on a finger by itself, the rest I can arrange however I want. If I have two or more rings on the same finger, then I consider different orders of rings along the same finger to be different arrangements. How many different ways can I wear the rings on my fingers?
|
600. First we pick the finger for the Canadian ring. This gives a multiplicative factor of 5 . For distributing the remaining 3 rings among 4 fingers, they can either be all on the same finger ( $4 \cdot 3$ ! ways), all on different fingers $\left(\binom{4}{3} \cdot 3\right.$ ! ways), or two on one finger and one on another $\left(4 \cdot\binom{3}{2} \cdot 2!\cdot 3\right.$ ways.) Therefore, I have $5 \cdot(24+24+72)=600$ choices.
|
600
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
I have four distinct rings that I want to wear on my right hand hand (five distinct fingers.) One of these rings is a Canadian ring that must be worn on a finger by itself, the rest I can arrange however I want. If I have two or more rings on the same finger, then I consider different orders of rings along the same finger to be different arrangements. How many different ways can I wear the rings on my fingers?
|
600. First we pick the finger for the Canadian ring. This gives a multiplicative factor of 5 . For distributing the remaining 3 rings among 4 fingers, they can either be all on the same finger ( $4 \cdot 3$ ! ways), all on different fingers $\left(\binom{4}{3} \cdot 3\right.$ ! ways), or two on one finger and one on another $\left(4 \cdot\binom{3}{2} \cdot 2!\cdot 3\right.$ ways.) Therefore, I have $5 \cdot(24+24+72)=600$ choices.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen1-solutions.jsonl",
"problem_match": "\n9. [6]",
"solution_match": "\nAnswer: "
}
|
df53fe74-0702-54c5-92e7-570ce1dab372
| 608,169
|
A parallelogram has 3 of its vertices at $(1,2),(3,8)$, and $(4,1)$. Compute the sum of all possible $x$ coordinates of the 4th vertex.
|
8. There are three possibilities: the 4th vertex must be opposite one of the three given vertices. These three possibilities have as a medial triangle the three given vertices, so the sum of their $x$ coordinates is the same as the sum of the $x$ coordinates of the given triangle.
|
8
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
A parallelogram has 3 of its vertices at $(1,2),(3,8)$, and $(4,1)$. Compute the sum of all possible $x$ coordinates of the 4th vertex.
|
8. There are three possibilities: the 4th vertex must be opposite one of the three given vertices. These three possibilities have as a medial triangle the three given vertices, so the sum of their $x$ coordinates is the same as the sum of the $x$ coordinates of the given triangle.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl",
"problem_match": "\n2. [2]",
"solution_match": "\nAnswer: "
}
|
51d7f5de-7e41-5e75-b80e-6666bd51175f
| 608,171
|
Three brothers Abel, Banach, and Gauss each have portable music players that can share music with each other. Initially, Abel has 9 songs, Banach has 6 songs, and Gauss has 3 songs, and none of these songs are the same. One day, Abel flips a coin to randomly choose one of his brothers and he adds all of that brother's songs to his collection. The next day, Banach flips a coin to randomly choose one of his brothers and he adds all of that brother's collection of songs to his collection. Finally, each brother randomly plays a song from his collection with each song in his collection being equally likely to be chosen. What is the probability that they all play the same song?
|
$\frac{\mathbf{1}}{\mathbf{2 8 8}}$. If Abel copies Banach's songs, this can never happen. Therefore, we consider only the cases where Abel copies Gauss's songs. Since all brothers have Gauss's set of songs, the probability that they play the same song is equivalent to the probability that they independently match whichever song Gauss chooses. Case 1: Abel copies Gauss and Banach copies Gauss (1/4 chance) - The probability of songs matching is then $1 / 12 \cdot 1 / 9$. Case 2: Abel copies Gauss and Banach copies Abel ( $1 / 4$ probability) - The probability of songs matching is then $1 / 12 \cdot 1 / 18$. We add the two probabilities together to get $1 / 4 \cdot 1 / 12 \cdot(1 / 9+1 / 18)=1 / 288$.
|
\frac{1}{288}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Three brothers Abel, Banach, and Gauss each have portable music players that can share music with each other. Initially, Abel has 9 songs, Banach has 6 songs, and Gauss has 3 songs, and none of these songs are the same. One day, Abel flips a coin to randomly choose one of his brothers and he adds all of that brother's songs to his collection. The next day, Banach flips a coin to randomly choose one of his brothers and he adds all of that brother's collection of songs to his collection. Finally, each brother randomly plays a song from his collection with each song in his collection being equally likely to be chosen. What is the probability that they all play the same song?
|
$\frac{\mathbf{1}}{\mathbf{2 8 8}}$. If Abel copies Banach's songs, this can never happen. Therefore, we consider only the cases where Abel copies Gauss's songs. Since all brothers have Gauss's set of songs, the probability that they play the same song is equivalent to the probability that they independently match whichever song Gauss chooses. Case 1: Abel copies Gauss and Banach copies Gauss (1/4 chance) - The probability of songs matching is then $1 / 12 \cdot 1 / 9$. Case 2: Abel copies Gauss and Banach copies Abel ( $1 / 4$ probability) - The probability of songs matching is then $1 / 12 \cdot 1 / 18$. We add the two probabilities together to get $1 / 4 \cdot 1 / 12 \cdot(1 / 9+1 / 18)=1 / 288$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl",
"problem_match": "\n4. [3]",
"solution_match": "\nAnswer: "
}
|
f11fc2a6-7840-573a-bcda-683b9043fd03
| 608,172
|
A best of 9 series is to be played between two teams. That is, the first team to win 5 games is the winner. One of the teams, the Mathletes, has a $2 / 3$ chance of winning any given game. What is the probability that the winner is determined in the 7th game?
|
| $\mathbf{2 0}$ |
| :---: |
| $\mathbf{8 1}$ | . If the Mathletes are the winners, they must win the 7 th game and have won exactly four of the previous 6 games. The probability of this occurring is
$$
\left((2 / 3)^{4} \cdot(1 / 3)^{2} \cdot\binom{6}{2}\right) \cdot(2 / 3)
$$
Analogously, the other team wins with probability $\left((1 / 3)^{4} \cdot(2 / 3)^{2} \cdot\binom{6}{2}\right) \cdot(1 / 3)$. Summing, the probability is
$$
\frac{\binom{6}{2} \cdot 2^{2} \cdot\left(2^{3} \cdot 1^{2}+1^{5}\right)}{3^{7}}=\frac{5 \cdot 4}{3^{4}}=\frac{20}{81}
$$
|
\frac{20}{81}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
A best of 9 series is to be played between two teams. That is, the first team to win 5 games is the winner. One of the teams, the Mathletes, has a $2 / 3$ chance of winning any given game. What is the probability that the winner is determined in the 7th game?
|
| $\mathbf{2 0}$ |
| :---: |
| $\mathbf{8 1}$ | . If the Mathletes are the winners, they must win the 7 th game and have won exactly four of the previous 6 games. The probability of this occurring is
$$
\left((2 / 3)^{4} \cdot(1 / 3)^{2} \cdot\binom{6}{2}\right) \cdot(2 / 3)
$$
Analogously, the other team wins with probability $\left((1 / 3)^{4} \cdot(2 / 3)^{2} \cdot\binom{6}{2}\right) \cdot(1 / 3)$. Summing, the probability is
$$
\frac{\binom{6}{2} \cdot 2^{2} \cdot\left(2^{3} \cdot 1^{2}+1^{5}\right)}{3^{7}}=\frac{5 \cdot 4}{3^{4}}=\frac{20}{81}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl",
"problem_match": "\n5. [4]",
"solution_match": "\nAnswer: "
}
|
c177a579-6d28-508c-aabd-9f22b60548a8
| 608,173
|
My friend and I are playing a game with the following rules: If one of us says an integer $n$, the opponent then says an integer of their choice between $2 n$ and $3 n$, inclusive. Whoever first says 2007 or greater loses the game, and their opponent wins. I must begin the game by saying a positive integer less than 10 . With how many of them can I guarantee a win?
|
6. We assume optimal play and begin working backward. I win if I say any number between 1004 and 2006. Thus, by saying such a number, my friend can force a win for himself if I ever say a number between 335 and 1003. Then I win if I say any number between 168 and 334 , because my friend must then say one of the losing numbers just considered. Similarly, I lose by saying 56 through 167 , win by saying 28 through 55 , lose with 10 through 17 , win with 5 through 9 , lose with 2 through 4 , and win with 1 .
|
6
|
Yes
|
Yes
|
math-word-problem
|
Logic and Puzzles
|
My friend and I are playing a game with the following rules: If one of us says an integer $n$, the opponent then says an integer of their choice between $2 n$ and $3 n$, inclusive. Whoever first says 2007 or greater loses the game, and their opponent wins. I must begin the game by saying a positive integer less than 10 . With how many of them can I guarantee a win?
|
6. We assume optimal play and begin working backward. I win if I say any number between 1004 and 2006. Thus, by saying such a number, my friend can force a win for himself if I ever say a number between 335 and 1003. Then I win if I say any number between 168 and 334 , because my friend must then say one of the losing numbers just considered. Similarly, I lose by saying 56 through 167 , win by saying 28 through 55 , lose with 10 through 17 , win with 5 through 9 , lose with 2 through 4 , and win with 1 .
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl",
"problem_match": "\n7. [4]",
"solution_match": "\nAnswer: "
}
|
0f3e9dca-316d-5362-8864-1a7224c4de8b
| 608,175
|
Compute the number of sequences of numbers $a_{1}, a_{2}, \ldots, a_{10}$ such that
$$
\begin{aligned}
& \text { I. } a_{i}=0 \text { or } 1 \text { for all } i \\
& \text { II. } a_{i} \cdot a_{i+1}=0 \text { for } i=1,2, \ldots, 9 \\
& \text { III. } a_{i} \cdot a_{i+2}=0 \text { for } i=1,2, \ldots, 8
\end{aligned}
$$
|
60. Call such a sequence "good," and let $A_{n}$ be the number of good sequences of length $n$. Let $a_{1}, a_{2}, \ldots, a_{n}$ be a good sequence. If $a_{1}=0$, then $a_{1}, a_{2}, \ldots, a_{n}$ is a good sequence if and only if $a_{2}, \ldots, a_{n}$ is a good sequence, so there are $A_{n-1}$ of them. If $a_{1}=1$, then we must have $a_{2}=a_{3}=0$, and in this case, $a_{1}, a_{2}, \ldots, a_{n}$ is a good sequence if and only if $a_{4}, a_{5}, \ldots, a_{n}$ is a good sequence, so there are $A_{n-3}$ of them. We thus obtain the recursive relation $A_{n}=A_{n-1}+A_{n-3}$. Note that $A_{1}=2, A_{2}=3, A_{3}=4$. Plugging these into the recursion eventually yields $A_{10}=60$.
|
60
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Compute the number of sequences of numbers $a_{1}, a_{2}, \ldots, a_{10}$ such that
$$
\begin{aligned}
& \text { I. } a_{i}=0 \text { or } 1 \text { for all } i \\
& \text { II. } a_{i} \cdot a_{i+1}=0 \text { for } i=1,2, \ldots, 9 \\
& \text { III. } a_{i} \cdot a_{i+2}=0 \text { for } i=1,2, \ldots, 8
\end{aligned}
$$
|
60. Call such a sequence "good," and let $A_{n}$ be the number of good sequences of length $n$. Let $a_{1}, a_{2}, \ldots, a_{n}$ be a good sequence. If $a_{1}=0$, then $a_{1}, a_{2}, \ldots, a_{n}$ is a good sequence if and only if $a_{2}, \ldots, a_{n}$ is a good sequence, so there are $A_{n-1}$ of them. If $a_{1}=1$, then we must have $a_{2}=a_{3}=0$, and in this case, $a_{1}, a_{2}, \ldots, a_{n}$ is a good sequence if and only if $a_{4}, a_{5}, \ldots, a_{n}$ is a good sequence, so there are $A_{n-3}$ of them. We thus obtain the recursive relation $A_{n}=A_{n-1}+A_{n-3}$. Note that $A_{1}=2, A_{2}=3, A_{3}=4$. Plugging these into the recursion eventually yields $A_{10}=60$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-gen2-solutions.jsonl",
"problem_match": "\n8. [5]",
"solution_match": "\nAnswer: "
}
|
6a8dd945-975b-5eaa-b36b-c2d99cd165ae
| 608,176
|
$A, B, C$, and $D$ are points on a circle, and segments $\overline{A C}$ and $\overline{B D}$ intersect at $P$, such that $A P=8$, $P C=1$, and $B D=6$. Find $B P$, given that $B P<D P$.
|
2. Writing $B P=x$ and $P D=6-x$, we have that $B P<3$. Power of a point at $P$ gives $A P \cdot P C=B P \cdot P D$ or $8=x(6-x)$. This can be solved for $x=2$ and $x=4$, and we discard the latter.
|
2
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
$A, B, C$, and $D$ are points on a circle, and segments $\overline{A C}$ and $\overline{B D}$ intersect at $P$, such that $A P=8$, $P C=1$, and $B D=6$. Find $B P$, given that $B P<D P$.
|
2. Writing $B P=x$ and $P D=6-x$, we have that $B P<3$. Power of a point at $P$ gives $A P \cdot P C=B P \cdot P D$ or $8=x(6-x)$. This can be solved for $x=2$ and $x=4$, and we discard the latter.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-geo-solutions.jsonl",
"problem_match": "\n2. [3]",
"solution_match": "\nAnswer: "
}
|
8e241c73-dfbd-5541-b2b5-db1bdb297c07
| 608,178
|
Circles $\omega_{1}, \omega_{2}$, and $\omega_{3}$ are centered at $M, N$, and $O$, respectively. The points of tangency between $\omega_{2}$ and $\omega_{3}, \omega_{3}$ and $\omega_{1}$, and $\omega_{1}$ and $\omega_{2}$ are tangent at $A, B$, and $C$, respectively. Line $M O$ intersects $\omega_{3}$ and $\omega_{1}$ again at $P$ and $Q$ respectively, and line $A P$ intersects $\omega_{2}$ again at $R$. Given that $A B C$ is an equilateral triangle of side length 1 , compute the area of $P Q R$.
|
$\mathbf{2 \sqrt { 3 }}$. Note that $O N M$ is an equilateral triangle of side length 2, so $m \angle B P A=m \angle B O A / 2=$ $\pi / 6$. Now $B P A$ is a $30-60-90$ triangle with short side length 1 , so $A P=\sqrt{3}$. Now $A$ and $B$ are the midpoints of segments $P R$ and $P Q$, so $[P Q R]=\frac{P R}{P A} \cdot \frac{P Q}{P B}[P B A]=2 \cdot 2[P B A]=2 \sqrt{3}$.
|
2 \sqrt{3}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Circles $\omega_{1}, \omega_{2}$, and $\omega_{3}$ are centered at $M, N$, and $O$, respectively. The points of tangency between $\omega_{2}$ and $\omega_{3}, \omega_{3}$ and $\omega_{1}$, and $\omega_{1}$ and $\omega_{2}$ are tangent at $A, B$, and $C$, respectively. Line $M O$ intersects $\omega_{3}$ and $\omega_{1}$ again at $P$ and $Q$ respectively, and line $A P$ intersects $\omega_{2}$ again at $R$. Given that $A B C$ is an equilateral triangle of side length 1 , compute the area of $P Q R$.
|
$\mathbf{2 \sqrt { 3 }}$. Note that $O N M$ is an equilateral triangle of side length 2, so $m \angle B P A=m \angle B O A / 2=$ $\pi / 6$. Now $B P A$ is a $30-60-90$ triangle with short side length 1 , so $A P=\sqrt{3}$. Now $A$ and $B$ are the midpoints of segments $P R$ and $P Q$, so $[P Q R]=\frac{P R}{P A} \cdot \frac{P Q}{P B}[P B A]=2 \cdot 2[P B A]=2 \sqrt{3}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-geo-solutions.jsonl",
"problem_match": "\n3. [4]",
"solution_match": "\nAnswer: "
}
|
729781a1-a4d3-583d-83dd-74b87b44fb8a
| 608,179
|
Circle $\omega$ has radius 5 and is centered at $O$. Point $A$ lies outside $\omega$ such that $O A=13$. The two tangents to $\omega$ passing through $A$ are drawn, and points $B$ and $C$ are chosen on them (one on each tangent), such that line $B C$ is tangent to $\omega$ and $\omega$ lies outside triangle $A B C$. Compute $A B+A C$ given that $B C=7$.
|
17. Let $T_{1}, T_{2}$, and $T_{3}$ denote the points of tangency of $A B, A C$, and $B C$ with $\omega$, respectively. Then $7=B C=B T_{3}+T_{3} C=B T_{1}+C T_{2}$. By Pythagoras, $A T_{1}=A T_{2}=\sqrt{13^{2}-5^{2}}=12$. Now note that $24=A T_{1}+A T_{2}=A B+B T_{1}+A C+C T_{2}=A B+A C+7$.
|
17
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Circle $\omega$ has radius 5 and is centered at $O$. Point $A$ lies outside $\omega$ such that $O A=13$. The two tangents to $\omega$ passing through $A$ are drawn, and points $B$ and $C$ are chosen on them (one on each tangent), such that line $B C$ is tangent to $\omega$ and $\omega$ lies outside triangle $A B C$. Compute $A B+A C$ given that $B C=7$.
|
17. Let $T_{1}, T_{2}$, and $T_{3}$ denote the points of tangency of $A B, A C$, and $B C$ with $\omega$, respectively. Then $7=B C=B T_{3}+T_{3} C=B T_{1}+C T_{2}$. By Pythagoras, $A T_{1}=A T_{2}=\sqrt{13^{2}-5^{2}}=12$. Now note that $24=A T_{1}+A T_{2}=A B+B T_{1}+A C+C T_{2}=A B+A C+7$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-geo-solutions.jsonl",
"problem_match": "\n4. [4]",
"solution_match": "\nAnswer: "
}
|
eea4b44c-9ad9-5a6c-9625-ea4597fcfbd7
| 608,180
|
Triangle $A B C$ has $\angle A=90^{\circ}$, side $B C=25, A B>A C$, and area 150. Circle $\omega$ is inscribed in $A B C$, with $M$ its point of tangency on $A C$. Line $B M$ meets $\omega$ a second time at point $L$. Find the length of segment $B L$.
|
$4 \mathbf{4 5} \sqrt{\mathbf{1 7} / 17}$. Let $D$ be the foot of the altitude from $A$ to side $B C$. The length of $A D$ is $2 \cdot 150 / 25=12$. Triangles $A D C$ and $B D A$ are similar, so $C D \cdot D B=A D^{2}=144 \Rightarrow B D=16$ and $C D=9 \Rightarrow A B=20$ and $A C=15$. Using equal tangents or the formula inradius as area divided by semiperimeter, we can find the radius of $\omega$ to be 5 . Now, let $N$ be the tangency point of $\omega$ on $A B$. By power of a point, we have $B L \cdot B M=B N^{2}$. Since the center of $\omega$ together with $M, A$, and $N$ determines a square, $B N=15$ and $B M=5 \sqrt{17}$, and we have $B L=45 \sqrt{17} / 17$.
|
\frac{45\sqrt{17}}{17}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Triangle $A B C$ has $\angle A=90^{\circ}$, side $B C=25, A B>A C$, and area 150. Circle $\omega$ is inscribed in $A B C$, with $M$ its point of tangency on $A C$. Line $B M$ meets $\omega$ a second time at point $L$. Find the length of segment $B L$.
|
$4 \mathbf{4 5} \sqrt{\mathbf{1 7} / 17}$. Let $D$ be the foot of the altitude from $A$ to side $B C$. The length of $A D$ is $2 \cdot 150 / 25=12$. Triangles $A D C$ and $B D A$ are similar, so $C D \cdot D B=A D^{2}=144 \Rightarrow B D=16$ and $C D=9 \Rightarrow A B=20$ and $A C=15$. Using equal tangents or the formula inradius as area divided by semiperimeter, we can find the radius of $\omega$ to be 5 . Now, let $N$ be the tangency point of $\omega$ on $A B$. By power of a point, we have $B L \cdot B M=B N^{2}$. Since the center of $\omega$ together with $M, A$, and $N$ determines a square, $B N=15$ and $B M=5 \sqrt{17}$, and we have $B L=45 \sqrt{17} / 17$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-geo-solutions.jsonl",
"problem_match": "\n6. [5]",
"solution_match": "\nAnswer: "
}
|
bc2ef25e-cb61-58dc-9763-728d28e86d1d
| 608,182
|
Convex quadrilateral $A B C D$ has sides $A B=B C=7, C D=5$, and $A D=3$. Given additionally that $m \angle A B C=60^{\circ}$, find $B D$.
|
8. Triangle $A B C$ is equilateral, so $A C=7$ as well. Now the law of cosines shows that $m \angle C D A=120^{\circ}$; i.e., $A B C D$ is cyclic. Ptolemy's theorem now gives $A C \cdot B D=A B \cdot C D+A D \cdot B C$, or simply $B D=C D+A D=8$.
|
8
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Convex quadrilateral $A B C D$ has sides $A B=B C=7, C D=5$, and $A D=3$. Given additionally that $m \angle A B C=60^{\circ}$, find $B D$.
|
8. Triangle $A B C$ is equilateral, so $A C=7$ as well. Now the law of cosines shows that $m \angle C D A=120^{\circ}$; i.e., $A B C D$ is cyclic. Ptolemy's theorem now gives $A C \cdot B D=A B \cdot C D+A D \cdot B C$, or simply $B D=C D+A D=8$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-geo-solutions.jsonl",
"problem_match": "\n7. [5]",
"solution_match": "\nAnswer: "
}
|
eda03d79-d604-5456-adee-1107785f9dbf
| 608,183
|
$\triangle A B C$ is right angled at $A . D$ is a point on $A B$ such that $C D=1 . A E$ is the altitude from $A$ to $B C$. If $B D=B E=1$, what is the length of $A D$ ?
|
$\sqrt[3]{2}-1$. Let $A D=x$, angle $A B C=t$. We also have $\angle B C A=90-t$ and $\angle D C A=90-2 t$ so that $\angle A D C=2 t$. Considering triangles $A B E$ and $A D C$, we obtain, respectively,
$\cos (t)=1 /(1+x)$ and $\cos (2 t)=x$. By the double angle formula we get, $(1+x)^{3}=2$.
Alternatively, construct $M$, the midpoint of segment $B C$, and note that triangles $A B C, E B A$, and $M B D$ are similar. Thus, $A B^{2}=B C \cdot B E=B C$. In particular,
$$
A B=\frac{B C}{A B}=\frac{A B}{B E}=\frac{B D}{B M}=\frac{2 B D}{B C}=\frac{2}{A B^{2}}
$$
from which $A B=\sqrt[3]{2}$ and $A D=\sqrt[3]{2}-1$.
|
\sqrt[3]{2}-1
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
$\triangle A B C$ is right angled at $A . D$ is a point on $A B$ such that $C D=1 . A E$ is the altitude from $A$ to $B C$. If $B D=B E=1$, what is the length of $A D$ ?
|
$\sqrt[3]{2}-1$. Let $A D=x$, angle $A B C=t$. We also have $\angle B C A=90-t$ and $\angle D C A=90-2 t$ so that $\angle A D C=2 t$. Considering triangles $A B E$ and $A D C$, we obtain, respectively,
$\cos (t)=1 /(1+x)$ and $\cos (2 t)=x$. By the double angle formula we get, $(1+x)^{3}=2$.
Alternatively, construct $M$, the midpoint of segment $B C$, and note that triangles $A B C, E B A$, and $M B D$ are similar. Thus, $A B^{2}=B C \cdot B E=B C$. In particular,
$$
A B=\frac{B C}{A B}=\frac{A B}{B E}=\frac{B D}{B M}=\frac{2 B D}{B C}=\frac{2}{A B^{2}}
$$
from which $A B=\sqrt[3]{2}$ and $A D=\sqrt[3]{2}-1$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-geo-solutions.jsonl",
"problem_match": "\n9. [7]",
"solution_match": "\nAnswer: "
}
|
1679827e-726e-5c4d-a80a-adb282132d7b
| 608,185
|
$A B C D$ is a convex quadrilateral such that $A B=2, B C=3, C D=7$, and $A D=6$. It also has an incircle. Given that $\angle A B C$ is right, determine the radius of this incircle.
|
$\frac{1+\sqrt{13}}{\mathbf{3}}$. Note that $A C^{2}=A B^{2}+B C^{2}=13=C D^{2}-D A^{2}$. It follows that $\angle D A C$ is right, and so
$$
[A B C D]=[A B C]+[D A C]=2 \cdot 3 / 2+6 \cdot \sqrt{13} / 2=3+3 \sqrt{13}
$$
On the other hand, if $I$ denotes the incenter and $r$ denotes the inradius,
$$
[A B C D]=[A I B]+[B I C]+[C I D]+[D I A]=A B \cdot r / 2+B C \cdot r / 2+C D \cdot r / 2+D A \cdot r / 2=9 r
$$
Therefore, $r=(3+3 \sqrt{13}) / 9=\frac{1+\sqrt{13}}{3}$.
|
\frac{1+\sqrt{13}}{3}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
$A B C D$ is a convex quadrilateral such that $A B=2, B C=3, C D=7$, and $A D=6$. It also has an incircle. Given that $\angle A B C$ is right, determine the radius of this incircle.
|
$\frac{1+\sqrt{13}}{\mathbf{3}}$. Note that $A C^{2}=A B^{2}+B C^{2}=13=C D^{2}-D A^{2}$. It follows that $\angle D A C$ is right, and so
$$
[A B C D]=[A B C]+[D A C]=2 \cdot 3 / 2+6 \cdot \sqrt{13} / 2=3+3 \sqrt{13}
$$
On the other hand, if $I$ denotes the incenter and $r$ denotes the inradius,
$$
[A B C D]=[A I B]+[B I C]+[C I D]+[D I A]=A B \cdot r / 2+B C \cdot r / 2+C D \cdot r / 2+D A \cdot r / 2=9 r
$$
Therefore, $r=(3+3 \sqrt{13}) / 9=\frac{1+\sqrt{13}}{3}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-geo-solutions.jsonl",
"problem_match": "\n10. [8]",
"solution_match": "\nAnswer: "
}
|
d0fc6a6d-e7f2-5936-a27a-2555ca15aa0d
| 608,186
|
Define the sequence of positive integers $a_{n}$ recursively by $a_{1}=7$ and $a_{n}=7^{a_{n-1}}$ for all $n \geq 2$. Determine the last two digits of $a_{2007}$.
|
43. Note that the last two digits of $7^{4}$ are 01. Also, $a_{2006}=7^{a_{2005}}=(-1)^{a_{2005}}=-1=3$ $(\bmod 4)$ since $a_{2005}$ is odd. Therefore, $a_{2007}=7^{a_{2006}}=7^{3}=43(\bmod 100)$.
|
43
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Define the sequence of positive integers $a_{n}$ recursively by $a_{1}=7$ and $a_{n}=7^{a_{n-1}}$ for all $n \geq 2$. Determine the last two digits of $a_{2007}$.
|
43. Note that the last two digits of $7^{4}$ are 01. Also, $a_{2006}=7^{a_{2005}}=(-1)^{a_{2005}}=-1=3$ $(\bmod 4)$ since $a_{2005}$ is odd. Therefore, $a_{2007}=7^{a_{2006}}=7^{3}=43(\bmod 100)$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n1. [5]",
"solution_match": "\nAnswer: "
}
|
1374b05a-936a-56bc-ac6d-53064df9bf88
| 608,187
|
A candy company makes 5 colors of jellybeans, which come in equal proportions. If I grab a random sample of 5 jellybeans, what is the probability that I get exactly 2 distinct colors?
|
$\frac{\mathbf{1 2}}{\mathbf{1 2 5}}$. There are $\binom{5}{2}=10$ possible pairs of colors. Each pair of colors contributes $2^{5}-2=30$ sequences of beans that use both colors. Thus, the answer is $10 \cdot 30 / 5^{5}=12 / 125$.
|
\frac{12}{125}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
A candy company makes 5 colors of jellybeans, which come in equal proportions. If I grab a random sample of 5 jellybeans, what is the probability that I get exactly 2 distinct colors?
|
$\frac{\mathbf{1 2}}{\mathbf{1 2 5}}$. There are $\binom{5}{2}=10$ possible pairs of colors. Each pair of colors contributes $2^{5}-2=30$ sequences of beans that use both colors. Thus, the answer is $10 \cdot 30 / 5^{5}=12 / 125$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n2. [5]",
"solution_match": "\nAnswer: "
}
|
67e42776-0417-54dc-9714-85da448fcd9e
| 608,188
|
The equation $x^{2}+2 x=i$ has two complex solutions. Determine the product of their real parts.
|
$\frac{1-\sqrt{2}}{\mathbf{2}}$. Complete the square by adding 1 to each side. Then $(x+1)^{2}=1+i=e^{\frac{i \pi}{4}} \sqrt{2}$, so $x+1= \pm e^{\frac{i \pi}{8}} \sqrt[4]{2}$. The desired product is then
$$
\left(-1+\cos \left(\frac{\pi}{8}\right) \sqrt[4]{2}\right)\left(-1-\cos \left(\frac{\pi}{8}\right) \sqrt[4]{2}\right)=1-\cos ^{2}\left(\frac{\pi}{8}\right) \sqrt{2}=1-\frac{\left(1+\cos \left(\frac{\pi}{4}\right)\right)}{2} \sqrt{2}=\frac{1-\sqrt{2}}{2}
$$
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
\frac{1-\sqrt{2}}{2}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
The equation $x^{2}+2 x=i$ has two complex solutions. Determine the product of their real parts.
|
$\frac{1-\sqrt{2}}{\mathbf{2}}$. Complete the square by adding 1 to each side. Then $(x+1)^{2}=1+i=e^{\frac{i \pi}{4}} \sqrt{2}$, so $x+1= \pm e^{\frac{i \pi}{8}} \sqrt[4]{2}$. The desired product is then
$$
\left(-1+\cos \left(\frac{\pi}{8}\right) \sqrt[4]{2}\right)\left(-1-\cos \left(\frac{\pi}{8}\right) \sqrt[4]{2}\right)=1-\cos ^{2}\left(\frac{\pi}{8}\right) \sqrt{2}=1-\frac{\left(1+\cos \left(\frac{\pi}{4}\right)\right)}{2} \sqrt{2}=\frac{1-\sqrt{2}}{2}
$$
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n3. [5]",
"solution_match": "\nAnswer: "
}
|
0530b3c6-b441-5b2d-a130-c43b9eaa1328
| 608,189
|
A sequence consists of the digits $122333444455555 \ldots$ such that the each positive integer $n$ is repeated $n$ times, in increasing order. Find the sum of the 4501 st and 4052 nd digits of this sequence.
|
13. Note that $n$ contributes $n \cdot d(n)$ digits, where $d(n)$ is the number of digits of $n$. Then because $1+\cdots+99=4950$, we know that the digits of interest appear amongst copies of two digit numbers. Now for $10 \leq n \leq 99$, the number of digits in the subsequence up to the last copy of $n$ is
$$
1+2+3+\cdots+9+2 \cdot(10+\cdots+n)=2 \cdot(1+\cdots+n)-45=n^{2}+n-45
$$
Since $67^{2}+67-45=4511$, the two digits are 6 and 7 in some order, so have sum 13 .
|
13
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
A sequence consists of the digits $122333444455555 \ldots$ such that the each positive integer $n$ is repeated $n$ times, in increasing order. Find the sum of the 4501 st and 4052 nd digits of this sequence.
|
13. Note that $n$ contributes $n \cdot d(n)$ digits, where $d(n)$ is the number of digits of $n$. Then because $1+\cdots+99=4950$, we know that the digits of interest appear amongst copies of two digit numbers. Now for $10 \leq n \leq 99$, the number of digits in the subsequence up to the last copy of $n$ is
$$
1+2+3+\cdots+9+2 \cdot(10+\cdots+n)=2 \cdot(1+\cdots+n)-45=n^{2}+n-45
$$
Since $67^{2}+67-45=4511$, the two digits are 6 and 7 in some order, so have sum 13 .
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n4. [6]",
"solution_match": "\nAnswer: "
}
|
f353a2a9-79e5-52fc-9b88-c050a43ce02e
| 608,190
|
Compute the largest positive integer such that $\frac{2007!}{2007^{n}}$ is an integer.
|
9. Note that $2007=3^{2} \cdot 223$. Using the fact that the number of times a prime $p$ divides $n$ ! is given by
$$
\left\lfloor\frac{n}{p}\right\rfloor+\left\lfloor\frac{n}{p^{2}}\right\rfloor+\left\lfloor\frac{n}{p^{3}}\right\rfloor+\cdots
$$
it follows that the answer is 9 .
|
9
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Compute the largest positive integer such that $\frac{2007!}{2007^{n}}$ is an integer.
|
9. Note that $2007=3^{2} \cdot 223$. Using the fact that the number of times a prime $p$ divides $n$ ! is given by
$$
\left\lfloor\frac{n}{p}\right\rfloor+\left\lfloor\frac{n}{p^{2}}\right\rfloor+\left\lfloor\frac{n}{p^{3}}\right\rfloor+\cdots
$$
it follows that the answer is 9 .
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n5. [6]",
"solution_match": "\nAnswer: "
}
|
f10413c8-cf96-515f-a362-ca3296fdc00e
| 608,191
|
There are three video game systems: the Paystation, the WHAT, and the ZBoz2 $\pi$, and none of these systems will play games for the other systems. Uncle Riemann has three nephews: Bernoulli, Galois, and Dirac. Bernoulli owns a Paystation and a WHAT, Galois owns a WHAT and a ZBoz2r, and Dirac owns a ZBoz2 $\pi$ and a Paystation. A store sells 4 different games for the Paystation, 6 different games for the WHAT, and 10 different games for the ZBoz2 $\pi$. Uncle Riemann does not understand the
difference between the systems, so he walks into the store and buys 3 random games (not necessarily distinct) and randomly hands them to his nephews. What is the probability that each nephew receives a game he can play?
|
$\frac{\mathbf{7}}{\mathbf{2 5}}$. Since the games are not necessarily distinct, probabilities are independent. Multiplying the odds that each nephew receives a game he can play, we get $10 / 20 \cdot 14 / 20 \cdot 16 / 20=7 / 25$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
\frac{7}{25}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
There are three video game systems: the Paystation, the WHAT, and the ZBoz2 $\pi$, and none of these systems will play games for the other systems. Uncle Riemann has three nephews: Bernoulli, Galois, and Dirac. Bernoulli owns a Paystation and a WHAT, Galois owns a WHAT and a ZBoz2r, and Dirac owns a ZBoz2 $\pi$ and a Paystation. A store sells 4 different games for the Paystation, 6 different games for the WHAT, and 10 different games for the ZBoz2 $\pi$. Uncle Riemann does not understand the
difference between the systems, so he walks into the store and buys 3 random games (not necessarily distinct) and randomly hands them to his nephews. What is the probability that each nephew receives a game he can play?
|
$\frac{\mathbf{7}}{\mathbf{2 5}}$. Since the games are not necessarily distinct, probabilities are independent. Multiplying the odds that each nephew receives a game he can play, we get $10 / 20 \cdot 14 / 20 \cdot 16 / 20=7 / 25$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n6. [6]",
"solution_match": "\nAnswer: "
}
|
4930c2fe-5685-5047-993e-2478f140643d
| 608,192
|
A student at Harvard named Kevin
Was counting his stones by 11
He messed up $n$ times
And instead counted 9s
And wound up at 2007.
How many values of $n$ could make this limerick true?
|
21. The mathematical content is that $9 n+11 k=2007$, for some nonnegative integers $n$ and $k$. As $2007=9 \cdot 223, k$ must be divisible by 9 . Using modulo 11 , we see that $n$ is 3 more than a multiple of 11 . Thus, the possibilities are $n=223,212,201, \ldots, 3$, which are 21 in number.
|
21
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
A student at Harvard named Kevin
Was counting his stones by 11
He messed up $n$ times
And instead counted 9s
And wound up at 2007.
How many values of $n$ could make this limerick true?
|
21. The mathematical content is that $9 n+11 k=2007$, for some nonnegative integers $n$ and $k$. As $2007=9 \cdot 223, k$ must be divisible by 9 . Using modulo 11 , we see that $n$ is 3 more than a multiple of 11 . Thus, the possibilities are $n=223,212,201, \ldots, 3$, which are 21 in number.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n7. [7]",
"solution_match": "\nAnswer: "
}
|
85f570d1-56ac-576a-ab44-3092a0e1d493
| 608,193
|
Let $A_{12}$ denote the answer to problem 12. There exists a unique triple of digits $(B, C, D)$ such that $10>A_{12}>B>C>D>0$ and
$$
\overline{A_{12} B C D}-\overline{D C B A_{12}}=\overline{B D A_{12} C}
$$
where $\overline{A_{12} B C D}$ denotes the four digit base 10 integer. Compute $B+C+D$.
|
11. Since $D<A_{12}$, when $A$ is subtracted from $D$ we must carry over from $C$. Thus, $D+10-\overline{A_{12}}=C$. Next, since $C-1<C<B$, we must carry over from the tens digit, so that $(C-1+10)-B=A_{12}$. Now $B>C$ so $B-1 \geq C$, and $(B-1)-C=D$. Similarly, $A_{12}-D=B$. Solving this system of four equations produces $\left(A_{12}, B, C, D\right)=(7,6,4,1)$.
|
11
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Let $A_{12}$ denote the answer to problem 12. There exists a unique triple of digits $(B, C, D)$ such that $10>A_{12}>B>C>D>0$ and
$$
\overline{A_{12} B C D}-\overline{D C B A_{12}}=\overline{B D A_{12} C}
$$
where $\overline{A_{12} B C D}$ denotes the four digit base 10 integer. Compute $B+C+D$.
|
11. Since $D<A_{12}$, when $A$ is subtracted from $D$ we must carry over from $C$. Thus, $D+10-\overline{A_{12}}=C$. Next, since $C-1<C<B$, we must carry over from the tens digit, so that $(C-1+10)-B=A_{12}$. Now $B>C$ so $B-1 \geq C$, and $(B-1)-C=D$. Similarly, $A_{12}-D=B$. Solving this system of four equations produces $\left(A_{12}, B, C, D\right)=(7,6,4,1)$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n10. [8]",
"solution_match": "\nAnswer: "
}
|
a9683c1c-4890-5a8d-a488-39f1811cc2d7
| 608,196
|
Let $A_{10}$ denote the answer to problem 10. Two circles lie in the plane; denote the lengths of the internal and external tangents between these two circles by $x$ and $y$, respectively. Given that the product of the radii of these two circles is $15 / 2$, and that the distance between their centers is $A_{10}$, determine $y^{2}-x^{2}$.
|
30. Suppose the circles have radii $r_{1}$ and $r_{2}$. Then using the tangents to build right triangles, we have $x^{2}+\left(r_{1}+r_{2}\right)^{2}=A_{10}^{2}=y^{2}+\left(r_{1}-r_{2}\right)^{2}$. Thus, $y^{2}-x^{2}=\left(r_{1}+r_{2}\right)^{2}-\left(r_{1}-r_{2}\right)^{2}=$ $4 r_{1} r_{2}=30$.
|
30
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Let $A_{10}$ denote the answer to problem 10. Two circles lie in the plane; denote the lengths of the internal and external tangents between these two circles by $x$ and $y$, respectively. Given that the product of the radii of these two circles is $15 / 2$, and that the distance between their centers is $A_{10}$, determine $y^{2}-x^{2}$.
|
30. Suppose the circles have radii $r_{1}$ and $r_{2}$. Then using the tangents to build right triangles, we have $x^{2}+\left(r_{1}+r_{2}\right)^{2}=A_{10}^{2}=y^{2}+\left(r_{1}-r_{2}\right)^{2}$. Thus, $y^{2}-x^{2}=\left(r_{1}+r_{2}\right)^{2}-\left(r_{1}-r_{2}\right)^{2}=$ $4 r_{1} r_{2}=30$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n11. [8]",
"solution_match": "\nAnswer: "
}
|
87db8ecf-7286-54a0-89ad-3f1df624a303
| 608,197
|
Let $A_{11}$ denote the answer to problem 11. Determine the smallest prime $p$ such that the arithmetic sequence $p, p+A_{11}, p+2 A_{11}, \ldots$ begins with the largest possible number of primes.
|
7. First, note that the maximal number of initial primes is bounded above by the smallest prime not dividing $A_{11}$, with equality possible only if $p$ is this prime. For, if $q$ is the smallest prime not dividing $A_{11}$, then the first $q$ terms of the arithmetic sequence determine a complete residue class modulo $q$, and the multiple of $q$ is nonprime unless it equals $q$. If $q<A_{11}$, then $q$ must appear first in the sequence, and thus divide the $(q+1)$ st term. If $q>A_{11}$, then $A_{11}=2$ and $q=3$ by Bertrand's postulate, so $q$ must appear first by inspection.
Now since $A_{11}=30$, the bound is 7 . In fact, $7,37,67,97,127$, and 157 are prime, but 187 is not. Then on the one hand, our bound of seven initial primes is not realizable. On the other hand, this implies an upper bound of six, and this bound is achieved by $p=7$. Smaller primes $p$ yield only one initial prime, so 7 is the answer.
Remarks. A number of famous theorems are concerned with the distribution of prime numbers. For two relatively prime positive integers $a$ and $b$, the arithmetic progression $a, a+b, a+2 b, \ldots$ contains infinitely many primes, a result known as Dirichlet's theorem. It was shown recently (c. 2004) that there exist arbitrarily long arithmetic progressions consisting of primes only. Bertrand's postulate states that for any positive integer $n$, there exists a prime $p$ such that $n<p \leq 2 n$. This is an unfortunate misnomer, as the statement is known to be true. As with many theorems concerning the distributions of primes, these results are easily stated in elementary terms, concealing elaborate proofs.
There is just one triple of possible $\left(A_{10}, A_{11}, A_{12}\right)$ of answers to these three problems. Your team will receive credit only for answers matching these. (So, for example, submitting a wrong answer for problem 11 will not alter the correctness of your answer to problem 12.)
|
7
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Let $A_{11}$ denote the answer to problem 11. Determine the smallest prime $p$ such that the arithmetic sequence $p, p+A_{11}, p+2 A_{11}, \ldots$ begins with the largest possible number of primes.
|
7. First, note that the maximal number of initial primes is bounded above by the smallest prime not dividing $A_{11}$, with equality possible only if $p$ is this prime. For, if $q$ is the smallest prime not dividing $A_{11}$, then the first $q$ terms of the arithmetic sequence determine a complete residue class modulo $q$, and the multiple of $q$ is nonprime unless it equals $q$. If $q<A_{11}$, then $q$ must appear first in the sequence, and thus divide the $(q+1)$ st term. If $q>A_{11}$, then $A_{11}=2$ and $q=3$ by Bertrand's postulate, so $q$ must appear first by inspection.
Now since $A_{11}=30$, the bound is 7 . In fact, $7,37,67,97,127$, and 157 are prime, but 187 is not. Then on the one hand, our bound of seven initial primes is not realizable. On the other hand, this implies an upper bound of six, and this bound is achieved by $p=7$. Smaller primes $p$ yield only one initial prime, so 7 is the answer.
Remarks. A number of famous theorems are concerned with the distribution of prime numbers. For two relatively prime positive integers $a$ and $b$, the arithmetic progression $a, a+b, a+2 b, \ldots$ contains infinitely many primes, a result known as Dirichlet's theorem. It was shown recently (c. 2004) that there exist arbitrarily long arithmetic progressions consisting of primes only. Bertrand's postulate states that for any positive integer $n$, there exists a prime $p$ such that $n<p \leq 2 n$. This is an unfortunate misnomer, as the statement is known to be true. As with many theorems concerning the distributions of primes, these results are easily stated in elementary terms, concealing elaborate proofs.
There is just one triple of possible $\left(A_{10}, A_{11}, A_{12}\right)$ of answers to these three problems. Your team will receive credit only for answers matching these. (So, for example, submitting a wrong answer for problem 11 will not alter the correctness of your answer to problem 12.)
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n12. [8]",
"solution_match": "\nAnswer: "
}
|
b6f6294d-4d2e-5ad0-8169-9c154623c322
| 608,198
|
Determine the largest integer $n$ such that $7^{2048}-1$ is divisible by $2^{n}$.
|
14. We have
$$
7^{2048}-1=(7-1)(7+1)\left(7^{2}+1\right)\left(7^{4}+1\right) \cdots\left(7^{1024}+1\right)
$$
In the expansion, the eleven terms other than $7+1$ are divisible by 2 exactly once, as can be checked easily with modulo 4 .
|
14
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Determine the largest integer $n$ such that $7^{2048}-1$ is divisible by $2^{n}$.
|
14. We have
$$
7^{2048}-1=(7-1)(7+1)\left(7^{2}+1\right)\left(7^{4}+1\right) \cdots\left(7^{1024}+1\right)
$$
In the expansion, the eleven terms other than $7+1$ are divisible by 2 exactly once, as can be checked easily with modulo 4 .
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n13. [9]",
"solution_match": "\nAnswer: "
}
|
97de4bc4-8cb3-551d-b330-8306f14302d2
| 608,199
|
We are given some similar triangles. Their areas are $1^{2}, 3^{2}, 5^{2} \ldots$, and $49^{2}$. If the smallest triangle has a perimeter of 4 , what is the sum of all the triangles' perimeters?
|
2500. Because the triangles are all similar, they all have the same ratio of perimeter squared to area, or, equivalently, the same ratio of perimeter to the square root of area. Because the latter ratio is 4 for the smallest triangle, it is 4 for all the triangles, and thus their perimeters are $4 \cdot 1,4 \cdot 3,4 \cdot 5, \ldots, 4 \cdot 49$, and the sum of these numbers is $\left[4(1+3+5+\cdots+49)=4\left(25^{2}\right)=2500\right.$.
|
2500
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
We are given some similar triangles. Their areas are $1^{2}, 3^{2}, 5^{2} \ldots$, and $49^{2}$. If the smallest triangle has a perimeter of 4 , what is the sum of all the triangles' perimeters?
|
2500. Because the triangles are all similar, they all have the same ratio of perimeter squared to area, or, equivalently, the same ratio of perimeter to the square root of area. Because the latter ratio is 4 for the smallest triangle, it is 4 for all the triangles, and thus their perimeters are $4 \cdot 1,4 \cdot 3,4 \cdot 5, \ldots, 4 \cdot 49$, and the sum of these numbers is $\left[4(1+3+5+\cdots+49)=4\left(25^{2}\right)=2500\right.$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n14. [9]",
"solution_match": "\nAnswer: "
}
|
b1af9038-45cb-5f73-8cc9-026893317888
| 608,200
|
Points $A, B$, and $C$ lie in that order on line $\ell$, such that $A B=3$ and $B C=2$. Point $H$ is such that $C H$ is perpendicular to $\ell$. Determine the length $C H$ such that $\angle A H B$ is as large as possible.
|
$\sqrt{\sqrt{\mathbf{1 0}}}$. Let $\omega$ denote the circumcircle of triangle $A B H$. Since $A B$ is fixed, the smaller the radius of $\omega$, the bigger the angle $A H B$. If $\omega$ crosses the line $C H$ in more than one point, then there exists a smaller circle that goes through $A$ and $B$ that crosses $C H$ at a point $H^{\prime}$. But angle $A H^{\prime} B$ is greater than $A H B$, contradicting our assumption that $H$ is the optimal spot. Thus the circle $\omega$ crosses the line $C H$ at exactly one spot: ie, $\omega$ is tangent to $C H$ at $H$. By Power of a Point, $C H^{2}=C A C B=5 \cdot 2=10$, so $C H=\sqrt{10}$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
\sqrt{10}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Points $A, B$, and $C$ lie in that order on line $\ell$, such that $A B=3$ and $B C=2$. Point $H$ is such that $C H$ is perpendicular to $\ell$. Determine the length $C H$ such that $\angle A H B$ is as large as possible.
|
$\sqrt{\sqrt{\mathbf{1 0}}}$. Let $\omega$ denote the circumcircle of triangle $A B H$. Since $A B$ is fixed, the smaller the radius of $\omega$, the bigger the angle $A H B$. If $\omega$ crosses the line $C H$ in more than one point, then there exists a smaller circle that goes through $A$ and $B$ that crosses $C H$ at a point $H^{\prime}$. But angle $A H^{\prime} B$ is greater than $A H B$, contradicting our assumption that $H$ is the optimal spot. Thus the circle $\omega$ crosses the line $C H$ at exactly one spot: ie, $\omega$ is tangent to $C H$ at $H$. By Power of a Point, $C H^{2}=C A C B=5 \cdot 2=10$, so $C H=\sqrt{10}$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n15. [9]",
"solution_match": "\nAnswer: "
}
|
86c1af46-92d6-51fd-96ea-169bd70793b8
| 608,201
|
Let $A B C$ be a triangle with $A B=7, B C=9$, and $C A=4$. Let $D$ be the point such that $A B \| C D$ and $C A \| B D$. Let $R$ be a point within triangle $B C D$. Lines $\ell$ and $m$ going through $R$ are parallel to $C A$ and $A B$ respectively. Line $\ell$ meets $A B$ and $B C$ at $P$ and $P^{\prime}$ respectively, and $m$ meets $C A$ and $B C$ at $Q$ and $Q^{\prime}$ respectively. If $S$ denotes the largest possible sum of the areas of triangles $B P P^{\prime}, R P^{\prime} Q^{\prime}$, and $C Q Q^{\prime}$, determine the value of $S^{2}$.
|
180. Let $R^{\prime}$ denote the intersection of the lines through $Q^{\prime}$ and $P^{\prime}$ parallel to $\ell$ and $m$ respectively. Then $\left[R P^{\prime} Q^{\prime}\right]=\left[R^{\prime} P^{\prime} Q^{\prime}\right]$. Triangles $B P P^{\prime}, R^{\prime} P^{\prime} Q^{\prime}$, and $C Q Q^{\prime}$ lie in $A B C$ without overlap, so that on the one hand, $S \leq A B C$. On the other, this bound is realizable by taking $R$ to be a vertex of triangle $B C D$. We compute the square of the area of $A B C$ to be $10 \cdot(10-9) \cdot(10-7) \cdot(10-4)=$ 180.
|
180
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Let $A B C$ be a triangle with $A B=7, B C=9$, and $C A=4$. Let $D$ be the point such that $A B \| C D$ and $C A \| B D$. Let $R$ be a point within triangle $B C D$. Lines $\ell$ and $m$ going through $R$ are parallel to $C A$ and $A B$ respectively. Line $\ell$ meets $A B$ and $B C$ at $P$ and $P^{\prime}$ respectively, and $m$ meets $C A$ and $B C$ at $Q$ and $Q^{\prime}$ respectively. If $S$ denotes the largest possible sum of the areas of triangles $B P P^{\prime}, R P^{\prime} Q^{\prime}$, and $C Q Q^{\prime}$, determine the value of $S^{2}$.
|
180. Let $R^{\prime}$ denote the intersection of the lines through $Q^{\prime}$ and $P^{\prime}$ parallel to $\ell$ and $m$ respectively. Then $\left[R P^{\prime} Q^{\prime}\right]=\left[R^{\prime} P^{\prime} Q^{\prime}\right]$. Triangles $B P P^{\prime}, R^{\prime} P^{\prime} Q^{\prime}$, and $C Q Q^{\prime}$ lie in $A B C$ without overlap, so that on the one hand, $S \leq A B C$. On the other, this bound is realizable by taking $R$ to be a vertex of triangle $B C D$. We compute the square of the area of $A B C$ to be $10 \cdot(10-9) \cdot(10-7) \cdot(10-4)=$ 180.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n16. [10]",
"solution_match": "\nAnswer: "
}
|
70155191-d516-5f78-a113-0e3e0b944207
| 608,202
|
During the regular season, Washington Redskins achieve a record of 10 wins and 6 losses. Compute the probability that their wins came in three streaks of consecutive wins, assuming that all possible arrangements of wins and losses are equally likely. (For example, the record LLWWWWWLWWLWWWLL contains three winning streaks, while WWWWWWWLLLLLLWWW has just two.)
|
\( \frac{45}{286} \). Suppose the winning streaks consist of \( w_1, w_2, \) and \( w_3 \) wins, in chronological order, where the first winning streak is preceded by $l_{0}$ consecutive losses and the $i$ winning streak is immediately succeeded by $l_{i}$ losses. Then $w_{1}, w_{2}, w_{3}, l_{1}, l_{2}>0$ are positive and $l_{0}, l_{3} \geq 0$ are nonnegative. The equations
$$
w_{1}+w_{2}+w_{3}=10 \quad \text { and } \quad\left(l_{0}+1\right)+l_{1}+l_{2}+\left(l_{3}+1\right)=8
$$
are independent, and have $\binom{9}{2}$ and $\binom{7}{3}$ solutions, respectively. It follows that the answer is
$$
\frac{\binom{9}{2}\binom{7}{3}}{\binom{16}{6}}=\frac{315}{2002}
$$
|
\frac{315}{2002}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
During the regular season, Washington Redskins achieve a record of 10 wins and 6 losses. Compute the probability that their wins came in three streaks of consecutive wins, assuming that all possible arrangements of wins and losses are equally likely. (For example, the record LLWWWWWLWWLWWWLL contains three winning streaks, while WWWWWWWLLLLLLWWW has just two.)
|
\( \frac{45}{286} \). Suppose the winning streaks consist of \( w_1, w_2, \) and \( w_3 \) wins, in chronological order, where the first winning streak is preceded by $l_{0}$ consecutive losses and the $i$ winning streak is immediately succeeded by $l_{i}$ losses. Then $w_{1}, w_{2}, w_{3}, l_{1}, l_{2}>0$ are positive and $l_{0}, l_{3} \geq 0$ are nonnegative. The equations
$$
w_{1}+w_{2}+w_{3}=10 \quad \text { and } \quad\left(l_{0}+1\right)+l_{1}+l_{2}+\left(l_{3}+1\right)=8
$$
are independent, and have $\binom{9}{2}$ and $\binom{7}{3}$ solutions, respectively. It follows that the answer is
$$
\frac{\binom{9}{2}\binom{7}{3}}{\binom{16}{6}}=\frac{315}{2002}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n17. [10]",
"solution_match": "\nAnswer: "
}
|
d83bc1fa-643d-58eb-94ca-f9835a6883d2
| 608,203
|
Convex quadrilateral $A B C D$ has right angles $\angle A$ and $\angle C$ and is such that $A B=B C$ and $A D=C D$. The diagonals $A C$ and $B D$ intersect at point $M$. Points $P$ and $Q$ lie on the circumcircle of triangle $A M B$ and segment $C D$, respectively, such that points $P, M$, and $Q$ are collinear. Suppose that $m \angle A B C=160^{\circ}$ and $m \angle Q M C=40^{\circ}$. Find $M P \cdot M Q$, given that $M C=6$.
|
36. Note that $m \angle Q P B=m \angle M P B=m \angle M A B=m \angle C A B=\angle B C A=\angle C D B$. Thus, $M P \cdot M Q=M B \cdot M D$. On the other hand, segment $C M$ is an altitude of right triangle $B C D$, so $M B \cdot M D=M C^{2}=36$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
36
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Convex quadrilateral $A B C D$ has right angles $\angle A$ and $\angle C$ and is such that $A B=B C$ and $A D=C D$. The diagonals $A C$ and $B D$ intersect at point $M$. Points $P$ and $Q$ lie on the circumcircle of triangle $A M B$ and segment $C D$, respectively, such that points $P, M$, and $Q$ are collinear. Suppose that $m \angle A B C=160^{\circ}$ and $m \angle Q M C=40^{\circ}$. Find $M P \cdot M Q$, given that $M C=6$.
|
36. Note that $m \angle Q P B=m \angle M P B=m \angle M A B=m \angle C A B=\angle B C A=\angle C D B$. Thus, $M P \cdot M Q=M B \cdot M D$. On the other hand, segment $C M$ is an altitude of right triangle $B C D$, so $M B \cdot M D=M C^{2}=36$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n18. [10]",
"solution_match": "\nAnswer: "
}
|
715f1db9-9ae0-5030-be5f-be1785984520
| 608,204
|
Define $x \star y=\frac{\sqrt{x^{2}+3 x y+y^{2}-2 x-2 y+4}}{x y+4}$. Compute
$$
((\cdots((2007 \star 2006) \star 2005) \star \cdots) \star 1) .
$$
|
$\frac{\sqrt{\mathbf{1 5}}}{\mathbf{9}}$. Note that $x \star 2=\frac{\sqrt{x^{2}+6 x+4-2 x-4+4}}{2 x+4}=\frac{\sqrt{(x+2)^{2}}}{2(x+2)}=\frac{1}{2}$ for $x>-2$. Because $x \star y>0$ if $x, y>0$, we need only compute $\frac{1}{2} \star 1=\frac{\sqrt{\frac{1}{4}+\frac{3}{2}+1-3+4}}{\frac{1}{2}+4}=\frac{\sqrt{15}}{9}$.
|
\frac{\sqrt{15}}{9}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Define $x \star y=\frac{\sqrt{x^{2}+3 x y+y^{2}-2 x-2 y+4}}{x y+4}$. Compute
$$
((\cdots((2007 \star 2006) \star 2005) \star \cdots) \star 1) .
$$
|
$\frac{\sqrt{\mathbf{1 5}}}{\mathbf{9}}$. Note that $x \star 2=\frac{\sqrt{x^{2}+6 x+4-2 x-4+4}}{2 x+4}=\frac{\sqrt{(x+2)^{2}}}{2(x+2)}=\frac{1}{2}$ for $x>-2$. Because $x \star y>0$ if $x, y>0$, we need only compute $\frac{1}{2} \star 1=\frac{\sqrt{\frac{1}{4}+\frac{3}{2}+1-3+4}}{\frac{1}{2}+4}=\frac{\sqrt{15}}{9}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n19. [10]",
"solution_match": "\nAnswer: "
}
|
1916a95d-0a67-5e84-a272-65e297638922
| 608,205
|
For $a$ a positive real number, let $x_{1}, x_{2}, x_{3}$ be the roots of the equation $x^{3}-a x^{2}+a x-a=0$. Determine the smallest possible value of $x_{1}^{3}+x_{2}^{3}+x_{3}^{3}-3 x_{1} x_{2} x_{3}$.
|
-4 . Note that $x_{1}+x_{2}+x_{3}=x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{1}=a$. Then
$$
\begin{aligned}
& x_{1}^{3}+x_{2}^{3}+x_{3}^{3}-3 x_{1} x_{2} x_{3}=\left(x_{1}+x_{2}+x_{3}\right)\left(x_{1}^{2}+x_{2}^{2}+x_{3}^{2}-\left(x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{1}\right)\right) \\
& \quad=\left(x_{1}+x_{2}+x_{3}\right)\left(\left(x_{1}+x_{2}+x_{3}\right)^{2}-3\left(x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{1}\right)\right)=a \cdot\left(a^{2}-3 a\right)=a^{3}-3 a^{2}
\end{aligned}
$$
The expression is negative only where $0<a<3$, so we need only consider these values of $a$. Finally, AM-GM gives $\sqrt[3]{(6-2 a)(a)(a)} \leq \frac{(6-2 a)+a+a}{3}=2$, with equality where $a=2$, and this rewrites as $(a-3) a^{2} \geq-4$.
|
-4
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
For $a$ a positive real number, let $x_{1}, x_{2}, x_{3}$ be the roots of the equation $x^{3}-a x^{2}+a x-a=0$. Determine the smallest possible value of $x_{1}^{3}+x_{2}^{3}+x_{3}^{3}-3 x_{1} x_{2} x_{3}$.
|
-4 . Note that $x_{1}+x_{2}+x_{3}=x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{1}=a$. Then
$$
\begin{aligned}
& x_{1}^{3}+x_{2}^{3}+x_{3}^{3}-3 x_{1} x_{2} x_{3}=\left(x_{1}+x_{2}+x_{3}\right)\left(x_{1}^{2}+x_{2}^{2}+x_{3}^{2}-\left(x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{1}\right)\right) \\
& \quad=\left(x_{1}+x_{2}+x_{3}\right)\left(\left(x_{1}+x_{2}+x_{3}\right)^{2}-3\left(x_{1} x_{2}+x_{2} x_{3}+x_{3} x_{1}\right)\right)=a \cdot\left(a^{2}-3 a\right)=a^{3}-3 a^{2}
\end{aligned}
$$
The expression is negative only where $0<a<3$, so we need only consider these values of $a$. Finally, AM-GM gives $\sqrt[3]{(6-2 a)(a)(a)} \leq \frac{(6-2 a)+a+a}{3}=2$, with equality where $a=2$, and this rewrites as $(a-3) a^{2} \geq-4$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n20. [10]",
"solution_match": "\nAnswer: "
}
|
26684fb4-b532-587b-97ec-d2b2c5dbce93
| 608,206
|
Bob the bomb-defuser has stumbled upon an active bomb. He opens it up, and finds the red and green wires conveniently located for him to cut. Being a seasoned member of the bomb-squad, Bob quickly determines that it is the green wire that he should cut, and puts his wirecutters on the green wire. But just before he starts to cut, the bomb starts to count down, ticking every second. Each time the bomb ticks, starting at time $t=15$ seconds, Bob panics and has a certain chance to move his wirecutters to the other wire. However, he is a rational man even when panicking, and has a $\frac{1}{2 t^{2}}$ chance of switching wires at time $t$, regardless of which wire he is about to cut. When the bomb ticks at $t=1$, Bob cuts whatever wire his wirecutters are on, without switching wires. What is the probability that Bob cuts the green wire?
|
$\frac{\mathbf{2 3}}{\mathbf{3 0}}$. Suppose Bob makes $n$ independent decisions, with probabilities of switching $p_{1}, p_{2}, \ldots, p_{n}$. Then in the expansion of the product
$$
P(x)=\left(p_{1}+\left(1-p_{1}\right) x\right)\left(p_{2}+\left(1-p_{2}\right) x\right) \cdots\left(p_{n}+\left(1-p_{n}\right) x\right)
$$
the sum of the coefficients of even powers of $x$ gives the probability that Bob makes his original decision. This is just $(P(1)+P(-1)) / 2$, so the probability is just
$$
\frac{1+\left(1-\frac{1}{1515}\right)\left(1-\frac{1}{1414}\right) \cdots\left(1-\frac{1}{22}\right)}{2}=\frac{1+\frac{1416 \frac{1315}{1515} 1414}{\cdots \frac{13}{22}}}{2}=\frac{1+\frac{8}{15}}{2}=\frac{23}{30} .
$$
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
\frac{23}{30}
|
Yes
|
Yes
|
math-word-problem
|
Logic and Puzzles
|
Bob the bomb-defuser has stumbled upon an active bomb. He opens it up, and finds the red and green wires conveniently located for him to cut. Being a seasoned member of the bomb-squad, Bob quickly determines that it is the green wire that he should cut, and puts his wirecutters on the green wire. But just before he starts to cut, the bomb starts to count down, ticking every second. Each time the bomb ticks, starting at time $t=15$ seconds, Bob panics and has a certain chance to move his wirecutters to the other wire. However, he is a rational man even when panicking, and has a $\frac{1}{2 t^{2}}$ chance of switching wires at time $t$, regardless of which wire he is about to cut. When the bomb ticks at $t=1$, Bob cuts whatever wire his wirecutters are on, without switching wires. What is the probability that Bob cuts the green wire?
|
$\frac{\mathbf{2 3}}{\mathbf{3 0}}$. Suppose Bob makes $n$ independent decisions, with probabilities of switching $p_{1}, p_{2}, \ldots, p_{n}$. Then in the expansion of the product
$$
P(x)=\left(p_{1}+\left(1-p_{1}\right) x\right)\left(p_{2}+\left(1-p_{2}\right) x\right) \cdots\left(p_{n}+\left(1-p_{n}\right) x\right)
$$
the sum of the coefficients of even powers of $x$ gives the probability that Bob makes his original decision. This is just $(P(1)+P(-1)) / 2$, so the probability is just
$$
\frac{1+\left(1-\frac{1}{1515}\right)\left(1-\frac{1}{1414}\right) \cdots\left(1-\frac{1}{22}\right)}{2}=\frac{1+\frac{1416 \frac{1315}{1515} 1414}{\cdots \frac{13}{22}}}{2}=\frac{1+\frac{8}{15}}{2}=\frac{23}{30} .
$$
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n21. [10]",
"solution_match": "\nAnswer: "
}
|
74492643-c2e1-5005-9b44-8e05d7e81c0c
| 608,207
|
The sequence $\left\{a_{n}\right\}_{n \geq 1}$ is defined by $a_{n+2}=7 a_{n+1}-a_{n}$ for positive integers $n$ with initial values $a_{1}=1$ and $a_{2}=8$. Another sequence, $\left\{b_{n}\right\}$, is defined by the rule $b_{n+2}=3 b_{n+1}-b_{n}$ for positive integers $n$ together with the values $b_{1}=1$ and $b_{2}=2$. Find $\operatorname{gcd}\left(a_{5000}, b_{501}\right)$.
|
89. We show by induction that $a_{n}=F_{4 n-2}$ and $b_{n}=F_{2 n-1}$, where $F_{k}$ is the $k$ th Fibonacci number. The base cases are clear. As for the inductive steps, note that
$$
F_{k+2}=F_{k+1}+F_{k}=2 F_{k}+F_{k-1}=3 F_{k}-F_{k-2}
$$
and
$$
F_{k+4}=3 F_{k+2}-F_{k}=8 F_{k}+3 F_{k-2}=7 F_{k}-F_{k-4}
$$
We wish to compute the greatest common denominator of $F_{19998}$ and $F_{1001}$. The Fibonacci numbers satisfy the property that $\operatorname{gcd}\left(F_{m}, F_{n}\right)=F_{\operatorname{gcd}(m, n)}$, which can be proven by noting that they are periodic modulo any positive integer. So since $\operatorname{gcd}(19998,1001)=11$, the answer is $F_{11}=89$.
|
89
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
The sequence $\left\{a_{n}\right\}_{n \geq 1}$ is defined by $a_{n+2}=7 a_{n+1}-a_{n}$ for positive integers $n$ with initial values $a_{1}=1$ and $a_{2}=8$. Another sequence, $\left\{b_{n}\right\}$, is defined by the rule $b_{n+2}=3 b_{n+1}-b_{n}$ for positive integers $n$ together with the values $b_{1}=1$ and $b_{2}=2$. Find $\operatorname{gcd}\left(a_{5000}, b_{501}\right)$.
|
89. We show by induction that $a_{n}=F_{4 n-2}$ and $b_{n}=F_{2 n-1}$, where $F_{k}$ is the $k$ th Fibonacci number. The base cases are clear. As for the inductive steps, note that
$$
F_{k+2}=F_{k+1}+F_{k}=2 F_{k}+F_{k-1}=3 F_{k}-F_{k-2}
$$
and
$$
F_{k+4}=3 F_{k+2}-F_{k}=8 F_{k}+3 F_{k-2}=7 F_{k}-F_{k-4}
$$
We wish to compute the greatest common denominator of $F_{19998}$ and $F_{1001}$. The Fibonacci numbers satisfy the property that $\operatorname{gcd}\left(F_{m}, F_{n}\right)=F_{\operatorname{gcd}(m, n)}$, which can be proven by noting that they are periodic modulo any positive integer. So since $\operatorname{gcd}(19998,1001)=11$, the answer is $F_{11}=89$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n22. [12]",
"solution_match": "\nAnswer: "
}
|
c816657f-ed69-5efb-b5e5-7781553c5b57
| 608,208
|
In triangle $A B C, \angle A B C$ is obtuse. Point $D$ lies on side $A C$ such that $\angle A B D$ is right, and point $E$ lies on side $A C$ between $A$ and $D$ such that $B D$ bisects $\angle E B C$. Find $C E$, given that $A C=35, B C=7$, and $B E=5$.
|
10. Reflect $A$ and $E$ over $B D$ to $A^{\prime}$ and $E^{\prime}$ respectively. Note that the angle conditions show that $A^{\prime}$ and $E^{\prime}$ lie on $A B$ and $B C$ respectively. $B$ is the midpoint of segment $A A^{\prime}$ and $C E^{\prime}=$ $B C-B E^{\prime}=2$. Menelaus' theorem now gives
$$
\frac{C D}{D A} \cdot \frac{A A^{\prime}}{A^{\prime} B} \cdot \frac{B E^{\prime}}{E^{\prime} C}=1
$$
from which $D A=5 C D$ or $C D=A C / 6$. By the angle bisector theorem, $D E=5 C D / 7$, so that $C E=12 C D / 7=10$.
|
10
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
In triangle $A B C, \angle A B C$ is obtuse. Point $D$ lies on side $A C$ such that $\angle A B D$ is right, and point $E$ lies on side $A C$ between $A$ and $D$ such that $B D$ bisects $\angle E B C$. Find $C E$, given that $A C=35, B C=7$, and $B E=5$.
|
10. Reflect $A$ and $E$ over $B D$ to $A^{\prime}$ and $E^{\prime}$ respectively. Note that the angle conditions show that $A^{\prime}$ and $E^{\prime}$ lie on $A B$ and $B C$ respectively. $B$ is the midpoint of segment $A A^{\prime}$ and $C E^{\prime}=$ $B C-B E^{\prime}=2$. Menelaus' theorem now gives
$$
\frac{C D}{D A} \cdot \frac{A A^{\prime}}{A^{\prime} B} \cdot \frac{B E^{\prime}}{E^{\prime} C}=1
$$
from which $D A=5 C D$ or $C D=A C / 6$. By the angle bisector theorem, $D E=5 C D / 7$, so that $C E=12 C D / 7=10$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n23. [12]",
"solution_match": "\nAnswer: "
}
|
bc5fab59-c5da-5d8e-92fc-ecf5f5ce6f95
| 608,209
|
Let $x, y, n$ be positive integers with $n>1$. How many ordered triples $(x, y, n)$ of solutions are there to the equation $x^{n}-y^{n}=2^{100}$ ?
|
49. Break all possible values of $n$ into the four cases: $n=2, n=4, n>4$ and $n$ odd. By Fermat's theorem, no solutions exist for the $n=4$ case because we may write $y^{4}+\left(2^{25}\right)^{4}=x^{4}$.
We show that for $n$ odd, no solutions exist to the more general equation $x^{n}-y^{n}=2^{k}$ where $k$ is a positive integer. Assume otherwise for contradiction's sake, and suppose on the grounds of well ordering that $k$ is the least exponent for which a solution exists. Clearly $x$ and $y$ must both be even or both odd. If both are odd, we have $(x-y)\left(x^{n-1}+\ldots+y^{n-1}\right)$. The right factor of this expression contains an odd number of odd terms whose sum is an odd number greater than 1 , impossible. Similarly if $x$ and $y$ are even, write $x=2 u$ and $y=2 v$. The equation becomes $u^{n}-v^{n}=2^{k-n}$. If $k-n$ is greater than 0 , then our choice $k$ could not have been minimal. Otherwise, $k-n=0$, so that two consecutive positive integers are perfect $n$th powers, which is also absurd.
For the case that $n$ is even and greater than 4, consider the same generalization and hypotheses. Writing $n=2 m$, we find $\left(x^{m}-y^{m}\right)\left(x^{m}+y^{m}\right)=2^{k}$. Then $x^{m}-y^{m}=2^{a}<2^{k}$. By our previous work, we see that $m$ cannot be an odd integer greater than 1 . But then $m$ must also be even, contrary to the minimality of $k$.
Finally, for $n=2$ we get $x^{2}-y^{2}=2^{100}$. Factoring the left hand side gives $x-y=2^{a}$ and $x+y=2^{b}$, where implicit is $a<b$. Solving, we get $x=2^{b-1}+2^{a-1}$ and $y=2^{b-1}-2^{a-1}$, for a total of 49 solutions. Namely, those corresponding to $(a, b)=(1,99),(2,98), \cdots,(49,51)$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
49
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Let $x, y, n$ be positive integers with $n>1$. How many ordered triples $(x, y, n)$ of solutions are there to the equation $x^{n}-y^{n}=2^{100}$ ?
|
49. Break all possible values of $n$ into the four cases: $n=2, n=4, n>4$ and $n$ odd. By Fermat's theorem, no solutions exist for the $n=4$ case because we may write $y^{4}+\left(2^{25}\right)^{4}=x^{4}$.
We show that for $n$ odd, no solutions exist to the more general equation $x^{n}-y^{n}=2^{k}$ where $k$ is a positive integer. Assume otherwise for contradiction's sake, and suppose on the grounds of well ordering that $k$ is the least exponent for which a solution exists. Clearly $x$ and $y$ must both be even or both odd. If both are odd, we have $(x-y)\left(x^{n-1}+\ldots+y^{n-1}\right)$. The right factor of this expression contains an odd number of odd terms whose sum is an odd number greater than 1 , impossible. Similarly if $x$ and $y$ are even, write $x=2 u$ and $y=2 v$. The equation becomes $u^{n}-v^{n}=2^{k-n}$. If $k-n$ is greater than 0 , then our choice $k$ could not have been minimal. Otherwise, $k-n=0$, so that two consecutive positive integers are perfect $n$th powers, which is also absurd.
For the case that $n$ is even and greater than 4, consider the same generalization and hypotheses. Writing $n=2 m$, we find $\left(x^{m}-y^{m}\right)\left(x^{m}+y^{m}\right)=2^{k}$. Then $x^{m}-y^{m}=2^{a}<2^{k}$. By our previous work, we see that $m$ cannot be an odd integer greater than 1 . But then $m$ must also be even, contrary to the minimality of $k$.
Finally, for $n=2$ we get $x^{2}-y^{2}=2^{100}$. Factoring the left hand side gives $x-y=2^{a}$ and $x+y=2^{b}$, where implicit is $a<b$. Solving, we get $x=2^{b-1}+2^{a-1}$ and $y=2^{b-1}-2^{a-1}$, for a total of 49 solutions. Namely, those corresponding to $(a, b)=(1,99),(2,98), \cdots,(49,51)$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n24. [12]",
"solution_match": "\nAnswer: "
}
|
a58170f4-5d7e-5e78-b695-414bc15efe00
| 608,210
|
Two real numbers $x$ and $y$ are such that $8 y^{4}+4 x^{2} y^{2}+4 x y^{2}+2 x^{3}+2 y^{2}+2 x=x^{2}+1$. Find all possible values of $x+2 y^{2}$.
|
$\frac{\mathbf{1}}{\mathbf{2}}$. Writing $a=x+2 y^{2}$, the given quickly becomes $4 y^{2} a+2 x^{2} a+a+x=x^{2}+1$. We can rewrite $4 y^{2} a$ for further reduction to $a(2 a-2 x)+2 x^{2} a+a+x=x^{2}+1$, or
$$
2 a^{2}+\left(2 x^{2}-2 x+1\right) a+\left(-x^{2}+x-1\right)=0
$$
The quadratic formula produces the discriminant
$$
\left(2 x^{2}-2 x+1\right)^{2}+8\left(x^{2}-x+1\right)=\left(2 x^{2}-2 x+3\right)^{2},
$$
an identity that can be treated with the difference of squares, so that $a=\frac{-2 x^{2}+2 x-1 \pm\left(2 x^{2}-2 x+3\right)}{4}=$ $\frac{1}{2},-x^{2}+x-1$. Now $a$ was constructed from $x$ and $y$, so is not free. Indeed, the second expression flies in the face of the trivial inequality: $a=-x^{2}+x-1<-x^{2}+x \leq x+2 y^{2}=a$. On the other hand, $a=1 / 2$ is a bona fide solution to $\left(^{*}\right)$, which is identical to the original equation.
|
\frac{1}{2}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Two real numbers $x$ and $y$ are such that $8 y^{4}+4 x^{2} y^{2}+4 x y^{2}+2 x^{3}+2 y^{2}+2 x=x^{2}+1$. Find all possible values of $x+2 y^{2}$.
|
$\frac{\mathbf{1}}{\mathbf{2}}$. Writing $a=x+2 y^{2}$, the given quickly becomes $4 y^{2} a+2 x^{2} a+a+x=x^{2}+1$. We can rewrite $4 y^{2} a$ for further reduction to $a(2 a-2 x)+2 x^{2} a+a+x=x^{2}+1$, or
$$
2 a^{2}+\left(2 x^{2}-2 x+1\right) a+\left(-x^{2}+x-1\right)=0
$$
The quadratic formula produces the discriminant
$$
\left(2 x^{2}-2 x+1\right)^{2}+8\left(x^{2}-x+1\right)=\left(2 x^{2}-2 x+3\right)^{2},
$$
an identity that can be treated with the difference of squares, so that $a=\frac{-2 x^{2}+2 x-1 \pm\left(2 x^{2}-2 x+3\right)}{4}=$ $\frac{1}{2},-x^{2}+x-1$. Now $a$ was constructed from $x$ and $y$, so is not free. Indeed, the second expression flies in the face of the trivial inequality: $a=-x^{2}+x-1<-x^{2}+x \leq x+2 y^{2}=a$. On the other hand, $a=1 / 2$ is a bona fide solution to $\left(^{*}\right)$, which is identical to the original equation.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n25. [12]",
"solution_match": "\nAnswer: "
}
|
8c795f65-c484-58ab-8a8c-2e983ceefbbf
| 608,211
|
$A B C D$ is a cyclic quadrilateral in which $A B=4, B C=3, C D=2$, and $A D=5$. Diagonals $A C$ and $B D$ intersect at $X$. A circle $\omega$ passes through $A$ and is tangent to $B D$ at $X$. $\omega$ intersects $A B$ and $A D$ at $Y$ and $Z$ respectively. Compute $Y Z / B D$.
|
$\frac{\mathbf{1 1 5}}{\mathbf{1 4 3}}$. Denote the lengths $A B, B C, C D$, and $D A$ by $a, b, c$, and $d$ respectively. Because $A B C D$ is cyclic, $\triangle A B X \sim \triangle D C X$ and $\triangle A D X \sim \triangle B C X$. It follows that $\frac{A X}{D X}=\frac{B X}{C X}=\frac{a}{c}$ and $\frac{A X}{B X}=\frac{D X}{C X}=\frac{d}{b}$. Therefore we may write $A X=a d k, B X=a b k, C X=b c k$, and $D X=c d k$ for some $k$. Now, $\angle X D C=\angle B A X=\angle Y X B$ and $\angle D C X=\angle X B Y$, so $\triangle B X Y \sim \triangle C D X$. Thus, $X Y=$ $D X \cdot \frac{B X}{C D}=c d k \cdot \frac{a b k}{c}=a b d k^{2}$. Analogously, $X Y=a c d k^{2}$. Note that $X Y / X Z=C B / C D$. Since $\angle Y X Z=\pi-\angle Z A \stackrel{c}{Y}=\angle B C D$, we have that $\triangle X Y Z \sim \triangle C B D$. Thus, $Y Z / B D=X Y / C B=a d k^{2}$.
Finally, Ptolemy's theorem applied to $A B C D$ gives
$$
(a d+b c) k \cdot(a b+c d) k=a c+b d
$$
It follows that the answer is
$$
\frac{a d(a c+b d)}{(a b+c d)(a d+b c)}=\frac{20 \cdot 23}{22 \cdot 26}=\frac{115}{143}
$$
|
\frac{115}{143}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
$A B C D$ is a cyclic quadrilateral in which $A B=4, B C=3, C D=2$, and $A D=5$. Diagonals $A C$ and $B D$ intersect at $X$. A circle $\omega$ passes through $A$ and is tangent to $B D$ at $X$. $\omega$ intersects $A B$ and $A D$ at $Y$ and $Z$ respectively. Compute $Y Z / B D$.
|
$\frac{\mathbf{1 1 5}}{\mathbf{1 4 3}}$. Denote the lengths $A B, B C, C D$, and $D A$ by $a, b, c$, and $d$ respectively. Because $A B C D$ is cyclic, $\triangle A B X \sim \triangle D C X$ and $\triangle A D X \sim \triangle B C X$. It follows that $\frac{A X}{D X}=\frac{B X}{C X}=\frac{a}{c}$ and $\frac{A X}{B X}=\frac{D X}{C X}=\frac{d}{b}$. Therefore we may write $A X=a d k, B X=a b k, C X=b c k$, and $D X=c d k$ for some $k$. Now, $\angle X D C=\angle B A X=\angle Y X B$ and $\angle D C X=\angle X B Y$, so $\triangle B X Y \sim \triangle C D X$. Thus, $X Y=$ $D X \cdot \frac{B X}{C D}=c d k \cdot \frac{a b k}{c}=a b d k^{2}$. Analogously, $X Y=a c d k^{2}$. Note that $X Y / X Z=C B / C D$. Since $\angle Y X Z=\pi-\angle Z A \stackrel{c}{Y}=\angle B C D$, we have that $\triangle X Y Z \sim \triangle C B D$. Thus, $Y Z / B D=X Y / C B=a d k^{2}$.
Finally, Ptolemy's theorem applied to $A B C D$ gives
$$
(a d+b c) k \cdot(a b+c d) k=a c+b d
$$
It follows that the answer is
$$
\frac{a d(a c+b d)}{(a b+c d)(a d+b c)}=\frac{20 \cdot 23}{22 \cdot 26}=\frac{115}{143}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n26. [12]",
"solution_match": "\nAnswer: "
}
|
f4e88b8c-cc9e-5bb9-b560-e780378c08f7
| 608,212
|
Find the number of 7 -tuples $\left(n_{1}, \ldots, n_{7}\right)$ of integers such that
$$
\sum_{i=1}^{7} n_{i}^{6}=96957
$$
|
2688. Consider the equation in modulo 9. All perfect 6 th powers are either 0 or 1 . Since 9 divides 96957 , it must be that each $n_{i}$ is a multiple of 3 . Writing $3 a_{i}=n_{i}$ and dividing both sides by $3^{6}$, we have $a_{1}^{6}+\cdots+a_{7}^{6}=133$. Since sixth powers are nonnegative, $\left|a_{i}\right| \leq 2$. Again considering modulo 9 , we see that $a_{i} \neq 0$. Thus, $a_{i}^{6} \in\{1,64\}$. The only possibility is $133=64+64+1+1+1+1+1$, so $\left|a_{1}\right|, \ldots,\left|a_{7}\right|$ consists of 22 's and 51 's. It follows that the answer is $\binom{7}{2} \cdot 2^{7}=2688$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
2688
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find the number of 7 -tuples $\left(n_{1}, \ldots, n_{7}\right)$ of integers such that
$$
\sum_{i=1}^{7} n_{i}^{6}=96957
$$
|
2688. Consider the equation in modulo 9. All perfect 6 th powers are either 0 or 1 . Since 9 divides 96957 , it must be that each $n_{i}$ is a multiple of 3 . Writing $3 a_{i}=n_{i}$ and dividing both sides by $3^{6}$, we have $a_{1}^{6}+\cdots+a_{7}^{6}=133$. Since sixth powers are nonnegative, $\left|a_{i}\right| \leq 2$. Again considering modulo 9 , we see that $a_{i} \neq 0$. Thus, $a_{i}^{6} \in\{1,64\}$. The only possibility is $133=64+64+1+1+1+1+1$, so $\left|a_{1}\right|, \ldots,\left|a_{7}\right|$ consists of 22 's and 51 's. It follows that the answer is $\binom{7}{2} \cdot 2^{7}=2688$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n27. [12]",
"solution_match": "\nAnswer: "
}
|
9284eff6-d83b-5289-92c3-30d4c696be25
| 608,213
|
Compute the circumradius of cyclic hexagon $A B C D E F$, which has side lengths $A B=B C=$ $2, C D=D E=9$, and $E F=F A=12$.
|
8. Construct point $E^{\prime}$ on the circumcircle of $A B C D E F$ such that $D E^{\prime}=E F=12$ and $E^{\prime} F=D E=9$; then $\overline{B E^{\prime}}$ is a diameter. Let $B E^{\prime}=d$. Then $C E^{\prime}=\sqrt{B E^{\prime 2}-B C^{2}}=\sqrt{d^{2}-4}$ and $B D=\sqrt{B E^{\prime 2}-D E^{\prime 2}}=\sqrt{d^{2}-144}$. Applying Ptolemy's theorem to $B C D E^{\prime}$ now yields
$$
9 \cdot d+2 \cdot 12=\sqrt{\left(d^{2}-4\right)\left(d^{2}-144\right)}
$$
Squaring and rearranging, we find $0=d^{4}-229 d^{2}-432 d=d(d-16)\left(d^{2}+16 d+27\right)$. Since $d$ is a positive real number, $d=16$, and the circumradius is 8 .
|
8
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Compute the circumradius of cyclic hexagon $A B C D E F$, which has side lengths $A B=B C=$ $2, C D=D E=9$, and $E F=F A=12$.
|
8. Construct point $E^{\prime}$ on the circumcircle of $A B C D E F$ such that $D E^{\prime}=E F=12$ and $E^{\prime} F=D E=9$; then $\overline{B E^{\prime}}$ is a diameter. Let $B E^{\prime}=d$. Then $C E^{\prime}=\sqrt{B E^{\prime 2}-B C^{2}}=\sqrt{d^{2}-4}$ and $B D=\sqrt{B E^{\prime 2}-D E^{\prime 2}}=\sqrt{d^{2}-144}$. Applying Ptolemy's theorem to $B C D E^{\prime}$ now yields
$$
9 \cdot d+2 \cdot 12=\sqrt{\left(d^{2}-4\right)\left(d^{2}-144\right)}
$$
Squaring and rearranging, we find $0=d^{4}-229 d^{2}-432 d=d(d-16)\left(d^{2}+16 d+27\right)$. Since $d$ is a positive real number, $d=16$, and the circumradius is 8 .
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n28. [15]",
"solution_match": "\nAnswer: "
}
|
adac014a-7970-5ba8-b760-b93ddc82486c
| 608,214
|
A sequence $\left\{a_{n}\right\}_{n \geq 1}$ of positive reals is defined by the rule $a_{n+1} a_{n-1}^{5}=a_{n}^{4} a_{n-2}^{2}$ for integers $n>2$ together with the initial values $a_{1}=8$ and $a_{2}=64$ and $a_{3}=1024$. Compute
$$
\sqrt{a_{1}+\sqrt{a_{2}+\sqrt{a_{3}+\cdots}}}
$$
|
$\mathbf{3} \sqrt{\mathbf{2}}$. Taking the base- $2 \log$ of the sequence $\left\{a_{n}\right\}$ converts the multiplicative rule to a more familiar additive rule: $\log _{2}\left(a_{n+1}\right)-4 \log _{2}\left(a_{n}\right)+5 \log _{2}\left(a_{n-1}\right)-2 \log _{2}\left(a_{n-2}\right)=0$. The characteristic equation is $0=x^{3}-4 x^{2}+5 x-2=(x-1)^{2}(x-2)$, so $\log _{2}\left(a_{n}\right)$ is of the form $a \cdot n+b+c \cdot 2^{n}$ and we find $a_{n}=2^{2 n+2^{n-1}}$. Now,
$$
\sqrt{a_{1}+\sqrt{a_{2}+\sqrt{a_{3}+\cdots}}}=\sqrt{2} \cdot \sqrt{4+\sqrt{16+\sqrt{64+\cdots}}}
$$
We can estimate the new nested radical expression as 3 , which expands thus
$$
3=\sqrt{4+5}=\sqrt{4+\sqrt{16+9}}=\sqrt{4+\sqrt{16+\sqrt{64+17}}}=\cdots
$$
As a rigorous confirmation, we have $2^{k}+1=\sqrt{4^{k}+\left(2^{k+1}+1\right)}$, as desired. It follows that the answer is $3 \sqrt{2}$.
|
3 \sqrt{2}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
A sequence $\left\{a_{n}\right\}_{n \geq 1}$ of positive reals is defined by the rule $a_{n+1} a_{n-1}^{5}=a_{n}^{4} a_{n-2}^{2}$ for integers $n>2$ together with the initial values $a_{1}=8$ and $a_{2}=64$ and $a_{3}=1024$. Compute
$$
\sqrt{a_{1}+\sqrt{a_{2}+\sqrt{a_{3}+\cdots}}}
$$
|
$\mathbf{3} \sqrt{\mathbf{2}}$. Taking the base- $2 \log$ of the sequence $\left\{a_{n}\right\}$ converts the multiplicative rule to a more familiar additive rule: $\log _{2}\left(a_{n+1}\right)-4 \log _{2}\left(a_{n}\right)+5 \log _{2}\left(a_{n-1}\right)-2 \log _{2}\left(a_{n-2}\right)=0$. The characteristic equation is $0=x^{3}-4 x^{2}+5 x-2=(x-1)^{2}(x-2)$, so $\log _{2}\left(a_{n}\right)$ is of the form $a \cdot n+b+c \cdot 2^{n}$ and we find $a_{n}=2^{2 n+2^{n-1}}$. Now,
$$
\sqrt{a_{1}+\sqrt{a_{2}+\sqrt{a_{3}+\cdots}}}=\sqrt{2} \cdot \sqrt{4+\sqrt{16+\sqrt{64+\cdots}}}
$$
We can estimate the new nested radical expression as 3 , which expands thus
$$
3=\sqrt{4+5}=\sqrt{4+\sqrt{16+9}}=\sqrt{4+\sqrt{16+\sqrt{64+17}}}=\cdots
$$
As a rigorous confirmation, we have $2^{k}+1=\sqrt{4^{k}+\left(2^{k+1}+1\right)}$, as desired. It follows that the answer is $3 \sqrt{2}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n29. [15]",
"solution_match": "\nAnswer: "
}
|
a2b4e29c-77e4-55ed-b6b4-722fb2056f70
| 608,215
|
$A B C D$ is a cyclic quadrilateral in which $A B=3, B C=5, C D=6$, and $A D=10 . M, I$, and $T$ are the feet of the perpendiculars from $D$ to lines $A B, A C$, and $B C$ respectively. Determine the value of $M I / I T$.
|
$\frac{\mathbf{2 5}}{\mathbf{9}}$. Quadrilaterals $A M I D$ and $D I C T$ are cyclic, having right angles $\angle A M D, \angle A I D$, and $\angle C I D, \angle C T D$ respectively. We see that $M, I$, and $T$ are collinear. For, $m \angle M I D=\pi-m \angle D A M=$ $\pi-m \angle D A B=m \angle B C D=\pi-m \angle D C T=\pi-m \angle D I T$. Therefore, Menelaus' theorem applied to triangle $M T B$ and line $I C A$ gives
$$
\frac{M I}{I T} \cdot \frac{T C}{C B} \cdot \frac{B A}{A M}=1
$$
On the other hand, triangle $A D M$ is similar to triangle $C D T$ since $\angle A M D \cong \angle C T D$ and $\angle D A M \cong$ $\angle D C T$ and thus $A M / C T=A D / C D$. It follows that
$$
\frac{M I}{I T}=\frac{B C \cdot A M}{A B \cdot C T}=\frac{B C \cdot A D}{A B \cdot C D}=\frac{5 \cdot 10}{3 \cdot 6}=\frac{25}{9}
$$
Remarks. The line MIT, constructed in this problem by taking perpendiculars from a point on the circumcircle of $A B C$, is known as the Simson line. It is often helpful for us to use directed angles while angle chasing to avoid supplementary configuration issues, such as those arising while establishing the collinearity of $M, I$, and $T$.
## $10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
\frac{25}{9}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
$A B C D$ is a cyclic quadrilateral in which $A B=3, B C=5, C D=6$, and $A D=10 . M, I$, and $T$ are the feet of the perpendiculars from $D$ to lines $A B, A C$, and $B C$ respectively. Determine the value of $M I / I T$.
|
$\frac{\mathbf{2 5}}{\mathbf{9}}$. Quadrilaterals $A M I D$ and $D I C T$ are cyclic, having right angles $\angle A M D, \angle A I D$, and $\angle C I D, \angle C T D$ respectively. We see that $M, I$, and $T$ are collinear. For, $m \angle M I D=\pi-m \angle D A M=$ $\pi-m \angle D A B=m \angle B C D=\pi-m \angle D C T=\pi-m \angle D I T$. Therefore, Menelaus' theorem applied to triangle $M T B$ and line $I C A$ gives
$$
\frac{M I}{I T} \cdot \frac{T C}{C B} \cdot \frac{B A}{A M}=1
$$
On the other hand, triangle $A D M$ is similar to triangle $C D T$ since $\angle A M D \cong \angle C T D$ and $\angle D A M \cong$ $\angle D C T$ and thus $A M / C T=A D / C D$. It follows that
$$
\frac{M I}{I T}=\frac{B C \cdot A M}{A B \cdot C T}=\frac{B C \cdot A D}{A B \cdot C D}=\frac{5 \cdot 10}{3 \cdot 6}=\frac{25}{9}
$$
Remarks. The line MIT, constructed in this problem by taking perpendiculars from a point on the circumcircle of $A B C$, is known as the Simson line. It is often helpful for us to use directed angles while angle chasing to avoid supplementary configuration issues, such as those arising while establishing the collinearity of $M, I$, and $T$.
## $10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n30. [15]",
"solution_match": "\nAnswer: "
}
|
7b84a1b9-9d0e-56dc-bc2b-97a14efebeef
| 608,216
|
A sequence $\left\{a_{n}\right\}_{n \geq 0}$ of real numbers satisfies the recursion $a_{n+1}=a_{n}^{3}-3 a_{n}^{2}+3$ for all positive integers $n$. For how many values of $a_{0}$ does $a_{2007}=a_{0}$ ?
|
$\mathbf{3}^{\mathbf{2 0 0 7}}$. If $x$ appears in the sequence, the next term $x^{3}-3 x^{2}+3$ is the same if and only if $0=x^{3}-3 x^{2}-x+3=(x-3)(x-1)(x+1)$. Moreover, that next term is strictly larger if $x>3$ and strictly smaller if $x<-1$. It follows that no values of $a_{0}$ with $\left|a_{0}-1\right|>2$ yield $a_{0}=a_{2007}$.
Now suppose $a_{0}=a_{2007}$ and write $a_{0}=1+e^{\alpha i}+e^{-\alpha i}$; the values $a_{0}$ we seek will be in bijective correspondence with solutions $\alpha$ where $0 \leq \alpha \leq \pi$. Then
$$
a_{1}=\left(a_{0}-1\right)^{3}-3 a_{0}+4=e^{3 \alpha i}+3 e^{\alpha i}+3 e^{-\alpha i}+e^{-3 \alpha i}-3 e^{\alpha i}-3 e^{-\alpha i}-3+4=e^{3 \alpha i}+e^{-3 \alpha i}+1
$$
and an easy inductive argument gives $a_{2007}=e^{3^{2007} \alpha i}+e^{-3^{2007} \alpha i}+1$. It follows that $a_{0}=a_{2007}$ is equivalent to $\cos (\alpha)=\cos \left(3^{2007} \alpha\right)$. Now,
$$
\cos \left(3^{2007} \alpha\right)-\cos (\alpha)=2 \sin \left(\left(\frac{3^{2007}+1}{2}\right) \alpha\right) \sin \left(\left(\frac{3^{2007}-1}{2}\right) \alpha\right)
$$
so $\operatorname{since} \sin (k x)=0$ for a positive integer $k$ if and only if $x$ is a multiple of $\frac{\pi}{k}$, the solutions $\alpha$ are $\left\{0, \frac{2 \pi}{3^{2007}-1}, \frac{4 \pi}{3^{2007}-1}, \ldots, \pi\right\} \cup\left\{0, \frac{2 \pi}{3^{2007}+1}, \ldots, \pi\right\}$. Because our values $k$ are consecutive, these sets overlap only at 0 and $\pi$, so there are $3^{2007}$ distinct $\alpha$.
|
3^{2007}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
A sequence $\left\{a_{n}\right\}_{n \geq 0}$ of real numbers satisfies the recursion $a_{n+1}=a_{n}^{3}-3 a_{n}^{2}+3$ for all positive integers $n$. For how many values of $a_{0}$ does $a_{2007}=a_{0}$ ?
|
$\mathbf{3}^{\mathbf{2 0 0 7}}$. If $x$ appears in the sequence, the next term $x^{3}-3 x^{2}+3$ is the same if and only if $0=x^{3}-3 x^{2}-x+3=(x-3)(x-1)(x+1)$. Moreover, that next term is strictly larger if $x>3$ and strictly smaller if $x<-1$. It follows that no values of $a_{0}$ with $\left|a_{0}-1\right|>2$ yield $a_{0}=a_{2007}$.
Now suppose $a_{0}=a_{2007}$ and write $a_{0}=1+e^{\alpha i}+e^{-\alpha i}$; the values $a_{0}$ we seek will be in bijective correspondence with solutions $\alpha$ where $0 \leq \alpha \leq \pi$. Then
$$
a_{1}=\left(a_{0}-1\right)^{3}-3 a_{0}+4=e^{3 \alpha i}+3 e^{\alpha i}+3 e^{-\alpha i}+e^{-3 \alpha i}-3 e^{\alpha i}-3 e^{-\alpha i}-3+4=e^{3 \alpha i}+e^{-3 \alpha i}+1
$$
and an easy inductive argument gives $a_{2007}=e^{3^{2007} \alpha i}+e^{-3^{2007} \alpha i}+1$. It follows that $a_{0}=a_{2007}$ is equivalent to $\cos (\alpha)=\cos \left(3^{2007} \alpha\right)$. Now,
$$
\cos \left(3^{2007} \alpha\right)-\cos (\alpha)=2 \sin \left(\left(\frac{3^{2007}+1}{2}\right) \alpha\right) \sin \left(\left(\frac{3^{2007}-1}{2}\right) \alpha\right)
$$
so $\operatorname{since} \sin (k x)=0$ for a positive integer $k$ if and only if $x$ is a multiple of $\frac{\pi}{k}$, the solutions $\alpha$ are $\left\{0, \frac{2 \pi}{3^{2007}-1}, \frac{4 \pi}{3^{2007}-1}, \ldots, \pi\right\} \cup\left\{0, \frac{2 \pi}{3^{2007}+1}, \ldots, \pi\right\}$. Because our values $k$ are consecutive, these sets overlap only at 0 and $\pi$, so there are $3^{2007}$ distinct $\alpha$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n31. [18]",
"solution_match": "\nAnswer: "
}
|
b0a93152-63fa-505c-b745-d9716c1499c1
| 608,217
|
Triangle $A B C$ has $A B=4, B C=6$, and $A C=5$. Let $O$ denote the circumcenter of $A B C$. The circle $\Gamma$ is tangent to and surrounds the circumcircles of triangles $A O B, B O C$, and $A O C$. Determine the diameter of $\Gamma$.
|
$\frac{\mathbf{2 5 6} \sqrt{\mathbf{7}}}{\mathbf{1 7}}$. Denote by $\omega, \Gamma_{1}, \Gamma_{2}$, and $\Gamma_{3}$ the circumcenters of triangles $A B C, B O C, C O A$, and $A O B$, respectively. An inversion about $\omega$ interchanges $\Gamma_{1}$ and line $B C, \Gamma_{2}$ and line $C A$, and $\Gamma_{3}$ and line $A B$. This inversion also preserves tangency between generalized circles, so the image of $\Gamma$ is a circle tangent to $A B, B C$, and $C A$. It is the incircle of $A B C$ because it is closer to $O$ than these lines and $A B C$ is acute.
Now we run a few standard calculations. Where $s, r$, and $R$ denote the semiperimeter, inradius, and circumradius of $A B C$, respectively, we have the following:
$$
\begin{aligned}
& {[A B C]=\sqrt{s(s-a)(s-b)(s-c)}=\frac{15 \sqrt{7}}{4}} \\
& r=[A B C] / s=\sqrt{7} / 2 \\
& R=\frac{a b c}{4[A B C]}=\frac{8}{\sqrt{7}} \\
& O I^{2}=R(R-2 r)=\frac{8}{7}
\end{aligned}
$$
Let $O I$ intersect the incircle of $A B C$ at $P$ and $Q$, with $I$ between $P$ and $O$. Then $O P=r+O I$ and $O Q=r-O I$, and $\overline{P Q}$ is a diameter. Under the inversion, $P$ and $Q$ map to $P^{\prime}$ and $Q^{\prime}$ respectively. Because $P, I, O$, and $Q$ are collinear in that order, $P^{\prime}$ and $Q^{\prime}$ are diametrically opposed on $\Gamma$. It follows that the diameter of $\Gamma$ is
$$
P^{\prime} Q^{\prime}=O P^{\prime}+O Q^{\prime}=\frac{R^{2}}{O P}+\frac{R^{2}}{O Q}=R^{2}\left(\frac{1}{r+O I}+\frac{1}{r-O I}\right)=\frac{2 r R^{2}}{r^{2}-O I^{2}} .
$$
We plug in the values found above to arrive at $\frac{256 \sqrt{7}}{17}$.
|
\frac{256 \sqrt{7}}{17}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Triangle $A B C$ has $A B=4, B C=6$, and $A C=5$. Let $O$ denote the circumcenter of $A B C$. The circle $\Gamma$ is tangent to and surrounds the circumcircles of triangles $A O B, B O C$, and $A O C$. Determine the diameter of $\Gamma$.
|
$\frac{\mathbf{2 5 6} \sqrt{\mathbf{7}}}{\mathbf{1 7}}$. Denote by $\omega, \Gamma_{1}, \Gamma_{2}$, and $\Gamma_{3}$ the circumcenters of triangles $A B C, B O C, C O A$, and $A O B$, respectively. An inversion about $\omega$ interchanges $\Gamma_{1}$ and line $B C, \Gamma_{2}$ and line $C A$, and $\Gamma_{3}$ and line $A B$. This inversion also preserves tangency between generalized circles, so the image of $\Gamma$ is a circle tangent to $A B, B C$, and $C A$. It is the incircle of $A B C$ because it is closer to $O$ than these lines and $A B C$ is acute.
Now we run a few standard calculations. Where $s, r$, and $R$ denote the semiperimeter, inradius, and circumradius of $A B C$, respectively, we have the following:
$$
\begin{aligned}
& {[A B C]=\sqrt{s(s-a)(s-b)(s-c)}=\frac{15 \sqrt{7}}{4}} \\
& r=[A B C] / s=\sqrt{7} / 2 \\
& R=\frac{a b c}{4[A B C]}=\frac{8}{\sqrt{7}} \\
& O I^{2}=R(R-2 r)=\frac{8}{7}
\end{aligned}
$$
Let $O I$ intersect the incircle of $A B C$ at $P$ and $Q$, with $I$ between $P$ and $O$. Then $O P=r+O I$ and $O Q=r-O I$, and $\overline{P Q}$ is a diameter. Under the inversion, $P$ and $Q$ map to $P^{\prime}$ and $Q^{\prime}$ respectively. Because $P, I, O$, and $Q$ are collinear in that order, $P^{\prime}$ and $Q^{\prime}$ are diametrically opposed on $\Gamma$. It follows that the diameter of $\Gamma$ is
$$
P^{\prime} Q^{\prime}=O P^{\prime}+O Q^{\prime}=\frac{R^{2}}{O P}+\frac{R^{2}}{O Q}=R^{2}\left(\frac{1}{r+O I}+\frac{1}{r-O I}\right)=\frac{2 r R^{2}}{r^{2}-O I^{2}} .
$$
We plug in the values found above to arrive at $\frac{256 \sqrt{7}}{17}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n32. [18]",
"solution_match": "\nAnswer: "
}
|
89d1e409-4eb2-5705-92f4-4670a759a6c0
| 608,218
|
Compute
$$
\int_{1}^{2} \frac{9 x+4}{x^{5}+3 x^{2}+x} d x
$$
(No, your TI-89 doesn't know how to do this one. Yes, the end is near.)
|
$\ln \frac{\mathbf{8 0}}{\mathbf{2 3}}$. We break the given integral into two pieces:
$$
\int_{1}^{2} \frac{9 x+4}{x^{5}+3 x^{2}+x} d x=5 \int_{1}^{2} \frac{x^{4}+3 x+1}{x^{5}+3 x^{2}+x} d x-\int_{1}^{2} \frac{5 x^{4}+6 x+1}{x^{5}+3 x^{2}+x} d x
$$
These two new integrals are easily computed; for, the first integrand reduces to $1 / x$ and the second is of the form $f^{\prime}(x) / f(x)$. We obtain
$$
\left[5 \ln |x|-\ln \left|x^{5}+3 x^{2}+x\right|\right]_{1}^{2}=\ln 32-\ln 46+\ln 5=\ln \frac{80}{23}
$$
Motivation. Writing $f(x)=9 x+4$ and $g(x)=x^{5}+3 x^{2}+x=x\left(x^{4}+3 x+1\right)$, we wish to find the antiderivative of $f(x) / g(x)$. It makes sense to consider other rational functions with denominator $g(x)$ that have an exact antiderivative. Clearly, if the numerator were $f_{1}(x)=x^{4}+3 x+1$ or a constant multiple, then we can integrate the function. Another trivial case is if the numerator were $f_{2}(x)=g^{\prime}(x)=5 x^{4}+6 x+1$ or a constant multiple. Guessing that $f(x)$ is a linear combination of $f_{1}(x)$ and $f_{2}(x)$, we easily find that $f(x)=9 x+4=5 f_{1}(x)-f_{2}(x)$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
\ln \frac{80}{23}
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
Compute
$$
\int_{1}^{2} \frac{9 x+4}{x^{5}+3 x^{2}+x} d x
$$
(No, your TI-89 doesn't know how to do this one. Yes, the end is near.)
|
$\ln \frac{\mathbf{8 0}}{\mathbf{2 3}}$. We break the given integral into two pieces:
$$
\int_{1}^{2} \frac{9 x+4}{x^{5}+3 x^{2}+x} d x=5 \int_{1}^{2} \frac{x^{4}+3 x+1}{x^{5}+3 x^{2}+x} d x-\int_{1}^{2} \frac{5 x^{4}+6 x+1}{x^{5}+3 x^{2}+x} d x
$$
These two new integrals are easily computed; for, the first integrand reduces to $1 / x$ and the second is of the form $f^{\prime}(x) / f(x)$. We obtain
$$
\left[5 \ln |x|-\ln \left|x^{5}+3 x^{2}+x\right|\right]_{1}^{2}=\ln 32-\ln 46+\ln 5=\ln \frac{80}{23}
$$
Motivation. Writing $f(x)=9 x+4$ and $g(x)=x^{5}+3 x^{2}+x=x\left(x^{4}+3 x+1\right)$, we wish to find the antiderivative of $f(x) / g(x)$. It makes sense to consider other rational functions with denominator $g(x)$ that have an exact antiderivative. Clearly, if the numerator were $f_{1}(x)=x^{4}+3 x+1$ or a constant multiple, then we can integrate the function. Another trivial case is if the numerator were $f_{2}(x)=g^{\prime}(x)=5 x^{4}+6 x+1$ or a constant multiple. Guessing that $f(x)$ is a linear combination of $f_{1}(x)$ and $f_{2}(x)$, we easily find that $f(x)=9 x+4=5 f_{1}(x)-f_{2}(x)$.
$10^{\text {th }}$ HARVARD-MIT MATHEMATICS TOURNAMENT, 24 FEBRUARY 2007 - GUTS ROUND
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n33. [18]",
"solution_match": "\nAnswer: "
}
|
87dacad2-1736-5753-8187-815aa3d2a0a3
| 608,219
|
The Game. Eric and Greg are watching their new favorite TV show, The Price is Right. Bob Barker recently raised the intellectual level of his program, and he begins the latest installment with bidding on following question: How many Carmichael numbers are there less than 100,000?
Each team is to list one nonnegative integer not greater than 100,000. Let $X$ denote the answer to Bob's question. The teams listing $N$, a maximal bid (of those submitted) not greater than $X$, will receive $N$ points, and all other teams will neither receive nor lose points. (A Carmichael number is an odd composite integer $n$ such that $n$ divides $a^{n-1}-1$ for all integers $a$ relatively prime to $n$ with $1<a<n$.)
|
16? There are 16 such numbers: 561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, $29341,41041,46657,52633,62745,63973$, and 75361 . The next, 101101 , is too large to be counted. Their distribution is considerably more subtle than that of the primes, and it was only recently proven that there are infinitely many Carmichael numbers. For sufficiently large $n, C(n)>n^{2 / 7}$, although this bound has been subsequently improved. (For details, see Alford, W. R.; Granville, A.; and Pomerance, C. "There are Infinitely Many Carmichael Numbers." Annals of Mathematics. 139 (1994), 703-722.) The expectation is that teams are unable to determine that $X=16$; otherwise, the obvious dominant play is listing 16. The Problem Czar, anticipating that teams will attempt to deduce $X$ by considering the point values of the other problems in the triplet, has chosen a value $X$ that is considerably lower. Teams may of course speculate whether this action has been taken, and to what extent, etc... On the actual TV show, many contestants win by guessing prices of 1 , or other numbers dramatically lower than the actual price. This strategy is enhanced because of the show's ordered bidding, and will be more difficult here. It will be interesting to see the submissions.
|
16
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
The Game. Eric and Greg are watching their new favorite TV show, The Price is Right. Bob Barker recently raised the intellectual level of his program, and he begins the latest installment with bidding on following question: How many Carmichael numbers are there less than 100,000?
Each team is to list one nonnegative integer not greater than 100,000. Let $X$ denote the answer to Bob's question. The teams listing $N$, a maximal bid (of those submitted) not greater than $X$, will receive $N$ points, and all other teams will neither receive nor lose points. (A Carmichael number is an odd composite integer $n$ such that $n$ divides $a^{n-1}-1$ for all integers $a$ relatively prime to $n$ with $1<a<n$.)
|
16? There are 16 such numbers: 561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, $29341,41041,46657,52633,62745,63973$, and 75361 . The next, 101101 , is too large to be counted. Their distribution is considerably more subtle than that of the primes, and it was only recently proven that there are infinitely many Carmichael numbers. For sufficiently large $n, C(n)>n^{2 / 7}$, although this bound has been subsequently improved. (For details, see Alford, W. R.; Granville, A.; and Pomerance, C. "There are Infinitely Many Carmichael Numbers." Annals of Mathematics. 139 (1994), 703-722.) The expectation is that teams are unable to determine that $X=16$; otherwise, the obvious dominant play is listing 16. The Problem Czar, anticipating that teams will attempt to deduce $X$ by considering the point values of the other problems in the triplet, has chosen a value $X$ that is considerably lower. Teams may of course speculate whether this action has been taken, and to what extent, etc... On the actual TV show, many contestants win by guessing prices of 1 , or other numbers dramatically lower than the actual price. This strategy is enhanced because of the show's ordered bidding, and will be more difficult here. It will be interesting to see the submissions.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n34. [?]",
"solution_match": "\nAnswer: "
}
|
37d1800b-5d40-5395-9980-4c31dc14e354
| 608,220
|
The Algorithm. There are thirteen broken computers situated at the following set $S$ of thirteen points in the plane:
$$
\begin{array}{lll}
A=(1,10) & B=(976,9) & C=(666,87) \\
D=(377,422) & E=(535,488) & F=(775,488) \\
G=(941,500) & H=(225,583) & I=(388,696) \\
J=(3,713) & K=(504,872) & L=(560,934) \\
& M=(22,997) &
\end{array}
$$
At time $t=0$, a repairman begins moving from one computer to the next, traveling continuously in straight lines at unit speed. Assuming the repairman begins and $A$ and fixes computers instantly, what path does he take to minimize the total downtime of the computers? List the points he visits in order. Your score will be $\left\lfloor\frac{N}{40}\right\rfloor$, where
$$
N=1000+\lfloor\text { the optimal downtime }\rfloor-\lfloor\text { your downtime }\rfloor,
$$
or 0 , whichever is greater. By total downtime we mean the sum
$$
\sum_{P \in S} t_{P}
$$
where $t_{P}$ is the time at which the repairman reaches $P$.
|
ADHIKLEFGBCJM. This is an instance of the minimum-latency problem, which is at least NP-hard. There is an easy $O(n!)$ algorithm, but this is unavailable to teams on computational grounds ( 100 MHz calculators used to seem fast...) The best strategy may be drawing an accurate picture and exercising geometric intuition. The distribution of the points somewhat resembles a short, four-pronged fork with its outermost prongs bent apart; it is plausible to assume that the optimal order respects this shape. The optimal downtime is 24113.147907 , realized by ADHIKLEFGBCJM, though a number of others also receive positive marks.
|
24113.147907
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
The Algorithm. There are thirteen broken computers situated at the following set $S$ of thirteen points in the plane:
$$
\begin{array}{lll}
A=(1,10) & B=(976,9) & C=(666,87) \\
D=(377,422) & E=(535,488) & F=(775,488) \\
G=(941,500) & H=(225,583) & I=(388,696) \\
J=(3,713) & K=(504,872) & L=(560,934) \\
& M=(22,997) &
\end{array}
$$
At time $t=0$, a repairman begins moving from one computer to the next, traveling continuously in straight lines at unit speed. Assuming the repairman begins and $A$ and fixes computers instantly, what path does he take to minimize the total downtime of the computers? List the points he visits in order. Your score will be $\left\lfloor\frac{N}{40}\right\rfloor$, where
$$
N=1000+\lfloor\text { the optimal downtime }\rfloor-\lfloor\text { your downtime }\rfloor,
$$
or 0 , whichever is greater. By total downtime we mean the sum
$$
\sum_{P \in S} t_{P}
$$
where $t_{P}$ is the time at which the repairman reaches $P$.
|
ADHIKLEFGBCJM. This is an instance of the minimum-latency problem, which is at least NP-hard. There is an easy $O(n!)$ algorithm, but this is unavailable to teams on computational grounds ( 100 MHz calculators used to seem fast...) The best strategy may be drawing an accurate picture and exercising geometric intuition. The distribution of the points somewhat resembles a short, four-pronged fork with its outermost prongs bent apart; it is plausible to assume that the optimal order respects this shape. The optimal downtime is 24113.147907 , realized by ADHIKLEFGBCJM, though a number of others also receive positive marks.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n35. [ $\\leq \\mathbf{2 5}]$",
"solution_match": "\nAnswer: "
}
|
864f1b26-a3ae-5e52-9fba-00ed5cd0081a
| 608,221
|
The Marathon. Let $\omega$ denote the incircle of triangle $A B C$. The segments $B C, C A$, and $A B$ are tangent to $\omega$ at $D, E$, and $F$, respectively. Point $P$ lies on $E F$ such that segment $P D$ is perpendicular to $B C$. The line $A P$ intersects $B C$ at $Q$. The circles $\omega_{1}$ and $\omega_{2}$ pass through $B$ and $C$, respectively, and are tangent to $A Q$ at $Q$; the former meets $A B$ again at $X$, and the latter meets $A C$ again at $Y$. The line $X Y$ intersects $B C$ at $Z$. Given that $A B=15, B C=14$, and $C A=13$, find $\lfloor X Z \cdot Y Z\rfloor$.
|
101. Construct $D^{\prime}$ diametrically opposed to $D$, so that $\angle D F D^{\prime}$ and $\angle D E D^{\prime}$ are right, and note that $P$ lies on $D D^{\prime}$. By standard angle chasing, $m \angle F D D^{\prime}=\beta$ (half angle $B$ ) and $m \angle D^{\prime} D E=\gamma$. Thus, $m \angle D D^{\prime} F=90^{\circ}-\beta$ and $m \angle E D^{\prime} D=90^{\circ}-\gamma$. Then by the law of sines, $D E: E D^{\prime}: D^{\prime} F$ : $F D=\cos (\gamma): \sin (\gamma): \sin (\beta): \sin (\gamma)$. Now using $\triangle D E P \sim \triangle F D^{\prime} P$ and $\triangle D F P \sim \triangle E D^{\prime} P$, we have
$$
\frac{E P}{P F}=\frac{E D \cdot E D^{\prime}}{F D \cdot F D^{\prime}}=\frac{\sin (\gamma) \cos (\gamma)}{\sin (\beta) \sin (\beta)}=\frac{c}{b}
$$
Let the dilation centered at $A$ sending $E$ to $C$ map $P$ and $F$ to $P^{\prime}$ and $F^{\prime}$, respectively. Note that $A F^{\prime}=A C$ as $A E$ and $A F$ are equal tangents, and $C P^{\prime}: P^{\prime} F^{\prime}=E P: P F=c: b$ by similarity. Then by Menelaus' theorem,
$$
1=\frac{B Q}{Q C} \frac{C P^{\prime}}{P^{\prime} F^{\prime}} \frac{F^{\prime} A}{A B}=\frac{B Q}{Q C} \frac{c}{b} \frac{b}{c}
$$
so that $B Q=Q C$ and $A Q$ is actually a median. So, $A Q^{2}=\frac{1}{4}\left(2 b^{2}+2 c^{2}-a^{2}\right)=148$. Now by Power of a Point, $A B \cdot A X=A Q^{2}=A C \cdot A Y$, so $A X=148 / 15$ and $A Y=148 / 13$. Moreover, $B X C Y$ is cyclic as $\triangle A B C \sim \triangle A Y X$. Thus, $X Z \cdot Y Z=B Z \cdot C Z$, and it suffices to compute $B Z / C Z$. Menelaus once more gives
$$
1=\frac{B Z}{Z C} \frac{C Y}{Y A} \frac{A X}{X B}
$$
whence, $B Z / C Z=(A Y / A X)(B X / C Y)=(15 / 13)((77 \cdot 13) /(21 \cdot 15))=11 / 3$. We write $C Z=3 d$ and $B Z=11 d$. Because $A X<A B$ and $A Y<A C, Z$ does not lie on segment $B C$. Given the configuration information, $B C=8 d=14$, so $d=7 / 4$, and finally $\lfloor B Z \cdot C Z\rfloor=\left\lfloor 33 d^{2}\right\rfloor=\left\lfloor\frac{1617}{16}\right\rfloor=101$.
|
101
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
The Marathon. Let $\omega$ denote the incircle of triangle $A B C$. The segments $B C, C A$, and $A B$ are tangent to $\omega$ at $D, E$, and $F$, respectively. Point $P$ lies on $E F$ such that segment $P D$ is perpendicular to $B C$. The line $A P$ intersects $B C$ at $Q$. The circles $\omega_{1}$ and $\omega_{2}$ pass through $B$ and $C$, respectively, and are tangent to $A Q$ at $Q$; the former meets $A B$ again at $X$, and the latter meets $A C$ again at $Y$. The line $X Y$ intersects $B C$ at $Z$. Given that $A B=15, B C=14$, and $C A=13$, find $\lfloor X Z \cdot Y Z\rfloor$.
|
101. Construct $D^{\prime}$ diametrically opposed to $D$, so that $\angle D F D^{\prime}$ and $\angle D E D^{\prime}$ are right, and note that $P$ lies on $D D^{\prime}$. By standard angle chasing, $m \angle F D D^{\prime}=\beta$ (half angle $B$ ) and $m \angle D^{\prime} D E=\gamma$. Thus, $m \angle D D^{\prime} F=90^{\circ}-\beta$ and $m \angle E D^{\prime} D=90^{\circ}-\gamma$. Then by the law of sines, $D E: E D^{\prime}: D^{\prime} F$ : $F D=\cos (\gamma): \sin (\gamma): \sin (\beta): \sin (\gamma)$. Now using $\triangle D E P \sim \triangle F D^{\prime} P$ and $\triangle D F P \sim \triangle E D^{\prime} P$, we have
$$
\frac{E P}{P F}=\frac{E D \cdot E D^{\prime}}{F D \cdot F D^{\prime}}=\frac{\sin (\gamma) \cos (\gamma)}{\sin (\beta) \sin (\beta)}=\frac{c}{b}
$$
Let the dilation centered at $A$ sending $E$ to $C$ map $P$ and $F$ to $P^{\prime}$ and $F^{\prime}$, respectively. Note that $A F^{\prime}=A C$ as $A E$ and $A F$ are equal tangents, and $C P^{\prime}: P^{\prime} F^{\prime}=E P: P F=c: b$ by similarity. Then by Menelaus' theorem,
$$
1=\frac{B Q}{Q C} \frac{C P^{\prime}}{P^{\prime} F^{\prime}} \frac{F^{\prime} A}{A B}=\frac{B Q}{Q C} \frac{c}{b} \frac{b}{c}
$$
so that $B Q=Q C$ and $A Q$ is actually a median. So, $A Q^{2}=\frac{1}{4}\left(2 b^{2}+2 c^{2}-a^{2}\right)=148$. Now by Power of a Point, $A B \cdot A X=A Q^{2}=A C \cdot A Y$, so $A X=148 / 15$ and $A Y=148 / 13$. Moreover, $B X C Y$ is cyclic as $\triangle A B C \sim \triangle A Y X$. Thus, $X Z \cdot Y Z=B Z \cdot C Z$, and it suffices to compute $B Z / C Z$. Menelaus once more gives
$$
1=\frac{B Z}{Z C} \frac{C Y}{Y A} \frac{A X}{X B}
$$
whence, $B Z / C Z=(A Y / A X)(B X / C Y)=(15 / 13)((77 \cdot 13) /(21 \cdot 15))=11 / 3$. We write $C Z=3 d$ and $B Z=11 d$. Because $A X<A B$ and $A Y<A C, Z$ does not lie on segment $B C$. Given the configuration information, $B C=8 d=14$, so $d=7 / 4$, and finally $\lfloor B Z \cdot C Z\rfloor=\left\lfloor 33 d^{2}\right\rfloor=\left\lfloor\frac{1617}{16}\right\rfloor=101$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-guts-solutions.jsonl",
"problem_match": "\n36. [25]",
"solution_match": "\nAnswer: "
}
|
ea23dd4a-131e-5cdd-b363-e53ed403274d
| 608,222
|
Solve for the positive integer(s) $n$ such that $\phi\left(n^{2}\right)=1000 \phi(n)$.
|
The unique solution is $n=1000$. For, $\phi(p n)=p \phi(n)$ for every prime $p$ dividing $n$, so that $\phi\left(n^{2}\right)=n \phi(n)$ for all positive integers $n$.
|
1000
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Solve for the positive integer(s) $n$ such that $\phi\left(n^{2}\right)=1000 \phi(n)$.
|
The unique solution is $n=1000$. For, $\phi(p n)=p \phi(n)$ for every prime $p$ dividing $n$, so that $\phi\left(n^{2}\right)=n \phi(n)$ for all positive integers $n$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team1-solutions.jsonl",
"problem_match": "\n2. [20]",
"solution_match": "\nSolution. "
}
|
1a610ab9-f648-56af-8cdd-25c4c3513dff
| 608,224
|
Find the sum of the positive integer divisors of $2^{2007}$.
|
$\mathbf{2}^{\mathbf{2 0 0 8}}-\mathbf{1}$. The divisors are the powers of two not exceeding $2^{2007}$. So the sum is
$1+2+2^{2}+\cdots+2^{2007}=-1+2+2+2^{2}+\cdots+2^{2007}=-1+2^{2}+2^{2}+\cdots+2^{2007}=\cdots=-1+2^{2008}$.
|
2^{2008}-1
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find the sum of the positive integer divisors of $2^{2007}$.
|
$\mathbf{2}^{\mathbf{2 0 0 8}}-\mathbf{1}$. The divisors are the powers of two not exceeding $2^{2007}$. So the sum is
$1+2+2^{2}+\cdots+2^{2007}=-1+2+2+2^{2}+\cdots+2^{2007}=-1+2^{2}+2^{2}+\cdots+2^{2007}=\cdots=-1+2^{2008}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n1. [20]",
"solution_match": "\nAnswer: "
}
|
ac694573-06db-5da0-b91b-d7f1b091fa6c
| 608,236
|
The four sides of quadrilateral $A B C D$ are equal in length. Determine the perimeter of $A B C D$ given that it has area 120 and $A C=10$.
|
52. Let $M$ be the midpoint of $A C$. Then triangles $A M B, B M C, C M D$, and $D M A$ are all right triangles having legs 5 and $h$ for some $h$. The area of $A B C D$ is 120 , but also $4 \cdot\left(\frac{1}{2} \cdot 5 \cdot h\right)=10 h$, so $h=12$. Then $A B=B C=C D=D A=\sqrt{12^{2}+5^{2}}=13$, and the perimeter of $A B C D$ is 52 .
|
52
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
The four sides of quadrilateral $A B C D$ are equal in length. Determine the perimeter of $A B C D$ given that it has area 120 and $A C=10$.
|
52. Let $M$ be the midpoint of $A C$. Then triangles $A M B, B M C, C M D$, and $D M A$ are all right triangles having legs 5 and $h$ for some $h$. The area of $A B C D$ is 120 , but also $4 \cdot\left(\frac{1}{2} \cdot 5 \cdot h\right)=10 h$, so $h=12$. Then $A B=B C=C D=D A=\sqrt{12^{2}+5^{2}}=13$, and the perimeter of $A B C D$ is 52 .
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n2. [20]",
"solution_match": "\nAnswer: "
}
|
46bd3d7a-71c7-50a6-a784-12dc61f9b349
| 608,237
|
Five people are crowding into a booth against a wall at a noisy restaurant. If at most three can fit on one side, how many seating arrangements accomodate them all?
|
240. Three people will sit on one side and two sit on the other, giving a factor of two. Then there are 5 ! ways to permute the people.
|
240
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Five people are crowding into a booth against a wall at a noisy restaurant. If at most three can fit on one side, how many seating arrangements accomodate them all?
|
240. Three people will sit on one side and two sit on the other, giving a factor of two. Then there are 5 ! ways to permute the people.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n3. [20]",
"solution_match": "\nAnswer: "
}
|
a9aa4525-8774-5c7d-9e71-f40edc0698ea
| 608,238
|
Thomas and Michael are just two people in a large pool of well qualified candidates for appointment to a problem writing committee for a prestigious college math contest. It is 40 times more likely that both will serve if the size of the committee is increased from its traditional 3 members to a whopping $n$ members. Determine $n$. (Each person in the pool is equally likely to be chosen.)
|
16. Suppose there are $k$ candidates. Then the probability that both serve on a 3 membered committee is $(k-2) /\binom{k}{3}$, and the odds that both serve on an $n$ membered committee are $\binom{k-2}{n-2} /\binom{k}{n}$. The ratio of the latter to the former is
$$
\frac{\binom{k}{3}\binom{k-2}{n-2}}{(k-2)\binom{k}{n}}=\frac{k!(k-2)!1!(k-3)!n!(k-n)!}{k!(k-2)!(n-2)!(k-n)!3!(k-3)!}=\frac{n \cdot(n-1)}{3!}
$$
Solving $n \cdot(n-1)=240$ produces $n=16,-15$, and we discard the latter.
|
16
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Thomas and Michael are just two people in a large pool of well qualified candidates for appointment to a problem writing committee for a prestigious college math contest. It is 40 times more likely that both will serve if the size of the committee is increased from its traditional 3 members to a whopping $n$ members. Determine $n$. (Each person in the pool is equally likely to be chosen.)
|
16. Suppose there are $k$ candidates. Then the probability that both serve on a 3 membered committee is $(k-2) /\binom{k}{3}$, and the odds that both serve on an $n$ membered committee are $\binom{k-2}{n-2} /\binom{k}{n}$. The ratio of the latter to the former is
$$
\frac{\binom{k}{3}\binom{k-2}{n-2}}{(k-2)\binom{k}{n}}=\frac{k!(k-2)!1!(k-3)!n!(k-n)!}{k!(k-2)!(n-2)!(k-n)!3!(k-3)!}=\frac{n \cdot(n-1)}{3!}
$$
Solving $n \cdot(n-1)=240$ produces $n=16,-15$, and we discard the latter.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n4. [20]",
"solution_match": "\nAnswer: "
}
|
8e95b3f9-7bf6-5dd3-9a0e-66af6b482314
| 608,239
|
The curves $y=x^{2}(x-3)^{2}$ and $y=\left(x^{2}-1\right)(x-2)$ intersect at a number of points in the real plane. Determine the sum of the $x$-coordinates of these points of intersection.
|
7. Because the first curve touches the $x$-axis at $x=0$ and $x=3$ while the second curve crosses the $x$-axis at $x= \pm 1$ and $x=2$, there are four points of intersection. In particular, the points of intersection have $x$-coordinates determined by the difference of the two curves:
$$
0=x^{2}(x-3)^{2}-\left(x^{2}-1\right)(x-2)=\left(x^{4}-6 x^{3}+\cdots\right)-\left(x^{3}+\cdots\right)=x^{4}-7 x^{3}+\cdots
$$
We need only the first two coefficients to determine $x_{1}+x_{2}+x_{3}+x_{4}=-\left(\frac{-7}{1}\right)=7$.
|
7
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
The curves $y=x^{2}(x-3)^{2}$ and $y=\left(x^{2}-1\right)(x-2)$ intersect at a number of points in the real plane. Determine the sum of the $x$-coordinates of these points of intersection.
|
7. Because the first curve touches the $x$-axis at $x=0$ and $x=3$ while the second curve crosses the $x$-axis at $x= \pm 1$ and $x=2$, there are four points of intersection. In particular, the points of intersection have $x$-coordinates determined by the difference of the two curves:
$$
0=x^{2}(x-3)^{2}-\left(x^{2}-1\right)(x-2)=\left(x^{4}-6 x^{3}+\cdots\right)-\left(x^{3}+\cdots\right)=x^{4}-7 x^{3}+\cdots
$$
We need only the first two coefficients to determine $x_{1}+x_{2}+x_{3}+x_{4}=-\left(\frac{-7}{1}\right)=7$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n5. [20]",
"solution_match": "\nAnswer: "
}
|
2c4c7f91-e527-5802-91a4-8d827803e252
| 608,240
|
Andrew has a fair six sided die labeled with 1 through 6 as usual. He tosses it repeatedly, and on every third roll writes down the number facing up as long as it is not the 6 . He stops as soon as the last two numbers he has written down are squares or one is a prime and the other is a square. What is the probability that he stops after writing squares consecutively?
|
$4 / \mathbf{2 5}$. We can safely ignore all of the rolls he doesn't record. The probability that he stops after writing two squares consecutively is the same as the probability that he never rolls a prime. For, as soon as the first prime is written, either it must have been preceded by a square or it will be followed by a nonnegative number of additional primes and then a square. So we want the probability that two numbers chosen uniformly with replacement from $\{1,2,3,4,5\}$ are both squares, which is $(2 / 5)^{2}$.
|
\frac{4}{25}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Andrew has a fair six sided die labeled with 1 through 6 as usual. He tosses it repeatedly, and on every third roll writes down the number facing up as long as it is not the 6 . He stops as soon as the last two numbers he has written down are squares or one is a prime and the other is a square. What is the probability that he stops after writing squares consecutively?
|
$4 / \mathbf{2 5}$. We can safely ignore all of the rolls he doesn't record. The probability that he stops after writing two squares consecutively is the same as the probability that he never rolls a prime. For, as soon as the first prime is written, either it must have been preceded by a square or it will be followed by a nonnegative number of additional primes and then a square. So we want the probability that two numbers chosen uniformly with replacement from $\{1,2,3,4,5\}$ are both squares, which is $(2 / 5)^{2}$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n6. [20]",
"solution_match": "\nAnswer: "
}
|
4061e926-12a7-547f-84a0-eaf865e67018
| 608,241
|
Three positive reals $x, y$, and $z$ are such that
$$
\begin{aligned}
x^{2}+2(y-1)(z-1) & =85 \\
y^{2}+2(z-1)(x-1) & =84 \\
z^{2}+2(x-1)(y-1) & =89
\end{aligned}
$$
Compute $x+y+z$.
|
18. Add the three equations to obtain
$$
x^{2}+y^{2}+z^{2}+2 x y+2 y z+2 z x-4 x-4 y-4 z+6=258
$$
which rewrites as $(x+y+z-2)^{2}=256$. Evidently, $x+y+z=2 \pm 16$. Since $x, y$, and $z$ are positive, $x+y+z>0$ so $x+y+z=2+16=18$.
|
18
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Three positive reals $x, y$, and $z$ are such that
$$
\begin{aligned}
x^{2}+2(y-1)(z-1) & =85 \\
y^{2}+2(z-1)(x-1) & =84 \\
z^{2}+2(x-1)(y-1) & =89
\end{aligned}
$$
Compute $x+y+z$.
|
18. Add the three equations to obtain
$$
x^{2}+y^{2}+z^{2}+2 x y+2 y z+2 z x-4 x-4 y-4 z+6=258
$$
which rewrites as $(x+y+z-2)^{2}=256$. Evidently, $x+y+z=2 \pm 16$. Since $x, y$, and $z$ are positive, $x+y+z>0$ so $x+y+z=2+16=18$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n7. [20]",
"solution_match": "\nAnswer: "
}
|
39bcdf9c-c563-5242-816a-f75762275b45
| 608,242
|
Find the positive real number(s) $x$ such that $\frac{1}{2}\left(3 x^{2}-1\right)=\left(x^{2}-50 x-10\right)\left(x^{2}+25 x+5\right)$.
|
$\mathbf{2 5}+\mathbf{2} \sqrt{\mathbf{1 5 9}}$. Write $a=x^{2}-50 x-10$ and $b=x^{2}+25 x+5$; the given becomes $\frac{a+2 b-1}{2}=a b$, so $0=2 a b-a-2 b+1=(a-1)(2 b-1)$. Then $a-1=x^{2}-50 x-11=0$ or $2 b-1=2 x^{2}+50 x+9=0$. The former has a positive root, $x=25+2 \sqrt{159}$, while the latter cannot, for obvious reasons.
|
25+2 \sqrt{159}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Find the positive real number(s) $x$ such that $\frac{1}{2}\left(3 x^{2}-1\right)=\left(x^{2}-50 x-10\right)\left(x^{2}+25 x+5\right)$.
|
$\mathbf{2 5}+\mathbf{2} \sqrt{\mathbf{1 5 9}}$. Write $a=x^{2}-50 x-10$ and $b=x^{2}+25 x+5$; the given becomes $\frac{a+2 b-1}{2}=a b$, so $0=2 a b-a-2 b+1=(a-1)(2 b-1)$. Then $a-1=x^{2}-50 x-11=0$ or $2 b-1=2 x^{2}+50 x+9=0$. The former has a positive root, $x=25+2 \sqrt{159}$, while the latter cannot, for obvious reasons.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n8. [20]",
"solution_match": "\nAnswer: "
}
|
c15fef76-9e05-5917-9dfc-9ed3123b4af5
| 608,243
|
Cyclic quadrilateral $A B C D$ has side lengths $A B=1, B C=2, C D=3$, and $A D=4$. Determine $A C / B D$.
|
5/7. Let the diagonals intersect at $P$. Note that triangles $A B P$ and $D C P$ are similar, so that $3 A P=D P$ and $3 B P=C P$. Additionally, triangles $B C P$ and $A D P$ are similar, so that $2 B P=A P$. It follows that
$$
\frac{A C}{B D}=\frac{A P+P C}{B P+P D}=\frac{2 B P+3 B P}{B P+6 B P}=\frac{5}{7}
$$
|
\frac{5}{7}
|
Yes
|
Yes
|
math-word-problem
|
Geometry
|
Cyclic quadrilateral $A B C D$ has side lengths $A B=1, B C=2, C D=3$, and $A D=4$. Determine $A C / B D$.
|
5/7. Let the diagonals intersect at $P$. Note that triangles $A B P$ and $D C P$ are similar, so that $3 A P=D P$ and $3 B P=C P$. Additionally, triangles $B C P$ and $A D P$ are similar, so that $2 B P=A P$. It follows that
$$
\frac{A C}{B D}=\frac{A P+P C}{B P+P D}=\frac{2 B P+3 B P}{B P+6 B P}=\frac{5}{7}
$$
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n9. [20]",
"solution_match": "\nAnswer: "
}
|
e96a94f3-c257-55d2-b932-7b5f3188f689
| 608,244
|
A positive real number $x$ is such that
$$
\sqrt[3]{1-x^{3}}+\sqrt[3]{1+x^{3}}=1
$$
Find $x^{2}$.
|
$\frac{\sqrt[3]{28}}{\mathbf{3}}$. Cubing the given equation yields
$$
1=\left(1-x^{3}\right)+3 \sqrt[3]{\left(1-x^{3}\right)\left(1+x^{3}\right)}\left(\sqrt[3]{1-x^{3}}+\sqrt[3]{1+x^{3}}\right)+\left(1+x^{3}\right)=2+3 \sqrt[3]{1-x^{6}}
$$
Then $\frac{-1}{3}=\sqrt[3]{1-x^{6}}$, so $\frac{-1}{27}=1-x^{6}$ and $x^{6}=\frac{28}{27}$ and $x^{2}=\frac{\sqrt[3]{28}}{3}$.
## Adult Acorns - Gee, I'm a Tree! [200]
In this section of the team round, your team will derive some basic results concerning tangential quadrilaterals. Tangential quadrilaterals have an incircle, or a circle lying within them that is tangent to all four sides. If a quadrilateral has an incircle, then the center of this circle is the incenter of the quadrilateral. As you shall see, tangential quadrilaterals are related to cyclic quadrilaterals. For reference, a review of cyclic quadrilaterals is given at the end of this section.
Your answers for this section of the team test should be proofs. Note that you may use any standard facts about cyclic quadrilaterals, such as those listed at the end of this test, without proving them. Additionally, you may cite the results of previous problems, even if you were unable to prove them.
For these problems, $A B C D$ is a tangential quadrilateral having incenter $I$. For the first three problems, the point $P$ is constructed such that triangle $P A B$ is similar to triangle $I D C$ and lies outside $A B C D$.
|
\frac{\sqrt[3]{28}}{3}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
A positive real number $x$ is such that
$$
\sqrt[3]{1-x^{3}}+\sqrt[3]{1+x^{3}}=1
$$
Find $x^{2}$.
|
$\frac{\sqrt[3]{28}}{\mathbf{3}}$. Cubing the given equation yields
$$
1=\left(1-x^{3}\right)+3 \sqrt[3]{\left(1-x^{3}\right)\left(1+x^{3}\right)}\left(\sqrt[3]{1-x^{3}}+\sqrt[3]{1+x^{3}}\right)+\left(1+x^{3}\right)=2+3 \sqrt[3]{1-x^{6}}
$$
Then $\frac{-1}{3}=\sqrt[3]{1-x^{6}}$, so $\frac{-1}{27}=1-x^{6}$ and $x^{6}=\frac{28}{27}$ and $x^{2}=\frac{\sqrt[3]{28}}{3}$.
## Adult Acorns - Gee, I'm a Tree! [200]
In this section of the team round, your team will derive some basic results concerning tangential quadrilaterals. Tangential quadrilaterals have an incircle, or a circle lying within them that is tangent to all four sides. If a quadrilateral has an incircle, then the center of this circle is the incenter of the quadrilateral. As you shall see, tangential quadrilaterals are related to cyclic quadrilaterals. For reference, a review of cyclic quadrilaterals is given at the end of this section.
Your answers for this section of the team test should be proofs. Note that you may use any standard facts about cyclic quadrilaterals, such as those listed at the end of this test, without proving them. Additionally, you may cite the results of previous problems, even if you were unable to prove them.
For these problems, $A B C D$ is a tangential quadrilateral having incenter $I$. For the first three problems, the point $P$ is constructed such that triangle $P A B$ is similar to triangle $I D C$ and lies outside $A B C D$.
|
{
"resource_path": "HarvardMIT/segmented/en-102-2007-feb-team2-solutions.jsonl",
"problem_match": "\n10. [20]",
"solution_match": "\nAnswer: "
}
|
e225c736-fa74-5afc-9343-879f42115cb6
| 608,245
|
Positive real numbers $x, y$ satisfy the equations $x^{2}+y^{2}=1$ and $x^{4}+y^{4}=\frac{17}{18}$. Find $x y$.
|
$\sqrt[\frac{1}{6}]{ }$ We have $2 x^{2} y^{2}=\left(x^{2}+y^{2}\right)^{2}-\left(x^{4}+y^{4}\right)=\frac{1}{18}$, so $x y=\frac{1}{6}$.
|
\frac{1}{6}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Positive real numbers $x, y$ satisfy the equations $x^{2}+y^{2}=1$ and $x^{4}+y^{4}=\frac{17}{18}$. Find $x y$.
|
$\sqrt[\frac{1}{6}]{ }$ We have $2 x^{2} y^{2}=\left(x^{2}+y^{2}\right)^{2}-\left(x^{4}+y^{4}\right)=\frac{1}{18}$, so $x y=\frac{1}{6}$.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n1. [3]",
"solution_match": "\nAnswer: "
}
|
1de24453-cc62-596d-9065-3bad89b57993
| 608,252
|
Let $f(n)$ be the number of times you have to hit the $\sqrt{ }$ key on a calculator to get a number less than 2 starting from $n$. For instance, $f(2)=1, f(5)=2$. For how many $1<m<2008$ is $f(m)$ odd?
|
242 This is $\left[2^{1}, 2^{2}\right) \cup\left[2^{4}, 2^{8}\right) \cup\left[2^{16}, 2^{32}\right) \ldots$, and $2^{8}<2008<2^{16}$ so we have exactly the first two intervals.
|
242
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Let $f(n)$ be the number of times you have to hit the $\sqrt{ }$ key on a calculator to get a number less than 2 starting from $n$. For instance, $f(2)=1, f(5)=2$. For how many $1<m<2008$ is $f(m)$ odd?
|
242 This is $\left[2^{1}, 2^{2}\right) \cup\left[2^{4}, 2^{8}\right) \cup\left[2^{16}, 2^{32}\right) \ldots$, and $2^{8}<2008<2^{16}$ so we have exactly the first two intervals.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n2. [3]",
"solution_match": "\nAnswer: "
}
|
563ad288-3372-5169-ad8d-402e8ea5a3b7
| 608,253
|
The function $f$ satisfies
$$
f(x)+f(2 x+y)+5 x y=f(3 x-y)+2 x^{2}+1
$$
for all real numbers $x, y$. Determine the value of $f(10)$.
|
$\quad-49$ Setting $x=10$ and $y=5$ gives $f(10)+f(25)+250=f(25)+200+1$, from which we get $f(10)=-49$.
Remark: By setting $y=\frac{x}{2}$, we see that the function is $f(x)=-\frac{1}{2} x^{2}+1$, and it can be checked that this function indeed satisfies the given equation.
|
-49
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
The function $f$ satisfies
$$
f(x)+f(2 x+y)+5 x y=f(3 x-y)+2 x^{2}+1
$$
for all real numbers $x, y$. Determine the value of $f(10)$.
|
$\quad-49$ Setting $x=10$ and $y=5$ gives $f(10)+f(25)+250=f(25)+200+1$, from which we get $f(10)=-49$.
Remark: By setting $y=\frac{x}{2}$, we see that the function is $f(x)=-\frac{1}{2} x^{2}+1$, and it can be checked that this function indeed satisfies the given equation.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n4. [4]",
"solution_match": "\nAnswer: "
}
|
8ba5529f-fcbc-51e8-8bd9-493aa7ca12ac
| 608,255
|
Let $f(x)=x^{3}+x+1$. Suppose $g$ is a cubic polynomial such that $g(0)=-1$, and the roots of $g$ are the squares of the roots of $f$. Find $g(9)$.
|
899 Let $a, b, c$ be the zeros of $f$. Then $f(x)=(x-a)(x-b)(x-c)$. Then, the roots of $g$ are $a^{2}, b^{2}, c^{2}$, so $g(x)=k\left(x-a^{2}\right)\left(x-b^{2}\right)\left(x-c^{2}\right)$ for some constant $k$. Since $a b c=-f(0)=-1$, we have $k=k a^{2} b^{2} c^{2}=-g(0)=1$. Thus,
$$
g\left(x^{2}\right)=\left(x^{2}-a^{2}\right)\left(x^{2}-b^{2}\right)\left(x^{2}-c^{2}\right)=(x-a)(x-b)(x-c)(x+a)(x+b)(x+c)=-f(x) f(-x)
$$
Setting $x=3$ gives $g(9)=-f(3) f(-3)=-(31)(-29)=899$.
|
899
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Let $f(x)=x^{3}+x+1$. Suppose $g$ is a cubic polynomial such that $g(0)=-1$, and the roots of $g$ are the squares of the roots of $f$. Find $g(9)$.
|
899 Let $a, b, c$ be the zeros of $f$. Then $f(x)=(x-a)(x-b)(x-c)$. Then, the roots of $g$ are $a^{2}, b^{2}, c^{2}$, so $g(x)=k\left(x-a^{2}\right)\left(x-b^{2}\right)\left(x-c^{2}\right)$ for some constant $k$. Since $a b c=-f(0)=-1$, we have $k=k a^{2} b^{2} c^{2}=-g(0)=1$. Thus,
$$
g\left(x^{2}\right)=\left(x^{2}-a^{2}\right)\left(x^{2}-b^{2}\right)\left(x^{2}-c^{2}\right)=(x-a)(x-b)(x-c)(x+a)(x+b)(x+c)=-f(x) f(-x)
$$
Setting $x=3$ gives $g(9)=-f(3) f(-3)=-(31)(-29)=899$.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n5. [5]",
"solution_match": "\nAnswer: "
}
|
9b5976c7-f155-5ecd-8e92-8986e7efd548
| 608,256
|
A root of unity is a complex number that is a solution to $z^{n}=1$ for some positive integer $n$. Determine the number of roots of unity that are also roots of $z^{2}+a z+b=0$ for some integers $a$ and $b$.
|
8 The only real roots of unity are 1 and -1 . If $\zeta$ is a complex root of unity that is also a root of the equation $z^{2}+a z+b$, then its conjugate $\bar{\zeta}$ must also be a root. In this case, $|a|=|\zeta+\bar{\zeta}| \leq|\zeta|+|\bar{\zeta}|=$ 2 and $b=\zeta \bar{\zeta}=1$. So we only need to check the quadratics $z^{2}+2 z+1, z^{2}+z+1, z^{2}+1, z^{2}-z+1, z^{2}-2 z+1$. We find 8 roots of unity: $\pm 1, \pm i, \frac{1}{2}( \pm 1 \pm \sqrt{3} i)$.
|
8
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
A root of unity is a complex number that is a solution to $z^{n}=1$ for some positive integer $n$. Determine the number of roots of unity that are also roots of $z^{2}+a z+b=0$ for some integers $a$ and $b$.
|
8 The only real roots of unity are 1 and -1 . If $\zeta$ is a complex root of unity that is also a root of the equation $z^{2}+a z+b$, then its conjugate $\bar{\zeta}$ must also be a root. In this case, $|a|=|\zeta+\bar{\zeta}| \leq|\zeta|+|\bar{\zeta}|=$ 2 and $b=\zeta \bar{\zeta}=1$. So we only need to check the quadratics $z^{2}+2 z+1, z^{2}+z+1, z^{2}+1, z^{2}-z+1, z^{2}-2 z+1$. We find 8 roots of unity: $\pm 1, \pm i, \frac{1}{2}( \pm 1 \pm \sqrt{3} i)$.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n6. [5]",
"solution_match": "\nAnswer: "
}
|
a4a5d234-1d7a-5914-a812-ff42ea82f73a
| 608,257
|
Compute $\sum_{n=1}^{\infty} \sum_{k=1}^{n-1} \frac{k}{2^{n+k}}$.
|
$\frac{4}{9}$ We change the order of summation:
$$
\sum_{n=1}^{\infty} \sum_{k=1}^{n-1} \frac{k}{2^{n+k}}=\sum_{k=1}^{\infty} \frac{k}{2^{k}} \sum_{n=k+1}^{\infty} \frac{1}{2^{n}}=\sum_{k=1}^{\infty} \frac{k}{4^{k}}=\frac{4}{9} .
$$
(The last two steps involve the summation of an infinite geometric series, and what is sometimes called an infinite arithmetico-geometric series. These summations are quite standard, and thus we omit the details here.)
|
\frac{4}{9}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Compute $\sum_{n=1}^{\infty} \sum_{k=1}^{n-1} \frac{k}{2^{n+k}}$.
|
$\frac{4}{9}$ We change the order of summation:
$$
\sum_{n=1}^{\infty} \sum_{k=1}^{n-1} \frac{k}{2^{n+k}}=\sum_{k=1}^{\infty} \frac{k}{2^{k}} \sum_{n=k+1}^{\infty} \frac{1}{2^{n}}=\sum_{k=1}^{\infty} \frac{k}{4^{k}}=\frac{4}{9} .
$$
(The last two steps involve the summation of an infinite geometric series, and what is sometimes called an infinite arithmetico-geometric series. These summations are quite standard, and thus we omit the details here.)
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n7. [5]",
"solution_match": "\nAnswer: "
}
|
68503668-6b0c-5b05-9260-4e14e969072d
| 608,258
|
Let $S$ be the set of points $(a, b)$ with $0 \leq a, b \leq 1$ such that the equation
$$
x^{4}+a x^{3}-b x^{2}+a x+1=0
$$
has at least one real root. Determine the area of the graph of $S$.
|
$\frac{1}{4}$ After dividing the equation by $x^{2}$, we can rearrange it as
$$
\left(x+\frac{1}{x}\right)^{2}+a\left(x+\frac{1}{x}\right)-b-2=0
$$
Let $y=x+\frac{1}{x}$. We can check that the range of $x+\frac{1}{x}$ as $x$ varies over the nonzero reals is $(-\infty,-2] \cup[2, \infty)$. Thus, the following equation needs to have a real root:
$$
y^{2}+a y-b-2=0 .
$$
Its discriminant, $a^{2}+4(b+2)$, is always positive since $a, b \geq 0$. Then, the maximum absolute value of the two roots is
$$
\frac{a+\sqrt{a^{2}+4(b+2)}}{2} .
$$
We need this value to be at least 2 . This is equivalent to
$$
\sqrt{a^{2}+4(b+2)} \geq 4-a .
$$
We can square both sides and simplify to obtain
$$
2 a \geq 2-b
$$
This equation defines the region inside $[0,1] \times[0,1]$ that is occupied by $S$, from which we deduce that the desired area is $1 / 4$.
|
\frac{1}{4}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Let $S$ be the set of points $(a, b)$ with $0 \leq a, b \leq 1$ such that the equation
$$
x^{4}+a x^{3}-b x^{2}+a x+1=0
$$
has at least one real root. Determine the area of the graph of $S$.
|
$\frac{1}{4}$ After dividing the equation by $x^{2}$, we can rearrange it as
$$
\left(x+\frac{1}{x}\right)^{2}+a\left(x+\frac{1}{x}\right)-b-2=0
$$
Let $y=x+\frac{1}{x}$. We can check that the range of $x+\frac{1}{x}$ as $x$ varies over the nonzero reals is $(-\infty,-2] \cup[2, \infty)$. Thus, the following equation needs to have a real root:
$$
y^{2}+a y-b-2=0 .
$$
Its discriminant, $a^{2}+4(b+2)$, is always positive since $a, b \geq 0$. Then, the maximum absolute value of the two roots is
$$
\frac{a+\sqrt{a^{2}+4(b+2)}}{2} .
$$
We need this value to be at least 2 . This is equivalent to
$$
\sqrt{a^{2}+4(b+2)} \geq 4-a .
$$
We can square both sides and simplify to obtain
$$
2 a \geq 2-b
$$
This equation defines the region inside $[0,1] \times[0,1]$ that is occupied by $S$, from which we deduce that the desired area is $1 / 4$.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n9. [7]",
"solution_match": "\nAnswer: "
}
|
46e6f455-3697-56a7-b0f4-f9745b9f90c8
| 608,260
|
Evaluate the infinite sum
$$
\sum_{n=0}^{\infty}\binom{2 n}{n} \frac{1}{5^{n}}
$$
|
$\sqrt{5}$ First Solution: Note that
$$
\begin{aligned}
\binom{2 n}{n} & =\frac{(2 n)!}{n!\cdot n!}=\frac{(2 n)(2 n-2)(2 n-4) \cdots(2)}{n!} \cdot \frac{(2 n-1)(2 n-3)(2 n-5) \cdots(1)}{n!} \\
& =2^{n} \cdot \frac{(-2)^{n}}{n!}\left(-\frac{1}{2}\right)\left(-\frac{1}{2}-1\right)\left(-\frac{1}{2}-2\right) \cdots\left(-\frac{1}{2}-n+1\right) \\
& =(-4)^{n}\binom{-\frac{1}{2}}{n}
\end{aligned}
$$
Then, by the binomial theorem, for any real $x$ with $|x|<\frac{1}{4}$, we have
$$
(1-4 x)^{-1 / 2}=\sum_{n=0}^{\infty}\binom{-\frac{1}{2}}{n}(-4 x)^{n}=\sum_{n=0}^{\infty}\binom{2 n}{n} x^{n} .
$$
Therefore,
$$
\sum_{n=0}^{\infty}\binom{2 n}{n}\left(\frac{1}{5}\right)^{n}=\frac{1}{\sqrt{1-\frac{4}{5}}}=\sqrt{5}
$$
Second Solution: Consider the generating function
$$
f(x)=\sum_{n=0}^{\infty}\binom{2 n}{n} x^{n}
$$
It has formal integral given by
$$
g(x)=I(f(x))=\sum_{n=0}^{\infty} \frac{1}{n+1}\binom{2 n}{n} x^{n+1}=\sum_{n=0}^{\infty} C_{n} x^{n+1}=x \sum_{n=0}^{\infty} C_{n} x^{n}
$$
where $C_{n}=\frac{1}{n+1}\binom{2 n}{n}$ is the $n$th Catalan number. Let $h(x)=\sum_{n=0}^{\infty} C_{n} x^{n}$; it suffices to compute this generating function. Note that
$$
1+x h(x)^{2}=1+x \sum_{i, j \geq 0} C_{i} C_{j} x^{i+j}=1+x \sum_{k \geq 0}\left(\sum_{i=0}^{k} C_{i} C_{k-i}\right) x^{k}=1+\sum_{k \geq 0} C_{k+1} x^{k+1}=h(x)
$$
where we've used the recurrence relation for the Catalan numbers. We now solve for $h(x)$ with the quadratic equation to obtain
$$
h(x)=\frac{1 / x \pm \sqrt{1 / x^{2}-4 / x}}{2}=\frac{1 \pm \sqrt{1-4 x}}{2 x}
$$
Note that we must choose the - sign in the $\pm$, since the + would lead to a leading term of $\frac{1}{x}$ for $h$ (by expanding $\sqrt{1-4 x}$ into a power series). Therefore, we see that
$$
f(x)=D(g(x))=D(x h(x))=D\left(\frac{1-\sqrt{1-4 x}}{2}\right)=\frac{1}{\sqrt{1-4 x}}
$$
and our answer is hence $f(1 / 5)=\sqrt{5}$.
|
\sqrt{5}
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Evaluate the infinite sum
$$
\sum_{n=0}^{\infty}\binom{2 n}{n} \frac{1}{5^{n}}
$$
|
$\sqrt{5}$ First Solution: Note that
$$
\begin{aligned}
\binom{2 n}{n} & =\frac{(2 n)!}{n!\cdot n!}=\frac{(2 n)(2 n-2)(2 n-4) \cdots(2)}{n!} \cdot \frac{(2 n-1)(2 n-3)(2 n-5) \cdots(1)}{n!} \\
& =2^{n} \cdot \frac{(-2)^{n}}{n!}\left(-\frac{1}{2}\right)\left(-\frac{1}{2}-1\right)\left(-\frac{1}{2}-2\right) \cdots\left(-\frac{1}{2}-n+1\right) \\
& =(-4)^{n}\binom{-\frac{1}{2}}{n}
\end{aligned}
$$
Then, by the binomial theorem, for any real $x$ with $|x|<\frac{1}{4}$, we have
$$
(1-4 x)^{-1 / 2}=\sum_{n=0}^{\infty}\binom{-\frac{1}{2}}{n}(-4 x)^{n}=\sum_{n=0}^{\infty}\binom{2 n}{n} x^{n} .
$$
Therefore,
$$
\sum_{n=0}^{\infty}\binom{2 n}{n}\left(\frac{1}{5}\right)^{n}=\frac{1}{\sqrt{1-\frac{4}{5}}}=\sqrt{5}
$$
Second Solution: Consider the generating function
$$
f(x)=\sum_{n=0}^{\infty}\binom{2 n}{n} x^{n}
$$
It has formal integral given by
$$
g(x)=I(f(x))=\sum_{n=0}^{\infty} \frac{1}{n+1}\binom{2 n}{n} x^{n+1}=\sum_{n=0}^{\infty} C_{n} x^{n+1}=x \sum_{n=0}^{\infty} C_{n} x^{n}
$$
where $C_{n}=\frac{1}{n+1}\binom{2 n}{n}$ is the $n$th Catalan number. Let $h(x)=\sum_{n=0}^{\infty} C_{n} x^{n}$; it suffices to compute this generating function. Note that
$$
1+x h(x)^{2}=1+x \sum_{i, j \geq 0} C_{i} C_{j} x^{i+j}=1+x \sum_{k \geq 0}\left(\sum_{i=0}^{k} C_{i} C_{k-i}\right) x^{k}=1+\sum_{k \geq 0} C_{k+1} x^{k+1}=h(x)
$$
where we've used the recurrence relation for the Catalan numbers. We now solve for $h(x)$ with the quadratic equation to obtain
$$
h(x)=\frac{1 / x \pm \sqrt{1 / x^{2}-4 / x}}{2}=\frac{1 \pm \sqrt{1-4 x}}{2 x}
$$
Note that we must choose the - sign in the $\pm$, since the + would lead to a leading term of $\frac{1}{x}$ for $h$ (by expanding $\sqrt{1-4 x}$ into a power series). Therefore, we see that
$$
f(x)=D(g(x))=D(x h(x))=D\left(\frac{1-\sqrt{1-4 x}}{2}\right)=\frac{1}{\sqrt{1-4 x}}
$$
and our answer is hence $f(1 / 5)=\sqrt{5}$.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-alg-solutions.jsonl",
"problem_match": "\n10. [8]",
"solution_match": "\nAnswer: "
}
|
01955233-b8a6-557c-b7ae-4db007a7a7e5
| 608,261
|
Let $f(x)=1+x+x^{2}+\cdots+x^{100}$. Find $f^{\prime}(1)$.
|
5050 Note that $f^{\prime}(x)=1+2 x+3 x^{2}+\cdots+100 x^{99}$, so $f^{\prime}(1)=1+2+\cdots+100=\frac{100 \cdot 101}{2}=$ 5050.
|
5050
|
Yes
|
Yes
|
math-word-problem
|
Calculus
|
Let $f(x)=1+x+x^{2}+\cdots+x^{100}$. Find $f^{\prime}(1)$.
|
5050 Note that $f^{\prime}(x)=1+2 x+3 x^{2}+\cdots+100 x^{99}$, so $f^{\prime}(1)=1+2+\cdots+100=\frac{100 \cdot 101}{2}=$ 5050.
|
{
"resource_path": "HarvardMIT/segmented/en-112-2008-feb-calc-solutions.jsonl",
"problem_match": "\n1. [3]",
"solution_match": "\nAnswer: "
}
|
b59d9bd8-a6d5-5e4c-b9b7-3b7c7773ca69
| 608,262
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.