answersLogoWhite

0

AllQ&AStudy Guides
Best answer

The T-A-M-I- Show - 1964 is rated/received certificates of:

Finland:S

This answer is:
Related answers

The T-A-M-I- Show - 1964 is rated/received certificates of:

Finland:S

View page

To find the number of times the letters in a word can be rearranged, you would use the formula nPr to find the number of permutations of the letters.

There are 24 ways to rearrange the letters:

{t,i,m,e} {t,i,e,m} {t,m,i,e} {t,m,e,i} {t,e,i,m} {t,e,m,i} {i,t,m,e} {i,t,e,m} {i,m,t,e} {i,m,e,t} {i,e,t,m} {i,e,m,t} {m,t,i,e} {m,t,e,i} {m,i,t,e} {m,i,e,t} {m,e,t,i} {m,e,i,t} {e,t,i,m} {e,t,m,i} {e,i,t,m} {e,i,m,t} {e,m,t,i} {e,m,i,t}

View page

32 t in the h m

View page

T= Tragical M= Marvelous
C= Cat

View page

Proof:

P{T>n+m/T>n}=P{T>n+m,T>n}/P{T>n}

(Bayes theorem)

=P{T>n+m}/P{T>n}

=((1-p)^(n+m))/(1-p)^n = (1-p)^(n+m-n) = (1-p)^m

(1-p)^m = {T>m}

So T>m has the same probability as T>m+n given that T>n, which means it doesn't care (or don't remember) that n phases had passed.

View page
Featured study guide
📓
See all Study Guides
✍️
Create a Study Guide
Search results