ᱤᱛᱤᱦᱟᱹᱥ ᱟᱨ ᱞᱟᱠᱪᱟᱨ · ᱤᱛᱤᱦᱟᱹᱥ · 9 ᱢᱤᱱᱤᱴ

ᱨᱩᱞᱮᱴ ᱥᱤᱥᱴᱮᱢ ᱨᱮᱭᱟᱜ ᱤᱛᱤᱦᱟᱹᱥ

ᱵᱟᱨ ᱥᱟᱭ ᱥᱮᱨᱢᱟ ᱦᱚᱲ ᱠᱚ ᱟᱡᱟᱜ ᱵᱟᱡᱤ ᱴᱟᱠᱟ ᱵᱚᱫᱚᱞ ᱨᱮᱭᱟᱜ ᱱᱤᱭᱚᱢ ᱠᱚ ᱚᱞ ᱮᱫᱟ᱾

ᱠᱷᱟᱴᱚ ᱛᱮᱞᱟ

ᱢᱟᱨᱴᱤᱝᱜᱮᱞ ᱫᱚ 18 ᱥᱟᱭ ᱥᱮᱨᱢᱟ ᱨᱮᱭᱟᱜ ᱠᱟᱱᱟ; ᱫᱟᱞᱟᱸᱵᱮᱨ ᱫᱚ ᱢᱤᱫ ᱜᱚᱱᱤᱛ ᱵᱤᱫᱽ ᱧᱩᱛᱩᱢ ᱛᱮ ᱠᱟᱱᱟ ᱡᱟᱦᱟᱸᱭ ᱱᱚᱶᱟ ᱵᱟᱭ ᱠᱩᱥᱤᱭᱟᱜ ᱛᱟᱦᱮᱸᱫ; ᱞᱟᱵᱩᱥᱮᱨ ᱫᱚ ᱵᱷᱤᱠᱴᱳᱨᱤᱭᱟᱱ ᱚᱠᱛᱚ ᱨᱮᱭᱟᱜ ᱢᱤᱫ ᱨᱟᱡᱽᱱᱤᱛᱤ ᱦᱚᱲ ᱨᱮᱭᱟᱜ ᱥᱟᱹᱠ ᱠᱟᱱᱟ᱾ ᱚᱱᱟ ᱚᱠᱛᱚ ᱦᱚᱸ ᱱᱚᱶᱟ ᱠᱚ ᱢᱤᱫᱴᱟᱝ ᱦᱚᱸ ᱵᱟᱝ ᱠᱟᱹᱢᱤ ᱞᱮᱫᱟ᱾

ᱢᱟᱨᱴᱤᱝᱜᱮᱞ
1762
ᱫᱟᱞᱟᱸᱵᱮᱨ
1717–1783 ᱛᱟᱭᱚᱢ
ᱞᱟᱵᱩᱥᱮᱨ
19 ᱥᱟᱭ ᱥᱮᱨᱢᱟ, ᱤᱝᱞᱮᱱᱰ
ᱯᱟᱦᱤᱞ ᱠᱚᱢᱯᱭᱩᱴᱟᱨ ᱯᱚᱨᱚᱠᱷ
1950 ᱫᱚᱥᱚᱠ

ᱢᱟᱨᱴᱤᱝᱜᱮᱞ

The 1762 Académie française dictionary records martingaleᱥᱴᱨᱮᱴᱮᱡᱤᱢᱟᱨᱴᱤᱝᱜᱮᱞᱡᱚᱛᱚ ᱦᱟᱨᱟᱣ ᱛᱟᱭᱚᱢ ᱵᱟᱡᱤ ᱰᱚᱵᱚᱞ ᱯᱨᱚᱜᱽᱨᱮᱥᱚᱱ᱾ ᱱᱚᱶᱟ ᱪᱮᱫ ᱮ ᱠᱟᱹᱢᱤᱭᱟ ᱟᱨ ᱪᱮᱫ ᱵᱟᱭ ᱠᱟᱹᱢᱤᱭᱟ, ᱚᱱᱟ ᱥᱴᱨᱮᱴᱮᱡᱤ ᱦᱟᱹᱴᱤᱧ ᱨᱮ ᱧᱮᱞ ᱯᱮ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ → as a gambling term for staking what has been lost. Its 1878 edition explicitly describes doubling after a loss and also uses the word more broadly for betting schemes. These entries document usage; they do not identify a single inventor.

