Masaken
Unknown Member
Hugh toasted n different slices of bread: T1, T2, ..., Tn, and he buttered one of the sides for each slice. However, he accidentally dropped all of the slices of toast to the floor.
The different thicknesses of butter resulted in the probability of the kth slice, Tk, landing on its buttered side being equal to (1/2k+1) [2k+1 is the denominator, sorry I don't know how to use latex]
Use mathematical induction to show the probability for n pieces of buttered toast, that an odd number of slices will land on their buttered side is (n/2n+1) [again 2n+1 is the entire denominator]
did the base case and the assumption, but i have no idea how to prove that the probability is true for n = k+1 (P(k+1)), help please, thanks in advance
The different thicknesses of butter resulted in the probability of the kth slice, Tk, landing on its buttered side being equal to (1/2k+1) [2k+1 is the denominator, sorry I don't know how to use latex]
Use mathematical induction to show the probability for n pieces of buttered toast, that an odd number of slices will land on their buttered side is (n/2n+1) [again 2n+1 is the entire denominator]
did the base case and the assumption, but i have no idea how to prove that the probability is true for n = k+1 (P(k+1)), help please, thanks in advance