https://artofproblemsolving.com/wiki/api.php?action=feedcontributions&user=Relay400&feedformat=atom
AoPS Wiki - User contributions [en]
2022-09-30T07:10:03Z
User contributions
MediaWiki 1.31.1
https://artofproblemsolving.com/wiki/index.php?title=2004_AMC_12A_Problems/Problem_18&diff=122378
2004 AMC 12A Problems/Problem 18
2020-05-14T01:31:48Z
<p>Relay400: This is not a solution.</p>
<hr />
<div>{{duplicate|[[2004 AMC 12A Problems|2004 AMC 12A #18]] and [[2004 AMC 10A Problems/Problem 22|2004 AMC 10A #22]]}}<br />
<br />
==Problem==<br />
[[Square]] <math>ABCD</math> has side length <math>2</math>. A [[semicircle]] with [[diameter]] <math>\overline{AB}</math> is constructed inside the square, and the [[tangent (geometry)|tangent]] to the semicircle from <math>C</math> intersects side <math>\overline{AD}</math> at <math>E</math>. What is the length of <math>\overline{CE}</math>?<br />
<br />
<asy><br />
size(100);<br />
defaultpen(fontsize(10));<br />
pair A=(0,0), B=(2,0), C=(2,2), D=(0,2), E=(0,1/2);<br />
draw(A--B--C--D--cycle);draw(C--E);<br />
draw(Arc((1,0),1,0,180));<br />
label("$A$",A,(-1,-1));<br />
label("$B$",B,( 1,-1));<br />
label("$C$",C,( 1, 1));<br />
label("$D$",D,(-1, 1));<br />
label("$E$",E,(-1, 0));<br />
</asy><br />
<br />
<math> \mathrm{(A) \ } \frac{2+\sqrt{5}}{2} \qquad \mathrm{(B) \ } \sqrt{5} \qquad \mathrm{(C) \ } \sqrt{6} \qquad \mathrm{(D) \ } \frac{5}{2} \qquad \mathrm{(E) \ } 5-\sqrt{5} </math><br />
<br />
__TOC__<br />
== Solution 1 ==<br />
<br />
<asy><br />
size(150);<br />
defaultpen(fontsize(10));<br />
pair A=(0,0), B=(2,0), C=(2,2), D=(0,2), E=(0,1/2), F=E+(C-E)/abs(C-E)/2;<br />
draw(A--B--C--D--cycle);draw(C--E);<br />
draw(Arc((1,0),1,0,180));draw((A+B)/2--F);<br />
label("$A$",A,(-1,-1));<br />
label("$B$",B,( 1,-1));<br />
label("$C$",C,( 1, 1));<br />
label("$D$",D,(-1, 1));<br />
label("$E$",E,(-1, 0));<br />
label("$F$",F,( 0, 1));<br />
label("$x$",(A+E)/2,(-1, 0));<br />
label("$x$",(E+F)/2,( 0, 1));<br />
label("$2$",(F+C)/2,( 0, 1));<br />
label("$2$",(D+C)/2,( 0, 1));<br />
label("$2$",(B+C)/2,( 1, 0));<br />
label("$2-x$",(D+E)/2,(-1, 0));<br />
</asy><br />
Let the point of tangency be <math>F</math>. By the [[Two Tangent Theorem]] <math>BC = FC = 2</math> and <math>AE = EF = x</math>. Thus <math>DE = 2-x</math>. The [[Pythagorean Theorem]] on <math>\triangle CDE</math> yields<br />
<br />
<cmath>\begin{align*}<br />
DE^2 + CD^2 &= CE^2\\<br />
(2-x)^2 + 2^2 &= (2+x)^2\\<br />
x^2 - 4x + 8 &= x^2 + 4x + 4\\<br />
x &= \frac{1}{2}\end{align*}</cmath><br />
<br />
Hence <math>CE = FC + x = \frac{5}{2} \Rightarrow\boxed{\mathrm{(D)}\ \frac{5}{2}}</math>.<br />
<br />
<br />
== Solution 2 ==<br />
Call the point of tangency point <math>F</math> and the midpoint of <math>AB</math> as <math>G</math>. <math>CF=2</math> by Tangent Theorem. Notice that <math>\angle EGF=\frac{180-2\cdot\angle CGF}{2}=90-\angle CGF</math>. Thus, <math>\angle EGF=\angle FCG</math> and <math>tanEGF=tanFCG=\frac{1}{2}</math>. Solving <math>EF=\frac{1}{2}</math>. Adding, the answer is <math>\frac{5}{2}</math>.<br />
<br />
== Solution 3 ==<br />
<br />
[[Image:2004_AMC12A-18.png]]<br />
<br />
Clearly, <math>EA = EF = BG</math>. Thus, the sides of [[right triangle]] <math>CDE</math> are in arithmetic progression. Thus it is [[similar triangles|similar]] to the triangle <math>3 - 4 - 5</math> and since <math>DC = 2</math>, <math>CE = 5/2</math>.<br />
<br />
== Solution 4 ==<br />
<asy><br />
size(150);<br />
defaultpen(fontsize(10));<br />
pair A=(0,0), B=(2,0), C=(2,2), D=(0,2), E=(0,1/2), F=E+(C-E)/abs(C-E)/2, G=(1,0);<br />
draw(A--B--C--D--cycle);draw(C--E);<br />
draw(Arc((1,0),1,0,180));draw((A+B)/2--F);<br />
label("$A$",A,(-1,-1));<br />
label("$B$",B,( 1,-1));<br />
label("$C$",C,( 1, 1));<br />
label("$D$",D,(-1, 1));<br />
label("$E$",E,(-1, 0));<br />
label("$F$",F,( 0, 1));<br />
label("$x$",(A+E)/2,(-1, 0));<br />
label("$x$",(E+F)/2,( 0, 1));<br />
label("$2$",(F+C)/2,( 0, 1));<br />
label("$2$",(D+C)/2,( 0, 1));<br />
label("$2$",(B+C)/2,( 1, 0));<br />
label("$2-x$",(D+E)/2,(-1, 0));<br />
label("$G$",G,(0,-1));<br />
dot(G);<br />
draw(G--C);<br />
label("$\sqrt{5}$",(G+C)/2,(-1,0));<br />
</asy><br />
<br />
Let us call the midpoint of side <math>AB</math>, point <math>G</math>. Since the semicircle has radius 1, we can do the Pythagorean theorem on sides <math>GB, BC, GC</math>. We get <math>GC=\sqrt{5}</math>. We then know that <math>CF=2</math> by Pythagorean theorem. Then by connecting <math>EG</math>, we get similar triangles <math>EFG</math> and <math>GFC</math>. Solving the ratios, we get <math>x=\frac{1}{2}</math>, so the answer is <math> \frac{5}{2} \Rightarrow\boxed{\mathrm{(D)}\ \frac{5}{2}}</math>.<br />
<br />
== Solution 5 ==<br />
Using the diagram as drawn in Solution 5, let the total area of square <math>ABCD</math> be divided into the triangles <math>DCE</math>, <math>EAG</math>, <math>CGB</math>, and <math>EGC</math>. Let x be the length of AE. Thus, the area of each triangle can be determined as follows: <br />
<br />
<cmath>DCE = \frac{DC\cdot{DE}}{2} = \frac{2\cdot(2-x)}{2} = 1-x</cmath><br />
<br />
<cmath>EAG= \frac{AE\cdot{AG}}{2} = \frac{1\cdot{x}}{2} = \frac{x}{2}</cmath><br />
<br />
<cmath>CGB = \frac{GB\cdot{CB}}{2} = \frac{1\cdot(2)}{2} = 1</cmath><br />
<br />
<cmath>EGC= \frac{EG\cdot{GC}}{2} = \frac{\sqrt{4+(2-x)^2}}{2}</cmath> (the length of CE is calculated with the [[Pythagorean Theorem]], lines GE and <br />
CE are perpendicular by definition of tangent)<br />
<br />
Adding up the areas and equating to the area of the total square (2*2=4), we get<br />
<br />
<cmath>1-x+\frac{x}{2}+1+ \frac{\sqrt{4+(2-x)^2}}{2} = 4 </cmath><br />
<br />
Solving for x:<br />
<br />
<cmath> 2-2x+x+1+\sqrt{x^2-4x+8}=8 </cmath><br />
<cmath> \sqrt{x^2-4x+8}=x+2 </cmath><br />
<cmath> x^2-4x+8=x^2+4x+4 </cmath><br />
<cmath> 8-4x=4x+4 \rightarrow x=\frac{1}{2} </cmath><br />
<br />
Solving for length of CE with the value we have for x:<br />
<cmath> \sqrt{4+(2-x)^2} = \sqrt{4+(3/2)^2} = \sqrt{25/4} = \boxed{\frac{5}{2}} </cmath></div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=2012_AMC_10A_Problems/Problem_25&diff=115136
2012 AMC 10A Problems/Problem 25
2020-01-22T05:29:53Z
<p>Relay400: Be proper.</p>
<hr />
<div>== Problem ==<br />
<br />
Real numbers <math>x</math>, <math>y</math>, and <math>z</math> are chosen independently and at random from the interval <math>[0,n]</math> for some positive integer <math>n</math>. The probability that no two of <math>x</math>, <math>y</math>, and <math>z</math> are within 1 unit of each other is greater than <math>\frac {1}{2}</math>. What is the smallest possible value of <math>n</math>?<br />
<br />
<math> \textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11 </math><br />
<br />
==Solution 1==<br />
<br />
Since <math>x,y,z</math> are all reals located in <math>[0, n]</math>, the number of choices for each one is continuous.<br />
<br />
WLOG([[Without loss of generality]]), assume that <math>n\geq x \geq y \geq z \geq 0</math>. Then the set of points <math>(x,y,z)</math> is a tetrahedron, or a triangular pyramid. The point <math>(x,y,z)</math> distributes uniformly in this region. If this is not easy to understand, read Solution II.<br />
<br />
The altitude of the tetrahedron is <math>n</math> and the base is an isosceles right triangle with a leg length <math>n</math>. The volume is <math>V_1=\dfrac{n^3}{6}</math>, as shown in the first figure in red.<br />
<br />
<asy><br />
import three;<br />
unitsize(10cm);<br />
size(150);<br />
currentprojection=orthographic(1/2,-1,2/3); <br />
// three - currentprojection, orthographic<br />
draw((1,1,0)--(0,1,0)--(0,0,0),dashed+green);<br />
draw((0,0,0)--(0,0,1),green);<br />
draw((0,1,0)--(0,1,1),dashed+green);<br />
draw((1,1,0)--(1,1,1),green);<br />
draw((1,0,0)--(1,0,1),green);<br />
draw((0,0,1)--(1,0,1)--(1,1,1)--(0,1,1)--cycle,green);<br />
<br />
draw((0,0,0)--(1,0,0)--(1,1,0)--(1,1,1), red);<br />
draw((1,1,0)--(0,0,0)--(1,1,1), dashed+red);<br />
draw((1,1,1)--(1,0,0), red);<br />
</asy><br />
<br />
<br />
Now we will find the region with points satisfying <math>|x-y|\geq1</math>, <math>|y-z|\geq1</math>, <math>|z-x|\geq1</math>.<br />
<br />
Since <math>n\geq x \geq y \geq z \geq 0</math>, we have <math>x-y\geq1</math>, <math>y-z\geq1</math>.<br />
<br />
The region of points <math>(x,y,z)</math> satisfying the condition is shown in the second figure in black. It is a tetrahedron, too.<br />
<br />
<asy><br />
import three;<br />
unitsize(10cm);<br />
size(150);<br />
currentprojection=orthographic(1/2, -1, 2/3); <br />
// three - currentprojection, orthographic<br />
draw((1, 1, 0)--(0, 1, 0)--(0, 0, 0), dashed+green);<br />
draw((0, 0, 0)--(0, 0, 1), green);<br />
draw((0, 1, 0)--(0, 1, 1), dashed+green);<br />
<br />
draw((1, 0, 0)--(1, 0, 1), green);<br />
draw((0, 0, 1)--(1, 0, 1)--(1, 1, 1)--(0, 1, 1)--cycle, green);<br />
<br />
<br />
<br />
draw((1,0,0)--(1,1,0)--(0,0,0)--(1,1,1), dashed+red);<br />
draw((0,0,0)--(1,0,0)--(1,1,1), red);<br />
draw((1,1,1)--(1,1,0)--(1,0.9,0), red);<br />
<br />
draw((1, 0.1, 0)--(1, 0.9, 0)--(1, 0.9, 0.8)--cycle);<br />
draw((0.2, 0.1, 0)--(1, 0.9, 0.8),dashed);<br />
draw((1, 0.1, 0)--(0.2, 0.1, 0)--(1, 0.9, 0),dashed);<br />
<br />
</asy><br />
<br />
The volume of this region is <math>V_2=\dfrac{(n-2)^3}{6}</math>.<br />
<br />
So the probability is <math>p=\dfrac{V_2}{V_1}=\dfrac{(n-2)^3}{n^3}</math>.<br />
<br />
Substituting <math>n</math> with the values in the choices, we find that when <math>n=10</math>, <math>p=\frac{512}{1000}>\frac{1}{2}</math>, when <math>n=9</math>, <math>p=\frac{343}{729}<\frac{1}{2}</math>. So <math>n\geq 10</math>.<br />
<br />
So the answer is <math> \boxed{\textbf{(D)}\ 10} </math>.<br />
<br />
==Solution 2==<br />
<br />
Because <math>x</math>, <math>y</math>, and <math>z</math> are chosen independently and at random from the interval <math>[0,n]</math>, which means that <math>x</math>, <math>y</math>, and <math>z</math> distributes uniformly and independently in the interval <math>[0,n]</math>. So the point <math>(x, y, z)</math> distributes uniformly in the cubic <math>0\leqslant x, y, z \leqslant n</math>, as shown in the figure below. The volume of this cubic is <math>V_0=n^3</math>.<br />
<br />
[[File:Cubic.png]]<br />
<br />
As we want to find the probablity of the incident <br />
<math>A=\big\{ |x-y| \geq 1, |y-z| \geq1, |z-x| \geq 1 \big\}</math>, <br />
we should find the volume of the region of points such that <math>|x-y|\geq 1</math>, <math>|y-z|\geq 1</math>, <math>|z-x|\geq 1</math> and <math>0\leq x, y, z \leq n</math>.<br />
<br />
Now we will find the region <math>\big\{ (x,y,z)\ | \ 0\leq x, y, z \leq n, |x-y|\geq 1, |y-z|\geq 1, |z-x|\geq 1 \big\} </math>.<br />
<br />
The region can be generated by cutting off 3 slices corresponding to <math>|x-y|< 1</math>, <math>|y-z|< 1</math>, and <math>|z-x|< 1</math>, respectively, from the cubic.<br />
<br />
After cutting off a slice corresponding to <math>|x-y|< 1</math>, we get two triangular prisms, as shown in the figure.<br />
<br />
[[File:2.png]]<br />
<br />
In order to observe the object clearly, we rotate the object by the <math>z</math> axis, as shown.<br />
<br />
[[File:3.png]]<br />
<br />
We can draw the slice corresponding to <math>|y-z|< 1</math> on the object.<br />
<br />
[[File:4B.png]]<br />
<br />
After cutting off the slice corresponding to <math>|y-z|< 1</math>, we have 4 pieces left.<br />
<br />
[[File:5.png]]<br />
<br />
After cutting off the slice corresponding to <math>|z-x|< 1</math>, we have 6 congruent triangular prisms. <br />
<br />
[[File:6B.png]]<br />
<br />
Here we draw all the pictures in colors in order to explain the solution clearly. That does not mean that the students should do it in the examination. They can draw a figure with lines only, as shown below.<br />
<br />
[[File:7.png]]<br />
<br />
Every triangular pyramid has an altitude <math>n-2</math> and a base of isoceless right triangle with leg length <math>n-2</math>, so the volume is <math>(n-2)^3/6</math>.<br />
Then the volume of the region <math>\big\{ (x,y,z)\ | \ 0\leqslant x, y, z \leqslant n, |x-y|\geqslant 1, |y-z|\geqslant 1, |z-x|\geqslant 1 \big\}</math> is <math>V_A=6\times(n-2)^3/6</math>=<math>(n-2)^3</math>.<br />
<br />
So the probability of the incident <math>A</math> is <math>P(A)=\dfrac{V_A}{V_0}</math>=<math>\dfrac{(n-2)^3}{n^3}</math>.<br />
<br />
Then we can get the answer the same way as Solution I.<br />
<br />
The answer is <math> \boxed{\textbf{(D)}\ 10} </math>.<br />
<br />
<br />
----<br />
<br />
<br />
If there is no choice for selection, we can also find the minimum value of the integer <math>n</math> if we do not substitute <math>n</math> by the possible values one by one.<br />
<br />
Let <math>P(A)>1/2</math>, i.e., <math>\dfrac{(n-2)^3}{n^3}>\dfrac{1}{2}</math>, so <math>\dfrac{n-2}{n}>\dfrac{1}{\sqrt[^3\!]{2}}</math>, or <math>1-\dfrac{2}{n}>\dfrac{1}{\sqrt[^3\!]{2}}</math>, hence <math>n>\dfrac{2\sqrt[^3\!]{2}}{\sqrt[^3\!]{2}-1}</math>.<br />
<br />
Now we will estimate the value of <math>\dfrac{2\sqrt[^3\!]{2}}{\sqrt[^3\!]{2}-1}</math> without a calculator.<br />
<br />
Since <math>a^3-1</math>=<math>(a-1)(a^2+a+1)</math>, so<br />
<math>\dfrac{2\sqrt[^3\!]{2}}{\sqrt[^3\!]{2}-1}</math><br />
=<math>\dfrac{2\sqrt[^3\!]{2}\times\left( \sqrt[^3\!]{2}^2+\sqrt[^3\!]{2}+1\right)}{\left( \sqrt[^3\!]{2}-1\right)\left( \sqrt[^3\!]{2}^2+\sqrt[^3\!]{2}+1\right)}</math><br />
=<math>\dfrac{2\times\left( 2+\sqrt[^3\!]{2}^2+\sqrt[^3\!]{2}\right)}{ \sqrt[^3\!]{2}^3-1}</math><br />
=<math>2\times\left( 2+\sqrt[^3\!]{4}+\sqrt[^3\!]{2}\right)</math>.<br />
<br />
Now we would get the approximation of <math>\sqrt[^3\!]{4}</math> and <math>\sqrt[^3\!]{2}</math>.<br />
<br />
In order to avoid compicated computation, we get the approximation with one decimal digit only.<br />
<br />
Estimation of <math>\sqrt[^3\!]{2}</math>.<br />
<br />
Since <math>1.5^3=2.25\times1.5>2</math>, so <math>1<\sqrt[^3\!]{2}<1.5</math>.<br />
<br />
The mean of 1 and 1.5 with one decimal digit is about 1.3 .<br />
<br />
As <math>1.3^3=1.69\times 1.3=2.197>2</math>, so <math>1<\sqrt[^3\!]{2}<1.3</math>.<br />
<br />
The mean of 1 and 1.3 with one decimal digit is about 1.2.<br />
<br />
As <math>1.2^3=1.44\times 1.2=1.728<2</math>, so <math>1.2<\sqrt[^3\!]{2}<1.3</math>.<br />
<br />
Estimation of <math>\sqrt[^3\!]{4}</math>.<br />
<br />
As <math>\sqrt[^3\!]{4}=\sqrt[^3\!]{2}^2</math>, so <math>1.2^2<\sqrt[^3\!]{4}<1.3^2</math>,<br />
then <math>1.24<\sqrt[^3\!]{4}<1.69</math>.<br />
<br />
As <math>1.5^3=2.25\times 1.5=3.375<4</math>, so <math>1.5<\sqrt[^3\!]{4}<1.69</math>.<br />
<br />
The mean of 1.5 and 1.69 with one decimal digit is about 1.6.<br />
<br />
As <math>1.6^3=(16/10)^3=(2^4/10)^3=2^{12}/10^3=4\times 2^10/10^3=4\times 1.024>4</math>, so <math>1.5<\sqrt[^3\!]{4}<1.6</math>.<br />
<br />
<br />
Then <math>2\times(2+1.5+1.2)<2\times\left(2+\sqrt[^3\!]{4}+\sqrt[^3\!]{2}\right)<2\times(2+1.6+1.3)</math>, i.e., <br />
<math>9.4<2\times\left(2+\sqrt[^3\!]{4}+\sqrt[^3\!]{2}\right)<9.8</math>,<br />
<br />
As <math>n>2\times\left(2+\sqrt[^3\!]{4}+\sqrt[^3\!]{2}\right)</math>, So the minimal value of integer <math>n</math> is 10.<br />
<br />
===Appendix===<br />
This solution is motivated by the suggestive formula <math>\frac{(n-2)^{3}}{n^{3}}</math>.<br />
<br />
The problem generalizes easily to <math>k</math>-dimensional real space <math>\mathbb{R}^{k}</math>. In the general <math>k</math>-dimensional case, we are asked to find the probability that a randomly chosen <math>k</math>-tuple <math>(x_{1},\dotsc,x_{k}) \in [0,n]^{k}</math> satisfies <math>|x_{i} - x_{j}| > 1</math> for all <math>i \ne j</math>. To avoid repetition, let us say that <math>(x_{1},\dotsc,x_{k})</math> is <i>spaced-out</i> if <math>|x_{i} - x_{j}| > 1</math> for all <math>i \ne j</math>.<br />
<br />
Let <math>C</math> be the <math>k</math>-dimensional hyper-cube of side length <math>n</math>: <br />
<cmath> C = [0,n]^{k} = \big\{(x_{1},\dotsc,x_{k}) \in \mathbb{R}^{k} \;:\; 0 \leqslant x_{i} \leqslant n \text{ for all }i \big\} \;.</cmath> <br />
Then <math>C</math> has volume <math>n^{k}</math>. Let <math>S</math> be the set of spaced-out <math>k</math>-tuples <math>(x_{1},\dotsc,x_{k})</math>. The desired probability is Vol<math>(S)/n^{k}</math>. <br />
<br />
The set of <math>k</math>-tuples <math>(x_{1},\dotsc,x_{k})</math> such that there exist distinct indices <math>i, j</math> such that <math>x_{i} = x_{j}</math> has volume <math>0</math>, so we may restrict our attention to <math>k</math>-tuples such that <math>x_{i} \ne x_{j}</math> for all <math>i \ne j</math>. <br />
<br />
Further, the condition that <math>(x_{1},\dotsc,x_{k})</math> is spaced-out is "invariant upon permuting the indices"; in other words, if <math>\sigma</math> is a permutation of the set of indices <math>\{1,\dotsc,k\}</math>, then <math>(x_{1},\dotsc,x_{k})</math> is spaced-out if and only if <math>(x_{\sigma(1)},\dotsc,x_{\sigma(k)})</math> is spaced-out. Therefore, we may consider the set of spaced-out <math>k</math>-tuples <math>(x_{1},\dotsc,x_{k})</math> which additionally satisfy <math>x_{1} < \dotsb < x_{k}</math>. Let us denote this set by <math>T</math>. This condition is equivalent to <cmath>0 \leqslant x_{1} < x_{2} - 1 < \dotsb < x_{i}-(i-1) < \dotsb < x_{k}-(k-1) \leqslant n-(k-1) \;.</cmath><br />
Let us choose new variables <math>y_{i} = x_{i} - (i-1)</math> for <math>i = 1,\dotsc,k</math>. This change of variables is just a translation of each <math>(x_{1},\dotsc,x_{k})</math> by the vector <math>(0,1,\dots,k-1)</math>; in the above solutions, it corresponds to taking the 6 tetrahedrons and gluing them together to form a cube. <br />
<br />
We now compute the volume of the set of <math>(y_{1},\dotsc,y_{k}) \in [0,n-(k-1)]^{k}</math> which satisfy <math>y_{1} < \dotsb < y_{k}</math>. As above, we can disregard any <math>(y_{1},\dotsc,y_{k})</math> such that <math>y_{i} = y_{j}</math> for some <math>i \ne j</math>. Given any <math>(y_{1},\dotsc,y_{k})</math> such that <math>y_{i} \ne y_{j}</math> for all <math>i \ne j</math>, there exists exactly one permutation <math>\sigma</math> of the indices <math>\{1,\dotsc,k\}</math> such that <math>y_{\sigma(1)} < \dotsb < y_{\sigma(k)}</math>. Since there are <math>k!</math> permutations of <math>\{1,\dotsc,k\}</math>, the desired volume is equal to <math>\frac{1}{k!}</math> times the volume of the <math>k</math>-dimensional hyper-cube of side length <math>n-(k-1)</math>, which is <math>\frac{1}{k!}(n-(k-1))^{k}</math>. Hence <math>T</math> has volume <math>\frac{1}{k!}(n-(k-1))^{k}</math> as well and <math>S</math> has volume <math>(n-(k-1))^{k}</math>. Hence the desired probability is <math>\frac{(n-(k-1))^{k}}{n^{k}}</math>.<br />
<br />
==Solution 3==<br />
<br />
If <math>x</math>, <math>y</math>, and <math>z</math> are separated by at least one, then by subtracting the minimum space between the three variables (which is <math>2</math>), <math>x</math>, <math>y</math>, and <math>z</math> can be chosen randomly in the interval <math>[0,n-2]</math>. The probability is hence <math>\dfrac{(n-2)^3}{n^3} > \dfrac{1}{2}</math>, which simplifies to <math>n^3-12n^2+24n-16>0</math>. <math>\boxed{\textbf{(D)} 10}</math> is the minimum which satisfies this inequality.<br />
<br />
==Solution 4==<br />
Imagine Points <math>x</math>, <math>y</math>, <math>z</math> as the "starting points" of three "blocks" of real numbers that have length <math>1</math>. We are just trying to find the probability that those three "blocks" do not overlap. To do this we can set each unit of <math>1</math> into <math>\mu</math> equal little increments, and take the limit of the probability as <math>\mu</math> approaches <math>\infty</math>. (This is because there are indefinitely many real numbers in a given interval.) We see that the total number of arrangements for the three blocks of <math>1</math>, without considering the rule that no two blocks shall overlap is <math>(n\mu + 1)^3</math>. We see that the number of ways to arrange the three blocks such that no three of them are overlapping is simply <math>\dbinom{(n-2)\mu + 3}{3}</math>. Taking the limit as <math>\mu</math> approaches infinity, we obtain our closed form to be <math>\lim_{\mu \to \infty} \frac{\dbinom{(n-2)\mu + 3}{3}}{ (n\mu + 1)^3 }. </math> Dividing leading coefficients, we obtain <math>\lim_{\mu \to \infty} \frac{\dbinom{(n-2)\mu + 3}{3}}{ (n\mu + 1)^3 } = <br />
\frac{\mu(n-2)^3}{\mu n^3} = \frac{(n-2)^3}{n^3}</math>. Solving the inequality <math>\frac{(n-2)^3}{n^3} > \frac{1}{2}</math>, we get the least value of <math>n</math> as <math>n=\boxed{10}</math>.<br />
<br />
-fidgetboss_4000<br />
<br />
== See Also ==<br />
<br />
{{AMC10 box|year=2012|ab=A|num-b=24|after=Last Problem.}}<br />
{{MAA Notice}}</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=2013_AMC_10B_Problems/Problem_25&diff=115135
2013 AMC 10B Problems/Problem 25
2020-01-22T05:15:22Z
<p>Relay400: small tweaks to make solution more cohesive & understandable</p>
<hr />
<div>{{duplicate|[[2013 AMC 12B Problems|2013 AMC 12B #23]] and [[2013 AMC 10B Problems|2013 AMC 10B #25]]}}<br />
<br />
==Problem==<br />
<br />
Bernardo chooses a three-digit positive integer <math>N</math> and writes both its base-5 and base-6 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-10 integers, he adds them to obtain an integer <math>S</math>. For example, if <math>N = 749</math>, Bernardo writes the numbers <math>10,\!444</math> and <math>3,\!245</math>, and LeRoy obtains the sum <math>S = 13,\!689</math>. For how many choices of <math>N</math> are the two rightmost digits of <math>S</math>, in order, the same as those of <math>2N</math>?<br />
<br />
<math> \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 15 \qquad\textbf{(D)}\ 20 \qquad\textbf{(E)}\ 25</math><br />
<br />
==Solution 1==<br />
First, we can examine the units digits of the number base 5 and base 6 and eliminate some possibilities.<br />
<br />
Say that <math>N \equiv a \pmod{6}</math><br />
<br />
also that <math>N \equiv b \pmod{5}</math><br />
<br />
Substituting these equations into the question and setting the units digits of <math>2N</math> and <math>S</math> equal to each other, it can be seen that <math>b < 5</math> (because otherwise <math>a</math> and <math>b</math> will have different parities), and thus <math>a=b</math>.<br />
<math>N \equiv a \pmod{6}</math>,<br />
<math>N \equiv a \pmod{5}</math>,<br />
<math>\implies N=a \pmod{30}</math>,<br />
<math>0 \le a \le 4 </math><br />
<br />
Therefore, <math>N</math> can be written as <math>30x+y</math><br />
and <math>2N</math> can be written as <math>60x+2y</math> <br />
<br />
Just keep in mind that <math>y</math> can be one of five choices: <math>0, 1, 2, 3,</math> or <math>4</math>, ;<br />
Also, we have already found which digits of <math>y</math> will add up into the units digits of <math>2N</math>.<br />
<br />
Now, examine the tens digit, <math>x</math> by using <math>\mod{25}</math> and <math>\mod{36}</math> to find the tens digit (units digits can be disregarded because <math>y=0,1,2,3,4</math> will always work)<br />
Then we take <math>N=30x+y</math> <math>\mod{25}</math> and <math>\mod{36}</math> to find the last two digits in the base <math>5</math> and <math>6</math> representation.<br />
<cmath>N \equiv 30x \pmod{36}</cmath><br />
<cmath>N \equiv 30x \equiv 5x \pmod{25}</cmath> <br />
Both of those must add up to <br />
<cmath>2N\equiv60x \pmod{100}</cmath><br />
<br />
(<math>33 \ge x \ge 4</math>)<br />
<br />
Now, since <math>y=0,1,2,3,4</math> will always work if <math>x</math> works, then we can treat <math>x</math> as a units digit instead of a tens digit in the respective bases and decrease the mods so that <math>x</math> is now the units digit.<br />
<cmath>N \equiv 6x \equiv x \pmod{5}</cmath> <br />
<cmath>N \equiv 5x \pmod{6}</cmath> <br />
<cmath>2N\equiv 6x \pmod{10}</cmath><br />
<br />
Say that <math>x=5m+n</math> (m is between 0-6, n is 0-4 because of constraints on x)<br />
Then <br />
<br />
<cmath>N \equiv 5m+n \pmod{5}</cmath> <br />
<cmath>N \equiv 25m+5n \pmod{6}</cmath> <br />
<cmath>2N\equiv30m + 6n \pmod{10}</cmath><br />
<br />
and this simplifies to <br />
<br />
<cmath>N \equiv n \pmod{5}</cmath> <br />
<cmath>N \equiv m+5n \pmod{6}</cmath><br />
<cmath>2N\equiv 6n \pmod{10}</cmath><br />
<br />
From careful inspection, this is true when<br />
<br />
<math>n=0, m=6</math><br />
<br />
<math>n=1, m=6</math><br />
<br />
<math>n=2, m=2</math><br />
<br />
<math>n=3, m=2</math><br />
<br />
<math>n=4, m=4</math><br />
<br />
This gives you <math>5</math> choices for <math>x</math>, and <math>5</math> choices for <math>y</math>, so the answer is <br />
<math>5* 5 = \boxed{\textbf{(E) }25}</math><br />
<br />
==Solution 2==<br />
Notice that there are exactly <math>1000-100=900=5^2\cdot 6^2</math> possible values of <math>N</math>. This means, in <math>100\le N\le 999</math>, every possible combination of <math>2</math> digits will happen exactly once. We know that <math>N=900,901,902,903,904</math> works because <math>900\equiv\dots00_5\equiv\dots00_6</math>.<br />
<br />
We know for sure that the units digit will add perfectly every <math>30</math> added or subtracted, because <math>\text{lcm }5,6=30</math>. So we only have to care about cases of <math>N</math> every <math>30</math> subtracted. In each case, <math>2N</math> subtracts <math>6</math>/adds <math>4</math>, <math>N_5</math> subtracts <math>1</math> and <math>N_6</math> adds <math>1</math> for the <math>10</math>'s digit.<br />
<br />
<cmath>\textbf{5 }\textcolor{red}{\text{ 0}}\text{ 4 3 2 1 0 }\textcolor{red}{\text{4}}\text{ 3 2 1 0 4 3 2 1 0 4 }\textcolor{red}{\text{3 2}}\text{ 1 0 4 3 2 1 0 4 3 2 }\textcolor{red}{\text{1}}</cmath><br />
<br />
<cmath>\textbf{6 }\textcolor{red}{\text{ 0}}\text{ 1 2 3 4 5 }\textcolor{red}{\text{0}}\text{ 1 2 3 4 5 0 1 2 3 4 }\textcolor{red}{\text{5 0}}\text{ 1 2 3 4 5 0 1 2 3 4 }\textcolor{red}{\text{5}}</cmath><br />
<br />
<cmath>\textbf{10}\textcolor{red}{\text{ 0}}\text{ 4 8 2 6 0 }\textcolor{red}{\text{4}}\text{ 8 2 6 0 4 8 2 6 0 4 }\textcolor{red}{\text{8 2}}\text{ 6 0 4 8 2 6 0 4 8 2 }\textcolor{red}{\text{6}}</cmath><br />
<br />
As we can see, there are <math>5</math> cases, including the original, that work. These are highlighted in <math>\textcolor{red}{\text{red}}</math>. So, thus, there are <math>5</math> possibilities for each case, and <math>5\cdot 5=\boxed{\textbf{(E) }25}</math>.<br />
<br />
== Solution 3 ==<br />
<br />
Notice that <math>N_5</math> ranges from <math>3</math> to <math>5</math> digits and <math>N_6</math> ranges from <math>3</math> to <math>4</math> digits.<br />
<br />
Then let <math>a_i</math>, <math>b_i</math> denotes the digits of <math>N_5</math>, <math>N_6</math>, respectively such that <cmath>0\le a_i<5,0\le b_i<6</cmath> Thus we have <cmath>N=5^4a_1+5^3a_2+5^2a_3+5a_4+a_5=6^3b_1+6^2b_2+6b_3+b_4</cmath><br />
<cmath>625a_1+125a_2+25a_3+5a_4+a_5=216b_1+36b_2+6b_3+b_4</cmath> <br />
Now we are given <cmath>2N \equiv S \equiv N_5+N_6\pmod{100}</cmath><br />
<cmath>2(625a_1+125a_2+25a_3+5a_4+a_5) \equiv (10000a_1+1000a_2+100a_3+10a_4+a_5)+(1000b_1+100b_2+10b_3+b_4)\pmod{100}</cmath><br />
<cmath>1250a_1+250a_2+50a_3+10a_4+2a_5 \equiv 10000a_1+1000a_2+1000b_1+100a_3+100b_2+10a_4+10b_3+a_5+b_4\pmod{100}</cmath><br />
<cmath>50a_1+50a_2+50a_3+10a_4+2a_5 \equiv 10a_4+10b_3+a_5+b_4\pmod{100}</cmath><br />
Canceling out <math>a_5</math> left with<br />
<cmath>50a_1+50a_2+50a_3+10a_4+a_5 \equiv 10a_4+10b_3+b_4\pmod{100}</cmath><br />
<br />
Since <math>a_5</math>, <math>b_4</math> determine the unit digits of the two sides of the congruence equation, we have <math>a_5=b_4=0,1,2,3,4</math>. Thus,<br />
<br />
<cmath>50a_1+50a_2+50a_3+10a_4 \equiv 10a_4+10b_3\pmod{100}</cmath> canceling out <math>10a_4</math>, we have <br />
<cmath>50a_1+50a_2+50a_3 \equiv 10b_3\pmod{100}</cmath><br />
<cmath>5a_1+5a_2+5a_3 \equiv b_3\pmod{10}</cmath><br />
<cmath>5(a_1+a_2+a_3) \equiv b_3\pmod{10}</cmath><br />
<br />
Thus <math>b_3</math> is a multiple of <math>5</math>.<br />
<br />
Now going back to our original equation <br />
<cmath>625a_1+125a_2+25a_3+5a_4+a_5=216b_1+36b_2+6b_3+b_4</cmath> <br />
Since <math>a_5=b_4</math>,<br />
<cmath>625a_1+125a_2+25a_3+5a_4=216b_1+36b_2+6b_3</cmath> <br />
<cmath>5(125a_1+25a_2+5a_3+a_4)=6(36b_1+6b_2+b_3)</cmath> <br />
<cmath>5(125a_1+25a_2+5a_3+a_4)=6[6(6b_1+b_2)+b_3]</cmath> <br />
<br />
Since the left side is a multiple of <math>5</math>, then so does the right side. Thus <math>5\mid6(6b_1+b_2)+b_3</math>.<br />
<br />
Since we already know that <math>5\mid b_3</math>, then <math>5\mid6(6b_1+b_2)</math>, from where we also know that <math>5\mid6b_1+b_2</math>.<br />
<br />
For <math>b_1,b_2<6</math>, there is a total of 7 ordered pairs that satisfy the condition. Namely,<br />
<br />
<cmath>(b_1,b_2)=(0,0),(0,5),(1,4),(2,3),(3,2),(4,1),(5,0)</cmath><br />
<br />
Since <math>N_6</math> has at least <math>3</math> digits, <math>(b_1,b_2)=(0,0)</math> doesn't work. Furthermore, when <math>b_1=5</math>, <math>216b_1</math> exceeds <math>1000</math> which is not possible as <math>N</math> is a three digit number, thus <math>(b_1,b_2)=(5,0)</math> won't work as well. <br />
<br />
Since we know that <math>a_i<5</math>, for each of the ordered pairs <math>(b_1,b_2)</math>, there is respectively one and only one solution <math>(a_1,a_2,a_3,a_5)</math> that satisfies the equation <br />
<br />
<cmath>625a_1+125a_2+25a_3+5a_4=216b_1+36b_2+6b_3</cmath><br />
<br />
Thus there are five solutions to the equation. Also since we have 5 possibilities for <math>a_5=b_4</math>, we have a total of <math>5\cdot5=25</math> values for <math>N</math>. <math>\boxed{\textbf{(E) }25}</math><br />
<br />
~ Nafer<br />
<br />
==Solution 4==<br />
<br />
Observe that the maximum possible value of the sum of the last two digits of the base <math>5</math> number and the base <math>6</math> number is <math>44+55=99</math>. <br />
Let <math>N \equiv a \mod 25</math> and <math>N \equiv b \mod 36</math>. <br />
<br />
If <math>a < \frac{25}{2}</math>, <math>2N \equiv 2a \mod 25</math> and if <math>a > \frac{25}{2}</math>, <math>2N \equiv 2a - 25 \mod 25</math>.<br />
<br />
Using the same logic for <math>b</math>, if <math>b < 18</math>, <math>2N \equiv 2b \mod 36</math>, and in the other case <math>2N \equiv 2b - 36 \mod 36</math>.<br />
<br />
We can do four cases:<br />
<br />
Case 1: <math>a + b = 2a - 25 + 2b - 36 \implies a + b = 61</math>.<br />
<br />
For this case, there is trivially only one possible solution, <math>(a, b) = (25, 36)</math>, which is equivalent to <math>(a, b) = (0, 0)</math>. <br />
<br />
Case 2: <math>a + b = 2a - 25 + 2b \implies a + b = 25</math>.<br />
<br />
Note that in this case, <math>a \geq 13</math> must hold, and <math>b < 18</math> must hold. <br />
We find the possible ordered pairs to be: <math>(13, 12), (14, 11), (15, 10), ..., (24, 1)</math> for a total of <math>12</math> ordered pairs.<br />
<br />
Case 3: <math>a + b = 2a + 2b - 36 \implies a + b = 36</math>.<br />
<br />
Note that in this case, <math>b \geq 18</math> must hold, and <math>a < 13</math> must hold.<br />
We find the possible ordered pairs to be: <math>(24, 12), (25, 11), (26, 10), ..., (35, 1)</math> for a total of <math>12</math> ordered pairs.<br />
<br />
Case 4: <math>a + b = 2a + 2b</math>.<br />
<br />
Trivially no solutions except <math>(a, b) = (0, 0)</math>, which matches the solution in Case 1, which makes this an overcount.<br />
<br />
By CRT, each solution <math>(a, b)</math> corresponds exactly one positive integer in a set of exactly <math>\text{lcm} (25, 36) = 900</math> consecutive positive integers, and since there are <math>900</math> positive integers between <math>100</math> and <math>999</math>, our induction is complete, and our answer is <math>1 + 12 + 12 = \boxed{\textbf{(E) }25}</math>.<br />
<br />
-fidgetboss_4000<br />
<br />
{{AMC12 box|year=2013|ab=B|num-b=22|num-a=24}}<br />
<br />
{{AMC10 box|year=2013|ab=B|num-b=24|after=Last Question}}<br />
<br />
{{MAA Notice}}</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=Kevin_Zhao&diff=106098
Kevin Zhao
2019-06-03T21:55:44Z
<p>Relay400: ... Definitely not appropriate.</p>
<hr />
<div></div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=2019_USAJMO_Problems/Problem_4&diff=105623
2019 USAJMO Problems/Problem 4
2019-05-04T18:46:07Z
<p>Relay400: /* See also */</p>
<hr />
<div>==Problem==<br />
<math>(*)</math> Let <math>ABC</math> be a triangle with <math>\angle ABC</math> obtuse. The <math>A</math>''-excircle'' is a circle in the exterior of <math>\triangle ABC</math> that is tangent to side <math>\overline{BC}</math> of the triangle and tangent to the extensions of the other two sides. Let <math>E</math>, <math>F</math> be the feet of the altitudes from <math>B</math> and <math>C</math> to lines <math>AC</math> and <math>AB</math>, respectively. Can line <math>EF</math> be tangent to the <math>A</math>-excircle?<br />
<br />
==Solution==<br />
<br />
Instead of trying to find a synthetic way to describe <math>EF</math> being tangent to the <math>A</math>-excircle (very hard), we instead consider the foot of the perpendicular from the <math>A</math>-excircle to <math>EF</math>, hoping to force something via the length of the perpendicular. It would be nice if there were an easier way to describe <math>EF</math>, something more closely related to the <math>A</math>-excircle; as we are considering perpendicularity, if we could generate a line parallel to <math>EF</math>, that would be good. <br />
<br />
So we recall that it is well known that triangle <math>AEF</math> is similar to <math>ABC</math>. This motivates reflecting <math>BC</math> over the angle bisector at <math>A</math> to obtain <math>B'C'</math>, which is parallel to <math>EF</math> for obvious reasons. <br />
<br />
Furthermore, as reflection preserves intersection, <math>B'C'</math> is tangent to the reflection of the <math>A</math>-excircle over the <math>A</math>-angle bisector. But it is well-known that the <math>A</math>-excenter lies on the <math>A</math>-angle bisector, so the <math>A</math>-excircle must be preserved under reflection over the <math>A</math>-excircle. Thus <math>B'C'</math> is tangent to the <math>A</math>-excircle.Yet for all lines parallel to <math>EF</math>, there are only two lines tangent to the <math>A</math>-excircle, and only one possibility for <math>EF</math>, so <math>EF = B'C'</math>. <br />
<br />
Thus as <math>ABB'</math> is isoceles, <cmath>[ABC] = \frac{1}{2} \cdot AC \cdot BE = \frac{AC}{2} \cdot \sqrt{AB^2 - AE^2} = \frac{AC}{2} \cdot \sqrt{AB^2 - AB'^2} = \frac{AC}{2} \cdot \sqrt{AB^2 - AB^2} = 0,</cmath> contradiction. -alifenix-<br />
<br />
==Solution 2 ==<br />
<br />
The answer is no.<br />
<br />
Suppose otherwise. Consider the reflection over the bisector of <math>\angle BAC</math>. This swaps rays <math>AB</math> and <math>AC</math>; suppose <math>E</math> and <math>F</math> are sent to <math>E'</math> and <math>F'</math>. Note that the <math>A</math>-excircle is fixed, so line <math>E'F'</math> must also be tangent to the <math>A</math>-excircle.<br />
<br />
Since <math>BEFC</math> is cyclic, we obtain <math>\measuredangle ECB = \measuredangle EFB = \measuredangle EF'E'</math>, so <math>\overline{E'F'} \parallel \overline{BC}</math>. However, as <math>\overline{EF}</math> is a chord in the circle with diameter <math>\overline{BC}</math>, <math>EF \le BC</math>.<br />
<br />
If <math>EF < BC</math> then <math>E'F' < BC</math> too, so then <math>\overline{E'F'}</math> lies inside <math>\triangle ABC</math> and cannot be tangent to the excircle.<br />
<br />
The remaining case is when <math>EF = BC</math>. In this case, <math>\overline{EF}</math> is also a diameter, so <math>BECF</math> is a rectangle. In particular <math>\overline{BE} \parallel \overline{CF}</math>. However, by the existence of the orthocenter, the lines <math>BE</math> and <math>CF</math> must intersect, contradiction.<br />
<br />
==See also==<br />
{{MAA Notice}}<br />
{{USAJMO newbox|year=2019|num-b=3|num-a=5}}</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=2019_USAJMO_Problems/Problem_4&diff=105622
2019 USAJMO Problems/Problem 4
2019-05-04T18:45:51Z
<p>Relay400: /* Solution */</p>
<hr />
<div>==Problem==<br />
<math>(*)</math> Let <math>ABC</math> be a triangle with <math>\angle ABC</math> obtuse. The <math>A</math>''-excircle'' is a circle in the exterior of <math>\triangle ABC</math> that is tangent to side <math>\overline{BC}</math> of the triangle and tangent to the extensions of the other two sides. Let <math>E</math>, <math>F</math> be the feet of the altitudes from <math>B</math> and <math>C</math> to lines <math>AC</math> and <math>AB</math>, respectively. Can line <math>EF</math> be tangent to the <math>A</math>-excircle?<br />
<br />
==Solution==<br />
<br />
Instead of trying to find a synthetic way to describe <math>EF</math> being tangent to the <math>A</math>-excircle (very hard), we instead consider the foot of the perpendicular from the <math>A</math>-excircle to <math>EF</math>, hoping to force something via the length of the perpendicular. It would be nice if there were an easier way to describe <math>EF</math>, something more closely related to the <math>A</math>-excircle; as we are considering perpendicularity, if we could generate a line parallel to <math>EF</math>, that would be good. <br />
<br />
So we recall that it is well known that triangle <math>AEF</math> is similar to <math>ABC</math>. This motivates reflecting <math>BC</math> over the angle bisector at <math>A</math> to obtain <math>B'C'</math>, which is parallel to <math>EF</math> for obvious reasons. <br />
<br />
Furthermore, as reflection preserves intersection, <math>B'C'</math> is tangent to the reflection of the <math>A</math>-excircle over the <math>A</math>-angle bisector. But it is well-known that the <math>A</math>-excenter lies on the <math>A</math>-angle bisector, so the <math>A</math>-excircle must be preserved under reflection over the <math>A</math>-excircle. Thus <math>B'C'</math> is tangent to the <math>A</math>-excircle.Yet for all lines parallel to <math>EF</math>, there are only two lines tangent to the <math>A</math>-excircle, and only one possibility for <math>EF</math>, so <math>EF = B'C'</math>. <br />
<br />
Thus as <math>ABB'</math> is isoceles, <cmath>[ABC] = \frac{1}{2} \cdot AC \cdot BE = \frac{AC}{2} \cdot \sqrt{AB^2 - AE^2} = \frac{AC}{2} \cdot \sqrt{AB^2 - AB'^2} = \frac{AC}{2} \cdot \sqrt{AB^2 - AB^2} = 0,</cmath> contradiction. -alifenix-<br />
<br />
==Solution 2 ==<br />
<br />
The answer is no.<br />
<br />
Suppose otherwise. Consider the reflection over the bisector of <math>\angle BAC</math>. This swaps rays <math>AB</math> and <math>AC</math>; suppose <math>E</math> and <math>F</math> are sent to <math>E'</math> and <math>F'</math>. Note that the <math>A</math>-excircle is fixed, so line <math>E'F'</math> must also be tangent to the <math>A</math>-excircle.<br />
<br />
Since <math>BEFC</math> is cyclic, we obtain <math>\measuredangle ECB = \measuredangle EFB = \measuredangle EF'E'</math>, so <math>\overline{E'F'} \parallel \overline{BC}</math>. However, as <math>\overline{EF}</math> is a chord in the circle with diameter <math>\overline{BC}</math>, <math>EF \le BC</math>.<br />
<br />
If <math>EF < BC</math> then <math>E'F' < BC</math> too, so then <math>\overline{E'F'}</math> lies inside <math>\triangle ABC</math> and cannot be tangent to the excircle.<br />
<br />
The remaining case is when <math>EF = BC</math>. In this case, <math>\overline{EF}</math> is also a diameter, so <math>BECF</math> is a rectangle. In particular <math>\overline{BE} \parallel \overline{CF}</math>. However, by the existence of the orthocenter, the lines <math>BE</math> and <math>CF</math> must intersect, contradiction.<br />
<br />
==See also==<br />
{{USAJMO newbox|year=2019|num-b=3|num-a=5}}</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=AMC_historical_results&diff=104073
AMC historical results
2019-03-06T04:10:56Z
<p>Relay400: /* AMC 12A */</p>
<hr />
<div><!-- Post AMC statistics and lists of high scorers here so that the AMC page doesn't get cluttered. --><br />
This is the '''AMC historical results''' page. This page should include results for the [[AIME]] as well. For [[USAMO]] results, see [[USAMO historical results]].<br />
==2019==<br />
===AMC 10A===<br />
*Average score: TBD<br />
*AIME floor: TBD<br />
*DHR: TBD<br />
<br />
===AMC 10B===<br />
*Average score: TBD<br />
*AIME floor: TBD <br />
*DHR: TBD<br />
<br />
===AMC 12A===<br />
*Average score: TBD <br />
*AIME floor: TBD<br />
*DHR: TBD<br />
<br />
===AMC 12B===<br />
*Average score: TBD<br />
*AIME floor: TBD <br />
*DHR: TBD<br />
<br />
==2018==<br />
===AMC 10A===<br />
*Average score:53.84<br />
*AIME floor: 111<br />
*DHR: 127.5<br />
<br />
===AMC 10B===<br />
*Average score: 57.81<br />
*AIME floor: 108<br />
*DHR: 123<br />
<br />
===AMC 12A===<br />
*Average score: 56.36<br />
*AIME floor: 93<br />
*DHR: 120<br />
<br />
===AMC 12B===<br />
*Average score: 57.85<br />
*AIME floor: 99<br />
*DHR: 126<br />
<br />
===AIME I===<br />
*Average score: 5.09<br />
*Median score: 5<br />
*USAMO cutoff: 215 (AMC 12A), 235 (AMC 12B)<br />
*USAJMO cutoff: 222 (AMC 10A), 212 (AMC 10B)<br />
<br />
===AIME II===<br />
*Average score: 5.48<br />
*Median score: 5<br />
*USAMO cutoff: 216 (AMC 12A), 230.5 (AMC 12B)<br />
*USAJMO cutoff: 222 (AMC 10A), 212 (AMC 10B)<br />
<br />
===AMC 8===<br />
*Honor roll: 15<br />
*DHR: 19<br />
<br />
==2017==<br />
===AMC 10A===<br />
*Average score: 59.33<br />
*AIME floor: 112.5<br />
*DHR: 127.5<br />
<br />
===AMC 10B===<br />
*Average score: 66.56<br />
*AIME floor: 120<br />
*DHR: 136.5<br />
<br />
===AMC 12A===<br />
*Average score: 60.32<br />
*AIME floor: 96<br />
*DHR: 115.5<br />
<br />
===AMC 12B===<br />
*Average score: 58.35<br />
*AIME floor: 100.5<br />
*DHR: 129<br />
<br />
===AIME I===<br />
*Average score:5.70<br />
*Median score: 6<br />
*USAMO cutoff: 225 (AMC 12A), 235 (AMC 12B)<br />
*USAJMO cutoff: 224.5 (AMC 10A), 233 (AMC 10B)<br />
<br />
===AIME II===<br />
*Average score: 5.64<br />
*Median score: 6<br />
*USAMO cutoff: 221 (AMC 12A), 230.5 (AMC 12B)<br />
*USAJMO cutoff: 219 (AMC 10A), 225 (AMC 10B)<br />
===AMC 8===<br />
*Honor roll: 17<br />
*DHR: 20<br />
<br />
==2016==<br />
===AMC 10A===<br />
*Average score: 65.3<br />
*AIME floor: 110<br />
*DHR: 120<br />
<br />
===AMC 10B===<br />
*Average score: 65.4<br />
*AIME floor: 111<br />
*DHR: 124.5<br />
<br />
===AMC 12A===<br />
*Average score: 59.06<br />
*AIME floor: 93<br />
*DHR: 111<br />
<br />
===AMC 12B===<br />
*Average score: 67.96<br />
*AIME floor: 100.5<br />
*DHR: 127.5<br />
<br />
===AIME I===<br />
*Average score: 5.83<br />
*Median score: 6<br />
*USAMO cutoff: 220<br />
*USAJMO cutoff: 210.5<br />
<br />
===AIME II===<br />
*Average score: 4.33<br />
*Median score: 4<br />
*USAMO cutoff: 205<br />
*USAJMO cutoff: 200<br />
<br />
===AMC 8===<br />
*Honor roll: 18<br />
*DHR: 22<br />
<br />
==2015==<br />
===AMC 10A===<br />
*Average score: 73.39<br />
*AIME floor: 106.5<br />
*DHR: 115.5<br />
<br />
===AMC 10B===<br />
*Average score: 76.10<br />
*AIME floor: 120<br />
*DHR: 132<br />
<br />
===AMC 12A===<br />
*Average score: 69.90<br />
*AIME floor: 99<br />
*DHR: 117<br />
<br />
===AMC 12B===<br />
*Average score: 66.92<br />
*AIME floor: 100.5<br />
*DHR: 126<br />
<br />
===AIME I===<br />
*Average score: 5.29<br />
*Median score: 5<br />
*USAMO cutoff: 219.0<br />
*USAJMO cutoff: 213.0<br />
<br />
===AIME II===<br />
*Average score: 6.63<br />
*Median score: 6<br />
*USAMO cutoff: 229.0<br />
*USAJMO cutoff: 223.5<br />
<br />
==2014==<br />
===AMC 10A===<br />
*Average score: 63.83<br />
*AIME floor: 120<br />
*DHR: 132<br />
<br />
===AMC 10B===<br />
*Average score: 71.44<br />
*AIME floor: 120<br />
*DHR: 132<br />
<br />
===AMC 12A===<br />
*Average score: 64.01<br />
*AIME floor: 93<br />
*DHR: 109.5<br />
<br />
===AMC 12B===<br />
*Average score: 68.11<br />
*AIME floor: 100.5<br />
*DHR: 121.5<br />
<br />
===AIME I===<br />
*Average score: 4.88<br />
*Median score: 5<br />
*USAMO cutoff: 211.5<br />
*USAJMO cutoff: 211<br />
<br />
===AIME II===<br />
*Average score: 5.49<br />
*Median score: 5<br />
*USAMO cutoff: 211.5<br />
*USAJMO cutoff: 211<br />
<br />
==2013==<br />
===AMC 10A===<br />
*Average score: 72.50<br />
*AIME floor: 108<br />
*DHR: 117<br />
<br />
===AMC 10B===<br />
*Average score: 72.62<br />
*AIME floor: 120<br />
*DHR: 129<br />
<br />
===AMC 12A===<br />
*Average score: 65.06<br />
*AIME floor: 88.5<br />
*DHR: 106.5<br />
<br />
===AMC 12B===<br />
*Average score: 64.21<br />
*AIME floor: 93<br />
*DHR: 108<br />
<br />
===AIME I===<br />
*Average score: 4.69<br />
*Median score: 4<br />
*USAMO cutoff: 209<br />
*USAJMO cutoff: 210.5<br />
<br />
===AIME II===<br />
*Average score: 6.56<br />
*Median score: 6<br />
*USAMO cutoff: 209<br />
*USAJMO cutoff: 210.5<br />
<br />
==2012==<br />
===AMC 10A===<br />
*Average score: 72.51<br />
*AIME floor: 115.5<br />
*DHR: 121.5<br />
<br />
===AMC 10B===<br />
*Average score: 76.59<br />
*AIME floor: 120<br />
*DHR: 133.5<br />
<br />
===AMC 12A===<br />
*Average score: 64.62<br />
*AIME floor: 94.5<br />
*DHR: 109.5<br />
<br />
===AMC 12B===<br />
*Average score: 70.08<br />
*AIME floor: 99<br />
*DHR: 114<br />
<br />
===AIME I===<br />
*Average score: 5.13<br />
*Median score: <br />
*USAMO cutoff: 204.5<br />
*USAJMO cutoff: 204<br />
<br />
===AIME II===<br />
*Average score: 4.94<br />
*Median score: <br />
*USAMO cutoff: 204.5<br />
*USAJMO cutoff: 204<br />
<br />
==2011==<br />
===AMC 10A===<br />
*Average score: 64.24<br />
*AIME floor: 117<br />
*DHR: 129<br />
<br />
===AMC 10B===<br />
*Average score: 71.78<br />
*AIME floor: 117<br />
*DHR: 133.5<br />
<br />
===AMC 12A===<br />
*Average score: 65.38<br />
*AIME floor: 93<br />
*DHR: 112.5<br />
<br />
===AMC 12B===<br />
*Average score: 64.71<br />
*AIME floor: 97.5<br />
*DHR: 121.5<br />
<br />
===AIME I===<br />
*Average score: 2.23<br />
*Median score: <br />
*USAMO cutoff: 188<br />
*USAJMO cutoff: 179<br />
<br />
===AIME II===<br />
*Average score: 5.47<br />
*Median score: <br />
*USAMO cutoff: 215.5<br />
*USAJMO cutoff: 196.5<br />
<br />
==2010==<br />
===AMC 10A===<br />
*Average score: 68.11<br />
*AIME floor: 115.5<br />
<br />
===AMC 10B===<br />
*Average score: 68.57<br />
*AIME floor: 118.5<br />
<br />
===AMC 12A===<br />
*Average score: 61.02<br />
*AIME floor: 88.5<br />
<br />
===AMC 12B===<br />
*Average score: 59.58<br />
*AIME floor: 88.5<br />
<br />
===AIME I===<br />
*Average score: 5.90<br />
*Median score: <br />
*USAMO cutoff: 208.5 (204.5 for non juniors and seniors)<br />
*USAJMO cutoff: 188.5<br />
<br />
===AIME II===<br />
*Average score: 3.39<br />
*Median score: <br />
*USAMO cutoff: 208.5 (204.5 for non juniors and seniors)<br />
*USAJMO cutoff: 188.5<br />
<br />
==2009==<br />
===AMC 10A===<br />
*Average score: 67.41<br />
*AIME floor: 120<br />
<br />
===AMC 10B===<br />
*Average score: 74.73<br />
*AIME floor: 120<br />
<br />
===AMC 12A===<br />
*Average score: 66.37<br />
*AIME floor: 97.5<br />
<br />
===AMC 12B===<br />
*Average score: 71.88<br />
*AIME floor: 100 (Top 5% (1.00))<br />
<br />
===AIME I===<br />
*Average score: 4.17<br />
*Median score: 4<br />
*USAMO floor: <br />
<br />
===AIME II===<br />
*Average score: 3.27<br />
*Median score: 3<br />
*USAMO floor:<br />
<br />
==2008==<br />
===AMC 10A===<br />
*Average score: <br />
*AIME floor: <br />
<br />
===AMC 10B===<br />
*Average score: <br />
*AIME floor: <br />
<br />
===AMC 12A===<br />
*Average score: 65.6<br />
*AIME floor: 97.5<br />
<br />
===AMC 12B===<br />
*Average score: 68.9<br />
*AIME floor: 97.5<br />
<br />
===AIME I===<br />
*Average score: <br />
*Median score: <br />
*USAMO floor: <br />
<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2007==<br />
<br />
===AMC 10A===<br />
*Average score: 67.9<br />
*AIME floor: 117<br />
<br />
===AMC 10B===<br />
*Average score: 61.5<br />
*AIME floor: 115.5<br />
<br />
===AMC 12A===<br />
*Average score: 66.8<br />
*AIME floor: 97.5<br />
<br />
===AMC 12B===<br />
*Average score: 73.1<br />
*AIME floor: 100<br />
<br />
===AIME I===<br />
*Average score: 5<br />
*Median score: 3<br />
*USAMO floor: 6<br />
<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2006==<br />
===AMC 10A===<br />
*Average score: 79.0<br />
*AIME floor: 120<br />
<br />
===AMC 10B===<br />
*Average score: 68.5<br />
*AIME floor: 120<br />
<br />
===AMC 12A===<br />
*Average score: 85.7<br />
*AIME floor: 100<br />
<br />
===AMC 12B===<br />
*Average score: 85.5<br />
*AIME floor: 100<br />
<br />
===AIME I===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
===AIME II===<br />
*Average score: <br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2005==<br />
===AMC 10A===<br />
*Average score: 74.0<br />
*AIME floor: 120<br />
<br />
===AMC 10B===<br />
*Average score: 79.0<br />
*AIME floor: 120<br />
<br />
===AMC 12A===<br />
*Average score: 78.7<br />
*AIME floor: 100<br />
<br />
===AMC 12B===<br />
*Average score: 83.4<br />
*AIME floor: 100<br />
<br />
===AIME I===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2004==<br />
===AMC 10A===<br />
*Average score: 69.1<br />
*AIME floor: 110<br />
<br />
===AMC 10B===<br />
*Average score: 80.4<br />
*AIME floor: 120<br />
<br />
===AMC 12A===<br />
*Average score: 73.9<br />
*AIME floor: 100<br />
<br />
===AMC 12B===<br />
*Average score: 84.5<br />
*AIME floor: 100<br />
<br />
===AIME I===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2003==<br />
===AMC 10A===<br />
*Average score: 74.4<br />
*AIME floor: 119<br />
<br />
===AMC 10B===<br />
*Average score: 79.6<br />
*AIME floor: 121<br />
<br />
===AMC 12A===<br />
*Average score: 77.8<br />
*AIME floor: 100<br />
<br />
===AMC 12B===<br />
*Average score: 76.6<br />
*AIME floor: 100<br />
<br />
===AIME I===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2002==<br />
===AMC 10A===<br />
*Average score: 68.5<br />
*AIME floor: 115<br />
<br />
===AMC 10B===<br />
*Average score: 74.9<br />
*AIME floor: 118<br />
<br />
===AMC 12A===<br />
*Average score: 72.7<br />
*AIME floor: 100<br />
<br />
===AMC 12B===<br />
*Average score: 80.8<br />
*AIME floor: 100<br />
<br />
===AIME I===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2001==<br />
===AMC 10===<br />
*Average score: 67.8<br />
*AIME floor: 116<br />
<br />
===AMC 12===<br />
*Average score: 56.6<br />
*AIME floor: 84<br />
<br />
===AIME I===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==2000==<br />
===AMC 10===<br />
*Average score: 64.2<br />
*AIME floor: 120<br />
<br />
===AMC 12===<br />
*Average score: 64.9<br />
*AIME floor: <br />
<br />
===AIME I===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
===AIME II===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:<br />
<br />
==1999==<br />
===AHSME===<br />
*Average score: 68.8<br />
*AIME floor:<br />
<br />
===AIME===<br />
*Average score:<br />
*Median score:<br />
*USAMO floor:</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=1966_AHSME_Answer_Key&diff=101978
1966 AHSME Answer Key
2019-02-13T03:29:16Z
<p>Relay400: #1 is incorrect, I have verified this and answer page agrees</p>
<hr />
<div>#B<br />
#E<br />
#D<br />
#B<br />
#A<br />
#C<br />
#A<br />
#B<br />
#A<br />
#E<!-- # 10 --><br />
#C<br />
#E<br />
#E<br />
#C<br />
#D<br />
#B<br />
#C<br />
#A<br />
#B<br />
#C<!-- # 20 --><br />
#E<br />
#A<br />
#A<br />
#B<br />
#D<br />
#C<br />
#A<br />
#B<br />
#B<br />
#D<!-- # 30 --><br />
#D<br />
#B<br />
#D<br />
#B<br />
#C<br />
#E<br />
#C<br />
#D<br />
#E<br />
#A<!-- # 40 --></div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=Gmaas&diff=95668
Gmaas
2018-06-29T01:15:46Z
<p>Relay400: /* gmaas in Popular Culture */</p>
<hr />
<div> :) :O :P {{{=== Gmaas Facts ===}}} :) :O :P<br />
<br />
-Gmaas founded Target, but then Gmaas sued them for making the mascot look like a dog when it was supposed to look like Gmaas. <br />
<br />
-Everyone has a bit of Gmaas inside them. EDIT: Except you. You are pure Gmaas. <br />
<br />
-Gmaas likes to eat popsicles. Especially the fudge ones that get him hyper. When he is hyper he runs across Washington D.C. grabbing unsuspecting pedestrians and steals their phone, hacks into them and downloads Fortnite onto their poor phone.<br />
<br />
-Gmaas' favorite cereal is fruit loops. Gmaas thinks it tastes like unicorns jumping on rainbows<br />
<br />
-Gmaas is a champion pillow-fighter.<br />
<br />
-Gmaas colonized Mars.<br />
<br />
-He also colonized Jupiter, Pluto, and several other galaxies. He cloned some little Gmaas robots (with his amazingly robotic skill of coding) and put them all over a galaxy called Gmaasalaxy. <br />
<br />
-Gmaas has the ability to make every device play "The Duck Song" at will.<br />
<br />
-Gmaas once caught the red dot and ate it.<br />
<br />
-Gmaas' favorite color is neon klfhsadkhfd.<br />
<br />
-Gmaas is a champion pvp Minecraft player<br />
<br />
-Gmaas founded Costco.<br />
<br />
-Gmaas can solve any puzzle instantly.<br />
<br />
-When Gmaas flips coins, they always land tails.<br />
<br />
-On Gmaas's math tests, he always gets 101.777777777777777777777777777777777777777777777777777701%<br />
<br />
-Gmaas' favorite number is pi. It's also one of his favorite foods. <br />
<br />
-Gmaas' burps created all gaseous planets.<br />
<br />
-Gmass beat Luke Robatille in an epic showdown of catnip consumption.<br />
<br />
- Gmaas' wealth is unknown, but it is estimated to be way more than Scrooge's.<br />
<br />
- Gmaas has a summer house on Mars. <br />
<br />
-Gmaas attended Harvard, Yale, Stanford, MIT, UC Berkeley, Princeton, Columbia, and Caltech at the same time, using a time-turner.<br />
<br />
-Gmaas also attended Hogwarts and was a prefect. <br />
<br />
-Mrs.Norris is Gmaas's archenemy.<br />
<br />
-Gmaas is a demigod and attends Camp Half-Blood over summer. He is the counselor for the Apollo cabin. Because cats are demigod counselors too.<br />
<br />
-Gmaas has completed over 2,000 quests, and is very popular throughout Camp Half-Blood. He has also been to Camp Jupiter.<br />
<br />
-Gmaas painted the Mona Lisa, The Last Supper, and A Starry Night.<br />
<br />
-Gmass knows that the real names are Gmassa Lisa, The Last Domestic Meal, and Far-away Light.<br />
<br />
-Gmaas actually attended all the Ivy Leagues.<br />
<br />
- I am Gmaas<br />
<br />
- I too am Gmaas<br />
<br />
- But it is I who is Gmaas<br />
<br />
- Gmaas is us all<br />
<br />
- Gmaas is all of us yet none of us<br />
<br />
- Gmaas was captured by the infamous j3370 in 2017 but was released due to sympathy. EDIT: j3370 only captured his concrete form, his abstract form cannot be processed by a feeble human brain<br />
<br />
- Gmaas's fur is purple and yellow and red and green and orange and blue and brown and pink all at the same time. <br />
<br />
- Gmaas crossed the event horizon of a black hole and ended up in the AoPS universe.<br />
<br />
- Gmaas crossed the Delaware River with Washington.<br />
<br />
- Gmaas also crossed the Atlantic with the pilgrims.<br />
<br />
- if you are able to capture a Gmaas hair, he will give you some of his gmaas power.<br />
<br />
- Chuck norris makes Gmaas jokes.<br />
<br />
- Gmaas is also the ruler of Oceania, Eastasia, and Eurasia (1984 reference)<br />
<br />
- Gmaas killed Big Brother by farting on him. Though he was caught by the Ministry of Love, he escaped easily.<br />
<br />
- Everyone thinks that Gmaas is a god<br />
<br />
- Gmaas also owns Animal Farm. Napoleon was his servant.<br />
<br />
- Gmaas is the only one who knows where Amelia Earhart is.<br />
<br />
- Gmaas is the only cat that has been proven transcendental.<br />
<br />
- Gmaas happened to notice http://artofproblemsolving.com/community/c402403h1598015p9983782 and is not very happy about it.<br />
<br />
- Grumpy cat reads Gmaas memes. EDIT: Grumpy cat then steals them and claims they're his. Gmass in't very happy about that, either.<br />
<br />
- The real reason why AIME cutoffs aren't out yet is because Gmaas refused to grade them due to too much problem misplacement.<br />
<br />
- Gmaas dueled Grumpy Cat and lost. He wasn't trying.<br />
<br />
- Gmaas sits on the statue of pallas and says forevermore (the Raven refrence )<br />
<br />
- Gmaas is a big fan of Edgar Allan Poe, because he is actually Poe. <br />
<br />
- Gmaas does merely not use USD. He owns it.<br />
<br />
- Gmaas really knows that Roblox is awful and does not play it seriously, thank god our lord is sane<br />
<br />
- In 2003, Gmaas used elliptical curves to force his reign over AoPS.<br />
<br />
- "Actually, my name is spelled GMAAS"<br />
<br />
- Gmaas is the smartest living being in the universe.<br />
<br />
- It was Gmaas who helped Sun Wukong on the Journey to the West.<br />
<br />
- Gmaas is the real creator of Wikipedia.<br />
<br />
-It is said Gmaas could hack any website he desires.<br />
<br />
-Gmaas is the basis of Greek mythology.<br />
<br />
-Gmaas once sold Google to a man for around <math>12</math> dollars!<br />
<br />
-Gmaas uses a HP printer.<br />
<br />
-Gmaas owns all AoPS staff including Richard Rusczyk.<br />
<br />
-Gmaas was there when Yoda was born.<br />
<br />
- Gmaas's true number of lives left is unknown; however, Gmaas recently confirmed that he had at least one left. Why doesn't Gmaas have so many more lives than other cats? The power of Gmaas.<br />
<br />
- sseraj once spelled Gmaas as gmASS on accident in Introduction to Geometry (1532).<br />
<br />
-Gmaas actively plays Roblox, and is a globally ranked professional gamer: https://www.roblox.com/users/29708533/profile...but he hates Roblox.<br />
<br />
-Gmaas has beaten Chuck Norris and The Rock and John Cena all together in a fight.<br />
<br />
-Gmaas is a South Korean, North Korean, Palestinian, Israeli, U.S., and Soviet citizen at the same time. EDIT: Gmaas has now been found out to be a citizen of every country in the world. Gmaas seems to enjoy the country of AOPS best, however.<br />
<br />
-"i am sand" destroyed Gmaas in FTW<br />
<br />
- sseraj posted a picture of gmaas with a game controller in Introduction to Geometry (1532).<br />
<br />
-Gmaas plays roblox mobile edition and likes Minecraft, Candy Crush, and Club Penguin Rewritten. He also <math>\boxed{\text{loves}}</math> <b>Cat</b>ch that fish.<br />
<br />
-Gmaas is Roy Moore's horse in the shape of a cat<br />
<br />
-Gmaas is a known roblox/club penguin rewritten player and is a legend at it. He has over <math>289547987693</math> robux and <math>190348</math> in CPR.<br />
<br />
-This is all hypothetical.<br />
<br />
- EDIT: This is all factual <br />
<br />
-Gmaas's real name is Princess. He has a sibling named Rusty/Fireheart/Firestar<br />
(Warrior cats reference)<br />
<br />
- He is capable of salmon powers, according to PunSpark (ask him)<br />
<br />
-The Gmaas told Richard Rusczyk to make AoPS<br />
<br />
-The Gmaas is everything. Yes, you are part of the Gmaas-Dw789<br />
<br />
-The Gmaas knows every dimension up to 9999999999999999999999999999999999999999999999999999999999999999999999999999999999th dimension.<br />
<br />
-Certain theories provide evidence that he IS darth plagueis the wise.<br />
<br />
-Gmaas is "TIRED OF PEOPLE ADDING TO HIS PAGE!!" (Maas 45).<br />
<br />
-Gmaas has multiple accounts; some of them are pifinity, cyumi, srej, squareman, Electro3.0, sturdywill, g1zq, alleycat, Equinox8, anc3, batta, beastgert, and lakecomo224. His best account, though, is wlm7, later renamed to "gmail.com".<br />
<br />
-Gmaas has a penguin servant named sm24136 who runs GMAASINC. The penguin may or may not be dead. <br />
<br />
-Gmaas owns a TARDIS, and can sometimes be seen traveling to other times for reasons unknown.<br />
<br />
-Gmaas knows how to hack into top secret aops community pages.<br />
<br />
-Gmaas was a river clant cat who crossed the event horizon of a black hole and came out the other end!<br />
<br />
-Gmaas is king of the first men, the anduls.<br />
<br />
-Gmaas is a well known professor at MEOWston Academy.<br />
<br />
-Gmaas is a Tuna addict, along with other, more potent fish such as Salmon and Trout.<br />
<br />
-Gmaas won the reward of being cutest and fattest cat ever--he surpassed grumpy cat. (He also out-grumped grumpy cat!!!)<br />
<br />
-Last sighting 1665 Algebra-A 3/9/18 at 9:08 PM.<br />
<br />
- owner of sseraj, not pet.<br />
<br />
- embodiment of life and universe and beyond .<br />
<br />
- Watches memes.<br />
<br />
-After Death became the GOD OF HYPERDEATH and obtained over 9000 souls.<br />
<br />
-Gmaas's real name is Pablo Diego JosÃ© Francisco de Paula Juan Nepomuceno MarÃa de los Remedios Cipriano de la SantÃsima Trinidad Ruiz y Picasso [STOP RICK ROLLING. (Source)]<br />
<br />
-Gmaas is a certified Slytherin.<br />
<br />
-Gmaas once slept on sseraj's private water bed, so sseraj locked him in the bathroom <br />
<br />
-Gmaas has superpowers that allow him to overcome the horrors of Mr. Toilet (while he was locked in the bathroom)<br />
<br />
- Gmaas once sat on an orange on a pile of AoPS books, causing an orange flavored equation explosion.<br />
<br />
-Gmaas once conquered the moon and imprinted his face on it until asteroids came.<br />
<br />
-Gmaas is a supreme overlord who must be given <math>10^{1000000000000000000000^{1000000000000000000000}}</math> minecraft DIAMONDS<br />
<br />
- gmaas is the Doctor Who lord; he sports Dalek-painted cars and eats human finger cheese and custard, plus black holes.<br />
<br />
- Gmaas is everyone's favorite animal. <br />
<br />
- He lives with sseraj. <br />
<br />
-Gmaas is my favorite pokemon<br />
<br />
-Gmaas dislikes number theory but enjoys geometry.<br />
<br />
- Gmaas is cool<br />
<br />
- He is often overfed (with probability <math>\frac{3972}{7891}</math>), or malnourished (with probability <math>\frac{3919}{7891}</math>) by sseraj.<br />
<br />
- He has <cmath>\sum_{k=1}^{267795} [k(k+1)]+GMAAS+GMAAAAAAAS</cmath> supercars, excluding the Purrari and the 138838383 Teslas. <br />
<br />
- He is an employee of AoPS.<br />
<br />
- He is a gmaas with yellow fur and white hypnotizing eyes.<br />
<br />
- He has the ability to divide by zero.<br />
<br />
- He was born with a tail that is a completely different color from the rest of his fur.<br />
<br />
- His stare is very hypnotizing and effective at getting table scraps.<br />
<br />
- He sometimes appears several minutes before certain classes start as an admin. <br />
<br />
- He died from too many Rubik's cubes in an Introduction to Algebra A class, but got revived by the Dark Lord at 00:13:37 AM the next day.<br />
<br />
- It is uncertain whether or not he is a cat, or is merely some sort of beast that has chosen to take the form of a cat (specifically a Persian Smoke.) <br />
<br />
- Actually, he is a cat. He said so. And science also says so.<br />
<br />
- He is distant relative of Mathcat1234.<br />
<br />
- He is very famous now, and mods always talk about him before class starts.<br />
<br />
- His favorite food is AoPS textbooks because they help him digest problems.<br />
<br />
- Gmaas tends to reside in sseraj's fridge.<br />
<br />
- Gmaas once ate all sseraj's fridge food, so sseraj had to put him in the freezer.<br />
<br />
- The fur of Gmaas can protect him from the harsh conditions of a freezer.<br />
<br />
- Gmaas sightings are not very common. There have only been 8 confirmed sightings of Gmaas in the wild.<br />
<br />
- Gmaas is a sage omniscient cat.<br />
<br />
- He is looking for suitable places other than sseraj's fridge to live in.<br />
<br />
- Places where gmaas sightings have happened: <br />
~The Royal Scoop ice cream store in Bonita Beach Florida<br />
<br />
~MouseFeastForCats/CAT 8 Mouse Apartment 1083<br />
<br />
-Prealgebra 2 (1440)<br />
<br />
~Alligator Swamp A 1072 <br />
<br />
~Alligator Swamp B 1073<br />
<br />
~Prealgebra A (1488)<br />
<br />
~Introduction to Algebra A (1170)<br />
<br />
~Introduction to Algebra B (1529)<br />
<br />
~Welcome to Panda Town Gate 1076<br />
<br />
~Welcome to Gmaas Town Gate 1221<br />
<br />
~Welcome to Gmaas Town Gate 1125<br />
<br />
~33Â°01'17.4"N 117Â°05'40.1"W (Rancho Bernardo Road, San Diego, CA)<br />
<br />
~The other side of the ice in Antarctica<br />
<br />
~Feisty Alligator Swamp 1115<br />
<br />
~Introduction to Geometry 1221 (Taught by sseraj)<br />
<br />
~Introduction to Counting and Probability 1142 <br />
<br />
~Feisty-ish Alligator Swamp 1115 (AGAIN)<br />
<br />
~Intermediate Counting and Probability 1137<br />
<br />
~Intermediate Counting and Probability 1207<br />
<br />
~Posting student surveys<br />
<br />
~USF Castle Walls - Elven Tribe 1203<br />
<br />
~Dark Lord's Hut 1210<br />
<br />
~AMC 10 Problem Series 1200<br />
<br />
~Intermediate Number Theory 1138<br />
<br />
~Intermediate Number Theory 1476<br />
<br />
~Introduction To Number Theory 1204. Date:7/27/16.<br />
<br />
~Algebra B 1112<br />
<br />
~Intermediate Algebra 1561 7:17 PM 12/11/16<br />
<br />
~Nowhere Else, Tasmania<br />
<br />
~Earth Dimension C-137<br />
~Geometry 1694 at 1616 PST military time. There was a boy riding him, and he seemed extremely miffed.<br />
<br />
<br />
<br />
<br />
- These have all been designated as the most glorious sections of Aopsland now (especially the USF castle walls), but deforestation is so far from threatens the wild areas (i.e. Alligator Swamps A&B).<br />
<br />
- Gmaas has also been sighted in Olympiad Geometry 1148.<br />
<br />
- Gmaas has randomly been known to have sent his minions into Prealgebra 2 1163. However, the danger is passed, that class is over.<br />
<br />
- Gmaas once snuck into sseraj's email so he could give pianoman24 an extension in Introduction to Number Theory 1204. This was 1204 minutes after his sighting on 7/27/16.<br />
<br />
- Gmaas also has randomly appeared on top of the USF's Tribal Bases(he seems to prefer the Void Tribe). However, the next day there is normally a puddle in the shape of a cat's underbelly wherever he was sighted. Nobody knows what this does. <br />
<br />
EDIT: Nobody has yet seen him atop a tribal base yet.<br />
<br />
- Gmaas are often under the disguise of a penguin or cat. Look out for them.<br />
<br />
EDIT: Gmaas rarely disguises himself as a penguin.<br />
<br />
- Many know that leafy stole dream island. In truth, After leafy stole it, Gmaas stole it himself. (BFDI Reference)<br />
<br />
- He lives in the shadows. Is he a dream? Truth? Fiction? Condemnation? Salvation? AoPS site admin? He is all these things and none of them. He is... Gmaas.<br />
<br />
EDIT: He IS an AoPS site admin.<br />
<br />
- If you make yourself more than just a cat... if you devote yourself to an ideal... and if they can't stop you... then you become something else entirely. A LEGEND. Gmaas now belongs to the ages.<br />
<br />
- Is this the real life? Is this just fantasy? No. This is Gmaas, the legend.<br />
<br />
-Aha!! An impostor!! <br />
http://www.salford.ac.uk/environment-life-sciences/research/applied-archaeology/greater-manchester-archaeological-advisory-service<br />
(look at the acronym).<br />
<br />
-EDIT. The above fact is slightly irrelevant.<br />
<br />
- Gmaas might have been viewing (with a <math>\frac{99999.\overline{9}}{100000}</math> chance) the Ultimate Survival Forum. He (or is he a she?) is suspected to be transforming the characters into real life. Be prepared to meet your epic swordsman self someday. If you do a sci-fi version of USF, then prepare to meet your Overpowered soldier with amazing weapons one day.<br />
<br />
- EDIT: Gmaas is a he.<br />
<br />
-Gmaas is love, Gmaas is life<br />
<br />
- The name of Gmaas is so powerful, it radiates Deja Mew.<br />
<br />
- Gmaas is on the list of "Elusive Creatures." If you have questions or want the full list, contact moab33.<br />
<br />
- Gmaas can be summoned using the <math>\tan(90)</math> ritual. Draw a pentagram and write the numerical value of <math>\tan(90)</math> in the middle, and he will be summoned.<br />
<br />
- EDIT: The above fact is incorrect. math101010 has done this and commented with screenshot proof at the below link, and Gmaas was not summoned.<br />
https://artofproblemsolving.com/community/c287916h1291232<br />
<br />
- EDIT EDIT: The above 'proof' is non-conclusive. math101010 had only put an approximation.<br />
<br />
- Gmaas's left eye contains the singularity of a black hole. (Only when everyone in the world blinks at the same time within a nano-nano second.)<br />
<br />
- EDIT: That has never happened and thus it does not contain the singularity of a black hole.<br />
<br />
- Lord Grindelwald once tried to make Gmaas into a Horcrux, but Gmaas's fur is Elder Wand protected and secure, as Kendra sprinkled holly into his fur.<br />
<br />
-Despite common belief, Harry Potter did not defeat Lord Voldemort. Gmaas did.<br />
<br />
- The original owner of Gmaas is Gmaas.<br />
<br />
- Gmaas was not the fourth Peverell brother, but he ascended into a higher being and now he resides in the body of a cat, as he was before. Is it a cat? We will know. (And the answer is YES.) EDIT: he wasn't the fourth Peverell brother, but he was a cousin of theirs, and he was the one who advised Ignotus to give up his cloak.<br />
<br />
- It is suspected that Gmaas may be ordering his cyber hairballs to take the forums, along with microbots.<br />
<br />
- The name of Gmaas is so powerful, it radiates Deja Mu.<br />
<br />
- Gmaas rarely frequents the headquarters of the Illuminati. He was their symbol for one yoctosecond, but soon decided that the job was too low for his power to be wasted on.<br />
<br />
- It has been wondered if Gmaas is the spirit of Obi-Wan Kenobi or Anakin Skywalker in a higher form, due to his strange capabilities and powers.<br />
<br />
- Gmaas has a habit of sneaking into computers, joining The Network, and exiting out of some other computer.<br />
<br />
- It has been confirmed that gmaas uses gmewal as his email service<br />
<br />
- Gmaas enjoys wearing gmean shorts<br />
<br />
- Gmaas has a bright orange tail with hot pink spirals. Or he had for 15 minutes. <br />
<br />
- Gmaas is well known behind his stage name, Michael Stevens (also known as Vsauce XD), or his page name, Purrshanks. EDIT: Crookshanks was his brother.<br />
<br />
- Gmaas rekt sseraj at 12:54 June 4, 2016 UTC time zone. And then the Doctor chased him.<br />
<br />
- Gmaas watchers know that the codes above are NOT years. They are secret codes for the place. But if you've edited that section of the page, you know that.<br />
<br />
- Gmaas is a good friend of the TARDIS and the Millenium Falcon. <br />
<br />
- In the Dark Lord's hut, gmaas was seen watching Doctor Who. Anyone who has seen the Dark Lord's hut knows that both Gmaas and the DL (USF code name of the Dark Lord) love BBC. How Gmaas gave him a TV may be lost to history. And it has been lost.<br />
<br />
- The TV has been noticed to be invincible. Many USF weapons, even volcano rings, have tried (and failed) to destroy it. The last time it was seen was on a Kobold display case outside of a mine. The display case was crushed, and a report showed a spy running off with a non-crushed TV.<br />
<br />
-The reason why Dacammel left the USF is that gmaas entrusted his TV to him, and not wanting to be discovered by LF, Cobra, or Z9, dacammel chose to leave the USF, but is regretting it, as snakes keep spawning from the TV.<br />
<br />
- EDIT: The above fact is somewhat irrelevant.<br />
<br />
-EDIT EDIT. Dacammel gave the TV back to gmaas, and he left the dark side and their cookies alone. <br />
<br />
- Gmaas is a Super Duper Uper Cat Time Lord. He has <math>57843504</math> regenerations and has used <math>3</math>. <cmath>9\cdot12\cdot2\cdot267794=57843504</cmath>. <br />
<br />
-Gmaas highly enjoys destroying squeaky toys until he finds the squeaky part, then destroys the squeaky part.<br />
<br />
- Gmaas loves to eat turnips. At <math>\frac{13}{32}</math> of the sites he was spotted at, he was seen with a turnip.<br />
<br />
-Gmaas has a secret hidden garden full of turnips under sseraj's house.<br />
<br />
- Gmaas has three tails, one for everyday life, one for special occasions, and one that's invisible.<br />
<br />
-Gmaas is a dangerous creature. If you ever meet him, immediately join his army or you will be killed.<br />
<br />
-Gmaas is in alliance with the Cult of Skaro. How did he get an alliance with ruthless creatures that want to kill everything in sight? Nobody knows (except him), not even the leader of the Cult of Skaro.<br />
<br />
-Gmaas lives in Gallifrey and in Gotham City (he has sleepovers with Batman).<br />
<br />
-Gmaas is an excellent driver. EDIT: he was to one who designed the driver's license test, although he didn't bother with the permit test.<br />
<br />
-The native location of Gmaas is the twilight zone.<br />
<br />
-Donald Trump once sang "All Hail the Chief" to Gmaas, 3 days after being sworn in as US President.<br />
<br />
- Gmaas likes to talk with rrusczyk from time to time.<br />
<br />
- Gmaas can shoot fire from his smelly butt.<br />
<br />
- Gmaas is the reason why the USF has the longest thread on AoPS.<br />
<br />
- Gmass is an avid watcher of the popular T.V. show "Bernie Sanders and the Gauntlet of DOOM"<br />
<br />
- sseraj, in 1521 Introduction to Number Theory, posted an image of Gmaas after saying "Who wants to see 5space?" at around 5:16 PM Mountain Time, noting Gmaas was "also 5space"<br />
<br />
-EDIT: he also did it in Introduction to Algebra A once.<br />
<br />
- Gmaas is now my HD background on my Mac.<br />
<br />
- In 1521 Into to Number Theory, sseraj posted an image of a 5space Gmaas fusion. (First sighting) <br />
<br />
- Also confirmed that Gmaas doesn't like ketchup because it was the only food left the photo.<br />
<br />
- In 1447 Intro to Geometry, sseraj posted a picture of Gmaas with a rubik's cube suggesting that Gmaas's has an average solve time of <math>-GMAAS</math> seconds.<br />
<br />
-Gmaas beat Superman in a fight with ease<br />
<br />
-Gmaas was an admin of Roblox<br />
<br />
-Gmaas traveled around the world, paying so much <math>MONEY</math> just to eat :D<br />
<br />
-Gmaas is a confirmed Apex predator and should not be approached, unless in a domestic form.<br />
Summary:<br />
<br />
-When Gmaas subtracts <math>0.\overline{99}</math> from <math>1</math>, the difference is greater than <math>0</math>.<br />
<br />
-Gmaas was shown to have fallen on Wed Aug 23 2017: https://ibb.co/bNrtmk https://ibb.co/jzUDmk<br />
<br />
-Gmaas died on August ,24, 2017, but fortunately IceParrot revived him after about 2 mins of being dead.<br />
<br />
-The results of the revival are top secret, and nobody knows what happened.<br />
<br />
-sseraj, in 1496 Prealgebra 2, said that Gmaas is Santacat.<br />
<br />
-sseraj likes to post a picture of gmaas in every class he passes by.<br />
<br />
-sseraj posted a picture of gmaas as an Ewok, suggesting he resides on the moon of Endor. Unfortunately, the moon of Endor is also uninhabitable ever since the wreckage of the Death Star changed the climate there. It is thought gmaas is now wandering space in search for a home.<br />
EDIT: What evidence is there Endor was affected? Other Ewoks still live there.<br />
EDIT EDIT: also, glass doesn't care. He can live there no matter what the climate is.<br />
<br />
-Gmaas is the lord of the pokemans<br />
<br />
-Gmaas can communicate with, and sometimes control any other cats, however this is very rare, as cats normally have a very strong will.<br />
<br />
-Picture of Gmaas http://i.imgur.com/PP9xi.png<br />
<br />
-Known by Mike Miller<br />
<br />
-Gmaas got mad at sseraj once, so he locked him in his own freezer<br />
<br />
-Then, sseraj decided to eat all of Gmaas's hidden turnips in the freezer as punishment<br />
<br />
-Gmaas is an obviously omnipotent cat.<br />
<br />
-ehawk11 met him<br />
<br />
-sseraj is known to post pictures of Gmaas on various AoPS classrooms. It is not known if these photos have been altered with the editing program called 'Photoshop'.<br />
<br />
-sseraj has posted pictures of gmaas in '"intro to algebra", before class started, with the title, "caption contest". anyone who posted a caption mysteriously vanished in the middle of the night. <br />
EDIT: This has happened many times, including in Introduction to Geometry 1533, among other active classes. The person writing this (Poeshuman) did participate, and did not disappear. (You could argue Gmaas is typing this through his/her account...)<br />
<br />
- gmaas has once slept in your bed and made it wet<br />
<br />
-It is rumored that rrusczyk is actually Gmaas in disguise<br />
<br />
-Gmaas is suspected to be a Mewtwo in disguise<br />
<br />
-Gmaas is a cat but has characteristics of every other animal on Earth.<br />
<br />
-Gmaas is the ruler of the universe and has been known to be the creator of the species "Gmaasians".<br />
<br />
-There is a rumor that Gmaas is starting a poll<br />
<br />
-Gmaas is a rumored past ThunderClan cat who ran away, founded GmaasClan, then became a kittypet.<br />
<br />
-There is a rumored sport called "Gmaas Hunting" where people try to successfully capture gmaas in the wild with video/camera/eyes. Strangely, no one has been able to do this, and those that have have mysteriously disappeared into the night. Nobody knows why. The person who is writing this(g1zq) has tried Gmaas Hunting, but has never been successful.<br />
<br />
- Gmaas burped and caused an earthquake.<br />
<br />
- Gmaas once drank from your pretty teacup.<br />
<br />
-GMAAS IS HERE.... PURRRRRRRRRRRRRRRRRRRR<br />
<br />
-Gmass made, and currently owns the Matrix.<br />
<br />
-The above fact is true. Therefore, this is an illusion.<br />
<br />
-Gmaas is the reason Salah will become better than Ronaldo.<br />
<br />
-Who is Gmaas, really?<br />
-Gmass is a heavenly being<br />
<br />
-Illuminati was a manifestation of Gmaas, but Gmass decided illuminati was not great enough for his godly self.<br />
<br />
-jlikemath has met Gmaas and Gmaas is his best friend.<br />
<br />
-Gmaas loves Kpop<br />
<br />
-Gmaas read Twilight EDIT: ...and SURVIVED<br />
<br />
-there is a secret code when put into super smash, Gmass would be a playible character. Too bad he didn't say it.<br />
<br />
-Gmaas was a tribute to one of the Hunger Games and came out a Victor and now lives in District 4<br />
<br />
=== Gmaas photos ===<br />
http://cdn.artofproblemsolving.com/images/f/f/8/ff8efef3a0d2eb51254634e54bec215b948a1bba.jpg<br />
<br />
=== gmaas in Popular Culture ===<br />
<br />
- <s>Currently, is being written (by themoocow) about the adventures of gmaas. It is aptly titled, "The Adventures of gmaas".</s>Sorry, this was a rick roll troll.<br />
<br />
- BREAKING NEWS: tigershark22 has found a possible cousin to gmaas in Raymond Feist's book Silverthorn. They are mountain dwellers, gwali. Not much are known about them either, and when someone asked,"What are gwali?" the customary answer "This is gwali" is returned. Scientist 5space is now looking into it.<br />
<br />
- Sullymath and themoocow are also writing a book about Gmaas<br />
<br />
-Sighting of Gmaas: https://2017.spaceappschallenge.org/challenges/warning-danger-ahead/and-you-can-help-fight-fires/teams/gmaas/project<br />
<br />
-Oryx the mad god is actually gmass wearing a suit of armor. This explains why he is never truly killed<br />
<br />
- Potential sighting of gmaas [http://www.gmac.com/frequently-asked-questions/gmass-search-service.aspx]<br />
<br />
- Gmaas has been spotted in some Doctor Who and Phineas and Ferb episodes, such as Aliens of London, Phineas and Ferb Save Summer, Dalek, Rollercoaster, Rose, Boom Town, The Day of The Doctor, Candace Gets Busted, and many more.<br />
<br />
- Gmaas can be found in many places in Plants vs. Zombies Garden Warfare 2 and Bloons TD Battles<br />
<br />
- gmaas was an un-credited actor in the Doctor Who story Knock Knock, playing a Dryad. How he shrunk, we will never know.<br />
<br />
-oadaegan is also writing a story about him. He is continuing the book that was started by JpusheenS. when he is done he will post it here<br />
<br />
-Gmaas is a time traveler from 0.9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 B.C.<br />
<br />
-No one knows if Gmass is a Mr. mime in a cat skin, the other way around, or just a downright combination of both.<br />
<br />
-In it, it mentions these four links as things Gmass is having trouble (specifically technical difficulties). What could it mean? Links:<br />
https://docs.google.com/document/d/1NZ0XcFYm80sA-fAoxnm7ulMCwdNU75Va_6ZjRHfSHV0<br />
https://docs.google.com/document/d/1ELN7ORauFFv1dwpU_u-ah_dFJHeuJ3szYxoeC1LlDQg/<br />
https://docs.google.com/document/d/1oy9Q3F7fygHw-OCWNEVE8d-Uob2dxVACFcGUcLmk3fA<br />
https://docs.google.com/document/d/1jzb9Q6FmDmrRyXwnik3e0sYw5bTPMo7aBwugmUbA13o<br />
<br />
<br />
- Another possible Gmaas sighting [https://2017.spaceappschallenge.org/challenges/warning-danger-ahead/and-you-can-help-fight-fires/teams/gmaas/project]<br />
<br />
-<math>Another</math> sighting? [https://www.radarbox24.com/data/flights/GMAAS]<br />
- Yet Another Gmaas sighting ? [https://supportforums.cisco.com/t5/user/viewprofilepage/user-id/45046]<br />
<br />
-Gmaas has been sighted several times on the Global Announcements forum<br />
<br />
-Gmaas uses the following transportation: <img> http://cdn.artofproblemsolving.com/images/3/6/8/368da4e615ea3476355ee3388b39f30a48b8dd48.jpg </img><br />
<br />
- When Gmaas was mad, he started world wars 1 & 2. It is only because of Gmaas that we have not had World War 3.<br />
<br />
- Gmaas is the only cat to have been proved irrational and transcendental, though we suspect all cats fall in the first category.<br />
<br />
- Gmaas plays Geometry Dash and shares an account with Springhill, his username is D3m0nG4m1n9.<br />
<br />
-Gmaas likes to whiz on the wilzo<br />
<br />
-Gmaas has been spotted in AMC 8 Basics<br />
<br />
-Gmaas is cool<br />
<br />
-Gmaas hemoon card that does over 9000000 dmg<br />
<br />
-Gmaas is a skilled swordsman who should not to be mistaken for Puss in Boots. Some say he even trained the mysterious and valiant Meta Knight.<br />
<br />
-Kirby once swallowed Gmaas. Gmaas had to spit him out.<br />
<br />
-Gmaas was the creator of pokemon, and his pokemon card can OHKO anyone in one turn. He is invisible and he will always move first.<br />
<br />
-Gmaas beat Dongmin in The Genius Game Seasons 1, 2, 3, 4, 5, 6, and 7.</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=Gmaas&diff=95667
Gmaas
2018-06-29T01:14:39Z
<p>Relay400: /* gmaas in Popular Culture */</p>
<hr />
<div> :) :O :P {{{=== Gmaas Facts ===}}} :) :O :P<br />
<br />
-Gmaas founded Target, but then Gmaas sued them for making the mascot look like a dog when it was supposed to look like Gmaas. <br />
<br />
-Everyone has a bit of Gmaas inside them. EDIT: Except you. You are pure Gmaas. <br />
<br />
-Gmaas likes to eat popsicles. Especially the fudge ones that get him hyper. When he is hyper he runs across Washington D.C. grabbing unsuspecting pedestrians and steals their phone, hacks into them and downloads Fortnite onto their poor phone.<br />
<br />
-Gmaas' favorite cereal is fruit loops. Gmaas thinks it tastes like unicorns jumping on rainbows<br />
<br />
-Gmaas is a champion pillow-fighter.<br />
<br />
-Gmaas colonized Mars.<br />
<br />
-He also colonized Jupiter, Pluto, and several other galaxies. He cloned some little Gmaas robots (with his amazingly robotic skill of coding) and put them all over a galaxy called Gmaasalaxy. <br />
<br />
-Gmaas has the ability to make every device play "The Duck Song" at will.<br />
<br />
-Gmaas once caught the red dot and ate it.<br />
<br />
-Gmaas' favorite color is neon klfhsadkhfd.<br />
<br />
-Gmaas is a champion pvp Minecraft player<br />
<br />
-Gmaas founded Costco.<br />
<br />
-Gmaas can solve any puzzle instantly.<br />
<br />
-When Gmaas flips coins, they always land tails.<br />
<br />
-On Gmaas's math tests, he always gets 101.777777777777777777777777777777777777777777777777777701%<br />
<br />
-Gmaas' favorite number is pi. It's also one of his favorite foods. <br />
<br />
-Gmaas' burps created all gaseous planets.<br />
<br />
-Gmass beat Luke Robatille in an epic showdown of catnip consumption.<br />
<br />
- Gmaas' wealth is unknown, but it is estimated to be way more than Scrooge's.<br />
<br />
- Gmaas has a summer house on Mars. <br />
<br />
-Gmaas attended Harvard, Yale, Stanford, MIT, UC Berkeley, Princeton, Columbia, and Caltech at the same time, using a time-turner.<br />
<br />
-Gmaas also attended Hogwarts and was a prefect. <br />
<br />
-Mrs.Norris is Gmaas's archenemy.<br />
<br />
-Gmaas is a demigod and attends Camp Half-Blood over summer. He is the counselor for the Apollo cabin. Because cats are demigod counselors too.<br />
<br />
-Gmaas has completed over 2,000 quests, and is very popular throughout Camp Half-Blood. He has also been to Camp Jupiter.<br />
<br />
-Gmaas painted the Mona Lisa, The Last Supper, and A Starry Night.<br />
<br />
-Gmass knows that the real names are Gmassa Lisa, The Last Domestic Meal, and Far-away Light.<br />
<br />
-Gmaas actually attended all the Ivy Leagues.<br />
<br />
- I am Gmaas<br />
<br />
- I too am Gmaas<br />
<br />
- But it is I who is Gmaas<br />
<br />
- Gmaas is us all<br />
<br />
- Gmaas is all of us yet none of us<br />
<br />
- Gmaas was captured by the infamous j3370 in 2017 but was released due to sympathy. EDIT: j3370 only captured his concrete form, his abstract form cannot be processed by a feeble human brain<br />
<br />
- Gmaas's fur is purple and yellow and red and green and orange and blue and brown and pink all at the same time. <br />
<br />
- Gmaas crossed the event horizon of a black hole and ended up in the AoPS universe.<br />
<br />
- Gmaas crossed the Delaware River with Washington.<br />
<br />
- Gmaas also crossed the Atlantic with the pilgrims.<br />
<br />
- if you are able to capture a Gmaas hair, he will give you some of his gmaas power.<br />
<br />
- Chuck norris makes Gmaas jokes.<br />
<br />
- Gmaas is also the ruler of Oceania, Eastasia, and Eurasia (1984 reference)<br />
<br />
- Gmaas killed Big Brother by farting on him. Though he was caught by the Ministry of Love, he escaped easily.<br />
<br />
- Everyone thinks that Gmaas is a god<br />
<br />
- Gmaas also owns Animal Farm. Napoleon was his servant.<br />
<br />
- Gmaas is the only one who knows where Amelia Earhart is.<br />
<br />
- Gmaas is the only cat that has been proven transcendental.<br />
<br />
- Gmaas happened to notice http://artofproblemsolving.com/community/c402403h1598015p9983782 and is not very happy about it.<br />
<br />
- Grumpy cat reads Gmaas memes. EDIT: Grumpy cat then steals them and claims they're his. Gmass in't very happy about that, either.<br />
<br />
- The real reason why AIME cutoffs aren't out yet is because Gmaas refused to grade them due to too much problem misplacement.<br />
<br />
- Gmaas dueled Grumpy Cat and lost. He wasn't trying.<br />
<br />
- Gmaas sits on the statue of pallas and says forevermore (the Raven refrence )<br />
<br />
- Gmaas is a big fan of Edgar Allan Poe, because he is actually Poe. <br />
<br />
- Gmaas does merely not use USD. He owns it.<br />
<br />
- Gmaas really knows that Roblox is awful and does not play it seriously, thank god our lord is sane<br />
<br />
- In 2003, Gmaas used elliptical curves to force his reign over AoPS.<br />
<br />
- "Actually, my name is spelled GMAAS"<br />
<br />
- Gmaas is the smartest living being in the universe.<br />
<br />
- It was Gmaas who helped Sun Wukong on the Journey to the West.<br />
<br />
- Gmaas is the real creator of Wikipedia.<br />
<br />
-It is said Gmaas could hack any website he desires.<br />
<br />
-Gmaas is the basis of Greek mythology.<br />
<br />
-Gmaas once sold Google to a man for around <math>12</math> dollars!<br />
<br />
-Gmaas uses a HP printer.<br />
<br />
-Gmaas owns all AoPS staff including Richard Rusczyk.<br />
<br />
-Gmaas was there when Yoda was born.<br />
<br />
- Gmaas's true number of lives left is unknown; however, Gmaas recently confirmed that he had at least one left. Why doesn't Gmaas have so many more lives than other cats? The power of Gmaas.<br />
<br />
- sseraj once spelled Gmaas as gmASS on accident in Introduction to Geometry (1532).<br />
<br />
-Gmaas actively plays Roblox, and is a globally ranked professional gamer: https://www.roblox.com/users/29708533/profile...but he hates Roblox.<br />
<br />
-Gmaas has beaten Chuck Norris and The Rock and John Cena all together in a fight.<br />
<br />
-Gmaas is a South Korean, North Korean, Palestinian, Israeli, U.S., and Soviet citizen at the same time. EDIT: Gmaas has now been found out to be a citizen of every country in the world. Gmaas seems to enjoy the country of AOPS best, however.<br />
<br />
-"i am sand" destroyed Gmaas in FTW<br />
<br />
- sseraj posted a picture of gmaas with a game controller in Introduction to Geometry (1532).<br />
<br />
-Gmaas plays roblox mobile edition and likes Minecraft, Candy Crush, and Club Penguin Rewritten. He also <math>\boxed{\text{loves}}</math> <b>Cat</b>ch that fish.<br />
<br />
-Gmaas is Roy Moore's horse in the shape of a cat<br />
<br />
-Gmaas is a known roblox/club penguin rewritten player and is a legend at it. He has over <math>289547987693</math> robux and <math>190348</math> in CPR.<br />
<br />
-This is all hypothetical.<br />
<br />
- EDIT: This is all factual <br />
<br />
-Gmaas's real name is Princess. He has a sibling named Rusty/Fireheart/Firestar<br />
(Warrior cats reference)<br />
<br />
- He is capable of salmon powers, according to PunSpark (ask him)<br />
<br />
-The Gmaas told Richard Rusczyk to make AoPS<br />
<br />
-The Gmaas is everything. Yes, you are part of the Gmaas-Dw789<br />
<br />
-The Gmaas knows every dimension up to 9999999999999999999999999999999999999999999999999999999999999999999999999999999999th dimension.<br />
<br />
-Certain theories provide evidence that he IS darth plagueis the wise.<br />
<br />
-Gmaas is "TIRED OF PEOPLE ADDING TO HIS PAGE!!" (Maas 45).<br />
<br />
-Gmaas has multiple accounts; some of them are pifinity, cyumi, srej, squareman, Electro3.0, sturdywill, g1zq, alleycat, Equinox8, anc3, batta, beastgert, and lakecomo224. His best account, though, is wlm7, later renamed to "gmail.com".<br />
<br />
-Gmaas has a penguin servant named sm24136 who runs GMAASINC. The penguin may or may not be dead. <br />
<br />
-Gmaas owns a TARDIS, and can sometimes be seen traveling to other times for reasons unknown.<br />
<br />
-Gmaas knows how to hack into top secret aops community pages.<br />
<br />
-Gmaas was a river clant cat who crossed the event horizon of a black hole and came out the other end!<br />
<br />
-Gmaas is king of the first men, the anduls.<br />
<br />
-Gmaas is a well known professor at MEOWston Academy.<br />
<br />
-Gmaas is a Tuna addict, along with other, more potent fish such as Salmon and Trout.<br />
<br />
-Gmaas won the reward of being cutest and fattest cat ever--he surpassed grumpy cat. (He also out-grumped grumpy cat!!!)<br />
<br />
-Last sighting 1665 Algebra-A 3/9/18 at 9:08 PM.<br />
<br />
- owner of sseraj, not pet.<br />
<br />
- embodiment of life and universe and beyond .<br />
<br />
- Watches memes.<br />
<br />
-After Death became the GOD OF HYPERDEATH and obtained over 9000 souls.<br />
<br />
-Gmaas's real name is Pablo Diego JosÃ© Francisco de Paula Juan Nepomuceno MarÃa de los Remedios Cipriano de la SantÃsima Trinidad Ruiz y Picasso [STOP RICK ROLLING. (Source)]<br />
<br />
-Gmaas is a certified Slytherin.<br />
<br />
-Gmaas once slept on sseraj's private water bed, so sseraj locked him in the bathroom <br />
<br />
-Gmaas has superpowers that allow him to overcome the horrors of Mr. Toilet (while he was locked in the bathroom)<br />
<br />
- Gmaas once sat on an orange on a pile of AoPS books, causing an orange flavored equation explosion.<br />
<br />
-Gmaas once conquered the moon and imprinted his face on it until asteroids came.<br />
<br />
-Gmaas is a supreme overlord who must be given <math>10^{1000000000000000000000^{1000000000000000000000}}</math> minecraft DIAMONDS<br />
<br />
- gmaas is the Doctor Who lord; he sports Dalek-painted cars and eats human finger cheese and custard, plus black holes.<br />
<br />
- Gmaas is everyone's favorite animal. <br />
<br />
- He lives with sseraj. <br />
<br />
-Gmaas is my favorite pokemon<br />
<br />
-Gmaas dislikes number theory but enjoys geometry.<br />
<br />
- Gmaas is cool<br />
<br />
- He is often overfed (with probability <math>\frac{3972}{7891}</math>), or malnourished (with probability <math>\frac{3919}{7891}</math>) by sseraj.<br />
<br />
- He has <cmath>\sum_{k=1}^{267795} [k(k+1)]+GMAAS+GMAAAAAAAS</cmath> supercars, excluding the Purrari and the 138838383 Teslas. <br />
<br />
- He is an employee of AoPS.<br />
<br />
- He is a gmaas with yellow fur and white hypnotizing eyes.<br />
<br />
- He has the ability to divide by zero.<br />
<br />
- He was born with a tail that is a completely different color from the rest of his fur.<br />
<br />
- His stare is very hypnotizing and effective at getting table scraps.<br />
<br />
- He sometimes appears several minutes before certain classes start as an admin. <br />
<br />
- He died from too many Rubik's cubes in an Introduction to Algebra A class, but got revived by the Dark Lord at 00:13:37 AM the next day.<br />
<br />
- It is uncertain whether or not he is a cat, or is merely some sort of beast that has chosen to take the form of a cat (specifically a Persian Smoke.) <br />
<br />
- Actually, he is a cat. He said so. And science also says so.<br />
<br />
- He is distant relative of Mathcat1234.<br />
<br />
- He is very famous now, and mods always talk about him before class starts.<br />
<br />
- His favorite food is AoPS textbooks because they help him digest problems.<br />
<br />
- Gmaas tends to reside in sseraj's fridge.<br />
<br />
- Gmaas once ate all sseraj's fridge food, so sseraj had to put him in the freezer.<br />
<br />
- The fur of Gmaas can protect him from the harsh conditions of a freezer.<br />
<br />
- Gmaas sightings are not very common. There have only been 8 confirmed sightings of Gmaas in the wild.<br />
<br />
- Gmaas is a sage omniscient cat.<br />
<br />
- He is looking for suitable places other than sseraj's fridge to live in.<br />
<br />
- Places where gmaas sightings have happened: <br />
~The Royal Scoop ice cream store in Bonita Beach Florida<br />
<br />
~MouseFeastForCats/CAT 8 Mouse Apartment 1083<br />
<br />
-Prealgebra 2 (1440)<br />
<br />
~Alligator Swamp A 1072 <br />
<br />
~Alligator Swamp B 1073<br />
<br />
~Prealgebra A (1488)<br />
<br />
~Introduction to Algebra A (1170)<br />
<br />
~Introduction to Algebra B (1529)<br />
<br />
~Welcome to Panda Town Gate 1076<br />
<br />
~Welcome to Gmaas Town Gate 1221<br />
<br />
~Welcome to Gmaas Town Gate 1125<br />
<br />
~33Â°01'17.4"N 117Â°05'40.1"W (Rancho Bernardo Road, San Diego, CA)<br />
<br />
~The other side of the ice in Antarctica<br />
<br />
~Feisty Alligator Swamp 1115<br />
<br />
~Introduction to Geometry 1221 (Taught by sseraj)<br />
<br />
~Introduction to Counting and Probability 1142 <br />
<br />
~Feisty-ish Alligator Swamp 1115 (AGAIN)<br />
<br />
~Intermediate Counting and Probability 1137<br />
<br />
~Intermediate Counting and Probability 1207<br />
<br />
~Posting student surveys<br />
<br />
~USF Castle Walls - Elven Tribe 1203<br />
<br />
~Dark Lord's Hut 1210<br />
<br />
~AMC 10 Problem Series 1200<br />
<br />
~Intermediate Number Theory 1138<br />
<br />
~Intermediate Number Theory 1476<br />
<br />
~Introduction To Number Theory 1204. Date:7/27/16.<br />
<br />
~Algebra B 1112<br />
<br />
~Intermediate Algebra 1561 7:17 PM 12/11/16<br />
<br />
~Nowhere Else, Tasmania<br />
<br />
~Earth Dimension C-137<br />
~Geometry 1694 at 1616 PST military time. There was a boy riding him, and he seemed extremely miffed.<br />
<br />
<br />
<br />
<br />
- These have all been designated as the most glorious sections of Aopsland now (especially the USF castle walls), but deforestation is so far from threatens the wild areas (i.e. Alligator Swamps A&B).<br />
<br />
- Gmaas has also been sighted in Olympiad Geometry 1148.<br />
<br />
- Gmaas has randomly been known to have sent his minions into Prealgebra 2 1163. However, the danger is passed, that class is over.<br />
<br />
- Gmaas once snuck into sseraj's email so he could give pianoman24 an extension in Introduction to Number Theory 1204. This was 1204 minutes after his sighting on 7/27/16.<br />
<br />
- Gmaas also has randomly appeared on top of the USF's Tribal Bases(he seems to prefer the Void Tribe). However, the next day there is normally a puddle in the shape of a cat's underbelly wherever he was sighted. Nobody knows what this does. <br />
<br />
EDIT: Nobody has yet seen him atop a tribal base yet.<br />
<br />
- Gmaas are often under the disguise of a penguin or cat. Look out for them.<br />
<br />
EDIT: Gmaas rarely disguises himself as a penguin.<br />
<br />
- Many know that leafy stole dream island. In truth, After leafy stole it, Gmaas stole it himself. (BFDI Reference)<br />
<br />
- He lives in the shadows. Is he a dream? Truth? Fiction? Condemnation? Salvation? AoPS site admin? He is all these things and none of them. He is... Gmaas.<br />
<br />
EDIT: He IS an AoPS site admin.<br />
<br />
- If you make yourself more than just a cat... if you devote yourself to an ideal... and if they can't stop you... then you become something else entirely. A LEGEND. Gmaas now belongs to the ages.<br />
<br />
- Is this the real life? Is this just fantasy? No. This is Gmaas, the legend.<br />
<br />
-Aha!! An impostor!! <br />
http://www.salford.ac.uk/environment-life-sciences/research/applied-archaeology/greater-manchester-archaeological-advisory-service<br />
(look at the acronym).<br />
<br />
-EDIT. The above fact is slightly irrelevant.<br />
<br />
- Gmaas might have been viewing (with a <math>\frac{99999.\overline{9}}{100000}</math> chance) the Ultimate Survival Forum. He (or is he a she?) is suspected to be transforming the characters into real life. Be prepared to meet your epic swordsman self someday. If you do a sci-fi version of USF, then prepare to meet your Overpowered soldier with amazing weapons one day.<br />
<br />
- EDIT: Gmaas is a he.<br />
<br />
-Gmaas is love, Gmaas is life<br />
<br />
- The name of Gmaas is so powerful, it radiates Deja Mew.<br />
<br />
- Gmaas is on the list of "Elusive Creatures." If you have questions or want the full list, contact moab33.<br />
<br />
- Gmaas can be summoned using the <math>\tan(90)</math> ritual. Draw a pentagram and write the numerical value of <math>\tan(90)</math> in the middle, and he will be summoned.<br />
<br />
- EDIT: The above fact is incorrect. math101010 has done this and commented with screenshot proof at the below link, and Gmaas was not summoned.<br />
https://artofproblemsolving.com/community/c287916h1291232<br />
<br />
- EDIT EDIT: The above 'proof' is non-conclusive. math101010 had only put an approximation.<br />
<br />
- Gmaas's left eye contains the singularity of a black hole. (Only when everyone in the world blinks at the same time within a nano-nano second.)<br />
<br />
- EDIT: That has never happened and thus it does not contain the singularity of a black hole.<br />
<br />
- Lord Grindelwald once tried to make Gmaas into a Horcrux, but Gmaas's fur is Elder Wand protected and secure, as Kendra sprinkled holly into his fur.<br />
<br />
-Despite common belief, Harry Potter did not defeat Lord Voldemort. Gmaas did.<br />
<br />
- The original owner of Gmaas is Gmaas.<br />
<br />
- Gmaas was not the fourth Peverell brother, but he ascended into a higher being and now he resides in the body of a cat, as he was before. Is it a cat? We will know. (And the answer is YES.) EDIT: he wasn't the fourth Peverell brother, but he was a cousin of theirs, and he was the one who advised Ignotus to give up his cloak.<br />
<br />
- It is suspected that Gmaas may be ordering his cyber hairballs to take the forums, along with microbots.<br />
<br />
- The name of Gmaas is so powerful, it radiates Deja Mu.<br />
<br />
- Gmaas rarely frequents the headquarters of the Illuminati. He was their symbol for one yoctosecond, but soon decided that the job was too low for his power to be wasted on.<br />
<br />
- It has been wondered if Gmaas is the spirit of Obi-Wan Kenobi or Anakin Skywalker in a higher form, due to his strange capabilities and powers.<br />
<br />
- Gmaas has a habit of sneaking into computers, joining The Network, and exiting out of some other computer.<br />
<br />
- It has been confirmed that gmaas uses gmewal as his email service<br />
<br />
- Gmaas enjoys wearing gmean shorts<br />
<br />
- Gmaas has a bright orange tail with hot pink spirals. Or he had for 15 minutes. <br />
<br />
- Gmaas is well known behind his stage name, Michael Stevens (also known as Vsauce XD), or his page name, Purrshanks. EDIT: Crookshanks was his brother.<br />
<br />
- Gmaas rekt sseraj at 12:54 June 4, 2016 UTC time zone. And then the Doctor chased him.<br />
<br />
- Gmaas watchers know that the codes above are NOT years. They are secret codes for the place. But if you've edited that section of the page, you know that.<br />
<br />
- Gmaas is a good friend of the TARDIS and the Millenium Falcon. <br />
<br />
- In the Dark Lord's hut, gmaas was seen watching Doctor Who. Anyone who has seen the Dark Lord's hut knows that both Gmaas and the DL (USF code name of the Dark Lord) love BBC. How Gmaas gave him a TV may be lost to history. And it has been lost.<br />
<br />
- The TV has been noticed to be invincible. Many USF weapons, even volcano rings, have tried (and failed) to destroy it. The last time it was seen was on a Kobold display case outside of a mine. The display case was crushed, and a report showed a spy running off with a non-crushed TV.<br />
<br />
-The reason why Dacammel left the USF is that gmaas entrusted his TV to him, and not wanting to be discovered by LF, Cobra, or Z9, dacammel chose to leave the USF, but is regretting it, as snakes keep spawning from the TV.<br />
<br />
- EDIT: The above fact is somewhat irrelevant.<br />
<br />
-EDIT EDIT. Dacammel gave the TV back to gmaas, and he left the dark side and their cookies alone. <br />
<br />
- Gmaas is a Super Duper Uper Cat Time Lord. He has <math>57843504</math> regenerations and has used <math>3</math>. <cmath>9\cdot12\cdot2\cdot267794=57843504</cmath>. <br />
<br />
-Gmaas highly enjoys destroying squeaky toys until he finds the squeaky part, then destroys the squeaky part.<br />
<br />
- Gmaas loves to eat turnips. At <math>\frac{13}{32}</math> of the sites he was spotted at, he was seen with a turnip.<br />
<br />
-Gmaas has a secret hidden garden full of turnips under sseraj's house.<br />
<br />
- Gmaas has three tails, one for everyday life, one for special occasions, and one that's invisible.<br />
<br />
-Gmaas is a dangerous creature. If you ever meet him, immediately join his army or you will be killed.<br />
<br />
-Gmaas is in alliance with the Cult of Skaro. How did he get an alliance with ruthless creatures that want to kill everything in sight? Nobody knows (except him), not even the leader of the Cult of Skaro.<br />
<br />
-Gmaas lives in Gallifrey and in Gotham City (he has sleepovers with Batman).<br />
<br />
-Gmaas is an excellent driver. EDIT: he was to one who designed the driver's license test, although he didn't bother with the permit test.<br />
<br />
-The native location of Gmaas is the twilight zone.<br />
<br />
-Donald Trump once sang "All Hail the Chief" to Gmaas, 3 days after being sworn in as US President.<br />
<br />
- Gmaas likes to talk with rrusczyk from time to time.<br />
<br />
- Gmaas can shoot fire from his smelly butt.<br />
<br />
- Gmaas is the reason why the USF has the longest thread on AoPS.<br />
<br />
- Gmass is an avid watcher of the popular T.V. show "Bernie Sanders and the Gauntlet of DOOM"<br />
<br />
- sseraj, in 1521 Introduction to Number Theory, posted an image of Gmaas after saying "Who wants to see 5space?" at around 5:16 PM Mountain Time, noting Gmaas was "also 5space"<br />
<br />
-EDIT: he also did it in Introduction to Algebra A once.<br />
<br />
- Gmaas is now my HD background on my Mac.<br />
<br />
- In 1521 Into to Number Theory, sseraj posted an image of a 5space Gmaas fusion. (First sighting) <br />
<br />
- Also confirmed that Gmaas doesn't like ketchup because it was the only food left the photo.<br />
<br />
- In 1447 Intro to Geometry, sseraj posted a picture of Gmaas with a rubik's cube suggesting that Gmaas's has an average solve time of <math>-GMAAS</math> seconds.<br />
<br />
-Gmaas beat Superman in a fight with ease<br />
<br />
-Gmaas was an admin of Roblox<br />
<br />
-Gmaas traveled around the world, paying so much <math>MONEY</math> just to eat :D<br />
<br />
-Gmaas is a confirmed Apex predator and should not be approached, unless in a domestic form.<br />
Summary:<br />
<br />
-When Gmaas subtracts <math>0.\overline{99}</math> from <math>1</math>, the difference is greater than <math>0</math>.<br />
<br />
-Gmaas was shown to have fallen on Wed Aug 23 2017: https://ibb.co/bNrtmk https://ibb.co/jzUDmk<br />
<br />
-Gmaas died on August ,24, 2017, but fortunately IceParrot revived him after about 2 mins of being dead.<br />
<br />
-The results of the revival are top secret, and nobody knows what happened.<br />
<br />
-sseraj, in 1496 Prealgebra 2, said that Gmaas is Santacat.<br />
<br />
-sseraj likes to post a picture of gmaas in every class he passes by.<br />
<br />
-sseraj posted a picture of gmaas as an Ewok, suggesting he resides on the moon of Endor. Unfortunately, the moon of Endor is also uninhabitable ever since the wreckage of the Death Star changed the climate there. It is thought gmaas is now wandering space in search for a home.<br />
EDIT: What evidence is there Endor was affected? Other Ewoks still live there.<br />
EDIT EDIT: also, glass doesn't care. He can live there no matter what the climate is.<br />
<br />
-Gmaas is the lord of the pokemans<br />
<br />
-Gmaas can communicate with, and sometimes control any other cats, however this is very rare, as cats normally have a very strong will.<br />
<br />
-Picture of Gmaas http://i.imgur.com/PP9xi.png<br />
<br />
-Known by Mike Miller<br />
<br />
-Gmaas got mad at sseraj once, so he locked him in his own freezer<br />
<br />
-Then, sseraj decided to eat all of Gmaas's hidden turnips in the freezer as punishment<br />
<br />
-Gmaas is an obviously omnipotent cat.<br />
<br />
-ehawk11 met him<br />
<br />
-sseraj is known to post pictures of Gmaas on various AoPS classrooms. It is not known if these photos have been altered with the editing program called 'Photoshop'.<br />
<br />
-sseraj has posted pictures of gmaas in '"intro to algebra", before class started, with the title, "caption contest". anyone who posted a caption mysteriously vanished in the middle of the night. <br />
EDIT: This has happened many times, including in Introduction to Geometry 1533, among other active classes. The person writing this (Poeshuman) did participate, and did not disappear. (You could argue Gmaas is typing this through his/her account...)<br />
<br />
- gmaas has once slept in your bed and made it wet<br />
<br />
-It is rumored that rrusczyk is actually Gmaas in disguise<br />
<br />
-Gmaas is suspected to be a Mewtwo in disguise<br />
<br />
-Gmaas is a cat but has characteristics of every other animal on Earth.<br />
<br />
-Gmaas is the ruler of the universe and has been known to be the creator of the species "Gmaasians".<br />
<br />
-There is a rumor that Gmaas is starting a poll<br />
<br />
-Gmaas is a rumored past ThunderClan cat who ran away, founded GmaasClan, then became a kittypet.<br />
<br />
-There is a rumored sport called "Gmaas Hunting" where people try to successfully capture gmaas in the wild with video/camera/eyes. Strangely, no one has been able to do this, and those that have have mysteriously disappeared into the night. Nobody knows why. The person who is writing this(g1zq) has tried Gmaas Hunting, but has never been successful.<br />
<br />
- Gmaas burped and caused an earthquake.<br />
<br />
- Gmaas once drank from your pretty teacup.<br />
<br />
-GMAAS IS HERE.... PURRRRRRRRRRRRRRRRRRRR<br />
<br />
-Gmass made, and currently owns the Matrix.<br />
<br />
-The above fact is true. Therefore, this is an illusion.<br />
<br />
-Gmaas is the reason Salah will become better than Ronaldo.<br />
<br />
-Who is Gmaas, really?<br />
-Gmass is a heavenly being<br />
<br />
-Illuminati was a manifestation of Gmaas, but Gmass decided illuminati was not great enough for his godly self.<br />
<br />
-jlikemath has met Gmaas and Gmaas is his best friend.<br />
<br />
-Gmaas loves Kpop<br />
<br />
-Gmaas read Twilight EDIT: ...and SURVIVED<br />
<br />
-there is a secret code when put into super smash, Gmass would be a playible character. Too bad he didn't say it.<br />
<br />
-Gmaas was a tribute to one of the Hunger Games and came out a Victor and now lives in District 4<br />
<br />
=== Gmaas photos ===<br />
http://cdn.artofproblemsolving.com/images/f/f/8/ff8efef3a0d2eb51254634e54bec215b948a1bba.jpg<br />
<br />
=== gmaas in Popular Culture ===<br />
<br />
- <s>Currently, is being written (by themoocow) about the adventures of gmaas. It is aptly titled, "The Adventures of gmaas".</s>Sorry, this was a rick roll troll.<br />
<br />
- BREAKING NEWS: tigershark22 has found a possible cousin to gmaas in Raymond Feist's book Silverthorn. They are mountain dwellers, gwali. Not much are known about them either, and when someone asked,"What are gwali?" the customary answer "This is gwali" is returned. Scientist 5space is now looking into it.<br />
<br />
- Sullymath and themoocow are also writing a book about Gmaas<br />
<br />
-Sighting of Gmaas: https://2017.spaceappschallenge.org/challenges/warning-danger-ahead/and-you-can-help-fight-fires/teams/gmaas/project<br />
<br />
-Oryx the mad god is actually gmass wearing a suit of armor. This explains why he is never truly killed<br />
<br />
- Potential sighting of gmaas [http://www.gmac.com/frequently-asked-questions/gmass-search-service.aspx]<br />
<br />
- Gmaas has been spotted in some Doctor Who and Phineas and Ferb episodes, such as Aliens of London, Phineas and Ferb Save Summer, Dalek, Rollercoaster, Rose, Boom Town, The Day of The Doctor, Candace Gets Busted, and many more.<br />
<br />
- Gmaas can be found in many places in Plants vs. Zombies Garden Warfare 2 and Bloons TD Battles<br />
<br />
- gmaas was an un-credited actor in the Doctor Who story Knock Knock, playing a Dryad. How he shrunk, we will never know.<br />
<br />
-oadaegan is also writing a story about him. He is continuing the book that was started by JpusheenS. when he is done he will post it here<br />
<br />
-Gmaas is a time traveler from 0.9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 B.C.<br />
<br />
-No one knows if Gmass is a Mr. mime in a cat skin, the other way around, or just a downright combination of both.<br />
<br />
-In it, it mentions these four links as things Gmass is having trouble (specifically technical difficulties). What could it mean? Links:<br />
https://docs.google.com/document/d/1NZ0XcFYm80sA-fAoxnm7ulMCwdNU75Va_6ZjRHfSHV0<br />
https://docs.google.com/document/d/1ELN7ORauFFv1dwpU_u-ah_dFJHeuJ3szYxoeC1LlDQg/<br />
https://docs.google.com/document/d/1oy9Q3F7fygHw-OCWNEVE8d-Uob2dxVACFcGUcLmk3fA<br />
https://docs.google.com/document/d/1jzb9Q6FmDmrRyXwnik3e0sYw5bTPMo7aBwugmUbA13o<br />
<br />
<br />
- Another possible Gmaas sighting [https://2017.spaceappschallenge.org/challenges/warning-danger-ahead/and-you-can-help-fight-fires/teams/gmaas/project]<br />
<br />
-<math>Another</math> sighting? [https://www.radarbox24.com/data/flights/GMAAS]<br />
- Yet Another Gmaas sighting ? [https://supportforums.cisco.com/t5/user/viewprofilepage/user-id/45046]<br />
<br />
-Gmaas has been sighted several times on the Global Announcements forum<br />
<br />
-Gmaas uses the following transportation: <img> http://cdn.artofproblemsolving.com/images/3/6/8/368da4e615ea3476355ee3388b39f30a48b8dd48.jpg </img><br />
<br />
- When Gmaas was mad, he started world wars 1 & 2. It is only because of Gmaas that we have not had World War 3.<br />
<br />
- Gmaas is the only cat to have been proved irrational and transcendental, though we suspect all cats fall in the first category.<br />
<br />
- Gmaas plays Geometry Dash and shares an account with Springhill, his username is D3m0nG4m1n9.<br />
<br />
-Gmaas likes to whiz on the wilzo<br />
<br />
-Gmaas has been spotted in AMC 8 Basics<br />
<br />
-Gmaas is cool<br />
<br />
-Gmaas hemoon card that does over 9000000 dmg<br />
<br />
-Gmaas is a skilled swordsman who should not to be mistaken for Puss in Boots. Some say he even trained the mysterious and valiant Meta Knight.<br />
<br />
-Kirby once swallowed Gmaas. Gmaas had to spit him out.<br />
<br />
-Gmaas was the creator of pokemon, and his pokemon card can OHKO anyone in one turn. He is invisible and he will always move first.<br />
<br />
-Gmass beat Dongmin in [url=The Genius Game]https://en.wikipedia.org/wiki/The_Genius_(TV_series)[/url] Season 1, 2, 3, 4, and 5.</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=Gmaas&diff=95666
Gmaas
2018-06-29T01:14:05Z
<p>Relay400: /* gmaas in Popular Culture */</p>
<hr />
<div> :) :O :P {{{=== Gmaas Facts ===}}} :) :O :P<br />
<br />
-Gmaas founded Target, but then Gmaas sued them for making the mascot look like a dog when it was supposed to look like Gmaas. <br />
<br />
-Everyone has a bit of Gmaas inside them. EDIT: Except you. You are pure Gmaas. <br />
<br />
-Gmaas likes to eat popsicles. Especially the fudge ones that get him hyper. When he is hyper he runs across Washington D.C. grabbing unsuspecting pedestrians and steals their phone, hacks into them and downloads Fortnite onto their poor phone.<br />
<br />
-Gmaas' favorite cereal is fruit loops. Gmaas thinks it tastes like unicorns jumping on rainbows<br />
<br />
-Gmaas is a champion pillow-fighter.<br />
<br />
-Gmaas colonized Mars.<br />
<br />
-He also colonized Jupiter, Pluto, and several other galaxies. He cloned some little Gmaas robots (with his amazingly robotic skill of coding) and put them all over a galaxy called Gmaasalaxy. <br />
<br />
-Gmaas has the ability to make every device play "The Duck Song" at will.<br />
<br />
-Gmaas once caught the red dot and ate it.<br />
<br />
-Gmaas' favorite color is neon klfhsadkhfd.<br />
<br />
-Gmaas is a champion pvp Minecraft player<br />
<br />
-Gmaas founded Costco.<br />
<br />
-Gmaas can solve any puzzle instantly.<br />
<br />
-When Gmaas flips coins, they always land tails.<br />
<br />
-On Gmaas's math tests, he always gets 101.777777777777777777777777777777777777777777777777777701%<br />
<br />
-Gmaas' favorite number is pi. It's also one of his favorite foods. <br />
<br />
-Gmaas' burps created all gaseous planets.<br />
<br />
-Gmass beat Luke Robatille in an epic showdown of catnip consumption.<br />
<br />
- Gmaas' wealth is unknown, but it is estimated to be way more than Scrooge's.<br />
<br />
- Gmaas has a summer house on Mars. <br />
<br />
-Gmaas attended Harvard, Yale, Stanford, MIT, UC Berkeley, Princeton, Columbia, and Caltech at the same time, using a time-turner.<br />
<br />
-Gmaas also attended Hogwarts and was a prefect. <br />
<br />
-Mrs.Norris is Gmaas's archenemy.<br />
<br />
-Gmaas is a demigod and attends Camp Half-Blood over summer. He is the counselor for the Apollo cabin. Because cats are demigod counselors too.<br />
<br />
-Gmaas has completed over 2,000 quests, and is very popular throughout Camp Half-Blood. He has also been to Camp Jupiter.<br />
<br />
-Gmaas painted the Mona Lisa, The Last Supper, and A Starry Night.<br />
<br />
-Gmass knows that the real names are Gmassa Lisa, The Last Domestic Meal, and Far-away Light.<br />
<br />
-Gmaas actually attended all the Ivy Leagues.<br />
<br />
- I am Gmaas<br />
<br />
- I too am Gmaas<br />
<br />
- But it is I who is Gmaas<br />
<br />
- Gmaas is us all<br />
<br />
- Gmaas is all of us yet none of us<br />
<br />
- Gmaas was captured by the infamous j3370 in 2017 but was released due to sympathy. EDIT: j3370 only captured his concrete form, his abstract form cannot be processed by a feeble human brain<br />
<br />
- Gmaas's fur is purple and yellow and red and green and orange and blue and brown and pink all at the same time. <br />
<br />
- Gmaas crossed the event horizon of a black hole and ended up in the AoPS universe.<br />
<br />
- Gmaas crossed the Delaware River with Washington.<br />
<br />
- Gmaas also crossed the Atlantic with the pilgrims.<br />
<br />
- if you are able to capture a Gmaas hair, he will give you some of his gmaas power.<br />
<br />
- Chuck norris makes Gmaas jokes.<br />
<br />
- Gmaas is also the ruler of Oceania, Eastasia, and Eurasia (1984 reference)<br />
<br />
- Gmaas killed Big Brother by farting on him. Though he was caught by the Ministry of Love, he escaped easily.<br />
<br />
- Everyone thinks that Gmaas is a god<br />
<br />
- Gmaas also owns Animal Farm. Napoleon was his servant.<br />
<br />
- Gmaas is the only one who knows where Amelia Earhart is.<br />
<br />
- Gmaas is the only cat that has been proven transcendental.<br />
<br />
- Gmaas happened to notice http://artofproblemsolving.com/community/c402403h1598015p9983782 and is not very happy about it.<br />
<br />
- Grumpy cat reads Gmaas memes. EDIT: Grumpy cat then steals them and claims they're his. Gmass in't very happy about that, either.<br />
<br />
- The real reason why AIME cutoffs aren't out yet is because Gmaas refused to grade them due to too much problem misplacement.<br />
<br />
- Gmaas dueled Grumpy Cat and lost. He wasn't trying.<br />
<br />
- Gmaas sits on the statue of pallas and says forevermore (the Raven refrence )<br />
<br />
- Gmaas is a big fan of Edgar Allan Poe, because he is actually Poe. <br />
<br />
- Gmaas does merely not use USD. He owns it.<br />
<br />
- Gmaas really knows that Roblox is awful and does not play it seriously, thank god our lord is sane<br />
<br />
- In 2003, Gmaas used elliptical curves to force his reign over AoPS.<br />
<br />
- "Actually, my name is spelled GMAAS"<br />
<br />
- Gmaas is the smartest living being in the universe.<br />
<br />
- It was Gmaas who helped Sun Wukong on the Journey to the West.<br />
<br />
- Gmaas is the real creator of Wikipedia.<br />
<br />
-It is said Gmaas could hack any website he desires.<br />
<br />
-Gmaas is the basis of Greek mythology.<br />
<br />
-Gmaas once sold Google to a man for around <math>12</math> dollars!<br />
<br />
-Gmaas uses a HP printer.<br />
<br />
-Gmaas owns all AoPS staff including Richard Rusczyk.<br />
<br />
-Gmaas was there when Yoda was born.<br />
<br />
- Gmaas's true number of lives left is unknown; however, Gmaas recently confirmed that he had at least one left. Why doesn't Gmaas have so many more lives than other cats? The power of Gmaas.<br />
<br />
- sseraj once spelled Gmaas as gmASS on accident in Introduction to Geometry (1532).<br />
<br />
-Gmaas actively plays Roblox, and is a globally ranked professional gamer: https://www.roblox.com/users/29708533/profile...but he hates Roblox.<br />
<br />
-Gmaas has beaten Chuck Norris and The Rock and John Cena all together in a fight.<br />
<br />
-Gmaas is a South Korean, North Korean, Palestinian, Israeli, U.S., and Soviet citizen at the same time. EDIT: Gmaas has now been found out to be a citizen of every country in the world. Gmaas seems to enjoy the country of AOPS best, however.<br />
<br />
-"i am sand" destroyed Gmaas in FTW<br />
<br />
- sseraj posted a picture of gmaas with a game controller in Introduction to Geometry (1532).<br />
<br />
-Gmaas plays roblox mobile edition and likes Minecraft, Candy Crush, and Club Penguin Rewritten. He also <math>\boxed{\text{loves}}</math> <b>Cat</b>ch that fish.<br />
<br />
-Gmaas is Roy Moore's horse in the shape of a cat<br />
<br />
-Gmaas is a known roblox/club penguin rewritten player and is a legend at it. He has over <math>289547987693</math> robux and <math>190348</math> in CPR.<br />
<br />
-This is all hypothetical.<br />
<br />
- EDIT: This is all factual <br />
<br />
-Gmaas's real name is Princess. He has a sibling named Rusty/Fireheart/Firestar<br />
(Warrior cats reference)<br />
<br />
- He is capable of salmon powers, according to PunSpark (ask him)<br />
<br />
-The Gmaas told Richard Rusczyk to make AoPS<br />
<br />
-The Gmaas is everything. Yes, you are part of the Gmaas-Dw789<br />
<br />
-The Gmaas knows every dimension up to 9999999999999999999999999999999999999999999999999999999999999999999999999999999999th dimension.<br />
<br />
-Certain theories provide evidence that he IS darth plagueis the wise.<br />
<br />
-Gmaas is "TIRED OF PEOPLE ADDING TO HIS PAGE!!" (Maas 45).<br />
<br />
-Gmaas has multiple accounts; some of them are pifinity, cyumi, srej, squareman, Electro3.0, sturdywill, g1zq, alleycat, Equinox8, anc3, batta, beastgert, and lakecomo224. His best account, though, is wlm7, later renamed to "gmail.com".<br />
<br />
-Gmaas has a penguin servant named sm24136 who runs GMAASINC. The penguin may or may not be dead. <br />
<br />
-Gmaas owns a TARDIS, and can sometimes be seen traveling to other times for reasons unknown.<br />
<br />
-Gmaas knows how to hack into top secret aops community pages.<br />
<br />
-Gmaas was a river clant cat who crossed the event horizon of a black hole and came out the other end!<br />
<br />
-Gmaas is king of the first men, the anduls.<br />
<br />
-Gmaas is a well known professor at MEOWston Academy.<br />
<br />
-Gmaas is a Tuna addict, along with other, more potent fish such as Salmon and Trout.<br />
<br />
-Gmaas won the reward of being cutest and fattest cat ever--he surpassed grumpy cat. (He also out-grumped grumpy cat!!!)<br />
<br />
-Last sighting 1665 Algebra-A 3/9/18 at 9:08 PM.<br />
<br />
- owner of sseraj, not pet.<br />
<br />
- embodiment of life and universe and beyond .<br />
<br />
- Watches memes.<br />
<br />
-After Death became the GOD OF HYPERDEATH and obtained over 9000 souls.<br />
<br />
-Gmaas's real name is Pablo Diego JosÃ© Francisco de Paula Juan Nepomuceno MarÃa de los Remedios Cipriano de la SantÃsima Trinidad Ruiz y Picasso [STOP RICK ROLLING. (Source)]<br />
<br />
-Gmaas is a certified Slytherin.<br />
<br />
-Gmaas once slept on sseraj's private water bed, so sseraj locked him in the bathroom <br />
<br />
-Gmaas has superpowers that allow him to overcome the horrors of Mr. Toilet (while he was locked in the bathroom)<br />
<br />
- Gmaas once sat on an orange on a pile of AoPS books, causing an orange flavored equation explosion.<br />
<br />
-Gmaas once conquered the moon and imprinted his face on it until asteroids came.<br />
<br />
-Gmaas is a supreme overlord who must be given <math>10^{1000000000000000000000^{1000000000000000000000}}</math> minecraft DIAMONDS<br />
<br />
- gmaas is the Doctor Who lord; he sports Dalek-painted cars and eats human finger cheese and custard, plus black holes.<br />
<br />
- Gmaas is everyone's favorite animal. <br />
<br />
- He lives with sseraj. <br />
<br />
-Gmaas is my favorite pokemon<br />
<br />
-Gmaas dislikes number theory but enjoys geometry.<br />
<br />
- Gmaas is cool<br />
<br />
- He is often overfed (with probability <math>\frac{3972}{7891}</math>), or malnourished (with probability <math>\frac{3919}{7891}</math>) by sseraj.<br />
<br />
- He has <cmath>\sum_{k=1}^{267795} [k(k+1)]+GMAAS+GMAAAAAAAS</cmath> supercars, excluding the Purrari and the 138838383 Teslas. <br />
<br />
- He is an employee of AoPS.<br />
<br />
- He is a gmaas with yellow fur and white hypnotizing eyes.<br />
<br />
- He has the ability to divide by zero.<br />
<br />
- He was born with a tail that is a completely different color from the rest of his fur.<br />
<br />
- His stare is very hypnotizing and effective at getting table scraps.<br />
<br />
- He sometimes appears several minutes before certain classes start as an admin. <br />
<br />
- He died from too many Rubik's cubes in an Introduction to Algebra A class, but got revived by the Dark Lord at 00:13:37 AM the next day.<br />
<br />
- It is uncertain whether or not he is a cat, or is merely some sort of beast that has chosen to take the form of a cat (specifically a Persian Smoke.) <br />
<br />
- Actually, he is a cat. He said so. And science also says so.<br />
<br />
- He is distant relative of Mathcat1234.<br />
<br />
- He is very famous now, and mods always talk about him before class starts.<br />
<br />
- His favorite food is AoPS textbooks because they help him digest problems.<br />
<br />
- Gmaas tends to reside in sseraj's fridge.<br />
<br />
- Gmaas once ate all sseraj's fridge food, so sseraj had to put him in the freezer.<br />
<br />
- The fur of Gmaas can protect him from the harsh conditions of a freezer.<br />
<br />
- Gmaas sightings are not very common. There have only been 8 confirmed sightings of Gmaas in the wild.<br />
<br />
- Gmaas is a sage omniscient cat.<br />
<br />
- He is looking for suitable places other than sseraj's fridge to live in.<br />
<br />
- Places where gmaas sightings have happened: <br />
~The Royal Scoop ice cream store in Bonita Beach Florida<br />
<br />
~MouseFeastForCats/CAT 8 Mouse Apartment 1083<br />
<br />
-Prealgebra 2 (1440)<br />
<br />
~Alligator Swamp A 1072 <br />
<br />
~Alligator Swamp B 1073<br />
<br />
~Prealgebra A (1488)<br />
<br />
~Introduction to Algebra A (1170)<br />
<br />
~Introduction to Algebra B (1529)<br />
<br />
~Welcome to Panda Town Gate 1076<br />
<br />
~Welcome to Gmaas Town Gate 1221<br />
<br />
~Welcome to Gmaas Town Gate 1125<br />
<br />
~33Â°01'17.4"N 117Â°05'40.1"W (Rancho Bernardo Road, San Diego, CA)<br />
<br />
~The other side of the ice in Antarctica<br />
<br />
~Feisty Alligator Swamp 1115<br />
<br />
~Introduction to Geometry 1221 (Taught by sseraj)<br />
<br />
~Introduction to Counting and Probability 1142 <br />
<br />
~Feisty-ish Alligator Swamp 1115 (AGAIN)<br />
<br />
~Intermediate Counting and Probability 1137<br />
<br />
~Intermediate Counting and Probability 1207<br />
<br />
~Posting student surveys<br />
<br />
~USF Castle Walls - Elven Tribe 1203<br />
<br />
~Dark Lord's Hut 1210<br />
<br />
~AMC 10 Problem Series 1200<br />
<br />
~Intermediate Number Theory 1138<br />
<br />
~Intermediate Number Theory 1476<br />
<br />
~Introduction To Number Theory 1204. Date:7/27/16.<br />
<br />
~Algebra B 1112<br />
<br />
~Intermediate Algebra 1561 7:17 PM 12/11/16<br />
<br />
~Nowhere Else, Tasmania<br />
<br />
~Earth Dimension C-137<br />
~Geometry 1694 at 1616 PST military time. There was a boy riding him, and he seemed extremely miffed.<br />
<br />
<br />
<br />
<br />
- These have all been designated as the most glorious sections of Aopsland now (especially the USF castle walls), but deforestation is so far from threatens the wild areas (i.e. Alligator Swamps A&B).<br />
<br />
- Gmaas has also been sighted in Olympiad Geometry 1148.<br />
<br />
- Gmaas has randomly been known to have sent his minions into Prealgebra 2 1163. However, the danger is passed, that class is over.<br />
<br />
- Gmaas once snuck into sseraj's email so he could give pianoman24 an extension in Introduction to Number Theory 1204. This was 1204 minutes after his sighting on 7/27/16.<br />
<br />
- Gmaas also has randomly appeared on top of the USF's Tribal Bases(he seems to prefer the Void Tribe). However, the next day there is normally a puddle in the shape of a cat's underbelly wherever he was sighted. Nobody knows what this does. <br />
<br />
EDIT: Nobody has yet seen him atop a tribal base yet.<br />
<br />
- Gmaas are often under the disguise of a penguin or cat. Look out for them.<br />
<br />
EDIT: Gmaas rarely disguises himself as a penguin.<br />
<br />
- Many know that leafy stole dream island. In truth, After leafy stole it, Gmaas stole it himself. (BFDI Reference)<br />
<br />
- He lives in the shadows. Is he a dream? Truth? Fiction? Condemnation? Salvation? AoPS site admin? He is all these things and none of them. He is... Gmaas.<br />
<br />
EDIT: He IS an AoPS site admin.<br />
<br />
- If you make yourself more than just a cat... if you devote yourself to an ideal... and if they can't stop you... then you become something else entirely. A LEGEND. Gmaas now belongs to the ages.<br />
<br />
- Is this the real life? Is this just fantasy? No. This is Gmaas, the legend.<br />
<br />
-Aha!! An impostor!! <br />
http://www.salford.ac.uk/environment-life-sciences/research/applied-archaeology/greater-manchester-archaeological-advisory-service<br />
(look at the acronym).<br />
<br />
-EDIT. The above fact is slightly irrelevant.<br />
<br />
- Gmaas might have been viewing (with a <math>\frac{99999.\overline{9}}{100000}</math> chance) the Ultimate Survival Forum. He (or is he a she?) is suspected to be transforming the characters into real life. Be prepared to meet your epic swordsman self someday. If you do a sci-fi version of USF, then prepare to meet your Overpowered soldier with amazing weapons one day.<br />
<br />
- EDIT: Gmaas is a he.<br />
<br />
-Gmaas is love, Gmaas is life<br />
<br />
- The name of Gmaas is so powerful, it radiates Deja Mew.<br />
<br />
- Gmaas is on the list of "Elusive Creatures." If you have questions or want the full list, contact moab33.<br />
<br />
- Gmaas can be summoned using the <math>\tan(90)</math> ritual. Draw a pentagram and write the numerical value of <math>\tan(90)</math> in the middle, and he will be summoned.<br />
<br />
- EDIT: The above fact is incorrect. math101010 has done this and commented with screenshot proof at the below link, and Gmaas was not summoned.<br />
https://artofproblemsolving.com/community/c287916h1291232<br />
<br />
- EDIT EDIT: The above 'proof' is non-conclusive. math101010 had only put an approximation.<br />
<br />
- Gmaas's left eye contains the singularity of a black hole. (Only when everyone in the world blinks at the same time within a nano-nano second.)<br />
<br />
- EDIT: That has never happened and thus it does not contain the singularity of a black hole.<br />
<br />
- Lord Grindelwald once tried to make Gmaas into a Horcrux, but Gmaas's fur is Elder Wand protected and secure, as Kendra sprinkled holly into his fur.<br />
<br />
-Despite common belief, Harry Potter did not defeat Lord Voldemort. Gmaas did.<br />
<br />
- The original owner of Gmaas is Gmaas.<br />
<br />
- Gmaas was not the fourth Peverell brother, but he ascended into a higher being and now he resides in the body of a cat, as he was before. Is it a cat? We will know. (And the answer is YES.) EDIT: he wasn't the fourth Peverell brother, but he was a cousin of theirs, and he was the one who advised Ignotus to give up his cloak.<br />
<br />
- It is suspected that Gmaas may be ordering his cyber hairballs to take the forums, along with microbots.<br />
<br />
- The name of Gmaas is so powerful, it radiates Deja Mu.<br />
<br />
- Gmaas rarely frequents the headquarters of the Illuminati. He was their symbol for one yoctosecond, but soon decided that the job was too low for his power to be wasted on.<br />
<br />
- It has been wondered if Gmaas is the spirit of Obi-Wan Kenobi or Anakin Skywalker in a higher form, due to his strange capabilities and powers.<br />
<br />
- Gmaas has a habit of sneaking into computers, joining The Network, and exiting out of some other computer.<br />
<br />
- It has been confirmed that gmaas uses gmewal as his email service<br />
<br />
- Gmaas enjoys wearing gmean shorts<br />
<br />
- Gmaas has a bright orange tail with hot pink spirals. Or he had for 15 minutes. <br />
<br />
- Gmaas is well known behind his stage name, Michael Stevens (also known as Vsauce XD), or his page name, Purrshanks. EDIT: Crookshanks was his brother.<br />
<br />
- Gmaas rekt sseraj at 12:54 June 4, 2016 UTC time zone. And then the Doctor chased him.<br />
<br />
- Gmaas watchers know that the codes above are NOT years. They are secret codes for the place. But if you've edited that section of the page, you know that.<br />
<br />
- Gmaas is a good friend of the TARDIS and the Millenium Falcon. <br />
<br />
- In the Dark Lord's hut, gmaas was seen watching Doctor Who. Anyone who has seen the Dark Lord's hut knows that both Gmaas and the DL (USF code name of the Dark Lord) love BBC. How Gmaas gave him a TV may be lost to history. And it has been lost.<br />
<br />
- The TV has been noticed to be invincible. Many USF weapons, even volcano rings, have tried (and failed) to destroy it. The last time it was seen was on a Kobold display case outside of a mine. The display case was crushed, and a report showed a spy running off with a non-crushed TV.<br />
<br />
-The reason why Dacammel left the USF is that gmaas entrusted his TV to him, and not wanting to be discovered by LF, Cobra, or Z9, dacammel chose to leave the USF, but is regretting it, as snakes keep spawning from the TV.<br />
<br />
- EDIT: The above fact is somewhat irrelevant.<br />
<br />
-EDIT EDIT. Dacammel gave the TV back to gmaas, and he left the dark side and their cookies alone. <br />
<br />
- Gmaas is a Super Duper Uper Cat Time Lord. He has <math>57843504</math> regenerations and has used <math>3</math>. <cmath>9\cdot12\cdot2\cdot267794=57843504</cmath>. <br />
<br />
-Gmaas highly enjoys destroying squeaky toys until he finds the squeaky part, then destroys the squeaky part.<br />
<br />
- Gmaas loves to eat turnips. At <math>\frac{13}{32}</math> of the sites he was spotted at, he was seen with a turnip.<br />
<br />
-Gmaas has a secret hidden garden full of turnips under sseraj's house.<br />
<br />
- Gmaas has three tails, one for everyday life, one for special occasions, and one that's invisible.<br />
<br />
-Gmaas is a dangerous creature. If you ever meet him, immediately join his army or you will be killed.<br />
<br />
-Gmaas is in alliance with the Cult of Skaro. How did he get an alliance with ruthless creatures that want to kill everything in sight? Nobody knows (except him), not even the leader of the Cult of Skaro.<br />
<br />
-Gmaas lives in Gallifrey and in Gotham City (he has sleepovers with Batman).<br />
<br />
-Gmaas is an excellent driver. EDIT: he was to one who designed the driver's license test, although he didn't bother with the permit test.<br />
<br />
-The native location of Gmaas is the twilight zone.<br />
<br />
-Donald Trump once sang "All Hail the Chief" to Gmaas, 3 days after being sworn in as US President.<br />
<br />
- Gmaas likes to talk with rrusczyk from time to time.<br />
<br />
- Gmaas can shoot fire from his smelly butt.<br />
<br />
- Gmaas is the reason why the USF has the longest thread on AoPS.<br />
<br />
- Gmass is an avid watcher of the popular T.V. show "Bernie Sanders and the Gauntlet of DOOM"<br />
<br />
- sseraj, in 1521 Introduction to Number Theory, posted an image of Gmaas after saying "Who wants to see 5space?" at around 5:16 PM Mountain Time, noting Gmaas was "also 5space"<br />
<br />
-EDIT: he also did it in Introduction to Algebra A once.<br />
<br />
- Gmaas is now my HD background on my Mac.<br />
<br />
- In 1521 Into to Number Theory, sseraj posted an image of a 5space Gmaas fusion. (First sighting) <br />
<br />
- Also confirmed that Gmaas doesn't like ketchup because it was the only food left the photo.<br />
<br />
- In 1447 Intro to Geometry, sseraj posted a picture of Gmaas with a rubik's cube suggesting that Gmaas's has an average solve time of <math>-GMAAS</math> seconds.<br />
<br />
-Gmaas beat Superman in a fight with ease<br />
<br />
-Gmaas was an admin of Roblox<br />
<br />
-Gmaas traveled around the world, paying so much <math>MONEY</math> just to eat :D<br />
<br />
-Gmaas is a confirmed Apex predator and should not be approached, unless in a domestic form.<br />
Summary:<br />
<br />
-When Gmaas subtracts <math>0.\overline{99}</math> from <math>1</math>, the difference is greater than <math>0</math>.<br />
<br />
-Gmaas was shown to have fallen on Wed Aug 23 2017: https://ibb.co/bNrtmk https://ibb.co/jzUDmk<br />
<br />
-Gmaas died on August ,24, 2017, but fortunately IceParrot revived him after about 2 mins of being dead.<br />
<br />
-The results of the revival are top secret, and nobody knows what happened.<br />
<br />
-sseraj, in 1496 Prealgebra 2, said that Gmaas is Santacat.<br />
<br />
-sseraj likes to post a picture of gmaas in every class he passes by.<br />
<br />
-sseraj posted a picture of gmaas as an Ewok, suggesting he resides on the moon of Endor. Unfortunately, the moon of Endor is also uninhabitable ever since the wreckage of the Death Star changed the climate there. It is thought gmaas is now wandering space in search for a home.<br />
EDIT: What evidence is there Endor was affected? Other Ewoks still live there.<br />
EDIT EDIT: also, glass doesn't care. He can live there no matter what the climate is.<br />
<br />
-Gmaas is the lord of the pokemans<br />
<br />
-Gmaas can communicate with, and sometimes control any other cats, however this is very rare, as cats normally have a very strong will.<br />
<br />
-Picture of Gmaas http://i.imgur.com/PP9xi.png<br />
<br />
-Known by Mike Miller<br />
<br />
-Gmaas got mad at sseraj once, so he locked him in his own freezer<br />
<br />
-Then, sseraj decided to eat all of Gmaas's hidden turnips in the freezer as punishment<br />
<br />
-Gmaas is an obviously omnipotent cat.<br />
<br />
-ehawk11 met him<br />
<br />
-sseraj is known to post pictures of Gmaas on various AoPS classrooms. It is not known if these photos have been altered with the editing program called 'Photoshop'.<br />
<br />
-sseraj has posted pictures of gmaas in '"intro to algebra", before class started, with the title, "caption contest". anyone who posted a caption mysteriously vanished in the middle of the night. <br />
EDIT: This has happened many times, including in Introduction to Geometry 1533, among other active classes. The person writing this (Poeshuman) did participate, and did not disappear. (You could argue Gmaas is typing this through his/her account...)<br />
<br />
- gmaas has once slept in your bed and made it wet<br />
<br />
-It is rumored that rrusczyk is actually Gmaas in disguise<br />
<br />
-Gmaas is suspected to be a Mewtwo in disguise<br />
<br />
-Gmaas is a cat but has characteristics of every other animal on Earth.<br />
<br />
-Gmaas is the ruler of the universe and has been known to be the creator of the species "Gmaasians".<br />
<br />
-There is a rumor that Gmaas is starting a poll<br />
<br />
-Gmaas is a rumored past ThunderClan cat who ran away, founded GmaasClan, then became a kittypet.<br />
<br />
-There is a rumored sport called "Gmaas Hunting" where people try to successfully capture gmaas in the wild with video/camera/eyes. Strangely, no one has been able to do this, and those that have have mysteriously disappeared into the night. Nobody knows why. The person who is writing this(g1zq) has tried Gmaas Hunting, but has never been successful.<br />
<br />
- Gmaas burped and caused an earthquake.<br />
<br />
- Gmaas once drank from your pretty teacup.<br />
<br />
-GMAAS IS HERE.... PURRRRRRRRRRRRRRRRRRRR<br />
<br />
-Gmass made, and currently owns the Matrix.<br />
<br />
-The above fact is true. Therefore, this is an illusion.<br />
<br />
-Gmaas is the reason Salah will become better than Ronaldo.<br />
<br />
-Who is Gmaas, really?<br />
-Gmass is a heavenly being<br />
<br />
-Illuminati was a manifestation of Gmaas, but Gmass decided illuminati was not great enough for his godly self.<br />
<br />
-jlikemath has met Gmaas and Gmaas is his best friend.<br />
<br />
-Gmaas loves Kpop<br />
<br />
-Gmaas read Twilight EDIT: ...and SURVIVED<br />
<br />
-there is a secret code when put into super smash, Gmass would be a playible character. Too bad he didn't say it.<br />
<br />
-Gmaas was a tribute to one of the Hunger Games and came out a Victor and now lives in District 4<br />
<br />
=== Gmaas photos ===<br />
http://cdn.artofproblemsolving.com/images/f/f/8/ff8efef3a0d2eb51254634e54bec215b948a1bba.jpg<br />
<br />
=== gmaas in Popular Culture ===<br />
<br />
- <s>Currently, is being written (by themoocow) about the adventures of gmaas. It is aptly titled, "The Adventures of gmaas".</s>Sorry, this was a rick roll troll.<br />
<br />
- BREAKING NEWS: tigershark22 has found a possible cousin to gmaas in Raymond Feist's book Silverthorn. They are mountain dwellers, gwali. Not much are known about them either, and when someone asked,"What are gwali?" the customary answer "This is gwali" is returned. Scientist 5space is now looking into it.<br />
<br />
- Sullymath and themoocow are also writing a book about Gmaas<br />
<br />
-Sighting of Gmaas: https://2017.spaceappschallenge.org/challenges/warning-danger-ahead/and-you-can-help-fight-fires/teams/gmaas/project<br />
<br />
-Oryx the mad god is actually gmass wearing a suit of armor. This explains why he is never truly killed<br />
<br />
- Potential sighting of gmaas [http://www.gmac.com/frequently-asked-questions/gmass-search-service.aspx]<br />
<br />
- Gmaas has been spotted in some Doctor Who and Phineas and Ferb episodes, such as Aliens of London, Phineas and Ferb Save Summer, Dalek, Rollercoaster, Rose, Boom Town, The Day of The Doctor, Candace Gets Busted, and many more.<br />
<br />
- Gmaas can be found in many places in Plants vs. Zombies Garden Warfare 2 and Bloons TD Battles<br />
<br />
- gmaas was an un-credited actor in the Doctor Who story Knock Knock, playing a Dryad. How he shrunk, we will never know.<br />
<br />
-oadaegan is also writing a story about him. He is continuing the book that was started by JpusheenS. when he is done he will post it here<br />
<br />
-Gmaas is a time traveler from 0.9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 B.C.<br />
<br />
-No one knows if Gmass is a Mr. mime in a cat skin, the other way around, or just a downright combination of both.<br />
<br />
-In it, it mentions these four links as things Gmass is having trouble (specifically technical difficulties). What could it mean? Links:<br />
https://docs.google.com/document/d/1NZ0XcFYm80sA-fAoxnm7ulMCwdNU75Va_6ZjRHfSHV0<br />
https://docs.google.com/document/d/1ELN7ORauFFv1dwpU_u-ah_dFJHeuJ3szYxoeC1LlDQg/<br />
https://docs.google.com/document/d/1oy9Q3F7fygHw-OCWNEVE8d-Uob2dxVACFcGUcLmk3fA<br />
https://docs.google.com/document/d/1jzb9Q6FmDmrRyXwnik3e0sYw5bTPMo7aBwugmUbA13o<br />
<br />
<br />
- Another possible Gmaas sighting [https://2017.spaceappschallenge.org/challenges/warning-danger-ahead/and-you-can-help-fight-fires/teams/gmaas/project]<br />
<br />
-<math>Another</math> sighting? [https://www.radarbox24.com/data/flights/GMAAS]<br />
- Yet Another Gmaas sighting ? [https://supportforums.cisco.com/t5/user/viewprofilepage/user-id/45046]<br />
<br />
-Gmaas has been sighted several times on the Global Announcements forum<br />
<br />
-Gmaas uses the following transportation: <img> http://cdn.artofproblemsolving.com/images/3/6/8/368da4e615ea3476355ee3388b39f30a48b8dd48.jpg </img><br />
<br />
- When Gmaas was mad, he started world wars 1 & 2. It is only because of Gmaas that we have not had World War 3.<br />
<br />
- Gmaas is the only cat to have been proved irrational and transcendental, though we suspect all cats fall in the first category.<br />
<br />
- Gmaas plays Geometry Dash and shares an account with Springhill, his username is D3m0nG4m1n9.<br />
<br />
-Gmaas likes to whiz on the wilzo<br />
<br />
-Gmaas has been spotted in AMC 8 Basics<br />
<br />
-Gmaas is cool<br />
<br />
-Gmaas hemoon card that does over 9000000 dmg<br />
<br />
-Gmaas is a skilled swordsman who should not to be mistaken for Puss in Boots. Some say he even trained the mysterious and valiant Meta Knight.<br />
<br />
-Kirby once swallowed Gmaas. Gmaas had to spit him out.<br />
<br />
-Gmaas was the creator of pokemon, and his pokemon card can OHKO anyone in one turn. He is invisible and he will always move first.<br />
<br />
-Gmass beat Dongmin in [url=https://en.wikipedia.org/wiki/The_Genius_(TV_series)]The Genius Game[/url] Season 1, 2, 3, 4, and 5.</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10B_Problems/Problem_23&diff=89971
2017 AMC 10B Problems/Problem 23
2018-01-25T04:08:46Z
<p>Relay400: /* Solution 2 */</p>
<hr />
<div>==Problem 23==<br />
Let <math>N=123456789101112\dots4344</math> be the <math>79</math>-digit number that is formed by writing the integers from <math>1</math> to <math>44</math> in order, one after the other. What is the remainder when <math>N</math> is divided by <math>45</math>?<br />
<br />
<math>\textbf{(A)}\ 1\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 44</math><br />
<br />
==Solution==<br />
We only need to find the remainders of N when divided by 5 and 9 to determine the answer.<br />
By inspection, <math>N \equiv 4 \text{ (mod 5)}</math>.<br />
The remainder when <math>N</math> is divided by <math>9</math> is <math>1+2+3+4+ \cdots +1+0+1+1 +1+2 +\cdots + 4+3+4+4</math>, but since <math>10 \equiv 1 \text{ (mod 9)}</math>, we can also write this as <math>1+2+3 +\cdots +10+11+12+ \cdots 43 + 44 = \frac{44 \cdot 45}2 = 22 \cdot 45</math>, which has a remainder of 0 mod 9. Therefore, by inspection, the answer is <math>\boxed{\textbf{(C) } 9}</math>.<br />
<br />
Note: the sum of the digits of <math>N</math> is <math>270</math>.<br />
<br />
==Solution 2==<br />
Noting the solution above, we try to find the sum of the digits to figure out its remainder when divided by <math>9</math>. From <math>1</math> thru <math>9</math>, the sum is <math>45</math>. <math>10</math> thru <math>19</math>, the sum is <math>55</math>, <math>20</math> thru <math>29</math> is <math>65</math>, and <math>30</math> thru <math>39</math> is <math>75</math>. Thus the sum of the digits is <math>45+55+65+75+4+5+6+7+8 = 240+30 = 270</math>, and thus <math>N</math> is divisible by <math>9</math>. Now, refer to the above solution. <math>N \equiv 4 \text{ (mod 5)}</math> and <math>N \equiv 0 \text{ (mod 9)}</math>. From this information, we can conclude that <math>N \equiv 54 \text{ (mod 5)}</math> and <math>N \equiv 54 \text{ (mod 9)}</math>. Therefore, <math>N \equiv 54 \text{ (mod 45)}</math> and <math>N \equiv 9 \text{ (mod 45)}</math> so the remainder is <math>\boxed{\textbf{(C) }9}</math><br />
<br />
==See Also==<br />
{{AMC10 box|year=2017|ab=B|num-b=22|num-a=24}}<br />
{{MAA Notice}}</div>
Relay400
https://artofproblemsolving.com/wiki/index.php?title=Mock_AIME_2_2010_Answer_Key&diff=78245
Mock AIME 2 2010 Answer Key
2016-04-25T23:50:49Z
<p>Relay400: /* Unformatted Solutions */</p>
<hr />
<div>Return to [[Mock AIME 2 2010]]<br />
<br />
# 804<br />
# 683<br />
# 401<br />
# 392<br />
# 416<br />
# 108<br />
# 756<br />
# 028<br />
# 135<br />
# 041<br />
# 164<br />
# 256<br />
# 385<br />
# 167<br />
# 860<br />
<br />
{{AIME box|year = Mock|n = 2 2010|before=[[Mock AIME 1 2010]]|after=[[Mock AIME 1 2011]]}}<br />
<br />
== Unformatted Solutions ==<br />
:''Written by the problem authors''. See the external links at [[Mock AIME 2 2010]].<br />
<br />
<br />
There are 2010 lemmings. At each step, we may separate the lemmings into groups of 5 and purge the remainder, separate them into groups of 3 and purge the remainder, or pick one lemming and purge it. Find the smallest number of steps necessary to remove all 2010 lemmings. (Alex Zhu)<br />
<br />
<br />
%%Solution 1<br />
<br />
Notice that removing as many lemmings as possible at each step (i.e., using the greedy algorithm) is optimal. This can be easily proved through strong induction. Starting from 2010, which is a multiple of 15, we must first purge 1 lemming. We can then purge 4 lemmings by using groups of 5. Then, we can use groups of 3 followed by groups of 5 to reduce it to 5 less. We can repeat this step again, and we will end up at <math>2010-15=1995</math>. This process can be repeated every for every 15 lemmings, so since it takes 6 steps to clear 15 lemmings, it will take us <math>2010\cdot\frac{6}{15}=\boxed{804}</math> to remove all the lemmings.<br />
<br />
<br />
%%Problem 2<br />
<br />
\setcounter{enumi}{1}<br />
Let <math>a_1, a_2, \ldots, a_{10}</math> be nonnegative integers such that <math>a_1 + a_2 + \ldots + a_{10} = 2010</math>, and define <math>f</math> so that <math>f((a_1, a_2, \ldots, a_{10})) = (b_1, b_2, \ldots, b_{10})</math>, with <math>0 \le b_i \le 2, 3|a_i-b_i</math> for <math>1 \le i \le 10</math>. Given that <math>f</math> can take on <math>K</math> distinct values, find the remainder when <math>K</math> is divided by 1000. (Alex Zhu)<br />
<br />
<br />
%%Solution 2<br />
<br />
For any <math>a_1, a_2, \ldots, a_{10}</math>, since <math>b_i\equiv a_i \pmod{3}</math> for <math>1\le i\le 10</math>, therefore, <math>b_1+b_2+\ldots+b_{10}\equiv a_1+a_2+\ldots+a_{10} = 2010 \equiv 0 \pmod{3}</math>. Also, note that for any <math>(b_1, b_2, \ldots, b_{10})</math> that satisfies <math>b_1+b_2+\ldots+b_{10}\equiv 0 \pmod{3}</math>, there exists a corresponding <math>(a_1, a_2, \ldots, a_{10})</math> such that <math>a_1+a_2+\ldots+a_{10}=2010</math> (let <math>a_i = b_i</math> for <math>1 \leq i \leq 9</math>, and <math>a_{10} = 2010 - (b_1 + b_2 + \ldots + b_9)</math>.) Therefore, we are just trying to count the number of <math>(b_1, b_2, \ldots, b_{10})</math> that satisfy <math>b_1+b_2+\ldots+b_{10}\equiv 0 \pmod{3}</math>. To do this, we note that for any of the <math>3^9</math> possible ways to pick <math>b_1, b_2, \dots, b_9</math>, there is exactly 1 possible value of <math>b_{10}</math> that works. Therefore, the total number of possibilities is <math>3^9=19\boxed{683}</math>.<br />
<br />
<br />
%%Problem 3<br />
<br />
\setcounter{enumi}{2}<br />
Five gunmen are shooting each other. At the same moment, each randomly chooses one of the other four to shoot. The probability that there are some two people shooting each other can be expressed in the form <math>\frac{a}{b}</math>, where <math>a, b</math> are relatively prime positive integers. Find <math>a+b</math>. (Tim Wu)<br />
<br />
<br />
<br />
We will count how many distinct arrangements (choices of target for each gunman) result in a pair shooting each other, and divide this by the total number of arrangements, <math>4^5</math>. For any pair to shoot each other, the two shoot each other in exactly one way, while the other three people shoot any of their 4 targets. There are 10 possible pairs, giving a count of <math>4^3\cdot10=640</math> this way. However, we must account for the overcount caused by 2 pairs shooting each other simultaneously. We can choose one person who is not in the pair in 5 ways, and then of the following people, say A, B, C, and D, we make A shoot one of the others in 3 possible ways (the remaining people can shoot each other in only one other way.) Finally, the lone person can shoot whomever he so desires in 4 ways, giving <math>5\cdot3\cdot4=60</math> total possibilities. Our probability is then <math>\frac{640-60}{4^5}=\frac{580}{4^5}=\frac{145}{256}</math>, so our answer is <math>\boxed{401}</math>.<br />
<br />
<br />
%%Problem 4<br />
<br />
\setcounter{enumi}{3}<br />
Anderson is bored in physics class. His favorite numbers are 1, 7, and 33. He randomly writes 0., and then writes down a long string consisting of those numbers juxtaposed against one another (e.g., 0.1337173377133...) on a sheet of paper. Since physics class is infinitely long, he writes an infinitely long decimal number. If the expected value of the number he wrote down is of the form <math>\frac{a}{b}</math>, where <math>a</math> and <math>b</math> are relatively prime positive integers, find <math>a+b</math>. (Alex Zhu)<br />
<br />
<br />
%%Solution 4<br />
<br />
Let <math>E</math> be the expected value of the number Anderson writes. Consider the first segment of the number Anderson writes. If it is 1, then the number will begin with 1, and the remaining part will have an expected value of <math>\frac{E}{10}</math> (the expected value of the original number only moved down a digit). Thus, in this case, his number will average <math>\frac{1}{10}+\frac{E}{10}</math>. Similarly, if he writes 7, his number will average <math>\frac{7}{10}+\frac{E}{10}</math>, and if he writes 33, his number will average <math>\frac{33}{100}+\frac{E}{100}</math>. Each of these cases happens with equal probability, so we have<br />
\begin{align*}<br />
E&= \dfrac{\frac{1}{10}+\frac{E}{10}+\frac{7}{10}+\frac{E}{10}+\frac{33}{100}+\frac{E}{100}}{3} \\<br />
300E &= 10+10E+70+10E+33+E \\<br />
279E &= 113 \\<br />
E &= \frac{113}{279}.<br />
\end{align*}<br />
Our answer is therefore <math>113+279=\boxed{392}</math>. <br />
<br />
<br />
%%Problem 5<br />
<br />
\setcounter{enumi}{4}<br />
Let <math>P(x)=(1+x)(1+2x^2)(1+3x^4)(1+4x^8)(1+5x^{16})</math>. Find the three rightmost nonzero digits of the product of the coefficients of <math>P(x)</math>. (Alex Zhu)<br />
<br />
<br />
%%Solution 5<br />
<br />
First, note that each of the <math>2^{5}</math> possible coefficients is multiplied by a different power of <math>x</math>, because there are also <math>2^5</math> different powers of <math>x</math> in total (this follows from the fact that every positive integer can be written uniquely as a sum of powers of 2; the coefficient of <math>x^n = x^{\sum 2^i b_i}</math>, where <math>b_i \in \{0,1\}</math>, is obtained from multiplying together all <math>i x^i</math> with <math>b_i = 1</math>.) Therefore, we are trying to find the product of the product of all of the elements of subsets of the set <math>S=\{ 1,2,3,4,5\}</math> (where the product of the elements of the empty set is taken to be 1). If we pair each subset <math>P</math> with its complement, we will have 16 pairs of subsets, each of which multiply together to <math>5!</math>, so the product of all of the subsets is <math>(5!)^{16}=120^{16}</math>. Since we want the last three nonzero digits, we simply wish to find <math>12^{16} \pmod{1000}</math>. To make this easier, we will find it modulo 8 and modulo 125 and use the Chinese remainder theorem to find the answer. <br />
<br />
<math>12^{16}\equiv 0 \pmod{8}</math>, and <math>12^{16}\equiv 144^8\equiv 19^8\equiv 361^4\equiv (-14)^4\equiv 196^2\equiv 71^2\equiv 41 \pmod{125}</math>.<br />
<br />
We can now see that because <math>41\equiv 1\pmod{8}</math> and <math>125\equiv 5\pmod{8}</math>, the only number that is <math>0\pmod{8}</math> and <math>41\pmod{125}</math> is <math>41+125 \cdot 3=\boxed{416}</math>.<br />
<br />
<br />
%%Problem 6<br />
<br />
\setcounter{enumi}{5}<br />
\item<br />
Let <math>S_n</math> denote the set <math>\{1,2,\ldots,n\}</math>, and define <math>f(S)</math>, where <math>S</math> is a subset of the positive integers, to output the greatest common divisor of all elements in <math>S</math>, unless <math>S</math> is empty, in which case it will output 0. Find the last three digits of <math>\sum_{S\subseteq S_{10}} f(S)</math>, where <math>S</math> ranges over all subsets of <math>S_{10}</math>. (George Xing)<br />
<br />
<br />
%%Solution 6<br />
<br />
Let <math>a_i</math> denote the number of subsets <math>S \subseteq S_{10}</math> such that <math>f(S)=i</math>. Our answer will be the sum <math>\sum_{i=0}^{10} ia_i</math>.<br />
<br />
For any positive integer <math>d \leq 10</math>, we note that the non-empty sets satisfying the property that <math>f(S)</math> is a multiple of <math>d</math> are exactly the non-empty sets whose elements are multiples of <math>d</math>. Hence, the number of such sets is <math>2^k - 1</math>, where <math>k=\lfloor \frac{10}{d} \rfloor</math> (as there are <math>k</math> multiples of <math>d</math> between 1 and 10 inclusive.) On the other hand, the number of such sets is <math>a_d + a_{2d} + \ldots + a_{kd}</math>, that is, the sum of the number of sets <math>S</math> such that <math>f(S)</math> is <math>d</math>, <math>f(S)</math> is <math>2d</math>, <math>f(S)</math> is <math>3d</math>, etc., so we have that <math>a_d + a_{2d} + \ldots + a_{kd} = 2^k - 1</math>. By setting <math>d = 1, 2, 3, \ldots, 10</math>, we see that <br />
<br />
\begin{align*}<br />
a_1 + a_2 + a_3 + a_4 + a_5 + a_6 + a_7 + a_8 + a_9 + a_{10} &= 2^{10} - 1 = 1023 \\<br />
a_2 + a_4 + a_6 + a_8 + a_{10} &= 2^5 - 1 = 31 \\<br />
a_3 + a_6 + a_9 &= 2^3 - 1 = 7 \\<br />
a_4 + a_8 &= 2^2 - 1 = 3 \\<br />
a_5 + a_{10} &= 2^2 - 1 = 3 \\<br />
a_6 &= 2^1 - 1 = 1 \\<br />
a_7 &= 2^1 - 1 = 1 \\<br />
a_8 &= 2^1 - 1 = 1 \\<br />
a_9 &= 2^1 - 1 = 1 \\<br />
a_{10} &= 2^1 - 1 = 1<br />
\end{align*}<br />
We can easily solve this system of equations to find <math>a_1 = 983</math>, <math>a_2 = 26</math>, <math>a_3 = 5</math>, <math>a_4 = 2</math>, <math>a_5 = 2</math>, and <math>a_6 = a_7 = a_8 = a_9 = a_{10} = 1</math>. Our answer is therefore <math>1 \cdot 983 + 2 \cdot 26 + 3 \cdot 5 + 4 \cdot 8 + 5 \cdot 2 + 6\cdot 1 + 7 \cdot 1 + 8 \cdot 1 + 9 \cdot 1 + 10 \cdot 1 = 1\boxed{108}</math>.<br />
<br />
<br />
%%Problem 7<br />
<br />
<br />
<br />
\setcounter{enumi}{6}<br />
Find the number of functions <math>f</math> from <math>\{1,2,3,4,5\}</math> to itself such that <math>f(f(f(x))) = f(f(x))</math> for all <math>x \in \{1,2,3,4,5\}</math>. (Alex Zhu)<br />
<br />
<br />
%%Solution 7<br />
<br />
For a function <math>f</math>, let <math>A= \{i : f(i)=i\}</math> be the set of values that are fixed, let <math>B = \{i : f(i) \in A \text{ and } i \not\in A\}</math> be the set of values that evaluate to an element in <math>A</math> but are not elements of <math>A</math> themselves, and let <math>C=\{1,2,3,4,5\} - (A\cup B)</math> be the set of the remaining values. Notice that all possible values of <math>f(f(x))</math> are in <math>A</math>, so <math>A</math> must be nonempty. We will now use casework on the size of <math>A</math>.<br />
<br />
\textbf{Case 1: } <math>|A|=1</math>.\\<br />
WLOG, let <math>f(1)=1</math>, so we will multiply our result by 5 at the end. Now, let <math>|B|=x</math>, so <math>|C|=4-x</math>. We must have <math>f(f(x))=1</math> for all <math>x</math>, so each element <math>c</math> in <math>C</math> must satisfy <math>f(c)=b</math> for some <math>b</math> in <math>B</math>, because <math>f(c)\neq 1</math> and the only other numbers for which <math>f(x)=1</math> are the elements of b. This also implies <math>|B|>0</math>. Conversely, it is easy to check any function satisfying <math>f(c)=b</math> works, so the total number of functions in this case is <math>{5\sum_{x=1}^4 \binom{4}{x} x^{4-x}}</math> because there are <math>\binom{4}{x}</math> ways to choose the elements in <math>B</math>, and each of the <math>4-x</math> elements in C can map to any of the <math>x</math> elements in B. This sum evaluates to <math>5(4+6\cdot 4+4\cdot 3+1)=205</math>, so there are 205 functions in this case.<br />
<br />
\textbf{Case 2: } <math>|A|=2</math>.\\<br />
This is very similar to case 1, except for the fact that each element in <math>B</math> can now correspond to one of two possible elements in <math>A</math>, so this adds a factor of <math>2^x</math>. The sum is <math>{\binom{5}{2}\sum_{x=1}^3\binom{3}{x} 2^x x^{3-x}}=10(3\cdot 2+3\cdot 4\cdot 2+8)=380</math>, so there are 380 functions in this case.<br />
<br />
\textbf{Case 3: } <math>|A|=3</math>.\\<br />
The sum is <math>{\binom{5}{3}\sum_{x=1}^2\binom{2}{x} 3^x x^{2-x}}=10(2\cdot 3+9)=150</math>, so there are 150 functions in this case.<br />
<br />
\textbf{Case 4: } <math>|A|=4</math>.\\<br />
There are clearly <math>5(4)=20</math> functions in this case. <br />
<br />
\textbf{Case 5: } <math>|A|=5</math>.\\<br />
There is a total of 1 function (the identity) in this case. <br />
<br />
Adding everything up, we see that our final answer is <math>205+380+150+20+1=\boxed{756}</math>.<br />
<br />
<br />
%%Problem 8<br />
<br />
\setcounter{enumi}{7}<br />
In triangle <math>ABC</math>, <math>BA = 15</math>, <math>AC = 20</math>, and <math>BC = 25</math>. In addition, there is a point <math>D</math> lying on segment <math>BC</math> such that <math>BD = 16</math>. Given that the length of the radius of the circle through <math>B</math> and <math>D</math> that is tangent to side <math>AC</math> can be expressed in the form <math>\frac{p}{q}</math>, where <math>p</math> and <math>q</math> are relatively prime integers, find <math>p + q</math>. (Alex Zhu)<br />
<br />
<br />
%%Solution 8<br />
\begin{sol1}<br />
Let <math>E</math> be the point of tangency of the circle with <math>AC</math>. By power of a point, <math>CD \cdot CB = CE^2</math>, that is, <math>9 \cdot 25 = C^2</math>, giving <math>CE = 15</math> and <math>AE = 20 - 15 = 5</math>. Since <math>15^2 + 20^2 = 25^2</math>, <math>m \angle A = 90^{\circ}</math>, so <math>BE = 5 \sqrt{10}</math> and <math>\sin m \angle AEB = \frac{15}{5 \sqrt{10}}</math>. Since the circle is tangent to <math>AC</math>, we have that <math>\angle AEB \cong \angle EDB</math>. By the extended law of sines, the circumdiameter of <math>\triangle BED</math> (that is, the radius of our circle) is <math>\frac{BE}{\sin m \angle EDB} = \frac{BE}{\sin m \angle AEB} = \frac{50}{3}</math>. Therefore, the radius is <math>\frac{25}{3}</math>, giving an answer of <math>25 + 3 = \boxed{028}</math>. <br />
\end{sol1}<br />
<br />
\begin{sol2}<br />
Let O be the center of the circle, and let points E and F to be the perpendiculars from O to AC and BC, respectively. First, by power of a point, we have <math>CD \cdot CB=CE^2</math>, so <math>9\cdot 25=CE^2</math>, giving <math>CE=15</math> and <math>EA=20-15=5</math>. Now, let <math>r</math> be the radius of the circle. We have <math>AF=EO=r</math>, so <math>FB=AB-AF=15-r</math>. By the Pythagorean theorem on triangle FOB, we have <math>FB^2+FO^2=BO^2\iff 225-30r+r^2+FO^2=r^2 \iff FO=\sqrt{30r-225}</math>. Finally, we have <math>5=EA=FO=\sqrt{30r-225}</math>, so <math>25=30r-225</math>. Hence, <math>r=\frac{25}{3}</math>, giving us an answer of <math>25+3=\boxed{028}</math>.<br />
\end{sol2}<br />
<br />
%%Problem 9<br />
<br />
\setcounter{enumi}{8}<br />
Given that <math>x,y,z</math> are reals such that <math>16 \sin^4(x+y) + 49 \cos^4(x+y) = \sin^2(2x + 2y)(8\sin^2(x+z) + 6 \cos^2(y+z))</math>, the largest possible value of <math>3\cos^2(x+y+z)</math> can be expressed in the form <math>\frac{a+b\sqrt{c}}{d}</math>, where <math>a</math> and <math>b</math> are integers, <math>c</math> is a positive integer not divisible by the square of any prime, and <math>d</math> is a positive integer such that <math>\gcd(a,b,d)=1</math>. Find <math>a+b+c+d</math>. (Alex Zhu)<br />
<br />
<br />
%%Solution 9<br />
<br />
\begin{align*}<br />
16\sin^4(x+y) + 49\cos^4(x+y) <br />
&= \sin^2(2x + 2y)\left(8\sin^2(x+z) + 6\cos^2(y+z)\right) \\<br />
&\leq 14 \sin^2(2x + 2y) \\<br />
&= 56(\sin(x+y) \cos(x+y))<br />
\end{align*}<br />
Hence, <math>(4 \sin^2(x+y) - 7 \cos^2(x+y)) \leq 0</math>, yielding <math>\tan^2(x+y) = \frac{7}{4}</math>, or <math>x + y = \pm \arctan{\frac{\sqrt{7}}{2}} + a\pi</math>, for some integer <math>a</math>. Furthermore, we must have <math>\sin^4(x+z) = \cos^4(y+z) = 1</math>, so <math>x + z = \frac{\pi}{2} + b\pi</math> and <math>y + z = c \pi</math> for some integers <math>b</math> and <math>c</math>. Hence, <math>2x + 2y + 2z = \pm \arctan\frac{\sqrt{7}}{2} + \frac{\pi}{2} + \pi(a+b+c)</math>, so <math>|\cos(2x + 2y + 2z)| = |\sin \arctan\frac{\sqrt{7}}{2}| = \frac{\sqrt{77}}{11}</math>. Hence, <math>2\cos(x+y+z)^2 - 1 \leq |2\cos(x+y+z)^2 - 1| = |\cos(2x + 2y + 2z)| = \frac{\sqrt{77}}{11}</math>, giving us <math>3 \cos(x+y+z)^2 \leq \frac{33 + 3 \sqrt{77}}{22}</math>. This is attained when <math>\cos(2x + 2y + 2z) > 0</math>, which indeed occurs if we pick <math>x + y = \arctan \frac{\sqrt{7}}{2}</math>, <math>x + z = \frac{\pi}{2} + \pi</math>, and <math>z + y = 0</math>, so our answer is <math>33 + 3 + 77 + 22 = \boxed{135}</math>. <br />
<br />
<br />
%%Problem 10<br />
<br />
\setcounter{enumi}{9}<br />
How many positive integers <math>n \le 2010 </math> satisfy <math>\phi(n) | n</math>, where <math>\phi(n)</math> is the number of positive integers less than or equal to <math>n</math> relatively prime to <math>n</math>? (Alex Zhu)<br />
<br />
<br />
%%Solution 10<br />
<br />
If <math>n = 2^k</math>, then <math>\varphi(2^k) = 2^{k-1} | 2^k = n</math>. Now, suppose <math>n</math> is not a power of 2. Let <math>n = 2^a b</math>, where <math>b</math> is odd. <math>\phi(n) = 2^{a-1} \phi(b)</math>. If <math>b = pqm</math>, where <math>p</math> and <math>q</math> are distinct odd prime numbers and <math>m</math> is some integer, then <math>\phi(b) = \phi(p)\phi(q) \phi(m) = (p-1)(q-1) \phi(m)</math>. Since <math>p</math> and <math>q</math> are odd, <math>p-1</math> and <math>q-1</math> are even, so <math>4 | \phi(b)</math>. Hence, <math>2^{a+1} | \phi(n)</math>, so <math>\phi(n) \not | n</math>. <br />
<br />
It follows that <math>n</math> has at most one other prime factor, so <math>n</math> is of the form <math>2^k p^j</math>. <math>\varphi(2^k p^j) = 2^{k-1} p^{j-1}(p-1) | 2^k p^j</math>, so <math>p - 1 | 2p</math>. Hence, <math>p - 1 | 2p - 2(p - 2) = 2</math>, so <math>p = 2, 3</math>. But <math>p \neq 2</math>, so we must have that <math>p = 3</math>. <br />
<br />
We now note that <math>\varphi(3^b)</math>, <math>b > 0</math>, is even, and hence does not divide <math>3^k</math>. But <math>\varphi(2^a 3^b) = 2^a 3^{b-1} | 2^a 3^b</math>, so we wish to find the number of integers less than or equal to 2010 of the form <math>2^a 3^b</math> such that <math>b \neq 0</math> implies <math>a \neq 0</math>. <br />
<br />
When <math>a=0</math>, <math>b=0</math> giving one possible value of <math>b</math>. For any larger <math>a < 10</math> (as <math>2^{11} > 2010</math>), we have <math>0 \leq b \leq \lfloor \log_2 \frac{2010}{2^a} \rfloor</math>, yieding <math>\lfloor \log_2 \frac{2010}{2^a} \rfloor + 1</math> possible values of <math>b</math>. Summing these values for <math>1 \leq a \leq 9</math> gives us the answer of <math>1 + 7 + 6 + 6 + 5 + 4 + 4 + 3 + 2 + 2 = \boxed{041}</math>. <br />
<br />
<br />
%%Problem 11<br />
<br />
\setcounter{enumi}{10}<br />
Let <math>f:\mathbb{N}\to\mathbb{N}</math> be a function such that <cmath>f(n) =\sum_{abc = n | a,b,c \in \mathbb{N}} ab + bc + ca.</cmath> For example, <math>f(5) = (1 \cdot 1 + 1 \cdot 5 + 5 \cdot 1) + (1 \cdot 5 + 5 \cdot 1 + 1 \cdot 1) + (5 \cdot 1 + 1 \cdot 1 + 1 \cdot 5) = 33</math>, where we are summing over the triples <math>(a,b,c) = (1,1,5), (1,5,1)</math>, and <math>(5,1,1)</math>. Find the last three digits of <math>f(30^{3})</math>. (Mitchell Lee)<br />
<br />
<br />
%%Solution 11<br />
<br />
<math>\sum_{abc = n | a,b,c \in \mathbb{N}} ab + bc + ca = abc \sum_{abc = n | a,b,c \in \mathbb{N}} \frac{1}{a} + \frac{1}{b} + \frac{1}{c}</math>. For any <math>a</math> that divides <math>n</math>, the number of sums that <math>\frac{1}{a}</math> will be in is exactly three the number of ordered pairs <math>(b,c)</math> we can find such that <math>abc = n</math>, which in turn is just <math>\tau(\frac{n}{a})</math>, where <math>\tau(n)</math> is the number of divisors of <math>n</math> (<math>b</math> can be any divisor of <math>\frac{n}{a}</math>, and <math>c = \frac{n}{ab}</math>.) (The factor of three arises from the fact that <math>\frac{1}{b} + \frac{1}{a} + \frac{1}{c}</math> and <math>\frac{1}{b} + \frac{1}{c} + \frac{1}{a}</math> are to be taken account as well.) Hence, <math>abc \sum_{abc = n | a,b,c \in \mathbb{N}} \frac{1}{a} + \frac{1}{b} + \frac{1}{c} = \frac{1}{n} \sum_{a | n} \frac{\tau(\frac{n}{a})}{a}</math>. Since the set <math>\{d : d > 0, d | n\}</math> is the same as the set <math>\{\frac{n}{d} : d > 0, d | n\}</math>, <math>n \sum_{a | n} \frac{\tau(\frac{n}{a})}{a} = n \sum_{a | n} \frac{\tau(a)}{\frac{n}{a}} = \sum_{a | n} a \tau(a)</math>, that is, <math>f(n) = 3 \sum_{a | n} a \tau(a)</math> for all <math>n</math>. <br />
<br />
Note that if <math>r</math> and <math>s</math> are relatively prime integers, then <math>\tau(rs) = \tau(r)\tau(s)</math> and <math>rs = (r)(s)</math>. Hence, <br />
<cmath>\sum_{a | rs} a \tau(a) = \left(\sum_{a | r} a \tau(a)\right) \left(\sum_{a | s} a \tau(a) \right),</cmath> since every divisor of <math>rs</math> can be expressed uniquely as a product of a divisor of <math>r</math> and as a divisor of <math>s</math> (upon expanding the product using the distributive property, it follows that we are summing over the set of all numbers of the form <math>r_1 s_1</math>, where <math>r_1 | r</math> and <math>s_1 | s</math>, which is exactly the set divisors of <math>rs</math>.) <br />
<br />
It follows that <br />
\begin{align*}<br />
3 f(30^3) <br />
&= 3 \sum_{d | 30^3} d \tau(d) \\<br />
&= 3 \left(\sum_{d | 2^3} d \tau(d) \right) \left(\sum_{d | 3^3} d \tau(d) \right) \left(\sum_{d | 5^3} d \tau(d) \right) \\<br />
&= 3 \left(1 \cdot 1 + 2 \cdot 2 + 3 \cdot 4 + 4 \cdot 8 \right) \left(1 \cdot 1 + 2 \cdot 3 + 3 \cdot 9 + 4 \cdot 27\right) \left( 1 \cdot 1 + 2 \cdot 5 + 3 \cdot 25 + 4 \cdot 125 \right) \\<br />
&= 3 \cdot 49 \cdot 142 \cdot 586<br />
\end{align*}<br />
The last three digits of this product can easily be computed to be <math>\boxed{164}</math>. <br />
<br />
<br />
%%Problem 12<br />
<br />
\setcounter{enumi}{11}<br />
Let <cmath>K = \sum_{a_1=0}^8\sum_{a_2=0}^{a_1}...\sum_{a_{100}=0}^{a_{99}}\binom{8}{a_1}\binom{a_1}{a_2}...\binom{a_{99}}{a_{100}}.</cmath> Find the sum of digits of <math>K</math> in base-100. (Tim Wu)<br />
<br />
<br />
%%Solution 12<br />
\begin{sol1}<br />
Let <cmath>f(n,k)=\sum_{a_1=0}^k \sum_{a_2=0}^{a_1}...\sum_{a_{n}=0}^{a_{n-1}}\binom{k}{a_1}\binom{a_1}{a_2}...\binom{a_{n-1}}{a_{n}}.</cmath> We seek to find <math>f(100,8)</math>.<br />
<br />
We shall prove by induction that <math>f(n,k) = (n+1)^k</math>. Our base case, <math>n=1</math>, follows from the fact that <math>f(1,k)= \sum_{a_1=0}^k \binom{k}{a_1}=2^k</math> by the binomial theorem. Now, we note that <math>f(n,k)=\sum_{i=0}^{k} \binom{k}{i} f(n-1,i)</math>. Assuming that <math>f(m,k) = (m+1)^k</math> for all integers <math>m</math> with <math>1 \leq m \leq n-1</math>, we have that <br />
\begin{align*}<br />
f(n,k)&=\sum_{i=0}^{k} \binom{k}{i} f(n-1,i) \\<br />
&= \sum_{i=0}^k \binom{k}{i} n^i \\<br />
&= (n+1)^k,<br />
\end{align*}<br />
where the last step follows from the binomial theorem. <br />
<br />
Thus, we have <math>f(100,8)=101^8</math>. To express this in base-100, we notice that <math>101^8=(100+1)^8 = 100^8+\binom{8}{1}100^7+\binom{8}{2}100^6+\cdots+100^0</math>. Since <math>\binom{8}{4} = 70 < 100</math>, there are no ``carry-overs,'' so the sum of digits in base-100 will simply be <math>\binom 80+\binom{8}1+\binom 82 + \cdots +\binom{8}{8} = 2^8=\boxed{256}</math>.<br />
\end{sol1}<br />
<br />
\begin{sol2}<br />
Let <math>A_0 = \{1,2,3,4,5,6,7,8\}</math>. The number of 101-tuples of sets <math>(A_{100}, A_{99}, \ldots, A_1, A_0)</math>, such that <math>A_{100} \subseteq A_{99} \subseteq \ldots \subseteq A_1 \subseteq A_0</math> is equal to <math>K</math>; <math>\binom{8}{a_1}</math> tells the number of ways to pick <math>a_1</math> elements from <math>A_0</math>, <math>a_2</math> elements from <math>A_1</math>, etc. <br />
<br />
We shall now count <math>K</math> another way. Consider all 8-digit (leading digits can be 0) base 101 integers; there are clearly <math>101^8</math> such integers. Let <math>A_i</math> be the set of all <math>i</math> such that the <math>i</math>-th digit is greater than or equal to <math>i</math>; then we have that <math>A_{100} \subseteq A_{99} \subseteq \ldots \subseteq A_1</math>. Conversely, for any 101-tuple of sets <math>(A_{100}, A_{99}, \ldots, A_1, A_0)</math> such that <math>A_{100} \subseteq A_{99} \subseteq \ldots \subseteq A_1 \subseteq A_0</math>, we can construct an 8-digit base 101 integer from this set, by having the digit <math>i</math> be the largest integer <math>k</math> such that <math>i \in A_k</math>. <br />
<br />
Hence, <math>K = 101^8</math>. We proceed as we did before to find the sum of the digits of <math>K</math> when it is written in base 100 to arrive at our answer of <math>\boxed{256}</math>. <br />
\end{sol2}<br />
<br />
%%Problem 13<br />
<br />
\setcounter{enumi}{12}<br />
<math>\triangle ABC</math> is inscribed in circle <math>\mathcal{C}</math>. The radius of <math>\mathcal{C}</math> is 285, and <math>BC = 567</math>. When the incircle of <math>\triangle ABC</math> is reflected across segment <math>BC</math>, it is tangent to <math>\mathcal{C}</math>. Given that the inradius of <math>\triangle ABC</math> can be expressed in the form <math>a\sqrt{b}</math>, where <math>a</math> and <math>b</math> are positive integers and <math>b</math> is not divisible by the square of any prime, find <math>a+b</math>. (Alex Zhu)<br />
<br />
<br />
%%Solution 13<br />
\begin{sol1}<br />
We shall prove that in a circle <math>\mathcal{C}</math> with center <math>O</math>, radius <math>R</math>, a chord <math>BC</math> with midpoint <math>M</math> such that <math>OM = m</math>, and a point <math>A</math> on <math>\mathcal{C}</math> such that the incircle <math>\omega</math> of <math>\triangle ABC</math> with radius <math>r</math>, when reflected across <math>BC</math>, is tangent to <math>\mathcal{C}</math>, we have that <math>r = 4m</math>. <br />
<br />
Let <math>I</math> be the incenter of <math>\triangle ABC</math>, let <math>I'</math> be the reflection of <math>I</math> across <math>BC</math> (hence, it is the center of the reflection of the incircle of <math>\triangle ABC</math> across <math>BC</math>), and let <math>O'</math> be the reflection of <math>O</math> across <math>BC</math>. <math>IOO'I'</math> is an isosceles trapezoid, so it is cyclic. Hence, by Ptolemy's theorem, <math>II' \cdot OO' + IO \cdot I'O' = O'I \cdot OI'</math>. In other words, <math>(2r)(2m) + IO^2 = OI'^2</math>, since <math>I'O' = IO</math> and <math>O'I = OI'</math>. But <math>OI' = R - r</math>, since the reflection of <math>\omega</math> across <math>BC</math> is tangent to <math>\mathcal{C}</math>, and <math>IO^2 = R^2 - 2Rr</math> by Euler's distance formula, so <math>4rm + R^2 - 2Rr = R^2 - 2Rr + r^2</math>, yielding <math>r = 4m</math>. <br />
<br />
It therefore suffices to find <math>m</math>. By the Pythagorean theorem, since <math>OMB</math> is right, we have that <math>m^2 + R^2 = \frac{BC^2}{4}</math>, so <br />
\begin{align*}<br />
m<br />
&= \sqrt{285^2 - \frac{567^2}{4}} \\<br />
&= \sqrt{\frac{570^2 - 567^2}{4}} \\<br />
&= \frac{\sqrt{(570 - 567)(570 + 567)}}{2} \\<br />
&= \frac{\sqrt{3 \cdot 1137}}{2} \\<br />
&= \frac{3 \sqrt{379}}{2}.<br />
\end{align*}<br />
Hence, <math>r = 4m = 6 \sqrt{379}</math>, giving us an answer of <math>6 + 379 = \boxed{385}</math>. <br />
\end{sol1}<br />
<br />
\begin{sol2}<br />
We shall prove that in another way that a circle <math>\mathcal{C}</math> with center <math>O</math>, radius <math>R</math>, a chord <math>BC</math> with midpoint <math>M</math> such that <math>OM = m</math>, and a point <math>A</math> on <math>\mathcal{C}</math> such that the incircle <math>\omega</math> of <math>\triangle ABC</math> with radius <math>r</math>, when reflected across <math>BC</math>, is tangent to <math>\mathcal{C}</math>, we have that <math>r = 4m</math>. <br />
<br />
Let <math>I</math> be the incenter of <math>\triangle ABC</math>, and let <math>I'</math> be the reflection of <math>I</math> across <math>BC</math> (hence, it is the center of the reflection of the incircle of <math>\triangle ABC</math> across <math>BC</math>.) Let <math>E</math> be the foot of the perpendicular from <math>O</math> to <math>II'</math>. We have that <math>IE = r - m</math> and <math>OI^2 = R^2 - 2Rr</math> by Euler's distance formula, so <math>OE^2 = R^2 - 2Rr - (r-m)^2 = R^2 - 2Rr + 2rm - r^2 - m^2</math>. In addition, <math>EI' = m + r</math> and <math>OI' = R - r</math>, since the reflection of <math>\omega</math> across <math>BC</math> is tangent to <math>\mathcal{C}</math>. Sine <math>\triangle OEI'</math> is right, we have that <math>OE^2 + EI'^2 = OI'^2</math>, that is, <math>R^2 - 2Rr + 2rm - r^2 - m^2 + m^2 + 2rm + r^2 = R^2 - 2Rr + r^2</math>, again yielding <math>r = 4m</math>. <br />
<br />
We simply compute the answer the way we did before to arrive at an answer of <math>\boxed{385}</math>. <br />
\end{sol2}<br />
<br />
%%Problem 14<br />
<br />
\setcounter{enumi}{13}<br />
Alex and Mitchell decide to play a game. In this game, there are 2010 pieces of candy on a table, and starting with Alex, the two take turns eating some positive integer number of pieces of candy. Since it is bad manners to eat the last candy, whoever eats the last candy loses. The two decide that the amount of candy a person can pick will be a set equal to the positive divisors of a number less than 2010 that each person picks (individually) from the beginning. For example, if Alex picks 19 and Mitchell picks 20, then on each turn, Alex must eat either 1 or 19 pieces, and Mitchell must eat 1, 2, 4, 5, 10, or 20 pieces. Mitchell knows Alex well enough to determine with certainty that Alex will either be immature and pick 69, or be clich\'ed and pick 42. How many integers can Mitchell pick to guarantee that he will not \emph{lose the game}? (George Xing)<br />
<br />
<br />
%%Solution 14<br />
<br />
We claim that Mitchell has a winning strategy if and only if the number he picks is a multiple of 12. To show that he has a winning strategy whenever the number he picks is a multiple of 5, it is clearly sufficient to show that Mitchell has a winning strategy when Mitchell's number is 12. <br />
<br />
Note that Mitchell has 1, 2, 3, and 4 among his divisors, and that no matter which number Alex chooses, Alex will not have a multiple of 4. Therefore, after Alex's first turn, let Mitchell choose one of his divisors so that the remaining number of pieces of candy on the table is congruent to 1 modulo 4. As Alex cannot decrease the amount of candy by a multiple of 4, he cannot force Mitchell to lose (as Mitchell can only be forced to lose if he is left with 1 piece of candy on the table.) Because Mitchell cannot be forced to lose, Mitchell has a winning strategy. <br />
<br />
We shall now show that if Mitchell does not pick a multiple of 3, then Mitchell cannot guarantee a victory. Alex can pick 42, which have 1, 2, and 3 among its divsiors. Therefore, Alex can play so that he always forces Mitchell to carry out his move when the number of pieces remaining on the table is congruent to 1 modulo 3. As the number of pieces of candy that Mitchell removes cannot be a multiple of 3, Alex will never have to move on a table with the number of pieces on the table congruent to 1 modulo 3. Hence, Alex cannot be forced to lose, so Alex has a winning strategy, and Mitchell does not. <br />
<br />
We shall now show that if Mitchell does not pick a multiple of 4, then he cannot guarentee a victory. Alex can pick 42, which have 1, 2, and 3 among its divisors. On Alex's first turn, he can pick a 1. Thereon, as Mitchell cannot pick a number that is a multiple of 4, Alex can play so that after his move, the number of pieces of candy remaining on the board is congruent to 1 modulo 4. Again, as Mitchell cannot pick a number that is a multiple of 4, Alex will never have to make his move when the number of pieces of candy remaining is congruent to 1 modulo 4, so he can never be forced to lose. Hence, he has a winning stratgecy, and Mitchell does not. <br />
<br />
First, let us consider what happens if Alex picks 69. If Mitchell picks an odd number, then each person can only take odd numbers of candies. This means that on Alex's turn, he will always have an even amount left, so he will always be able to move, whereas Mitchell will always have an odd number left, and eventually be forced to take the last candy. However, if Mitchell picks an even number, then he can take an even amount of candies on his first turn and force Alex to always have an odd amount of candies, forcing him to lose. Therefore, Mitchell must pick an even number.<br />
<br />
With this information, our answer simply becomes the number of multiples of 12 below 2010, which is <math>\left\lfloor \frac{2010}{12} \right\rfloor = \boxed{167}</math>.<br />
<br />
\emph{Remark: }I lost. <br />
<br />
<br />
%%Problem 15<br />
<br />
\setcounter{enumi}{14}<br />
Given that <math>\sum_{a = 1}^{491}\sum_{b = 1}^{491} \frac{1}{(a+bi)^4 - 1}</math> can be expressed in the form <math>\frac{p + qi}{r}</math>, where <math>\gcd(p, q, r) = 1</math> and <math>r > 0</math>, find the unique integer <math>k</math> between 0 and 982 inclusive such that <math>983</math> divides <math>(p + q) - kr</math>. [Note: 983 is a prime.] (Alex Zhu)<br />
<br />
<br />
%%Solution 15<br />
<br />
Let <math>S_1 = S</math>, <math>S_2 = \{iz : z \in S\}</math>, <math>S_3 = \{i^2 z : z \in S\}</math>, <math>S_4 = \{i^3 z : z \in S\}</math>, and let <math>S' = S_1 \cup S_2 \cup S_3 \cup S_4</math>. Note that the following: <br />
<br />
The sets <math>\{z^4 : z \in S_i\}</math>, for <math>1 \leq i \leq 4</math>, are equal (since <math>i^4 = 1</math>.)<br />
<math>\{iz : z \in S'\} = \{z : z \in S'\}</math>, since <math>z \in S'</math> if and only if <math>iz \in S'</math>. <br />
The sets <math>\{z^2 : z \in S_1 \mbox{ or } z \in S_4\}</math> is equal to the set <math>\{z^2 : z \in S_2 \mbox{ or } z \in S_3 \}</math>, since <math>z \in S_1</math> or <math>z \in S_4</math> if and only if <math>-z \in S_2</math> or <math>-z \in S_3</math>. <br />
<math>S_4 = \{\bar{z} : z \in S_1\}</math>. This is because <math>S_4</math> is the set of all complex numbers of the form <math>i(a + bi) = -b + ai</math>, where <math>a</math> and <math>b</math> are integers between 1 and 491 inclusive, which is the same as the set of all complex numbers of the form <math>a - bi</math>, where <math>a</math> and <math>b</math> are integers between 1 and 491 inclusive. The latter set is clearly comprised of exactly the conjugates of the elements of <math>S_1</math>. <br />
<br />
It follows that<br />
<br />
\begin{align*}<br />
\sum_{z \in S} \frac{1}{z^4 - 1} <br />
&= \frac{1}{4} \sum_{z \in S'} \frac{1}{z^4 - 1} \\ <br />
&= \frac{1}{8} \sum_{z \in S'} \left(\frac{1}{z^2 - 1} - \frac{1}{z^2 + 1} \right) \\<br />
&= \frac{1}{8} \left(\sum_{z \in S'} \frac{1}{z^2 - 1} - \sum_{z \in S'} \frac{1}{z^2 + 1} \right) \\<br />
&= \frac{1}{8} \left(\sum_{z \in S'} \frac{1}{z^2 - 1} - \sum_{z \in S'} \frac{1}{(iz)^2 + 1} \right) \\<br />
&= \frac{1}{8} \left(\sum_{z \in S'} \frac{1}{z^2 - 1} - \sum_{z \in S'} \frac{1}{-z^2 + 1}\right) \\<br />
&= \frac{1}{4} \left(\sum_{z \in S'} \frac{1}{z^2 - 1}\right) \\<br />
&= \frac{1}{2} \left(\sum_{z \in S_1 \cup S_4} \frac{1}{z^2 - 1}\right) \\ <br />
&= \sum_{z \in S_1} \frac{\frac{1}{z^2 - 1} + \frac{1}{\bar{z}^2 - 1}}{2} \\<br />
&= \sum_{z \in S_1} \frac{\frac{1}{z^2 - 1} + \overline{\left(\frac{1}{z^2 - 1}\right)}}{2} \\<br />
&= \sum_{z \in S} \mbox{Re } \frac{1}{z^2 - 1} \\<br />
&= \frac{1}{2}\mbox{Re} \left(\sum_{z \in S} \frac{1}{z-1} - \frac{1}{z+1} \right) \\<br />
&= \frac{1}{2} \mbox{Re} \left(\sum_{b=1}^{491} \sum_{a=1}^{491} \frac{1}{(a-1) + bi} - \frac{1}{(a+1) + bi}\right) \\<br />
&= \frac{1}{2} \mbox{Re} \left(\sum_{b=1}^{491} \left(\frac{1}{bi} + \frac{1}{1 + bi} - \frac{1}{491 + bi} - \frac{1}{492 + bi} \right)\right) \\<br />
&= \frac{1}{2} \sum_{b=1}^{491} \left(\mbox{Re} \left(\frac{1}{bi} + \frac{1}{1 + bi} - \frac{1}{491 + bi} - \frac{1}{492 + bi} \right)\right) \\<br />
&= \frac{1}{2} \left(\sum_{b=1}^{491} \left(\frac{1}{1 + b^2} - \frac{491}{491^2 + b^2} - \frac{492}{492^2 + b^2}\right) \right)<br />
\end{align*}<br />
We seek the integer <math>k</math> such that <math>983 | p - qk</math>, that is, we seek the value of <math>\frac{p}{q}</math> modulo 983, that is, the value of <math>pq^{-1}</math> modulo 983. Since the product of a quadratic residue and a quadratic nonresidue is a quadratic nonresidue, and -1 is a quadratic residue mod 983 (as 983 is congruent to 3 modulo 4), it follows that <math>b^2 + 1</math>, <math>b^2 + 492^2</math>, and <math>b^2 + 491^2</math> are never divisible by <math>983</math>, so the denominators of the above sum is never divisible by <math>983</math>. (Alternatively, upon noticing that <math>r \neq 0</math>, the problem statement implies that none of the denominators are divisible by <math>983</math>.) As the above sum that we have arrived at is real, and none of its denominators are divisible of <math>983</math>, we may manipulate the sum modulo 983. <br />
<br />
We note that <math>491 \equiv -492 \pmod{983}</math>, so <math>491^2 \equiv 492^2 \pmod{983}</math>, yielding <math>\frac{491}{491^2 + b^2} + \frac{492}{492^2 + b^2} \equiv \frac{491 + 492}{491^2 + b^2} = \frac{983}{491^2 + b^2} \equiv 0 \pmod{983}</math>. Hence, our sum taken modulo <math>p</math> is just <math>\frac{1}{2} \sum_{a=1}^{491} \frac{1}{1 + b^2}</math> mod <math>p</math>. Let this sum equal <math>T</math>. We have that <br />
\begin{align*}<br />
8T <br />
&\equiv 4\sum_{b=1}^{491} \frac{1}{1 + b^2} \\<br />
&\equiv 2\left(\sum_{b=1}^{491} \frac{1}{1 + b^2} + \sum_{b=1}^{491} \frac{1}{1 + (983 - b)^2}\right) \\<br />
&\equiv 2\left(\sum_{b=1}^{491} \frac{1}{1 + b^2} + \sum_{b=492}^{982} \frac{1}{1+b^2}\right) \\<br />
&\equiv 2 \sum_{b=1}^{982} \frac{1}{1+b^2} \pmod{983}.<br />
\end{align*}<br />
Since <math>\{\frac{1}{1}, \frac{1}{2}, \ldots, \frac{1}{p-1}\}</math> is a permutation of <math>\{1, 2, \ldots, p-1\}</math> modulo <math>p</math>, we have that <br />
\begin{align*}<br />
2 \sum_{b=1}^{982} \frac{1}{1+b^2} <br />
&\equiv \sum_{b=1}^{982} + \sum_{b=1}^{982} \frac{1}{1 + \left(\frac{1}{b}\right)^2} \\<br />
&\equiv \sum_{b=1}^{982} \frac{1}{b^2+1} + \sum_{b=1}^{982} \frac{b^2}{b^2 + 1} \\<br />
&\equiv \sum_{b=1}^{982} 1 \\<br />
&= 982 \pmod{983}. <br />
\end{align*}<math><br />
Hence, <br />
\begin{align*}<br />
T <br />
&\equiv \frac{982}{8} \\<br />
&\equiv \frac{491}{4} \\ <br />
&\equiv \frac{491 + 983}{4} \\<br />
&\equiv \frac{737}{2} \\<br />
&\equiv \frac{737 + 983}{2} \\<br />
&\equiv 860 \pmod{983}<br />
\end{align*}<br />
giving us an answer of </math>\boxed{860}$.</div>
Relay400