Today the familiar doubling progressionᱥᱴᱨᱮᱴᱮᱡᱤᱯᱨᱚᱜᱽᱨᱮᱥᱚᱱᱢᱟᱨᱮ ᱨᱮᱡᱟᱞᱴ ᱞᱮᱠᱟ ᱛᱮ ᱵᱟᱡᱤ ᱴᱟᱠᱟ ᱵᱚᱫᱚᱞ ᱡᱟᱦᱟᱸᱱ ᱱᱤᱭᱚᱢ᱾ ᱱᱮᱜᱮᱴᱤᱵᱷ ᱯᱨᱚᱜᱽᱨᱮᱥᱚᱱ ᱦᱟᱨᱟᱣ ᱛᱟᱭᱚᱢ ᱵᱟᱲᱦᱟᱣᱟ, ᱯᱚᱡᱤᱴᱤᱵᱷ ᱡᱤᱛ ᱛᱟᱭᱚᱢ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ → aims to recover previous losses and gain one starting unitᱴᱟᱠᱟᱭᱩᱱᱤᱴᱢᱤᱫ ᱥᱤᱥᱴᱮᱢ ᱟᱨᱵᱟᱝ ᱠᱷᱮᱞᱚᱸᱰ ᱵᱮᱵᱷᱟᱨ ᱵᱮᱥ ᱵᱟᱡᱤ ᱴᱟᱠᱟ᱾ ᱯᱨᱚᱜᱽᱨᱮᱥᱚᱱ ᱠᱚ ᱭᱩᱱᱤᱴ ᱛᱮ ᱵᱩᱡᱷᱟᱹᱣᱚᱜ-ᱟ ᱡᱮᱢᱚᱱ ᱡᱟᱦᱟᱸᱱ ᱴᱮᱵᱩᱞ ᱨᱮ ᱞᱟᱹᱜᱩ ᱦᱩᱭᱩᱜ-ᱟ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ → when a win arrives. A finite bankrollᱴᱟᱠᱟᱠᱷᱮᱞ ᱯᱩᱸᱡᱤᱠᱷᱮᱞ ᱞᱟᱹᱜᱤᱫ ᱟᱞᱟᱜ ᱫᱚᱦᱚ ᱟᱠᱟᱱ ᱡᱚᱛᱚ ᱴᱟᱠᱟ᱾ ᱠᱷᱮᱞ ᱯᱩᱸᱡᱤ ᱥᱟᱢᱵᱷᱟᱞ ᱫᱚ ᱢᱮᱱᱮᱛ ᱢᱤᱫ ᱵᱟᱡᱤ ᱟᱨ ᱢᱤᱫ ᱥᱮᱥᱚᱱ ᱨᱮ ᱚᱱᱟ ᱠᱷᱚᱱ ᱛᱤᱱᱟᱹᱜ ᱡᱚᱠᱷᱤᱢ ᱨᱮ ᱫᱚᱦᱚᱭ ᱚᱱᱟ ᱴᱷᱟᱹᱣᱠᱟᱹ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ → or table limitᱴᱮᱵᱩᱞᱴᱮᱵᱩᱞ ᱥᱤᱢᱟᱹᱦᱩᱠᱩᱢ ᱢᱮᱱᱟᱜ ᱠᱚᱢ ᱥᱮ ᱠᱚᱢ ᱟᱨ ᱵᱮᱥᱤ ᱥᱮ ᱵᱮᱥᱤ ᱵᱟᱡᱤ᱾ ᱵᱮᱥᱤ ᱥᱮ ᱵᱮᱥᱤ ᱥᱤᱢᱟᱹ ᱜᱮ ᱰᱚᱵᱚᱞ ᱯᱨᱚᱜᱽᱨᱮᱥᱚᱱ ᱵᱚᱸᱫᱟ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ → can stop the sequence first. The Strategy section shows how those limits affect a session.

ᱵᱷᱮᱱᱤᱥ ᱨᱮ ᱯᱷᱮᱨᱳ ᱨᱮ ᱢᱤᱫ ᱠᱷᱮᱞᱚᱸᱰ ᱦᱟᱨᱟᱣ ᱛᱟᱭᱚᱢ ᱫᱩᱱᱟ ᱮᱫᱟᱭ, ᱠᱟᱥᱟᱱᱚᱵᱷᱟ ᱞᱮᱠᱟ᱾

