OurBigBook About$ Donate
 Sign in Sign up

Posterior coin count after exactly one head (P(N=n∣H=1)=n(1−r)2rn−1)

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Probability theory Conditional probability Bayes theorem
2026-10-07  0 By others on same topic  0 Discussions Create my own version
Let N have the positive-integer geometric distribution with success parameter p∈(0,1), and conditionally toss N independent coins with head probability θ∈(0,1). Exactly one head has conditional probability nθ(1−θ)n−1. Combining this with the prior by Bayes theorem gives the displayed posterior with r=(1−p)(1−θ); its normalization uses ∑n≥1​nrn−1=(1−r)−2. For p=θ=1/2, the posterior is 9n/4n+1. It is also a shifted negative binomial distribution, with N−1 equal in law to the number of failures before two successes of probability 1−r.

 Ancestors (7)

  1. Bayes theorem
  2. Conditional probability
  3. Probability theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2012 / ia / Paper 2 / 3F / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook