User talk:Ddk001
![[asy]draw((0,0)----(0,6));draw((0,-3)----(-3,3));draw((3,0)----(-3,6));draw((6,-6)----(-6,3));draw((6,0)----(-6,0));[/asy]](http://latex.artofproblemsolving.com/d/6/1/d61604256e9de426afc94111a204811ff9d3cf0e.png)
Contents
Problems
Solutions
If you have solved the problems in my user page, put your solution here. We might have a discussion about the solution, like we will on a forum.
Meanwhile, try to do this:
New Problems
If you have a problem to contribute, please put it here. I might add it to my user page. If I have a set of 
good problems, we can consider starting a mock AIME or we can perhaps get the problems into future AIME.
- Note: I am talking mostly of AIME because my problems are all AIME based. If you have AMC or olympiad problems to contribute, you are welcomed to put it here.
Weird expressions
Here is the contest where you try to come up with the with the weirdest expression. Here a record to break:
![\[\frac{(\frac{\sqrt{3223}+\sqrt[23]{9879e}}{293847}+398\pi)^{9812347^{23478^{3^3}}}}{\sqrt[123]{\frac{\sqrt{\sqrt[23e]{3948 \pi}+(\sqrt{\frac{(19203e+\sqrt{\frac{\frac{(\frac{\sqrt[3e]{\frac{\frac{\frac{3}{4}}{\frac{4e}{3}}}{\pi}}}{\sqrt{10101010}}+121\pi)^{23}}{1902\pi e+10} \cdot (\frac{\sqrt[20202023e]{\frac{\frac{\frac{3243234}{4234}}{\frac{1023}{323}}}{23\pi}}}{\sqrt{1230}}+23189\sqrt{2}+29384)^{12}}{192019\sqrt{\frac{232}{2093}}+29384\pi}})^{10}}{1029\sqrt{23}+92483\pi+121212}}+1304987\pi)^{\sin{12394} e}}}{(\sin{(\sqrt{\sqrt{2+\sqrt{2+\sqrt{2+\sqrt{2}}}}+\sqrt{3+\sqrt{3+\sqrt{3+\sqrt{23}}}}})}+\cos{(\sqrt{\sqrt{2+\sqrt{2+\sqrt{2+\sqrt{2}}}}+\sqrt{3+\sqrt{3+\sqrt{3+\sqrt{23}}}}})})^{12e}}+\sqrt{\sqrt{\sqrt{\sqrt{\sqrt{\sqrt{\sqrt{18743691}}}}}}}}}\]](http://latex.artofproblemsolving.com/e/7/8/e78f6baf9dfb3777cd9f4a7390f19d723481e7c4.png)
~Be sure to include the owner of the expression. If you thought of another one, do not delete the existing ones. Simply add the new one.
Talk
Hi! You can say anything here. Please include who is talking. ~Ddk001
Things I think is interesting
The purpose of aops is to "Train today's mind for tomorrow's problems". I will now prove that this is impossible.
Suppose, for the sake of contradiction, that "Train today's mind for tomorrow's problems" is possible. Since we have problems today (Day 1), the base case is taken care of. Now, assume that we have problems on Day 
. Then, since we are training today's mind for tomorrow's problems, there will be problems on the next day, Day 
. Hence, by induction, there will be problems every day. This would imply there is infinitely many problems, a contradiction. Hence, the assumption, "Train today's mind for tomorrows problems", is incorrect.
Tell me if you see any flaws in this proof.
See also
- My user page