ᱨᱩᱞᱮᱴ ᱴᱮᱵᱩᱞ ᱥᱤᱢᱟᱹ

ᱫᱟᱞᱟᱸᱵᱮᱨ

The progression bearing d’Alembert’s name raises the stake by one unit after a loss and lowers it after a win. The name alone does not prove who devised or endorsed the betting rule.

Its mathematical issue is straightforward: on independent spinsᱜᱚᱱᱤᱛᱟᱡᱟᱫ ᱜᱷᱩᱨᱟᱹᱣᱢᱟᱨᱮ ᱪᱮᱫ ᱦᱚᱸ ᱦᱩᱭ ᱠᱷᱟᱱ ᱦᱚᱸ ᱡᱚᱛᱚ ᱜᱷᱩᱨᱟᱹᱣ ᱨᱮ ᱥᱚᱢᱵᱷᱟᱵᱱᱟ ᱢᱤᱫ ᱞᱮᱠᱟ ᱜᱮ᱾ ᱱᱚᱶᱟ ᱥᱟᱭᱤᱴ ᱨᱮᱭᱟᱜ ᱡᱚᱛᱚ ᱦᱤᱥᱟᱹᱵ ᱨᱮᱭᱟᱜ ᱵᱮᱥ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ →, a run of one outcome does not make the opposite outcome due. A famous namesake does not change that assumption or the payoutᱴᱟᱠᱟᱵᱷᱩᱜᱛᱟᱱᱡᱤᱛ ᱵᱟᱡᱤ ᱪᱮᱫ ᱨᱩᱣᱟᱹᱲᱟ, ᱨᱩᱣᱟᱹᱲ ᱵᱟᱡᱤ ᱴᱟᱠᱟ ᱪᱮᱛᱟᱱ “X ᱨᱮ 1” ᱞᱮᱠᱟ ᱨᱚᱲᱚᱜ-ᱟ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ →.

ᱫᱟᱞᱟᱸᱵᱮᱨ ᱨᱩᱞᱮᱴ ᱥᱴᱨᱮᱴᱮᱡᱤ

ᱞᱟᱵᱩᱥᱮᱨ

The cancellation system uses a list of numbers to determine the next stake. A win removes entries and a loss adds an entry; the Strategy section sets out the rules and examples. Historical stories about its namesake should be distinguished from evidence that the method creates an advantage.

A sequence may clear with a profit, but a losing run can leave a growing list and larger required stakes. How often it clears depends on the starting list, bankroll, limits and stopping rule. There is no universal success percentage.

ᱢᱚᱱᱴᱮ ᱠᱟᱨᱞᱚ ᱨᱩᱞᱮᱴᱞᱟᱵᱩᱥᱮᱨ ᱨᱩᱞᱮᱴ ᱥᱴᱨᱮᱴᱮᱡᱤ

20 ᱥᱟᱭ ᱥᱮᱨᱢᱟ

A simulation can show how a specified system behaves under a chosen wheel model. It cannot test every possible rule, and a finite run need not return exactly the theoretical house edgeᱜᱚᱱᱤᱛᱠᱮᱥᱤᱱᱳ ᱵᱟᱲᱛᱤᱡᱚᱛᱚ ᱵᱟᱡᱤ ᱴᱟᱠᱟ ᱠᱷᱚᱱ ᱠᱮᱥᱤᱱᱳ ᱟᱣᱥᱚᱛ ᱛᱮ ᱫᱚᱦᱚᱭ ᱦᱟᱹᱴᱤᱧ: ᱭᱩᱨᱚᱯᱤᱭᱟᱱ ᱨᱩᱞᱮᱴ ᱨᱮ 2.70%᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ →.

