Explore >> Select a destination
|
You are here 
|
angelika.me | ||
| | | | |
webrocker.de
|
|
| | | | | It's not a bug, it's the future.... | |
| | | | |
www.jeremykun.com
|
|
| | | | | This is the first in a series of "false proofs." Despite their falsity, they will be part of the Proof Gallery. The reason for putting them there is that often times a false proof gives insight into the nature of the problem domain. We will be careful to choose problems which do so. Problem: Show 1 = 2. "Solution": Let $ a=b \neq 0$. Then $ a^2 = ab$, and $ a^2 - b^2 = ab - b^2$. | |
| | | | |
www.jeremykun.com
|
|
| | | | | Numberphile posted a video today describing a neat trick based on complete sequences: The mathematics here is pretty simple, but I noticed at the end of the video that Dr. Grime was constructing the cards by hand, when really this is a job for a computer program. I thought it would be a nice warmup exercise (and a treat to all of the Numberphile viewers) to write a program to construct the cards for any complete sequence. | |
| | | | |
emilysincerely.wordpress.com
|
|
| | | 1 post published by Sincerely, Emily on July 21, 2012 | ||
