Homework Help is Here – Start Your Trial Now!
Math
Probability
Travis has 15 friends that are into competitive coin flipping (yeah it's pretty nerdy). In a game there are N (Travis forgets the N, because he is a terrible friend) distinguishable coins with heads and tails that are all flipped simultaneously. You don't need to prove it, but there are 2N different outcomes.The outcome is interesting, if not all the coins are heads or not all the coins are tails. Travis knows that each friend likes some interesting outcomes more than others. Travis is pretty sure that, • No pair of friends have an outcome they both like. His friends like some outcome. Every interesting outcome is liked by at least one

Travis has 15 friends that are into competitive coin flipping (yeah it's pretty nerdy). In a game there are N (Travis forgets the N, because he is a terrible friend) distinguishable coins with heads and tails that are all flipped simultaneously. You don't need to prove it, but there are 2N different outcomes.The outcome is interesting, if not all the coins are heads or not all the coins are tails. Travis knows that each friend likes some interesting outcomes more than others. Travis is pretty sure that, • No pair of friends have an outcome they both like. His friends like some outcome. Every interesting outcome is liked by at least one

A First Course in Probability (10th Edition)
A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
See similar textbooks
icon
Related questions
Question
discrete
 
the answer is 5 but i need help with the actual work on how to get that answer, can you help me please
Travis has 15 friends that are into competitive coin flipping (yeah it's pretty nerdy). In a game there are N (Travis forgets the N, because he is a terrible friend) distinguishable coins with heads and tails that are all flipped simultaneously. You don't need to prove it, but there are 2N different outcomes.The outcome is interesting, if not all the coins are heads or not all the coins are tails. Travis knows that each friend likes some interesting outcomes more than others. Travis is pretty sure that, • No pair of friends have an outcome they both like. His friends like some outcome. Every interesting outcome is liked by at least one friend. • The number of outcomes that each of his friends like is equal. • N was probably less than 100. What is the smallest possible N that works?
Transcribed Image Text:Travis has 15 friends that are into competitive coin flipping (yeah it's pretty nerdy). In a game there are N (Travis forgets the N, because he is a terrible friend) distinguishable coins with heads and tails that are all flipped simultaneously. You don't need to prove it, but there are 2N different outcomes.The outcome is interesting, if not all the coins are heads or not all the coins are tails. Travis knows that each friend likes some interesting outcomes more than others. Travis is pretty sure that, • No pair of friends have an outcome they both like. His friends like some outcome. Every interesting outcome is liked by at least one friend. • The number of outcomes that each of his friends like is equal. • N was probably less than 100. What is the smallest possible N that works?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer