Determine if different methods are fair or unfair.

Problem

Jake, Daniel, Timmy, Amy, and Pam are going on a fishing trip. They are taking a pick-up truck which only holds 3 people inside the truck. The other 2 people will have to ride in the back of the truck. No one wants to ride in the back.
They decide to let fate determine who has to ride in the back, by using this week's winning lottery ticket, which is about to be announced. The winning lottery ticket is a list of 5 numbers. Each number is a random integer from 1 to 1000.
Match each method for deciding who rides in the back with the correct assessment of its fairness.
(Consider a system to be fair when the probabilities of each event are equal.)
M, e, t, h, o, d, space, 1: If the first number is 1 - 200, Jake and Daniel ride in the back. If the first number is 201 - 400, Daniel and Timmy ride in the back. If the first number is 401 - 600, Timmy and Amy ride in the back. If the first number is 601 - 800, Amy and Pam ride in the back. If the first number is 801 - 1000, Pam and Jake ride in the back.
M, e, t, h, o, d, space, 2: If the first number is even, Jake rides in the back. If the first number is odd, Daniel rides in the back. If the second number is 1 - 333, Timmy rides in the back. If the second number is 334 - 666, Amy rides in the back. If the second number is 667 - 1000, Pam rides in the back.
M, e, t, h, o, d, space, 3: Jake is assigned the number 1. Daniel is assigned the number 250. Timmy is assigned the number 500. Amy is assigned the number 750 . Pam is assigned the number 1000. The 2 people whose numbers are closest to the fourth number read will ride in the back.
Decision-making method
Fairness assessment
  • M, e, t, h, o, d, space, 1
  • M, e, t, h, o, d, space, 2
  • M, e, t, h, o, d, space, 3
  • Not fair - Jake and Pam have the least chance of riding in the back.
  • Not fair - Jake and Daniel have the greatest chance of riding in the back.
  • Fair
Get 3 answers correct in a row