Goal: naam batao ki kaun sa tool apply hoga aur numbers padho.
Recall Solution 1.1
(a) Ek fair die ka matlab hai ki saatey chhekhne equally likely hain, toh hum count karte hain — yeh classical hai.
(b) Favourable outcomes = S mein 3 ke multiples = {3,6}, toh m=2. Total n=6.
P(A)=nm=62=31.
Recall Solution 1.2
Pin mein koi symmetry nahi hoti — "point-up" aur "point-down" equally likely nahi hain, toh count karne ke liye equal outcomes ka koi n nahi hai. Hume measure karna padega: yeh empirical hai.
P(point-up)≈Nf=200118=0.59.
Recall Solution 1.3
Axiom 1, Non-negativity: P(A)≥0 har event ke liye. Probability kabhi negative nahi ho sakti, toh −0.2 illegal hai. (Yeh No–Sure–Split mein "No" hai.)
Goal: addition aur complement rules mein sahi tarah se plug karo.
Recall Solution 2.1
Saare 52 cards equally likely hain → classical. Overlap F∩D = face cards jo spades bhi hain = {J♠, Q♠, K♠}, toh ∣F∩D∣=3.
P(F)=5212,P(D)=5213,P(F∩D)=523.
Addition rule (double-counted overlap ko subtract karo):
P(F∪D)=5212+5213−523=5222=2611.
Recall Solution 2.2
"At least one head" ke bahut saare cases hain; iska complement "koi head nahi" (sab tails, TTTT) mein exactly ek case hai. Complement rule use karo.
24=16 sequences mein se har ek equally likely hai, aur TTTT unhi mein se ek hai:
P(no head)=161.P(at least one head)=1−161=1615.
Recall Solution 2.3
Ordered pairs outcomes ko equally likely rakhte hain → n=36. Sums ≤4: sum 2: (1,1); sum 3: (1,2),(2,1); sum 4: (1,3),(2,2),(3,1). Matlab m=1+2+3=6.
P(sum≤4)=366=61.
Goal: sahi decomposition chuno, overlaps aur unequal-likelihood handle karo.
Recall Solution 3.1
Overlap ke liye addition rule rearrange karo:
P(A∩B)=P(A)+P(B)−P(A∪B)=0.5+0.4−0.7=0.2.
Ab Ac∩Bc ka matlab hai "na A, na B" =(A∪B)c (De Morgan). Complement rule use karo:
P(Ac∩Bc)=1−P(A∪B)=1−0.7=0.3.
Recall Solution 3.2
m/n kyun nahi? Faces equally likely nahi hain, toh counting fail hoti hai — hum seedha axioms use karte hain.
(a) Normalisation (axiom 2, P(S)=1) aur chhe disjoint singletons par additivity:
c(1+2+3+4+5+6)=1⇒21c=1⇒c=211.(b) Even faces {2,4,6} disjoint hain, toh add karo:
P(even)=c(2+4+6)=2112=74.
Recall Solution 3.3
(a) Empirical: P(H)≈1000620=0.62.(b) Independent events ke liye parent ki Independence of Events deti hai P(H∩H)=P(H)P(H):
P(HH)≈0.62×0.62=0.3844.
"At least one" ka direct counting messy hai; iska complement "kisi bhi roll mein koi six nahi" clean hai, aur rolls independent hain toh probabilities multiply hoti hain.
P(no six on one roll)=65.P(no six in four rolls)=(65)4=1296625.P(at least one six)=1−1296625=1296671≈0.5177.
Recall Solution 4.2
Event "red" ko split karo ki hum kaun sa urn use kar rahe hain (ek disjoint split — Law of Total Probability, Conditional Probability & Bayes' Theorem par based):
P(red)=P(X)P(red∣X)+P(Y)P(red∣Y).
Yahaan P(X)=P(Y)=21, P(red∣X)=53, P(red∣Y)=51:
P(red)=21⋅53+21⋅51=103+101=104=52.
Recall Solution 4.3
Saare committees equally likely hain → classical, aur hum Permutations & Combinations se count karte hain. Total committees:
(310)=120.
Complement "koi woman nahi" = saare 36 mardon mein se:
(36)=20,P(no woman)=12020=61.P(at least one woman)=1−61=65.
Goal: ek general fact prove karo aur degenerate/limiting cases stress-test karo.
Recall Solution 5.1
Exact addition rule se shuru karo (parent mein axioms se derive kiya gaya):
P(A∪B)=P(A)+P(B)−P(A∩B).
Axiom 1 se, P(A∩B)≥0. Ek non-negative number subtract karne se total sirf ghatt sakta hai, toh:
P(A∪B)=P(A)+P(B)−≥0P(A∩B)≤P(A)+P(B).Equality exactly tab hoti hai jab P(A∩B)=0 — khaas taur par jab A aur B disjoint hon (tab axiom 3 seedha addition deta hai). ∎
Recall Solution 5.2
Agar A⊆B hai, toh B ko do disjoint pieces mein split karo: A ke andar wala hissa, aur baaki.
B=A∪(B∩Ac),A∩(B∩Ac)=∅.
Axiom 3 se (disjoint add hote hain):
P(B)=P(A)+P(B∩Ac).
Kyunki P(B∩Ac)≥0 hai (axiom 1), hume milta hai P(B)≥P(A). ∎
(Isliye bade events ki probability kabhi chhoti nahi hoti — ek picture: A ek chhota region hai jo poori tarah B ke andar baitha hai.)
Recall Solution 5.3
(a)A∪Ac=S, toh P(A∪Ac)=P(S)=1 (axiom 2). Hamesha 1, chahe A kuch bhi ho.
(b) Monotonicity se, A∩B⊆B toh P(A∩B)≤P(B). Aur A∩B⊇ ... zyaada precisely: B=(A∩B)∪(Ac∩B) disjoint hai, toh P(B)=P(A∩B)+P(Ac∩B). Ab Ac∩B⊆Ac aur P(Ac)=1−P(A)=0, toh monotonicity se P(Ac∩B)=0. Isliye
P(A∩B)=P(B).(c) Ek continuous space mein ek exact point ke liye, P({0.5})=0. Phir bhi dart wahaan land kar sakta hai — toh yeh genuinely probability 0 wala event hai jo impossible nahi hai. Axioms P=0 ko permit karte hain bina A=∅ ke (parent ki teesri "steel-manned" mistake dekho).
Recall Self-check summary (sab finish karne ke baad reveal karo)