For independent uniform single-zeroᱪᱟᱠᱟᱡᱤᱨᱚᱢᱤᱫᱜᱮ ᱦᱟᱹᱨᱭᱟᱹᱲ ᱠᱷᱟᱱᱟ ᱡᱟᱦᱟᱸ ᱥᱚᱢᱟᱱ ᱴᱟᱠᱟ, ᱰᱚᱡᱮᱱ ᱟᱨᱵᱟᱝ ᱠᱚᱞᱚᱢ ᱵᱟᱡᱤ ᱵᱟᱭ ᱠᱚᱵᱷᱟᱨᱟ; ᱠᱮᱥᱤᱱᱳ ᱵᱟᱲᱛᱤ ᱨᱮᱭᱟᱜ ᱢᱩᱞ᱾ ᱮᱴᱟᱜ ᱧᱩᱛᱩᱢ: ᱥᱤᱝᱜᱚᱞ ᱡᱤᱨᱚ, 0᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ → spins with standard full-loss-on-zero payouts, each unit staked has expected net return −1/37. For a bounded session whose stakes are chosen using information available before each spin, adding the conditional expectations gives expected lossᱜᱚᱱᱤᱛᱟᱸᱫᱟᱡᱽ ᱦᱟᱹᱱᱤᱟᱸᱫᱟᱡᱽ ᱜᱚᱱᱚᱝ ᱜᱩᱬ ᱡᱚᱛᱚ ᱵᱟᱡᱤ ᱴᱟᱠᱟ; ᱢᱤᱫ ᱥᱮᱥᱚᱱ ᱟᱨᱵᱟᱝ ᱚᱠᱛᱚ ᱨᱮ ᱟᱣᱥᱚᱛ ᱛᱮ ᱦᱟᱨᱟᱣᱚᱜ ᱴᱟᱠᱟ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ → equal to 1/37 of expected turnoverᱴᱟᱠᱟᱡᱚᱛᱚ ᱵᱟᱡᱤ ᱦᱤᱥᱟᱹᱵᱢᱤᱫ ᱥᱮᱥᱚᱱ ᱟᱨᱵᱟᱝ ᱚᱠᱛᱚ ᱨᱮ ᱡᱚᱛᱚ ᱵᱟᱡᱤ ᱴᱟᱠᱟ, ᱫᱚᱦᱲᱟ ᱞᱟᱜᱟᱣ ᱡᱤᱛ ᱴᱟᱠᱟ ᱥᱮᱞᱮᱫ᱾ ᱮᱴᱟᱜ ᱧᱩᱛᱩᱢ: ᱦᱮᱱᱰᱮᱞ, ᱮᱠᱥᱚᱱ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ →. Stopping or changing stakes can change the distribution of results, but not create positive expectation under those assumptions. Other payouts, such as la partageᱱᱤᱭᱚᱢᱞᱟ ᱯᱟᱨᱛᱟᱡᱽᱯᱷᱨᱮᱧᱪ ᱱᱤᱭᱚᱢ: ᱡᱤᱨᱚ ᱦᱤᱡᱩᱜ ᱞᱮᱠᱷᱟᱱ ᱥᱚᱢᱟᱱ ᱴᱟᱠᱟ ᱵᱟᱡᱤ ᱨᱮᱭᱟᱜ ᱟᱫᱷᱟ ᱨᱩᱣᱟᱹᱲᱚᱜ-ᱟ᱾ ᱚᱱᱟ ᱵᱟᱡᱤ ᱠᱚ ᱨᱮ ᱠᱮᱥᱤᱱᱳ ᱵᱟᱲᱛᱤ ᱟᱫᱷᱟ, 1.35% ᱦᱩᱭᱩᱜ-ᱟ᱾ᱯᱩᱨᱟᱹ ᱯᱟᱲᱦᱟᱣ →, need their own calculation.

ᱢᱤᱫ ᱪᱟᱞᱟᱣᱤᱭᱟᱹ ᱠᱚᱢᱯᱭᱩᱴᱟᱨ ᱥᱤᱢᱩᱞᱮᱥᱚᱱ ᱛᱮ ᱰᱟᱠ ᱛᱮ ᱟᱠᱷᱨᱤᱧ ᱥᱤᱥᱴᱮᱢ ᱧᱮᱞ ᱧᱮᱞ ᱮᱫᱟᱭ, ᱟᱨ ᱛᱷᱟᱨ ᱫᱚ ᱧᱩᱨ ᱜᱮ ᱧᱩᱨᱚᱜ-ᱟ᱾

