KYUN normalization: total mass rule ∑pX=1 woh equation hai jo unknown c ko pin down karti hai.
c(12+22+32)=c(1+4+9)=14c=1⇒c=141.
Toh pX(1)=141,pX(2)=144,pX(3)=149.
P(X≥2): values 2 aur 3 ka mass add karo:
P(X≥2)=144+149=1413.
Complement se cross-check: 1−pX(1)=1−141=1413. ✓
Recall Solution L2·Q2
KYUN do answers: bracket type decoration nahi hai — points positive mass carry karte hain, toh endpoint include ya exclude karna count change karta hai.
P(2<X≤5)2 ko exclude karta hai, 5 ko include karta hai → values {3,4,5}:
FX(5)−FX(2)=65−62=63=21.
P(2≤X≤5)2 ko include karta hai → values {2,3,4,5}:
FX(5)−FX(2−)=FX(5)−FX(1)=65−61=64=32.
Extra 61 exactly pX(2) hai, woh mass jo humne rakhna choose kiya.
KYUN jumps = mass: parent note ke according, pX(xi)=FX(xi)−FX(xi−) — har vertical step ki height exactly wahan baithne wali probability hai. Flat pieces ka matlab koi mass nahi.
Staircase x=0,1,2,4 par jump karti hai:
0 par: 0.2−0=0.2
1 par: 0.5−0.2=0.3
2 par: 0.9−0.5=0.4
4 par: 1−0.9=0.1
Toh RV {0,1,2,4} par live karta hai (nahi3 par — F puri [2,4) mein flat hai, toh wahan koi mass nahi) aur
pX(0)=0.2,pX(1)=0.3,pX(2)=0.4,pX(4)=0.1.
Sanity check: 0.2+0.3+0.4+0.1=1. ✓
KYUN binomial: independent trials, har Head same p=0.6 ke saath; X successes count karta hai. 3 flips mein exactly k Heads paane ke tarike (k3) hain.
pX(k)=(k3)(0.6)k(0.4)3−k.
pX(0)=(03)(0.6)0(0.4)3=1⋅1⋅0.064=0.064
pX(1)=(13)(0.6)1(0.4)2=3⋅0.6⋅0.16=0.288
pX(2)=(23)(0.6)2(0.4)1=3⋅0.36⋅0.4=0.432
pX(3)=(33)(0.6)3(0.4)0=1⋅0.216⋅1=0.216
Total check: 0.064+0.288+0.432+0.216=1.000. ✓
FX(1)=pX(0)+pX(1)=0.064+0.288=0.352.
Recall Solution L4·Q2
KYUN Poisson: yeh "kitne independent rare events ek fixed window mein land karte hain" ke liye standard PMF hai, jo ek parameter λ= mean count se governed hai.
P(X≤2)=pX(0)+pX(1)+pX(2)=e−2(0!20+1!21+2!22)=e−2(1+2+2)=5e−2.
Numerically 5e−2≈5×0.13534=0.6767.
(a) Infinite tail ke saath Normalization. Values countably infinite hain, toh hum ek geometric series sum karte hain:
∑k=1∞c(21)k=c⋅1−1/21/2=c⋅1=c=1.
(∑k=1∞rk=1−rr for ∣r∣<1 use kiya, yahan r=21.) Toh c=1 aur pX(k)=(21)k.
Proof. Events {X≤a} aur {X>a}disjoint hain (koi value dono nahi ho sakti) aur unka union sab kuch hai jo X kar sakta hai. Probability axioms se (dekho Probability Axioms), disjoint events jo Ω cover karte hain unki probabilities 1 sum karti hain:
P(X≤a)+P(X>a)=1⇒P(X>a)=1−P(X≤a)=1−FX(a).
Apply. Die, {1,…,6} par uniform: FX(4)=64=32, toh
P(X>4)=1−32=31.
(Directly check karo: values 5,6 dete hain 61+61=31. ✓)
Recall Exercise skills ka one-line summary
PMF read/verify karo (rules) → CDF tak sum karo (staircase) → correct endpoints ke saath intervals read karo → mass recover karne ke liye jumps invert karo → named models se PMFs banao (Binomial, Poisson, geometric) → axioms se complement/conditional identities prove karo.