Neeche, q ka matlab hamesha 1−p (failure probability) hai, aur X∼Bin(n,p) ka matlab hai "X ek binomial count hai n trials aur success chance p ke saath".
BINS conditions check karo: Binary, Independent, fixed Number, Same p.
(a) Binomial. Har flip head/tail hai (Binary), flips ek doosre ko influence nahi karte (Independent), exactly 12 flips hain (Number fixed), aur p=0.5 har baar hai (Same p). Toh X∼Bin(12,0.5).
(b) NOT binomial. Card nikalne se deck badal jaati hai, toh p(red) har draw mein shift hoti hai aur draws dependent hain. Yeh without-replacement wala cousin hai → Hypergeometric distribution.
(c) NOT binomial. Trials ki sankhya pehle se fixed nahi hai — aap tab rukते ho jab six aata hai. Yeh ek geometric waiting-time question hai, fixed-n count nahi.
(d) Binomial (approximately). Binary Yes/No hai, essentially constant p aur independence hai kyunki population 30 ke relative bahut badi hai, aur n=30 fixed hai. Toh X∼Bin(30,p).
Recall Solution
n=10 (shots ki fixed sankhya), p=0.8 (har shot par same, independent, made/missed binary hai). Toh X∼Bin(10,0.8), aur X koi bhi integer k=0,1,2,…,10 ho sakta hai.
KYA: exactly k=2 successes in n=6 trials with p=0.4, q=0.6.
KAISE: PMF mein plug karo.
P(X=2)=(26)(0.4)2(0.6)4.(26)=2!4!6!=15 (2 successes rakhne ke tarike). Phir (0.4)2=0.16 aur (0.6)4=0.1296.
P(X=2)=15×0.16×0.1296=0.31104.
Recall Solution
E[X]=np=200×0.05=10 defects on average.
Var(X)=np(1−p)=200×0.05×0.95=9.5.
σ=9.5≈3.082.
Isko samjho: average 10 defects expect karo, usually ±3 ke andar. 25 defects ki batch (25−10)/3.08≈4.9 standard deviations high hai — yeh sach mein alarm ka signal hai.
Recall Solution
"X≤1" ka matlab hai X=0yaX=1; yeh alag alag outcomes hain, toh inki probabilities add karo.
P(X=0)=(04)(0.5)0(0.5)4=161,P(X=1)=(14)(0.5)1(0.5)3=4⋅161=164.P(X≤1)=161+164=165=0.3125.
P(X≥1)=P(1)+P(2)+⋯+P(50) compute karna 50 terms ka kaam hai. Iske bajaye complement use karo:
P(X≥1)=1−P(X=0)=1−(050)(0.02)0(0.98)50=1−(0.98)50.(0.98)50≈0.36417, toh P(X≥1)≈1−0.36417=0.63583.
Complement kyun jeetता hai: "X=0" ek single term (1−p)n hai — ek line se pachaas ki jagah kaam ho jaata hai.
Recall Solution
Range {2,3,4} ko add karna ya remove karna — dono tarike yahan theek hain. Directly:
P(X=2)=(25)(0.6)2(0.4)3=10(0.36)(0.064)=0.2304,P(X=3)=(35)(0.6)3(0.4)2=10(0.216)(0.16)=0.3456,P(X=4)=(45)(0.6)4(0.4)1=5(0.1296)(0.4)=0.2592.
Sum: 0.2304+0.3456+0.2592=0.8352.
Complement se check: bahar ka part hai {0,1,5}: P(0)=0.45=0.01024, P(1)=5(0.6)(0.44)=0.0768, P(5)=0.65=0.07776; total 0.16480, aur 1−0.16480=0.8352 ✓.
Pure system ki failure = saare servers down. Har server q=0.1 probability se down hota hai.
P(all down)=0.1n≤0.0001=10−4.
Base-10 log lo: nlog10(0.1)≤log10(10−4), yaani −n≤−4, toh n≥4.
Sabse chhota integer n=4 hai. Check karo: 0.14=0.0001, jisse P(at least one up)=1−0.0001=0.9999 ✓.
Recall Solution
Maano X∼Bin(8,0.25) = jeetne ki sankhya. Net profit =5X−1(8−X)=6X−8.
Linearity of expectation se, E[profit]=6E[X]−8=6(np)−8=6(8⋅0.25)−8=6(2)−8=4.
Expected net profit =\4.∗∗Matlab:∗∗averageparaapgainkarteho,jopooritarahE[X]=np=2$ wins se driven hai.
Recall Solution
λ=np=500×0.004=2.
Exact:P(X=2)=(2500)(0.004)2(0.996)498.
(2500)=124750, (0.004)2=1.6×10−5, (0.996)498≈0.13629.
P(X=2)≈124750×1.6×10−5×0.13629≈0.27201.
Poisson:P=2!λ2e−λ=24e−2=2e−2≈0.27067.
Dono lagbhag 3 decimals tak agree karte hain — expected hai, kyunki n large hai aur p tiny hai aur np moderate hai. Yahi woh regime hai jahan binomial → Poisson.
Dono PMF values likho aur divide karo — factorials telescope ho jaate hain:
P(k−1)P(k)=(k−1n)pk−1qn−k+1(kn)pkqn−k=(k−1n)(kn)⋅qp.
Ab (k−1n)(kn)=n!/((k−1)!(n−k+1)!)n!/(k!(n−k)!)=k!(n−k)!(k−1)!(n−k+1)!=kn−k+1.
Toh ratio hai kn−k+1⋅qp. ✓
Mode deduce karo: PMF tab badhti hai (P(k)>P(k−1)) jab tak yeh ratio >1 hai:
(n−k+1)p>k(1−p)⟺np+p−kp>k−kp⟺k<(n+1)p.
Toh probabilities k=⌊(n+1)p⌋ tak badhti hain aur uske baad ghatti hain — mode ⌊(n+1)p⌋ hai (aur agar (n+1)p integer hai, toh woh aur (n+1)p−1 dono tie karte hain). Staircase figure dekho.
Recall Solution
n>0 fix karo. f(p)=p(1−p)=p−p2 maximise karo. Complete the square:
p−p2=−(p2−p)=−(p−21)2+41.
Kyunki (p−21)2≥0 hai aur subtract ho raha hai, f(p)≤41 hai, aur equality tab hoti hai jabp=21.
Isliye Var=np(1−p)≤4n, p=21 par maximise hoti hai, aur Varmax=4n hai; aur Var=0 jab p=0 ya p=1 (koi randomness nahi). Parabola figure dekho.
Recall Solution
Conceptual proof (sabse clean).Xm independent trials mein successes count karta hai jahan har trial mein success chance p hai; Y aur n aise trials mein successes count karta hai. Saare m+n trials pool karo: woh independent hain, binary hain, number fixed hai, aur sab samep share karte hain — yeh exactly BINS setup hai Bin(m+n,p) ke liye. Total count X+Y wahi binomial hai. ∎
Consistency checks (inke liye p equal chahiye, aur variance ke liye independence):E[X+Y]=mp+np=(m+n)p✓,Var(X+Y)=mp(1−p)+np(1−p)=(m+n)p(1−p)✓.Caveat: agar dono p alag hote, toh pooling Same p violate karta aur X+Y binomial nahi hota — sum theorem identical p par depend karta hai.