MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping
Menu
Grade: 12
        a dice is thrown (2n+1) times.the probability of getting 1,3 or 4 at most n times is:
10 years ago

Answers : (4)

askiitian expert akshay singh
8 Points
							

p=probabilty of getiing 1/3/4 in one throw

q=1-p

P( getting 1,3 or 4 at most n times)=P(0 times) +P(1 time)....P(n times)

=2n+1C0*p0*q2n+1-0

+ 2n+1C1*p1*q2n+1-1
+2n+1C2*p2*q2n+1-2

.....+

2n+1Cn*pn*q2n+1-n

Since, p=q=0.5,

so above = 0.52n+1*[2n+1C0+2n+1C1...2n+1Cn]

= 0.52n+1*[0.5*[2n+1C0+2n+1C1...2n+1C2n+1]]

= 0.52n+1*[0.5*22n+1]

=0.5

 

10 years ago
varsha jayant karandikar
18 Points
							pls explain  clearly d second last step of ur solution. i got struck at that step only

						
10 years ago
mohit yadav
24 Points
							

hi varsha,

u have a basic method given by akshay sir u can also do dis question in an objective exam by putting n=0 so d question bcomes throwing d die 1 time and we wanna get d probability of getting no 1,3or4 so probability=3/6=0.5 or do by taking n=1 but for subjective do by sir's method

10 years ago
askiitian expert akshay singh
8 Points
							

hi varsha ,

  the last step was 0.52n+1*[0.5*22n+1].........now ,  0.52n+1 =(1/2)2n+1  so 22n+1 within then bracket cancels out with (1/2)2n+1 outside the bracket ,so the answer is 0.5.

10 years ago
Think You Can Provide A Better Answer ?
Answer & Earn Cool Goodies


Course Features

  • 731 Video Lectures
  • Revision Notes
  • Previous Year Papers
  • Mind Map
  • Study Planner
  • NCERT Solutions
  • Discussion Forum
  • Test paper with Video Solution


Course Features

  • 101 Video Lectures
  • Revision Notes
  • Test paper with Video Solution
  • Mind Map
  • Study Planner
  • NCERT Solutions
  • Discussion Forum
  • Previous Year Exam Questions


Ask Experts

Have any Question? Ask Experts

Post Question

 
 
Answer ‘n’ Earn
Attractive Gift
Vouchers
To Win!!! Click Here for details