Goal: decide karo ki events mutually exclusive hain ya nahi, aur simple probabilities read off karo.
Recall Solution
Kya dono ek saath ho sakte hain? Ek roll mein ek hi face aata hai; woh ek saath 3aur6 nahi ho sakta. Toh A∩B=∅ — yeh mutually exclusive hain.
P(A)=61, P(B)=61. Koi overlap nahi, toh:
P(A∪B)=61+61=62=31.
Recall Solution
Kya dono ek saath ho sakte hain? Haan — King of Hearts ek heart bhi hai aur King bhi. Toh A∩B={King of Hearts}=∅.
Isliye A aur Bmutually exclusive nahi hain. (Inhe combine karne ke liye general rule lagana padega, P(A∩B)=521 subtract karke.)
Goal: union compute karne ke liye addition rule (sahi wala) use karo.
Recall Solution
Yeh teen alag faces hain, jinmein se koi bhi do ek saath nahi aa sakte — pairwise mutually exclusive. Pairwise exclusive events ke liye bas add karo:
P=61+61+61=63=21.
Recall Solution
Kya dono ho sakte hain? Haan — Ace of Spades. Exclusive nahi, toh general rule use karo.
P(Ace)=524, P(Spade)=5213, overlap P(Ace∩Spade)=521.
P=524+5213−521=5216=134.
Count karke check karo: 4 Aces + 13 Spades − 1 double-counted (Ace of Spades) = 16 favourable cards. ✓
Recall Solution
Colours exclusive hain (ek ball exactly ek colour ki hoti hai), toh add karo:
P(red∪green)=0.4+0.25=0.65.
"Not blue" ke liye complement rule use karo P(A′)=1−P(A):
P(not blue)=1−0.35=0.65.
(Same number — kyunki "not blue" yahan "red or green" hi hai, kyunki teen colours exhaustive hain.)
Goal: di gayi probabilities se ulta sochna; consistency test karna.
Recall Solution
Overlap nikalne ke liye general rule ko rearrange karo:
P(A∩B)=P(A)+P(B)−P(A∪B)=0.45+0.35−0.8=0.
Overlap 0 hai, toh A∩B=∅ — yeh mutually exclusive hain. (Jab P(A) aur P(B) ko seedha add karne par exactly P(A∪B) aaye, toh subtract karne ke liye kuch tha hi nahi.)
Recall Solution
P(A∩B)=0.5+0.4−0.7=0.2.
Overlap 0.2=0 hai, toh yeh mutually exclusive nahi hain — yeh 20% probability share karte hain.
Recall Solution
Agar yeh exclusive hote, toh P(A∪B)=0.55+0.6=1.15>1 — yeh impossible hai, kyunki probability 1 se zyada nahi ho sakti. Toh yeh mutually exclusive nahi ho sakte.
Union zyada se zyada 1 ho sakta hai, toh P(A∩B)=P(A)+P(B)−P(A∪B) se overlap tab sabse chhota hoga jab P(A∪B) sabse bada (=1) ho:
P(A∩B)min=0.55+0.6−1=0.15.
Goal: addition rule ko complements ke saath combine karo, aur ise independence/multiplication se alag karo.
Recall Solution
Maano F = football, C = cricket. Diya gaya P(F)=0.4, P(C)=0.3, P(F∩C)=0.1.
(a) At least one = union. General rule (yeh overlap karte hain!):
P(F∪C)=0.4+0.3−0.1=0.6.(b) "Neither" "at least one" ka complement hai:
P(neither)=1−P(F∪C)=1−0.6=0.4.(c) "Football only" = football minus shared part:
P(F only)=P(F)−P(F∩C)=0.4−0.1=0.3.
Recall Solution
Independent ka matlab hai "A tumhe B ke baare mein kuch nahi batata", jo multiplication rule se intersection fix karta hai:
P(A∩B)=P(A)P(B)=0.5×0.4=0.2.
Phir general addition rule deta hai:
P(A∪B)=0.5+0.4−0.2=0.7.Mutually exclusive hone par P(A∩B)=0 force hota, toh:
P(A∪B)=0.5+0.4=0.9.
Alag answers — kyunki independence aur exclusivity overlap par alag constraints hain (ek ise P(A)P(B) banata hai, doosra ise 0 banata hai).