Problem #PRU-100423

Problems Discrete Mathematics Set theory and logic Logic and set theory

Problem

(a) Jimmy is working on a metal model of a grasshopper. He named it Kimmy. The boy keeps on adding new features to his robot. Besides being an accurate alarm clock, Kimmy can jump the distance of one or two cells, depending on how many times Jimmy claps his hands. Do you think the boy can choose a sequence of claps in such a way that the robot will visit all cells of a \(1\times101\) strip exactly once? (The robot is not allowed to leave the strip.)

(b) What if the task is to visit exactly once all cells of a \(1\times99\) strip? (The robot is not allowed to leave the strip.)