Re: [math-fun] Chocolate bar puzzle
27 Feb
2009
27 Feb
'09
2:50 p.m.
Or restated clearly, that the sum of a pair of primes that differ by 2 and are no smaller than 5, 7 is divisible by 12. << Or slightly restated, that the sum of a prime pair no smaller than 5,7 is divisible by 12. On Fri, Feb 27, 2009 at 12:56 PM, Stephen Gray <stevebg@roadrunner.com> wrote:
Try giving the following trivial problem to engineers or other fairly math-savvy people who have no exposure to number-theory thinking.
Show that the number between a prime pair no smaller than 5,7 is divisible by 6 .
_____________________________________________________________________ "It don't mean a thing if it ain't got that certain je ne sais quoi." --Peter Schickele
6111
Age (days ago)
6111
Last active (days ago)
0 comments
1 participants
participants (1)
-
Dan Asimov