MathYouLike MathYouLike
  • Toggle menubar
  • Toggle fullscreen
  • Toggle Search
  •    Sign up
  • QUESTIONS
  • TAGS
  • USERS
  • BADGES
  • ASK A QUESTION
  • BLOG
  • Profile
  • Activity
  • Summary
  • Answers
  • questions
Answers ( 1 )
  • See question detail

    let go backward!

    also ,u can watch this :https://www.youtube.com/watch?v=Mc6VA7Q1vXQ

    we will call the captian A and other B,C,D,E.

    if there only 2 pirate left,the captain(D) will take all the coin .E couldnt help because she only have 1 vote.

    if there are 3 pirate left,the captain (C) will take 99 coin and give E 1 coin. E will accept the plan (because if she dont,she wont have any coin).So,C and E will accept,and D wont

    If there are 4 pirate left,the captain(B) will take 99 coin and give D a coin.D will accept because if he dont,he have nothing.So B and D will accept and E and C wont.

    Now back to our problem!

    There are 5 pirate left. If B be the captian,E and C wont have any coin.So let give them a coin!We will take 98 coin and then E and C each have a coin.That way A ,E,C will vote for us and B and D wont.

    That is the best(?) way to get at much coin at posable

    Sorry if my English is wrong .

© HCEM 10.1.29.240
Crafted with by HCEM