For example, if he is at (5,0), his only option is to walk left to (4,0); if Pacman is instead at (3,2), he could walk either to (2,2) or (3,1). Prove by induction that no matter how he walks, he will always reach (0,0) in finite time. (Hint: Try starting Pacman at a few small points like (2,1) and looking all the different paths he could take to reach (0,0). Do you notice a pattern?)

Mariah is randomly choosing three books to read from the following: 5 mysteries, 7 biographies, and 8 science fiction novels. which of these statements are true? check all that apply. there are 20c3 possible ways to choose three books to read. there are 5c3 possible ways to choose three mysteries to read. there are 15c3 possible ways to choose three books that are not all mysteries. the probability that mariah will choose 3 mysteries can be expressed as . the probability that mariah will not choose all mysteries can be expressed as 1 −