Consider a game where there are two piles of chips. On a player's turn, he may remove between 1 and 4 chips from the first pile or else remove...
View the step-by-step solution to:
Question

Consider a game where there are two piles of chips. On a player's turn, he may remove between 1 and 4 chips from

the first pile or else remove between 1 and 5 chips from the second pile. The person who takes the last chip wins. Determine for which m, n ∈ N it is the case that (m, n) ∈ P. 

Top Answer

(n,m) is a win game for 1st... View the full answer

Sign up to view the full answer

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question