KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesFlipping a Coin Until a Head AppearsEngineering · Engineering MathematicsLesson 587/883← PrevNext →
GuidePublished 7 Aug 2026Updated 13 Aug 20267 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIFlipping a Coin Until a Head Appears

KEVOS knowledge first · trusted web sources when needed

Engineering  /  Mathematics  — Probabilistic Algorithms

Flipping a Coin Until a Head Appears

The geometric waiting time, its expectation and tail, and its role as the model for repeat-until-success algorithms.

Page KV-MATH-0359Reading time 3 minReviewed 2026-08-07Author Kevin Jogin

Executive summary

The number of trials until the first success is the simplest non-trivial infinite-support distribution, and it models every repeat-until-success algorithm in this subject.

Its expectation is the reciprocal of the success probability and its tail decays geometrically, which together supply everything an analysis needs.

Learning objectives

  1. Derive the expectation of the geometric distribution.
  2. State the tail bound and use it to set an iteration cap.
  3. Apply the model to a concrete algorithm.

01Expectation

Theorem

Expected waiting time

With independent trials each succeeding with probability p > 0, the expected number of trials until the first success is 1/p.

The cleanest derivation uses the tail-sum formula together with the tail probability.

E[X] = Σ_{k≥0} P(X > k) = Σ_{k≥0} (1−p)^k = 1/p

An alternative derivation conditions on the first trial: either it succeeds, or one trial is spent and the situation resets by memorylessness, giving E = 1 + (1−p)E.

02Tail behaviour

  1. Tail probabilityP(X > k) = (1−p)^kExponential decay in k
  2. Cap at c/p trialsfailure ≤ e^{−c}Using (1−p)^{1/p} ≤ 1/e
  3. Cap at 100/pfailure ≤ e^{−100}Below any practical threshold

The bound (1−p)^{1/p} ≤ 1/e is the exponential inequality again, and it converts an iteration cap expressed as a multiple of the expected count into a clean failure bound.

03Application

Finding a quadratic non-residue modulo a prime is the standard illustration. Exactly half the non-zero residues are non-residues, so a random guess succeeds with probability one half.

Algorithm

Find a quadratic non-residue mod p

Inputodd prime p
Outputa quadratic non-residue modulo p
  1. Draw a uniformly at random from {1, ..., p−1}.
  2. Compute the Legendre symbol of a modulo p.
  3. If the symbol is −1, return a.
  4. Otherwise repeat, up to a fixed cap.
Cost  expected 2 iterations, each O(len(p)²)
Note
No deterministic polynomial-time algorithm for this problem is known unconditionally, which is a striking gap: the randomised version succeeds in two expected tries, while the deterministic question remains open and is resolved only under the generalised Riemann hypothesis.

04Frequently asked questions

Is the expected value ever attained?

Not generally — for p = 1/2 the expectation is 2, which is attainable, but for p = 1/3 the expectation is 3 while the distribution is supported on integers with no particular mass at 3. Expectation is an average, not a typical value.

Why does memorylessness hold?

Because trials are independent, so conditioning on past failures leaves the future distribution unchanged. The geometric distribution is the only discrete distribution with this property.

What if the success probability is unknown?

A lower bound on p suffices to bound the expected count and set a cap. This is the usual situation in prime generation, where the prime number theorem supplies the lower bound.

Related pages

  • Infinite Discrete Probability Distributions
  • Approximating Functions by Random Sampling
  • Generating a Random Number from a Given Interval

Sources and method

Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 158-159.

This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.

Author: Kevin Jogin. Last reviewed 2026-08-07.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Flipping a Coin Until a Head Appears. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Flipping a Coin Until a Head Appears as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—expectation, tail, flipping, coin, until—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Flipping a Coin Until a Head Appears?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about expectation would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • NIST Digital Library of Mathematical Functions — National Institute of Standards and Technology. Used for mathematical notation, numerical methods, asymptotics and special functions. Accessed 2026-08-13.
  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.

Continue learning

Approximating Functions by Random SamplingGuide · Engineering MathematicsNEXT LESSON →Generating a Random Number from a Given IntervalGuide · Engineering MathematicsLanguage Recognition and Complexity ClassesGuide · Engineering MathematicsGenerating a Random PrimeGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®