ᱵᱷᱨᱚᱢ: ᱡᱟᱣᱨᱟ ᱡᱤᱛᱚᱜ ᱨᱩᱞᱮᱴ ᱥᱴᱨᱮᱴᱮᱡᱤᱯᱷᱤᱵᱚᱱᱟᱪᱤ ᱨᱩᱞᱮᱴ ᱥᱴᱨᱮᱴᱮᱡᱤ

ᱪᱮᱫᱟᱜ ᱵᱟᱧᱪᱟᱣ ᱢᱮᱱᱟᱜ ᱠᱟᱱᱟ

A demonstration can end in profit without showing that the method has an edge. Some rules favor frequent small wins at the cost of occasional large losses; others do the reverse. The proportions depend on the exact rules and limits.

When comparing systems, look at all completed sessions, total stakes, losses and stopping conditions. A selected winning example leaves out the information needed to assess the claim.

ᱥᱤᱥᱴᱮᱢᱥᱟᱭ ᱥᱮᱨᱢᱟᱪᱮᱫ ᱠᱟᱹᱢᱤᱭᱟ ᱢᱮᱱᱛᱮ ᱵᱤᱥᱣᱟᱥ ᱛᱟᱦᱮᱸᱫ
ᱢᱟᱨᱴᱤᱝᱜᱮᱞ18 ᱥᱟᱭᱫᱩᱱᱟ ᱠᱟᱛᱮ ᱡᱤᱛ ᱨᱮᱭᱟᱜ ᱜᱟᱨᱟᱱᱴᱤ
ᱫᱟᱞᱟᱸᱵᱮᱨ18–19 ᱥᱟᱭᱡᱤᱛ ᱟᱨ ᱦᱟᱨᱟᱣ ᱨᱮᱭᱟᱜ ᱥᱚᱢᱟᱱ ᱛᱩᱞᱟᱹ ᱵᱮᱵᱷᱟᱨ
ᱞᱟᱵᱩᱥᱮᱨ19 ᱥᱟᱭᱛᱷᱟᱨ ᱨᱮᱭᱟᱜ ᱡᱚᱛᱚ ᱨᱮᱭᱟᱜ ᱜᱟᱨᱟᱱᱴᱤ
ᱯᱷᱤᱵᱚᱱᱟᱪᱤ19–20 ᱥᱟᱭᱢᱤᱫ ᱞᱟᱞᱟ ᱢᱟᱨᱴᱤᱝᱜᱮᱞ
ᱯᱟᱨᱚᱞᱤ19–20 ᱥᱟᱭᱡᱤᱛ ᱞᱟᱜᱟᱛᱟᱨ ᱨᱮ ᱪᱟᱞᱟᱜ
ᱥᱮᱠᱴᱚᱨ ᱥᱤᱥᱴᱮᱢ20 ᱥᱟᱭᱪᱟᱠᱟ ᱨᱮᱭᱟᱜ ᱮᱞ ᱛᱟᱹᱞᱤᱠᱟᱹ ᱵᱮᱵᱷᱟᱨ

ᱟᱠᱷᱨᱤᱧ ᱞᱟᱹᱜᱤᱫ ᱥᱤᱥᱴᱮᱢ

Systems have also been sold with elaborate names and entry rules. The examples below illustrate the arithmetic of specific rules; they are not evidence of who first invented or marketed them. Waiting for a pattern does not alter the next independent spin’s probabilities.

