This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 Problem 5. Find the smallest positive integer with the property that, if you move the ±rst digit to the end, the new number is 1.5 times larger than the old one. Problem 6. Two players A and B alternatively take chips from two piles with a and b chips, respectively. Initially a > b . A move consists of taking from a pile a multiple of the other pile. The winner is the one who takes the last chip in one of the piles. Show that if a > 2 b , then the ±rst player A can force a win. Problem 7. Prove that n ( n + 1) divides 2(1 k + 2 k + · · · + n k ) for odd k . 2...
View
Full
Document
This note was uploaded on 02/06/2011 for the course ECE 423 taught by Professor Dolatabadi during the Spring '11 term at Amirkabir University of Technology.
 Spring '11
 Dolatabadi

Click to edit the document details