622: Haiku Proof

Explain xkcd: It's 'cause you're dumb.
Revision as of 21:51, 12 June 2014 by KillaBilla (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Haiku Proof
After somewhere around 40 hours, there's no academic reason to go to the class. Only go for the hallucinations.
Title text: After somewhere around 40 hours, there's no academic reason to go to the class. Only go for the hallucinations.

[edit] Explanation

Euclid's theorem states that there are an infinite number of primes, prime numbers being numbers that are only divisible by themselves and 1. The most notable proof of this theorem, and the one presented in this comic, was first given by Euclid himself in his Elements. A more traditional form of this proof follows:

If we suppose that there are a finite number of primes, then they must have a product, i.e. p1p2...pn = q. Now consider q + 1. If this number is prime itself, then we have discovered a new prime number, contrary to the assumption that we had listed them all. If it is not prime, it must have a prime divisor. Since all of the pk are a factor of q, they cannot be a divisor of q + 1. So q + 1 is divisible by a prime not on the list, which again is a contradiction. Therefore, there must be infinitely many primes.

The comic essentially takes this proof and states it in the form of a haiku, which is a traditional form of Japanese poetry which is in Japanese broken up into patterns of morae, a unit that measures the length of sound. A haiku consists of three lines with 5, 7 and 5 morae respectively per line. This is less easy to do in English as English doesn't use the concept of syllable length, so we count haikus according to the syllables in each line.

The comic and title text conclude that going to class while sleep-deprived is an interesting, but entirely noneducational, experience.

[edit] Transcript

[Students are sitting at desks.]
Megan: How do you know there are an infinite number of primes?
Miss Lenhart: I'll answer in haiku!
Miss Lenhart: Top prime's divisors'
[Miss Lenhart floats into the air.]
Miss Lenhart: Product (plus one)'s factors are...?
[Miss Lenhart wafts over the students.]
Miss Lenhart: Q.E.D., bitches!
Cuebal [in thought bubble]: Wow, after the 48-hour sleep-dep mark, lectures get really interesting.
comment.png add a comment! ⋅ Icons-mini-action refresh blue.gif refresh comments!


A prime number must also be a natural number greater that one. ‎ (talk) (please sign your comments with ~~~~)

I removed the paragraph about the haiku being off, as it is not "top prime's divisors," but "top prime's divisors' " (notice the second apostrophe). So the question is actually what the (prime) factors of the product of all prime divisors plus one are. KillaBilla (talk) 21:57, 12 June 2014 (UTC)
Personal tools


It seems you are using noscript, which is stopping our project wonderful ads from working. Explain xkcd uses ads to pay for bandwidth, and we manually approve all our advertisers, and our ads are restricted to unobtrusive images and slow animated GIFs. If you found this site helpful, please consider whitelisting us.

Want to advertise with us, or donate to us with Paypal or Bitcoin?