ᱥᱤᱥᱴᱮᱢᱵᱤᱪᱟᱹᱨᱥᱟᱹᱨᱤ ᱛᱮ ᱪᱮᱫ ᱦᱩᱭᱩᱜ-ᱟ
ᱯᱷᱮᱡᱽ ᱣᱟᱱᱢᱚᱬᱮ ᱟᱨᱟᱜ ᱛᱟᱭᱚᱢ, 5, 25, 70, 200, 500 ᱟᱨ 1,000 ᱭᱩᱱᱤᱴ ᱨᱮᱭᱟᱜ ᱛᱟᱹᱞᱤᱠᱟᱹ ᱛᱮ ᱦᱮᱸᱫᱮ ᱨᱮ ᱵᱟᱡᱤ ᱞᱟᱜᱟᱣᱛᱩᱨᱩᱭ ᱜᱷᱩᱨᱟᱹᱣ ᱦᱚᱸ ᱟᱨᱟᱜ ᱞᱟᱹᱜᱤᱫ 18/38 ᱜᱮ; ᱛᱩᱨᱩᱭ ᱫᱷᱟᱣ ᱞᱟᱜᱟᱛᱟᱨ ᱦᱟᱨᱟᱣ, ᱰᱚᱵᱚᱞ ᱡᱤᱨᱚ ᱪᱟᱠᱟ ᱨᱮ ᱯᱟᱥᱮ 47 ᱨᱮ 1, ᱫᱚ 1,800 ᱭᱩᱱᱤᱴ ᱦᱟᱹᱱᱤ
ᱡᱤᱨᱚ ᱛᱟᱹᱠᱤ ᱧᱮᱞ0 ᱟᱨᱵᱟᱝ 00 ᱵᱟᱹᱱᱩᱜ 40 ᱜᱷᱩᱨᱟᱹᱣ ᱦᱟᱹᱵᱤᱡ ᱛᱟᱹᱠᱤ, ᱛᱟᱭᱚᱢ ᱛᱮ ᱵᱟᱨᱭᱟ ᱨᱮ ᱵᱟᱡᱤ ᱞᱟᱜᱟᱣ, ᱡᱚᱛᱚ ᱵᱷᱩᱞ ᱛᱟᱭᱚᱢ ᱢᱤᱫ ᱭᱩᱱᱤᱴ ᱥᱮᱞᱮᱫOn independent uniform double-zero spins, both zeros miss 40 times with probability (36/38)^40 ≈ 11.50%. The next hit probability remains 2/38. With one additional unit on each zero after each miss, ten losses cost 110 units; a hit on spin eleven nets 264 units overall.
ᱯᱷᱮᱵᱷᱟᱨᱰ 5ᱢᱚᱬᱮ ᱮᱞ ᱫᱩᱦᱲᱟᱹ ᱦᱮᱡ ᱦᱟᱹᱵᱤᱡ ᱛᱟᱹᱠᱤ, ᱛᱟᱭᱚᱢ ᱛᱮ ᱚᱱᱟ ᱠᱚ ᱨᱮ ᱵᱟᱡᱤ ᱞᱟᱜᱟᱣᱡᱚᱛᱚ ᱜᱷᱩᱨᱟᱹᱣ ᱛᱟᱹᱞᱤᱠᱟᱹ ᱨᱮ ᱫᱩᱦᱲᱟᱹ ᱦᱮᱡ ᱮᱞ ᱢᱮᱱᱟᱜ-ᱟ; ᱥᱟᱢᱵᱷᱟᱞ ᱪᱟᱠᱟ ᱨᱮ ᱩᱱᱠᱩ ᱪᱮᱫ ᱦᱚᱸ ᱵᱟᱭ ᱞᱟᱹᱭ ᱞᱟᱦᱟᱭᱟ
ROL / BEH ᱜᱷᱩᱨᱟᱹᱣᱟᱨᱟᱜ, ᱵᱤᱡᱳᱲ, ᱦᱩᱰᱤᱧ ᱟᱨ ᱦᱮᱸᱫᱮ, ᱡᱳᱲ, ᱢᱟᱨᱟᱝ ᱨᱮ ᱵᱚᱫᱚᱞ ᱵᱚᱫᱚᱞ ᱛᱮ ᱢᱤᱫ ᱞᱮᱠᱟᱱ ᱥᱚᱢᱟᱱ ᱴᱟᱠᱟ ᱵᱟᱡᱤᱟᱡᱟᱫ ᱵᱟᱡᱤ ᱨᱮᱭᱟᱜ ᱢᱤᱫ ᱛᱟᱹᱞᱤᱠᱟᱹ, ᱡᱚᱛᱚ ᱯᱩᱨᱟᱹ ᱵᱟᱲᱛᱤ ᱥᱟᱶ
ᱵᱟᱨᱴᱥᱮᱞᱤ ᱨᱮᱭᱟᱜ “ᱜᱟᱨᱟᱱᱴᱤ” ᱥᱤᱥᱴᱮᱢᱢᱤᱫ ᱞᱟᱵᱩᱥᱮᱨ ᱡᱟᱦᱟᱸ ᱫᱚ ᱡᱚᱛᱚ ᱦᱟᱹᱱᱤ ᱢᱩᱪᱟᱹᱫ ᱨᱮ ᱥᱮᱞᱮᱫ ᱵᱟᱫᱚᱞ ᱢᱮᱱᱟᱜ ᱮᱞ ᱠᱚ ᱨᱮ ᱥᱟᱞᱟᱣ ᱮᱫᱟᱛᱷᱟᱨ ᱫᱚ ᱡᱟᱣᱽᱨᱟ ᱵᱟᱭ ᱡᱮᱞᱮᱧᱚᱜ-ᱟ; ᱵᱟᱡᱤ ᱴᱟᱠᱟ ᱫᱚ ᱛᱟᱵᱚᱱ ᱦᱟᱨᱟᱜ-ᱟ

