Daniel Tubbenhauer on Computational Science
I'd never heard the term before!!
This diagram showing the sum of the first n consecutive odd numbers equals the square of n reminds me of an idea I once had about diagrammatic proof. The idea is that you can do diagrammatic proofs from the top down and they can be quite as rigorous as proofs by induction because the diagrams are no longer limited to a finite number of cases. I think it's related to co-induction which Mike Gordon at Cambridge wrote about just before he died. See Corecursion and coinduction: what they are and how they relate to recursion and induction.
Subscribe to Visual Math.
Comments
Post a Comment