liveBook · Manning

Odds

As explained in Timeless Algorithms, The Foundational Ideas

Odds are the ratio of the number or probability of favorable outcomes to the number or probability of unfavorable outcomes.

Odds compare favorable outcomes with unfavorable ones; probability compares an event with all possible outcomes. For an event A, odds in favor are P(A) divided by the probability of its complement. section 2.1 section 2.3.3

Odds(A)= P(A)1-P(A)

The complement rule gives the denominator: the probability that A does not occur. section 2.3.3

Drawing an ace

A standard 52-card deck has 4 aces and 48 non-aces, so the odds of drawing an ace are 4 to 48, or 1 to 12. section 2.1

In Bayesian inference, odds compare competing possibilities and can be updated as evidence arrives. Each observation updates existing odds through a likelihood ratio, allowing evidence to accumulate. section 2.3.3

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines odds using event and complement probabilities, then describes likelihood-ratio updates without deriving them.
Examples
Uses an ace draw to distinguish odds from probability and repeated confirmations to illustrate changing odds.
What you can do after
Evaluate evidence by updating existing odds through likelihood ratios as observations accumulate.
How it connects
Connects odds to probability, complements, Bayesian inference, and likelihood ratios.

Also explained in

Compare how 5 books explain odds →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.