ᱡᱟᱦᱟᱸ ᱫᱚ ᱥᱤᱥᱴᱮᱢ ᱵᱟᱝ ᱠᱟᱱᱟ

ᱛᱤᱝᱜᱩ ᱱᱤᱭᱚᱢ: ᱢᱟᱲᱟᱝ ᱠᱷᱚᱱ ᱡᱟᱦᱟᱸᱱᱤᱡ ᱦᱟᱨᱟᱣ ᱟᱨᱵᱟᱝ ᱡᱤᱛᱟᱹᱣ ᱞᱟᱹᱜᱤᱫ ᱛᱷᱤᱨ ᱠᱟᱛᱮ ᱵᱟᱹᱜᱤ᱾ ᱟᱹᱰᱤ ᱫᱷᱟᱣ ᱱᱚᱶᱟ ᱠᱚ ᱥᱤᱥᱴᱮᱢ ᱨᱮᱭᱟᱜ ᱦᱟᱹᱴᱤᱧ ᱞᱮᱠᱟ ᱟᱠᱷᱨᱤᱧᱚᱜ-ᱟ ᱟᱨ ᱱᱚᱶᱟ ᱜᱮ ᱢᱤᱫ ᱜᱚᱴᱟ ᱦᱟᱹᱴᱤᱧ ᱡᱟᱦᱟᱸ ᱫᱚ ᱪᱮᱫ ᱦᱚᱸ ᱠᱟᱹᱢᱤᱭᱟ, ᱪᱮᱫᱟᱜ ᱡᱮ ᱱᱚᱶᱟ ᱠᱚ ᱡᱚᱛᱚ ᱵᱟᱡᱤ ᱦᱤᱥᱟᱹᱵ ᱠᱚᱢ ᱮᱫᱟ᱾ ᱱᱚᱶᱟ ᱠᱚᱣᱟᱜ ᱡᱟᱦᱟᱸ ᱧᱩᱛᱩᱢ ᱦᱚᱲ ᱵᱟᱹᱱᱩᱜ-ᱟ, ᱡᱟᱦᱟᱸ ᱫᱚ ᱴᱷᱤᱠ ᱜᱮ ᱠᱟᱱᱟ᱾

ᱠᱩᱠᱞᱤ ᱠᱚ

ᱡᱟᱹᱥᱛᱤ ᱢᱟᱨᱮ ᱥᱤᱥᱴᱮᱢ ᱫᱚ ᱚᱠᱟ ᱠᱟᱱᱟ?

ᱢᱟᱨᱴᱤᱝᱜᱮᱞ, ᱢᱤᱫ ᱥᱟᱭ ᱥᱮᱨᱢᱟ ᱟᱨᱵᱟᱝ ᱡᱟᱹᱥᱛᱤ ᱛᱮ᱾ ᱦᱟᱨᱟᱣ ᱛᱟᱭᱚᱢ ᱫᱩᱱᱟ ᱫᱚ ᱡᱚᱛᱚᱭ ᱦᱚᱲ ᱨᱮᱭᱟᱜ ᱯᱟᱦᱤᱞ ᱵᱤᱪᱟᱹᱨ ᱠᱟᱱᱟ᱾

ᱡᱟᱦᱟᱸ ᱧᱩᱛᱩᱢ ᱜᱚᱱᱤᱛ ᱵᱤᱫᱽ ᱢᱤᱫ ᱥᱤᱥᱴᱮᱢ ᱥᱟᱦᱟᱭ ᱞᱮᱫᱟᱭ ᱥᱮ?

