Professor Nowotny likes to cook. He cuts his potatoes into thin slices and fries them in a pan. He puts them in and occasionally tosses them. At each toss the potato slices fall independently of each other with probabili the same side and probability 1-p onto the other side. Q1: For n slices, what is the probability that they all fall back onto the same side in a single toss? A p" B 1-p" c n.p Dn (1-P) E (1-p)" [Select] Q2: He has n slices and tosses k times. What is the probability that all slices have both sides fried, i.e. have fallen at least once on the other side? Ak-p" Bn-p C (1-p")k D (1-pk)n E (1-p)nk

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...
icon
Related questions
Question
100%
Professor Nowotny likes to cook. He cuts his potatoes into thin slices and fries them in a pan. He puts them in and occasionally tosses them. At each toss the potato slices fall independently of each other with probability ponto
the same side and probability 1-p onto the other side.
Q1: For n slices, what is the probability that they all fall back onto the same side in a single toss?
A p"
B 1-p"
C n.p
Dn. (1-P)
E (1-p)"
[Select]
Q2: He has n slices and tosses k times. What is the probability that all slices have both sides fried, i.e. have fallen at least once on the other side?
Ak.p"
Bn p
C (1-p") k D (1-pk)n E (1-p)nk
[Select]
Q3: Professor Nowotny has n slices in the pan and would like to have them all fried on both sides with probability > 99%. How many times k does he need to toss at least?
log(1-(0.99)¹/n)
log(p)
A k2
B k>
log((0.99)¹/")
log(p)
log (1-(0.99)¹/n)
log(1-p)
[Select]
log(1-(0.01)")
log(p)
с
D k>
E k
1 log(0.01)
log(p)
Transcribed Image Text:Professor Nowotny likes to cook. He cuts his potatoes into thin slices and fries them in a pan. He puts them in and occasionally tosses them. At each toss the potato slices fall independently of each other with probability ponto the same side and probability 1-p onto the other side. Q1: For n slices, what is the probability that they all fall back onto the same side in a single toss? A p" B 1-p" C n.p Dn. (1-P) E (1-p)" [Select] Q2: He has n slices and tosses k times. What is the probability that all slices have both sides fried, i.e. have fallen at least once on the other side? Ak.p" Bn p C (1-p") k D (1-pk)n E (1-p)nk [Select] Q3: Professor Nowotny has n slices in the pan and would like to have them all fried on both sides with probability > 99%. How many times k does he need to toss at least? log(1-(0.99)¹/n) log(p) A k2 B k> log((0.99)¹/") log(p) log (1-(0.99)¹/n) log(1-p) [Select] log(1-(0.01)") log(p) с D k> E k 1 log(0.01) log(p)
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
Recommended textbooks for you
A First Course in Probability (10th Edition)
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
A First Course in Probability
A First Course in Probability
Probability
ISBN:
9780321794772
Author:
Sheldon Ross
Publisher:
PEARSON