13Nishant bhaiya.....u dere to explain this to me.....
each packet of certain items contain a coupon which is equally likely to bear the letters a,n,s,h,u if m packets r purchased then how to find the probability that the coupons cannot spell ANSHU, how? hint
-
UP 0 DOWN 0 2 21
21 Answers
13
62sorry dude.. i used recurrsion.. i meant inclusion exclusion..
I have a class now.. will catch you after that :)
That too was very clumsy.. I am not convinced with my own effort on this one... Will give it mroe thought when I have more time :)
13what is recurrsion relation??sir....plz explain a bit...i didn't get it[7]
for m=5 ...probability=5!/55 is n't it???
62I think it should be
5r - 5.4r + 10. 3r - 10 . 2r + 5 - 1
whole divided by 5r
by recurrsion relation... DId it without giving too much tought.. so may be wrong :)
13P of not getting an A, Probability of Not getting a B....
aren't these independent event???[7]
i myself also had the fallacy with m<5[2]
plz do it for us ...bhiyaa
62abhirup are these independent events?
P of not getting an A, Probability of Not getting a B and so on?
I think there is some mistake
Namely if m<5 answer should be zero or undefined....
13probability of getting no A for m times is (4/5)m
so,probability of getting atleast one A is 1-(4/5)m
so probability of getting atleast one A,N,S,H,U is[1-(4/5)m]5
probability that the coupons cannot spell ANSHU is 1-[1-(4/5)m]5
correct me if i am wrong.....
13HINT :
Such type of problems can be easily solved in this manner...
P(coupons cannot spell ANSHU) = 1 - P(coupons can spell ANSHU)
first try to find the probability dat d coupons can form the word (or spell the word) ANSHU...
hope this hint is sufficient...!!! [1]
1see abhirup
the easiest method i can think of is
the total no. of combinations of letters possible are 5m
find out the no of combinations that CAN spell anshu let it be x
then 1- x/5m
shud give the answer
13not exactly sankara...!!!
well, i'm not posting d solution juzz because kishan asked only d hint for solving it... he didn't even visit dis thread after posting the question... if he couldn't solve it further, den i'll post my solution... [1]