ᱫᱟᱞᱟᱸᱵᱮᱨ ᱡᱟᱹᱥᱛᱤ ᱥᱮᱴᱮᱨ ᱮᱱᱟᱭ, ᱵᱷᱩᱞ ᱛᱮ᱾ ᱯᱟᱥᱠᱟᱞ, ᱯᱷᱮᱨᱢᱟ, ᱦᱟᱭᱜᱮᱱᱥ, ᱵᱮᱨᱱᱩᱞᱤ ᱟᱨ ᱞᱟᱯᱞᱟᱥ ᱡᱚᱛᱚ ᱠᱚ ᱵᱩᱡᱷᱟᱹᱣ ᱠᱮᱫᱟ ᱪᱮᱫᱟᱜ ᱥᱤᱥᱴᱮᱢ ᱠᱚ ᱵᱷᱟᱝᱜᱚᱱᱚᱜ-ᱟ᱾

ᱥᱤᱥᱴᱮᱢ ᱠᱚ ᱪᱮᱫᱟᱜ ᱱᱤᱛ ᱦᱚᱸ ᱟᱠᱷᱨᱤᱧᱚᱜ ᱠᱟᱱᱟ?

ᱪᱮᱫᱟᱜ ᱡᱮ ᱟᱹᱰᱤ ᱥᱮᱥᱚᱱ ᱡᱤᱛᱚᱜ-ᱟ, ᱟᱨ ᱢᱤᱫ ᱡᱤᱛ ᱥᱮᱥᱚᱱ ᱨᱮᱭᱟᱜ ᱵᱷᱤᱰᱤᱭᱳ ᱛᱮᱭᱟᱨ ᱫᱚ ᱥᱚᱥᱛᱟ ᱠᱟᱱᱟ᱾

ᱞᱟᱸᱫᱟ ᱞᱟᱹᱜᱤᱫ ᱠᱚᱢᱤᱠ

ᱵᱟᱨ ᱥᱟᱭ ᱥᱮᱨᱢᱟ ᱨᱮᱭᱟᱜ ᱧᱩᱛᱩᱢ ᱠᱚ᱾ ᱢᱤᱫ ᱜᱚᱴᱟ ᱮᱞ᱾

ᱵᱟᱨ ᱥᱟᱭ ᱥᱮᱨᱢᱟ ᱨᱮᱭᱟᱜ ᱧᱩᱛᱩᱢ ᱠᱚ᱾ ᱢᱤᱫ ᱜᱚᱴᱟ ᱮᱞ᱾

ᱯᱷᱮᱰᱟᱛ

  1. Thorp, E. O. “Optimal gambling systems for favorable games.” Review of the International Statistical Institute 37(3), 1969.
  2. Thorp, E. O. The Mathematics of Gambling. Gambling Times / Lyle Stuart, 1984.
  3. Doob, J. L. “Note on probability.” Annals of Mathematics 37(2), 1936.
  4. Halmos, P. R. “Invariants of certain stochastic transformations: the mathematical theory of gambling systems.” Duke Mathematical Journal 5(2), 1939.
  5. d’Alembert, J. “Croix ou pile.” Encyclopédie, vol. 4, 1754.
  6. Schwartz, D. G. Roll the Bones: The History of Gambling. Gotham, 2006.
  7. Kavanagh, T. M. Dice, Cards, Wheels: A Different History of French Culture. University of Pennsylvania Press, 2005.
  8. Bollman, M. Mathematics of the Big Four Casino Table Games: Blackjack, Baccarat, Craps, & Roulette. CRC Press, 2021᱾ ᱪᱮᱯᱴᱟᱨ 2, ᱨᱩᱞᱮᱴ᱾
  9. Académie française, martingale, 1762 https://www.dictionnaire-academie.fr/article/A4M0448
  10. Académie française, martingale, 1878 https://www.dictionnaire-academie.fr/article/A7M0543
ᱢᱚᱰᱮᱞ: ᱭᱩᱨᱚᱯᱤᱭᱟᱱ, ᱥᱤᱝᱜᱚᱞ ᱡᱤᱨᱚᱦᱤᱥᱟᱹᱵ ᱦᱚᱨᱟ ↗ᱯᱷᱮᱰᱟᱛ ↗