You may also be interested in the printable (PDF) format or the LaTeX source code.
This problem is a variation of the famous Tower of Hanoi problem. If you don't know the original problem and its solution, check out:
http://mathforum.org/library/drmath/view/55956.html.
Suppose now that the three pegs are arranged in order --- A, B, and C --- and on a single move you can only move rings between A and B or between B and C. A ring can move from A to C or vice versa only in two moves (and then only provided that there isn't a smaller ring on B).
Consider the following two-player game. Starting with the number 0, players take turns adding to the current sum; on your turn, you can add either 4 or 7. If on your turn you can make the new sum end in two zeros (i.e., if your turn leaves a multiple of 100), you win.
Assuming best play, is there a winning strategy for either player, or will the game go on indefinitely? If there is a winning strategy, should you move first or second, and how do you play from there?
Suppose r and s are positive integers. Let F be a function from the set of all positive integers {1,2,3,…} to itself with the following properties:
Let a_{n} be the number of strings of length n that can be formed from the symbols X and O, with the restriction that a string may not consist entirely of multiple copies of one string of shorter length. For example, for n = 4, the string XXOX is allowed, while the strings XXXX and XOXO are not allowed. It is not hard to check that a_{4} = 12.
Here is a table showing a_{n} and approximate values of the ratio a_{n+1} / a_{n} for different values of n.
n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
a_{n} | 2 | 2 | 6 | 12 | 30 | 54 | 126 | 240 |
a_{n+1} / a_{n} | 1 | 3 | 2 | 2.5 | 1.8 | 2.333 | 1.905 | 2.1 |
The table suggests two conjectures:
Prove or disprove each of these conjectures.
For 0 ≤ x ≤ 1, let T(x) = x if x ≤ ½, and T(x) = 1 − x if x ≥ ½. In other words, T(x) is the distance from x to the nearest integer. Let:
Does there exist a value of x (still between 0 and 1) such that f(x) = 2010? Find all such values or show that none exist.
For what values of M and N can an M × N chessboard be covered by an equal number of horizontal and vertical dominoes? (A domino always covers two adjacent squares on the board.)
If we tile the plane with black and white squares in a regular checkerboard pattern, then every square has an equal number (four) of black and white neighbors. (Two squares are considered neighbors if they are not the same but have at least one common point; squares that touch just at a vertex count as neighbors.) But if we try the analogous pattern of cubes in 3-dimensional space, it no longer works this way.
Problems 2, 3, 5, 6, and 8 copyright Mark Krusemeyer.