Difference between revisions of "User:Dojo"

(AoPS activity)
(Blanked the page)
Line 1: Line 1:
{| class="wikitable" style="border:1px solid black; background:#CEE0F2;text-align:center;"
 
|-
 
|style="background:#B0C4DE;"|'''[[User:Dojo|Dojo]]'''
 
|-
 
|[[User:Dojo#The_Spinning_Sphere|The Spinning Sphere]] - [[User:Dojo#Trivial_Math_Proofs|Trivial Math Proofs]] - [[User:Dojo#AoPS_activity|AoPS activity]] - [[User:Dojo#Contact|Contact]]
 
|}
 
  
My name is '''Dojo''' and I currently am 14, and live in Washington.
 
 
My interests are math, technology, solving rubiks cubes, cello, piano, composing, track, cross country and tennis, just to name a few.
 
 
==The Spinning Sphere==
 
 
Yes yes,[big voice] I am the creator of the almighty spinning sphere!!! [/end big voice]
 
Yeah well anyway, for anyone interested, I have created a gallery of these spheres:
 
[http://www.artofproblemsolving.com/Forum/album.php?t=234501 My Gallery]
 
(My gallery is now the Animation Studio)
 
 
----
 
==Trivial Math Proofs==
 
 
Suggest your trival proofs you want [http://www.artofproblemsolving.com/Wiki/index.php/User_talk:Dojo here].
 
 
===Equilateral Triangle Area===
 
 
 
Proof that the area of an equilateral triangle with side length <math>s</math> is <math>\dfrac{s^2\sqrt {3}}{4}</math>:
 
 
Let's say that there is an equilateral triangle that has a side length of <math>s</math>. We can then draw the following figure:
 
 
<center>
 
<asy>
 
draw((0,0)--(1,sqrt(3)),linewidth(1));
 
add(pathticks((0,0)--(1,sqrt(3)),1,green+linewidth(1)));
 
draw((2,0)--(1,sqrt(3)),linewidth(1));
 
add(pathticks((2,0)--(1,sqrt(3)),1,green+linewidth(1)));
 
draw((2,0)--(0,0),linewidth(1));
 
add(pathticks((2,0)--(0,0),1,green+linewidth(1)));
 
label("$s$",(1,0),S);
 
</asy>
 
</center>
 
 
Now let's figure out the altitude so we can complete the triangle area forumla of <math>\dfrac{bh}{2}</math>:
 
 
<center>
 
<asy>
 
draw((0,0)--(1,sqrt(3)),linewidth(1));
 
add(pathticks((0,0)--(1,sqrt(3)),1,green+linewidth(1)));
 
draw((2,0)--(1,sqrt(3)),linewidth(1));
 
add(pathticks((2,0)--(1,sqrt(3)),1,green+linewidth(1)));
 
draw((2,0)--(0,0),linewidth(1));
 
add(pathticks((2,0)--(0,0),1,green+linewidth(1)));
 
label("$s$",(1,0),S);
 
draw((1,0)--(1,sqrt(3)),dashed+linewidth(1));
 
</asy>
 
</center>
 
 
We can now use the pythagorean theorem to find the length of the altitude:
 
 
<center>
 
<asy>
 
draw((0,0)--(0,sqrt(3))--(1,0)--cycle,linewidth(1));
 
draw(rightanglemark((0,sqrt(3)),(0,0),(1,0)),red+linewidth(1));
 
</asy>
 
</center>
 
 
Since we know that this is a <math>30 - 60 - 90</math> triangle, we can use proportions to find the altitude <math>a</math> in terms of side lenth <math>s</math>:
 
 
<math>\begin{align*} \dfrac{2}{\sqrt {3}} & = \dfrac{s}{a} \\
 
\sqrt {3}s & = 2a \\
 
\dfrac{\sqrt {3}}{2}s & = a \end{align*}</math>
 
 
Now plugging this altitude into the triangle area forumla gives us:
 
 
<math>\dfrac{\frac {\sqrt {3}}{2}s\times s}{2} = \dfrac{\frac {s^2\sqrt {3}}{2}}{2} = \boxed{\dfrac{s^2\sqrt {3}}{4}}</math>
 
 
Proof can be found on [http://www.artofproblemsolving.com/Forum/weblog_entry.php?t=273429 this] post of my blog.
 
 
===Diagonal Forumla===
 
 
Proof that the number of diagonals in a polygon with <math>n</math> sides is <math>\dfrac{n(n-3)}{2}</math>:
 
 
First, lets see the hexagon:
 
 
<asy>
 
size(200);
 
for(int i=0; i<6; ++i)
 
for(int j=i+1; j<6; ++j)
 
draw(dir(60*i)--dir(60*j));
 
</asy>
 
 
If you count carefully, you'll see that there are 9 diagonals.
 
 
Now we need to see how we can derive a forumla for the number of diagonals.
 
 
For any polygon with <math>n</math> sides, we see that there are <math>n</math> vertecies. To create a diagonal, we need one other point, which can be selected from a pool of <math>n - 3</math> points. We must exclude 3 points because the point connecting to the point itself doesn't count as a diagonal, and connecting to the 2 adjecent points don't count because they have already been "drawn in" as the sides of the polygon. We would then assume that there are <math>n(n - 3)</math> diagonals, right? Wrong. Let's say that two of the points are <math>A</math> and <math>B</math>. Using the above method, both the diagonals <math>AB</math> and <math>BA</math> would be counted. Therefore, we must divide the forumla by 2, giving us the diagonal forumla:
 
 
<math>\boxed{\dfrac{n(n - 3)}{2}}</math>
 
 
Proof can be found on [http://www.artofproblemsolving.com/Forum/weblog_entry.php?t=273655 this] post of my blog.
 
 
===Handshake formula===
 
 
Proof that the number of handshakes occuring in a group of <math>n</math> where each person shakes each other's hand is <math>\dfrac{n(n-1)}{2}</math>.
 
 
This proof is similar to the diagonal proof, with one exception. Each "vertex" is replaced by a person and people can shake hands to adjacent people. Since each person will shake hands with <math>n-1</math> people (Everyone except themselves) and there are <math>n</math> people, we get a doubled <math>n(n-1)</math> handshakes. Once again, we must discount the doubled handshakes occuring between say person A and B. Therefore, we have <math>\boxed{\dfrac{n(n-1)}{2}}</math>.
 
 
Proof can be found on [http://www.artofproblemsolving.com/Forum/weblog_entry.php?t=275015 this] post of my blog.
 
 
==AoPS activity==
 
 
AoPS activity.
 
 
===Forums I moderate===
 
http://www.artofproblemsolving.com/Forum/index.php?f=624
 
 
===Blog===
 
http://www.artofproblemsolving.com/Forum/weblog.php?w=1355
 
 
===Wiki pages I created===
 
[[Asymptote: Drawing|Drawing]]
 
 
[[Asymptote: Drawing part 2|Drawing part 2]]
 
 
[[Asymptote: Labeling|Labeling]]
 
 
[[Asymptote: Marking Angles|Marking Angles]]
 
 
[[Asymptote: Graphing|Graphing]]
 
 
[[Asymptote: Olympiad Package Part 1|Olympiad Package Part 1: Value Setting]]
 
 
[[Asymptote: Example 1|Example 1]]
 
 
=Contact=
 
 
Some ways you can reach me:
 
 
*Email. dojothegreat@gmail.com
 
*[http://www.artofproblemsolving.com/Forum/privmsg.php?mode=post&u=37836 PM]
 
*My [http://www.artofproblemsolving.com/Forum/weblog.php?w=1355 Blog]
 

Revision as of 23:55, 6 September 2010