anonymous
  • anonymous
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
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
but for n=2 ?
anonymous
  • anonymous
that needs another complete proof :)
anonymous
  • anonymous
Yeah, of course. Haha, it seems that Fermat's isn't strong enough to prove that...

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
lol
anonymous
  • anonymous
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
anonymous
  • anonymous
thats interesting too...
anonymous
  • anonymous
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/)
zzr0ck3r
  • zzr0ck3r
I saw another good one for infinite primes but its been a while.
anonymous
  • anonymous
Proof of the Infinity of the Prime Numbers this is simple but i like it http://www.hermetic.ch/pns/proof.htm
zzr0ck3r
  • zzr0ck3r
thats the one.
anonymous
  • anonymous
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
anonymous
  • anonymous
Oh, yeah, the Euclidean proof. It's nice, and pretty simple, with some extra lemmas to work from the axioms.
zzr0ck3r
  • zzr0ck3r
http://www.cut-the-knot.org/pythagoras/index.shtml 97 proofs of pythagoreans theorem!
zzr0ck3r
  • zzr0ck3r
lol
anonymous
  • anonymous
I just want, as they say, to 'nuke a mosquito'. With absolutely absurd proofs for simple statements.
anonymous
  • anonymous
man diophantine equations is my favorite topic :)
zzr0ck3r
  • zzr0ck3r
well then look up the proof for 2+2 = 4, its about 500 pgaes long.
anonymous
  • anonymous
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...

Looking for something else?

Not the answer you are looking for? Search for more explanations.