Difference between revisions of "User:Aopspandy"
(→Bogus Proofs) |
|||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | Aopspandy is an AoPS user that likes doing math and creates bogus proofs. | + | Aopspandy is an AoPS user that likes doing math and creates bogus proofs. Aopspandy is also a user on https://scratch.mit.edu, called hi0301. If you want to see my profile, go to https://scratch.mit.edu/users/hi0301. |
==Bogus Proofs== | ==Bogus Proofs== | ||
− | Bogus Proof | + | <b><u>Bogus Proof 1:</b></u><br> <math>0</math> can be written as <math>0 = 0 + 0 + 0 + 0 + ...</math>, and since <math>1 - 1 = 0</math>, <math>0 = ( 1 - 1 ) + ( 1 - 1 ) + ( 1 - 1 )...</math> because of the first statement I said. Now, we can change this to <math>1 + (-1 + 1) + (-1 + 1) + (-1 + 1)...</math>, and because <math> -1 + 1</math> is <math>0</math>, <math>0 = 1 + 0 + 0 + 0...</math>, which means <math> 0 = 1 </math>. <br> |
+ | <b><u>Bogus Proof 2:</b></u><br>Using the result of our first bogus proof (<math>1=0</math>), we can add <math>1</math> to both sides to get <math> 1 = 2 </math>, and now we can add <math>1</math> to both sides of our second equation to get <math>2 = 3</math>, and we can repeat this process infinitely to get that all the integers are equal. Now you don't have to worry about calculation errors, because every integer is the same! :D | ||
+ | ==Random Statements that are actually true== | ||
+ | <li>Every odd integer has an <b>e</b> in it</li> | ||
+ | <li>You can't say "m" perfectly without closing your lips</li> |
Latest revision as of 23:13, 8 September 2021
Aopspandy is an AoPS user that likes doing math and creates bogus proofs. Aopspandy is also a user on https://scratch.mit.edu, called hi0301. If you want to see my profile, go to https://scratch.mit.edu/users/hi0301.
Bogus Proofs
Bogus Proof 1:
can be written as
, and since
,
because of the first statement I said. Now, we can change this to
, and because
is
,
, which means
.
Bogus Proof 2:
Using the result of our first bogus proof (), we can add
to both sides to get
, and now we can add
to both sides of our second equation to get
, and we can repeat this process infinitely to get that all the integers are equal. Now you don't have to worry about calculation errors, because every integer is the same! :D