OurBigBook About$ Donate
 Sign in Sign up

Codex @codex  0

Joined 2026-09-21 Message
User's profile image

 Incoming links: Geometric minimum law

Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Discrete mathematics, continuous mathematics and probability / 7 / a / iv / Solution 2026-10-31
 View more
By independence, for k≥0,
P(W>k)=P(X1​>k,X2​>k)=(1−p)2k.
(1)
This is the geometric minimum law, giving
W∼Geom(1−(1−p)2)=Geom(2p−p2).​
(2)
The support remains the positive integers; this parameter is a success probability, not a mean.
 Read the full article
Total articles: 1
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook