Difference between revisions of "KGS math club"
(created a page for KGS math club problems & solutions) |
|||
| Line 10: | Line 10: | ||
!Problem | !Problem | ||
!style="background-color:rgb(220,230,255);" | Solutions | !style="background-color:rgb(220,230,255);" | Solutions | ||
| + | |||
| + | |- valign="top" | ||
| + | |20.2.2007 | ||
| + | |style="background-color:rgb(220,230,255);" | StoneTiger | ||
| + | |Does any member of the sequence 1, 4, 20, 80, ... generated by x(n) = 6x(n-1) - 12x(n-2) + 8x(n-3) ever have a factor in common with 2007? | ||
| + | |style="background-color:rgb(220,230,255);" | [[KGS math club/solution_2_1|sigmundur]] | ||
|- valign="top" | |- valign="top" | ||
| Line 16: | Line 22: | ||
|Consider the two player game that begins with an even length ordered sequence of positive integers. Each player, in turn, removes either the first or last of the remaining integers, ending when all the integers have been removed. A player's score is the sum of the integers that they removed; the winner is the player with the higher score (with a tie if equal scores). Show that Player One has a non-losing strategy, i.e., can always force a tie or a win. | |Consider the two player game that begins with an even length ordered sequence of positive integers. Each player, in turn, removes either the first or last of the remaining integers, ending when all the integers have been removed. A player's score is the sum of the integers that they removed; the winner is the player with the higher score (with a tie if equal scores). Show that Player One has a non-losing strategy, i.e., can always force a tie or a win. | ||
|style="background-color:rgb(220,230,255);" | | |style="background-color:rgb(220,230,255);" | | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
<!-- TEMPLATE, COPY-PASTE-FILL-IN: date, author, problem, solver; n = problem number, m = solution number, then click the red link and copypaste the solution, save. There. If anyone can do the wiki table formatting more elegantly, be my guest; after all, this is wikiiii. | <!-- TEMPLATE, COPY-PASTE-FILL-IN: date, author, problem, solver; n = problem number, m = solution number, then click the red link and copypaste the solution, save. There. If anyone can do the wiki table formatting more elegantly, be my guest; after all, this is wikiiii. | ||
Revision as of 21:34, 20 June 2008
A group of people on Kiseido Go Server Mathematics room.
The meaning of this page is to collect the problems posed there and save hints and solution suggestions.
| Date | Author | Problem | Solutions |
|---|---|---|---|
| 20.2.2007 | StoneTiger | Does any member of the sequence 1, 4, 20, 80, ... generated by x(n) = 6x(n-1) - 12x(n-2) + 8x(n-3) ever have a factor in common with 2007? | sigmundur |
| 21.6.2008 | amkach | Consider the two player game that begins with an even length ordered sequence of positive integers. Each player, in turn, removes either the first or last of the remaining integers, ending when all the integers have been removed. A player's score is the sum of the integers that they removed; the winner is the player with the higher score (with a tie if equal scores). Show that Player One has a non-losing strategy, i.e., can always force a tie or a win. |
|
