 |
Dr. Gary De Young's Website |
Contents
|
Problem Set I
- Formally write up in your journal a solution to the problem discussed in class: N Card in a stack are numbered 1 to N. After an initially randomly shuffle, the card are shuffled in the following way: If the card numbered k is on top then the first k cards are reversed in order and place on the top of the stack. Prove that the card labeled 1 will eventually appear on top.
- The first six terms of a sequence are 0, 1, 2, 3, 4, 5 each subsequent term is the last digit of the sum of the previous six terms. For 0+1+2+3+4+5 = 15 so the 7th term is 5. In this sequence is it possible to have a subsequence of consecutive terms that is 1, 3, 5, 7, 9?
|
