Weblog over wiskunde en computers
Zo wordt stellingen bewijzen wel heel gemakkelijk:
Gevonden via SOH-Dan.
lieven wrote:
Wie “that other proof” kent, kan misschien lachen met devolgende grap:
(Hendrik Lenstra). There are infinitely many composite numbers.
Proof. To obtain a new composite number, multiply together the first n composite numbers and don’t add 1.
Posted 29 Feb 2008 at 1:32 pm ¶
Koen Vervloesem wrote:
Mooi
Posted 29 Feb 2008 at 6:07 pm ¶
Your email is never published nor shared. Required fields are marked *
Name *
Email *
Website
Message
lieven![No Gravatar" onclick="javascript:urchinTracker(](http://www.gravatar.com/avatar/22a1c62aeccb3b278cfabc3e6c97fc64?rating=X&default=http://pub.mybloglog.com/coiserv.php?href="mailto:lieven.lebruyn@ua.ac.be&n=lieven.lebruyn@ua.ac.be)
wrote:
Wie “that other proof” kent, kan misschien lachen met devolgende grap:
(Hendrik Lenstra). There are infinitely many composite numbers.
Proof. To obtain a new composite number, multiply together the
first n composite numbers and don’t add 1.
Posted 29 Feb 2008 at 1:32 pm ¶
Koen Vervloesem![No Gravatar" onclick="javascript:urchinTracker(](http://www.gravatar.com/avatar/8f061296ca33b4003a0bf3452b602676?rating=X&default=http://pub.mybloglog.com/coiserv.php?href="mailto:kvervloesem@gmail.com&n=kvervloesem@gmail.com)
wrote:
Mooi
Posted 29 Feb 2008 at 6:07 pm ¶