12-240/Classnotes for Thursday October 18: Difference between revisions
From Drorbn
Jump to navigationJump to search
No edit summary |
|||
| Line 11: | Line 11: | ||
{{12-240:Dror/Students Divider}} |
{{12-240:Dror/Students Divider}} |
||
== Theorems == |
== Theorems == |
||
1. If G generates, |G| <math>\gre \!\,</math> n and G contains a basic, |G|=n then G is a basic |
|||
== class note == |
== class note == |
||
Revision as of 11:47, 18 October 2012
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Riddle Along
The game of 15 is played as follows. Two players alternate choosing cards numbered between 1 and 9, with repetitions forbidden, so that the game ends at most after 9 moves (or four and a half rounds). The first player to have within her/his cards a set of precisely 3 cards that add up to 15 wins.
Does this game has a winning strategy? What is it? Who wins, the first to move or the second? Why am I asking this question at this particular time?
See also a video and the transcript of that video.
| Dror's notes above / Students' notes below |
Theorems
1. If G generates, |G| Failed to parse (unknown function "\gre"): {\displaystyle \gre \!\,} n and G contains a basic, |G|=n then G is a basic
class note
page1
page2
page3
