WHY normalization: the total mass rule ∑pX=1 is the equation that pins down the unknown c.
c(12+22+32)=c(1+4+9)=14c=1⇒c=141.
So pX(1)=141,pX(2)=144,pX(3)=149.
P(X≥2): add the mass at values 2 and 3:
P(X≥2)=144+149=1413.
Cross-check with the complement: 1−pX(1)=1−141=1413. ✓
Recall Solution L2·Q2
WHY two answers: the bracket type is not decoration — points carry positive mass, so including or excluding an endpoint changes the count.
WHY jumps = mass: by the parent note, pX(xi)=FX(xi)−FX(xi−) — the height of each vertical step is the probability sitting exactly there. Flat pieces mean no mass.
The staircase jumps at x=0,1,2,4:
at 0: 0.2−0=0.2
at 1: 0.5−0.2=0.3
at 2: 0.9−0.5=0.4
at 4: 1−0.9=0.1
So the RV lives on {0,1,2,4} (not3 — F is flat across [2,4), so no mass there) with
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. ✓
The step heights are shown in the recovery figure:
Recall Solution L3·Q2
P(X=2) = jump at 2 = 0.4.
P(1≤X<2): values ≥1 and <2 → just {1}, so =pX(1)=0.3. (Via CDF: FX(2−)−FX(1−)=0.5−0.2=0.3.)
P(X>1) = 1−P(X≤1)=1−FX(1)=1−0.5=0.5. (Values 2 and 4: 0.4+0.1=0.5. ✓)
WHY binomial: independent trials, each Head with the same p=0.6; X counts successes. The number of ways to get exactly k Heads in 3 flips is (k3).
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
Check total: 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
WHY Poisson: it is the standard PMF for "how many independent rare events land in a fixed window," governed by one parameter λ= mean count.
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) Normalization with an infinite tail. The values are countably infinite, so we sum a geometric series:
∑k=1∞c(21)k=c⋅1−1/21/2=c⋅1=c=1.
(Used ∑k=1∞rk=1−rr for ∣r∣<1, here r=21.) So c=1 and pX(k)=(21)k.
(b)P(X≤2)=pX(1)+pX(2)=21+41=43.
(c) By definition P(A∣B)=P(B)P(A∩B).
A={X≤2}, B={X≥2}. Their intersection is exactly {X=2}, so P(A∩B)=pX(2)=41.
Proof. The events {X≤a} and {X>a} are disjoint (no value can be both) and their union is everythingX can do. By the probability axioms (see Probability Axioms), disjoint events that cover Ω have probabilities summing to 1:
P(X≤a)+P(X>a)=1⇒P(X>a)=1−P(X≤a)=1−FX(a).
Apply. Die, uniform on {1,…,6}: FX(4)=64=32, so
P(X>4)=1−32=31.
(Check directly: values 5,6 give 61+61=31. ✓)
Recall One-line summary of the exercise skills
Read/verify a PMF (rules) → sum to a CDF (staircase) → read intervals with correct endpoints → invert jumps to recover mass → build PMFs from named models (Binomial, Poisson, geometric) → prove complement/conditional identities from the axioms.