Question

Question 1.3 (F/CI) You are assigned to communicate with a truly ancient computer. You must do this by telephone by shouting binary digits over the line, in clumps of seven digits. a) How many different seven-digit binary strings are there to shout? b) For each string (of seven digits) that is shouted, how many digits must be a 1? c) For each string (of seven digits) that is shouted, how many digits must match? Question 1.4 (C1) A group of students are each making a single appointment to speak with a Dr. Jekyll one week (only weekdays allowed, M-F). Answer the following questions: a) If there are 14 students, explain why we cannot guarantee that at least 4 of them meet with Dr. J. on the same day 14 b) Even though | 5|-| - [2.8-3, explain why we cannot guarantee that at least 3 of them, meet with Dr. Jekyll on Thursday c) If we guarantee that no matter how they make their appointments, there is a day of the week on which5 students are meeting with Dr. J, at least how many students can you deduce are in the group? Question 1.5 (CI) Everyone has a favorite Teenage Mutant Ninja Turtle (Leonardo, Michelangelo, Raphael and Donatello). How many people need to vote on their favorite to guarantee that at least 20 people all agree on the winner

Answer 1