Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

Does anyone have any (hysterical) ridiculously-overblown proofs of simple statements? I'll give an example: \(\sqrt[n]{2}\) is irrational for all \(n>2\in \mathbb{Z}\) Proof: Suppose \(\sqrt[n]{2}=\frac{p}{q}\) for some \(p,q\in \mathbb{Z}\), then \[ 2=\frac{p^n}{q^n} \implies\\ 2q^n=q^n+q^n=p^n \]Contradicting Fermat's Last Theorem. I'd love to see some more of these, haha.

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Join Brainly to access

this expert answer

SEE EXPERT ANSWER

To see the expert answer you'll need to create a free account at Brainly

but for n=2 ?
that needs another complete proof :)
Yeah, of course. Haha, it seems that Fermat's isn't strong enough to prove that...

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

lol
Another interesting proof: There is an infinitude of primes: We begin by stating some large number \(n\) over which there exists no primes. If \(n>1\), there must exist a prime \(p\) such that \(n
thats interesting too...
Haha, it's sort of absolutely ridiculous... I'm trying to come up with these as I finish up some homework... but I'm having a hard time. (Although the first one is from http://rjlipton.wordpress.com/2010/03/31/april-fool/)
I saw another good one for infinite primes but its been a while.
Proof of the Infinity of the Prime Numbers this is simple but i like it http://www.hermetic.ch/pns/proof.htm
thats the one.
A proof that \(\nexists x, y \in \mathbb{Z} \text{ s.t. }x^3+113y^3=1\) http://books.google.com/books?id=YXDYKJvZY0QC&pg=PA111&lpg=PA111&dq=R+Finkelstein+and+H+London,+On+D.+J.+Lewis%27s+equation&source=bl&ots=YiyOhNRaLi&sig=JmtUPqakWZ5Mf4tqab8UMzQ_ecE&hl=en#v=onepage&q=R%20Finkelstein%20and%20H%20London%2C%20On%20D.%20J.%20Lewis%27s%20equation&f=false
Oh, yeah, the Euclidean proof. It's nice, and pretty simple, with some extra lemmas to work from the axioms.
http://www.cut-the-knot.org/pythagoras/index.shtml 97 proofs of pythagoreans theorem!
lol
I just want, as they say, to 'nuke a mosquito'. With absolutely absurd proofs for simple statements.
man diophantine equations is my favorite topic :)
well then look up the proof for 2+2 = 4, its about 500 pgaes long.
Haha, it actually IS. To prove that like \(0\cdot m=0\) takes quite a bit of work, from axioms. Oh, and that \(1 \in \mathbb{N}\), also does...

Not the answer you are looking for?

Search for more explanations.

Ask your own question