ꯐꯤꯕꯣꯅꯥꯆꯤ ꯔꯨꯂꯦꯠ ꯊꯧꯔꯥꯡ
ꯐꯤꯕꯣꯅꯥꯆꯤ ꯔꯨꯂꯦꯠ ꯊꯧꯔꯥꯡꯗ ꯊꯝꯂꯕ ꯁꯦꯜꯁꯤꯡꯅ 1, 1, 2, 3, 5, 8, 13… ꯃꯇꯨꯡ ꯏꯟꯅꯩ꯫ ꯃꯥꯏꯊꯤꯕꯒꯤ ꯃꯇꯨꯡꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯃꯃꯥꯡꯗ ꯆꯠꯂꯤ, ꯃꯥꯏꯄꯥꯛꯄꯒꯤ ꯃꯇꯨꯡꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯍꯟꯊꯔꯛꯂꯤ꯫

It does not beat the wheel; no staking plan does. Its stakes grow more slowly than doubling during consecutive losses, but accumulated losses can still be large. Under standard single-zeroꯆꯛꯔꯖꯤꯔꯣꯆꯞ ꯃꯥꯟꯅꯕ, ꯗꯖꯟ ꯅꯠꯔꯒ ꯀꯂꯝ ꯕꯦꯠ ꯑꯃꯠꯇꯅ ꯀꯨꯞꯇꯕ ꯑꯁꯪꯕ ꯄꯣꯀꯦꯠ ꯑꯃꯈꯛꯇ; ꯍꯥꯎꯁ ꯑꯦꯖꯀꯤ ꯍꯧꯔꯀꯐꯝꯅꯤ꯫ ꯑꯇꯣꯞꯄ ꯃꯃꯤꯡ: ꯁꯤꯡꯒꯜ ꯖꯤꯔꯣ, 0꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → rules, expected loss remains 1/37 of expected turnover for a bounded session.
ꯁꯤꯛꯋꯦꯟꯁ ꯑꯁꯤ ꯀꯔꯝꯅ ꯁꯦꯝꯕꯒꯦ
ꯃꯁꯤꯡ ꯈꯨꯗꯤꯡꯃꯛ ꯃꯃꯥꯡꯗ ꯂꯩꯕ ꯃꯁꯤꯡ ꯑꯅꯤꯒꯤ ꯄꯨꯟꯁꯤꯟꯕꯅꯤ꯫
ꯃꯔꯝ ꯑꯗꯨꯅ 8 ꯑꯃꯁꯨꯡ 13ꯒꯤ ꯃꯇꯨꯡꯗ 21 ꯂꯥꯛꯏ꯫
ꯃꯁꯤꯡ ꯈꯨꯗꯤꯡꯃꯛ ꯁ꯭ꯀ꯭ꯋꯥꯌꯔ ꯑꯃꯥ ꯑꯣꯏꯅ ꯌꯦꯛꯂꯕꯗ ꯁ꯭ꯀ꯭ꯋꯥꯌꯔꯁꯤꯡ ꯑꯗꯨ ꯆꯨꯅ ꯆꯥꯟꯅꯩ: ꯑꯅꯧꯕ ꯈꯨꯗꯤꯡꯃꯛꯀꯤ ꯁꯥꯡꯕ ꯑꯁꯤ ꯃꯃꯥꯡꯒꯤ ꯑꯅꯤ ꯑꯗꯨ ꯃꯅꯥꯛ ꯃꯅꯥꯛꯇ ꯊꯃꯂꯕꯒꯤ ꯁꯥꯡꯕꯒ ꯃꯥꯟꯅꯩ꯫ ꯁ꯭ꯀ꯭ꯋꯥꯌꯔ ꯈꯨꯗꯤꯡꯃꯛꯇ ꯀꯣꯏꯅꯒꯤ ꯃꯔꯤꯁꯨꯕ ꯁꯔꯨꯛ ꯑꯃꯥ ꯌꯦꯛꯂꯕꯗ ꯃꯈꯣꯌ ꯄꯨꯟꯅꯗꯨꯅ ꯁ꯭ꯄꯥꯏꯔꯦꯜ ꯑꯃꯥ ꯑꯣꯏꯔꯛꯏ꯫
ꯁꯤꯛꯋꯦꯟꯁ ꯑꯗꯨꯗ ꯆꯠꯄ
ꯃꯥꯏꯊꯤꯕ ꯑꯃꯅ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯃꯃꯥꯡꯗ ꯆꯠꯍꯜꯂꯤ꯫ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯃꯅ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯃꯇꯨꯡꯗ ꯍꯜꯂꯛꯍꯜꯂꯤ꯫
ꯊꯝꯂꯕ ꯁꯦꯜ ꯑꯃꯁꯨꯡ ꯃꯍꯩꯁꯤꯡ ꯑꯁꯤ ꯍꯧꯔꯛꯐꯃꯒꯤ ꯕꯦꯠꯀꯤ ꯌꯨꯅꯤꯠꯇꯅꯤ꯫
ꯐꯤꯕꯣꯅꯥꯆꯤ ꯔꯨꯂꯦꯠ ꯁꯤꯁ꯭ꯇꯦꯝꯅ ꯀꯔꯝꯅ ꯊꯕꯛ ꯇꯧꯕꯒꯦ?
ꯐꯤꯕꯣꯅꯥꯆꯤꯊꯧꯔꯥꯡꯐꯤꯕꯣꯅꯥꯆꯤ1, 1, 2, 3, 5, 8, 13… ꯁꯤꯛꯋꯦꯟꯁ ꯃꯇꯨꯡ ꯏꯟꯕ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯟ: ꯃꯥꯏꯊꯤꯔꯕꯥ ꯃꯇꯨꯡꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯃꯃꯥꯡꯗ, ꯃꯥꯏꯄꯥꯛꯂꯕꯥ ꯃꯇꯨꯡꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯃꯇꯨꯡꯗ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯃꯁꯤꯡꯁꯤꯡ ꯏꯕꯤꯌꯨ: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144꯫ ꯃꯁꯤꯡ ꯈꯨꯗꯤꯡꯃꯛ ꯃꯃꯥꯡꯒꯤ ꯃꯁꯤꯡ ꯑꯅꯤꯒꯤ ꯃꯄꯨꯡꯅꯤ꯫ ꯑꯍꯥꯅꯕꯗꯒꯤ ꯍꯧꯗꯨꯅ ꯃꯗꯨꯒꯤ ꯃꯁꯤꯡꯒꯤ ꯌꯨꯅꯤꯠꯁꯦꯜꯌꯨꯅꯤꯠꯁꯤꯁ꯭ꯇꯦꯝ ꯅꯠꯔꯒ ꯁꯥꯟꯅꯔꯤꯕ ꯑꯃꯅ ꯁꯤꯖꯤꯟꯅꯕ ꯃꯔꯨꯑꯣꯏꯕ ꯊꯝꯂꯕ ꯁꯦꯜ꯫ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯅꯁꯤꯡ ꯌꯨꯅꯤꯠꯇ ꯁꯟꯗꯣꯛꯂꯤ, ꯃꯔꯝ ꯑꯗꯨꯅ ꯃꯈꯣꯌ ꯀꯔꯤꯒꯨꯝꯕ ꯇꯦꯕꯜꯗ ꯆꯠꯂꯤ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯊꯝꯕꯤꯌꯨ꯫ ꯃꯥꯏꯊꯤꯔꯕꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯌꯦꯠꯊꯪꯗ ꯆꯠꯂꯣ꯫ ꯃꯥꯏꯄꯥꯛꯂꯕꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯑꯣꯏꯊꯪꯗ ꯆꯠꯂꯣ, ꯃꯐꯝ ꯂꯩꯇ꯭ꯔꯕꯗ ꯍꯧꯔꯀꯐꯃꯗ ꯍꯜꯂꯛꯂꯣ꯫ ꯁꯤꯁ꯭ꯇꯦꯝ ꯄꯨꯝꯅꯃꯛ ꯃꯁꯤꯅꯤ꯫ ꯇꯦꯕꯜꯅ ꯈꯣꯡꯊꯥꯡ ꯈꯨꯗꯤꯡꯃꯛ ꯀꯌꯥ ꯌꯥꯎꯕꯒꯦ ꯎꯠꯂꯤ: ꯇꯦꯕꯜꯒꯤ ꯉꯝꯈꯩꯇꯦꯕꯜꯇꯦꯕꯜꯒꯤ ꯉꯝꯈꯩꯌꯥꯍꯜꯂꯤꯕ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯅꯦꯝꯕ ꯑꯃꯁꯨꯡ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯋꯥꯡꯕ ꯕꯦꯠ꯫ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯋꯥꯡꯕ ꯉꯝꯈꯩ ꯑꯗꯨꯅ ꯑꯅꯤ ꯊꯥꯛ ꯍꯦꯅꯒꯠꯍꯟꯕ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯅꯁꯤꯡ ꯊꯤꯡꯏ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯅꯠꯔꯒ ꯅꯍꯥꯛꯀꯤ ꯕꯦꯡꯀꯔꯣꯜꯅꯁꯦꯜꯕꯦꯡꯀꯔꯣꯜꯁꯥꯟꯅꯅꯕ ꯇꯣꯉꯥꯟꯅ ꯊꯝꯂꯕ ꯁꯦꯜ ꯄꯨꯝꯅꯃꯛ꯫ ꯕꯦꯡꯀꯔꯣꯜ ꯃꯦꯅꯦꯖꯃꯦꯟꯠ ꯍꯥꯌꯕꯁꯤ ꯃꯗꯨꯒꯤ ꯀꯌꯥ ꯕꯦꯠ ꯈꯨꯗꯤꯡꯗ ꯑꯃꯁꯨꯡ ꯁꯦꯁꯟ ꯈꯨꯗꯤꯡꯗ ꯈꯨꯗꯣꯡꯊꯤꯕꯗ ꯊꯃꯒꯗꯒꯦ ꯍꯥꯌꯕ ꯋꯥꯔꯦꯞ ꯂꯧꯕꯅꯤ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯊꯤꯡꯖꯤꯜꯂꯕ ꯃꯥꯏꯊꯤꯕꯒꯤ ꯁ꯭ꯇ꯭ꯔꯤꯛ ꯑꯃꯅ ꯃꯇꯝ ꯑꯗꯨ ꯐꯥꯑꯣꯕ ꯊꯃꯈꯤꯕ ꯄꯨꯝꯅꯃꯛꯀꯤ ꯃꯄꯨꯡ ꯃꯥꯡꯍꯜꯂꯤ꯫
ꯁꯦꯁꯟ ꯑꯃꯥ ꯀꯔꯝꯕ ꯃꯑꯣꯡꯗ ꯎꯕꯒꯦ?
ꯑꯍꯧꯕ $10 ꯑꯃꯁꯨꯡ ꯁ꯭ꯄꯤꯟ ꯅꯤꯄꯥꯟ ꯂꯧꯕꯤꯌꯨ: L L W L L L W W꯫ ꯊꯝꯂꯕ ꯁꯦꯜꯁꯤꯡ 10, 10, 20 (ꯃꯥꯏꯄꯥꯛꯄ, ꯑꯅꯤ ꯍꯟꯊꯕ, ꯈꯣꯡꯊꯥꯡ 1 ꯗ), 10, 10, 20, 30 (ꯃꯥꯏꯄꯥꯛꯄ, ꯑꯅꯤ ꯍꯟꯊꯕ, ꯈꯣꯡꯊꯥꯡ 2 ꯗ), 10 (ꯃꯥꯏꯄꯥꯛꯄ, ꯍꯧꯔꯀꯐꯃꯗ) ꯑꯣꯏ꯫ ꯃꯥꯡꯈꯤꯕ: 10 + 10 + 10 + 10 + 20 = 60꯫ ꯃꯥꯏꯄꯥꯛꯈꯤꯕ: 20 + 30 + 10 = 60꯫ ꯃꯥꯏꯊꯤꯕ ꯃꯉꯥ, ꯃꯥꯏꯄꯥꯛꯄ ꯑꯍꯨꯝ, ꯑꯃꯁꯨꯡ ꯅꯍꯥꯛ ꯆꯞ ꯃꯥꯟꯅꯔꯦ꯫ ꯁꯤꯁ꯭ꯇꯦꯝ ꯑꯁꯤꯒꯤ ꯄꯥꯝꯖꯕꯥ ꯐꯕ ꯃꯑꯣꯡ ꯑꯗꯨ ꯃꯁꯤꯅꯤ꯫ ꯃꯃꯜ ꯑꯗꯨ ꯂꯥꯏꯟ ꯑꯗꯨꯃꯛꯇ ꯂꯩ: ꯃꯐꯝ ꯑꯗꯨꯗ ꯌꯧꯅꯕ $120 ꯒꯤ ꯕꯦꯠ ꯃꯊꯧ ꯇꯥꯈꯤ, ꯑꯃꯁꯨꯡ ꯊꯝꯂꯕ ꯗꯣꯂꯥꯔ ꯈꯨꯗꯤꯡꯃꯛꯅ ꯍꯥꯎꯁ ꯑꯦꯖꯃꯦꯊꯃꯦꯇꯤꯛꯁꯍꯥꯎꯁ ꯑꯦꯖꯊꯝꯂꯕ ꯁꯦꯜ ꯈꯨꯗꯤꯡꯗꯒꯤ ꯀꯦꯁꯤꯅꯣꯅ ꯑꯦꯚꯔꯦꯖꯗ ꯊꯃꯖꯤꯜꯂꯤꯕ ꯁꯔꯨꯛ: ꯌꯨꯔꯣꯄꯤꯌꯟ ꯔꯨꯂꯦꯠꯇ 2.70%꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯄꯨꯔꯤ꯫
ꯀꯔꯤꯒꯤ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯍꯟꯊꯕꯅꯣ, ꯑꯃꯈꯛ ꯅꯠꯇꯅ?
ꯃꯔꯃꯗꯤ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯃꯅ ꯆꯞꯆꯥꯅ ꯃꯥꯏꯊꯤꯕ ꯑꯅꯤꯒꯤ ꯃꯃꯜ ꯄꯤ꯫ ꯃꯁꯤꯡ ꯈꯨꯗꯤꯡꯃꯛ ꯃꯃꯥꯡꯒꯤ ꯃꯁꯤꯡ ꯑꯅꯤꯒꯤ ꯃꯄꯨꯡꯅꯤ, ꯃꯔꯝ ꯑꯗꯨꯅ ꯌꯨꯅꯤꯠ 5 ꯗ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯃꯅ ꯃꯃꯥꯡꯗ ꯃꯥꯡꯈꯤꯕ 2 ꯑꯃꯁꯨꯡ 3 ꯑꯗꯨ ꯍꯜꯂꯛꯂꯤ꯫ ꯈꯣꯡꯊꯥꯡ ꯂꯩꯕ ꯀꯥꯡꯂꯣꯟ ꯑꯃꯥ ꯈꯟꯕꯤꯌꯨ: ꯃꯥꯏꯊꯤꯕ ꯈꯨꯗꯤꯡꯃꯛꯇ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯀꯥꯏ, ꯃꯥꯏꯄꯥꯛꯄ ꯈꯨꯗꯤꯡꯃꯛꯇ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯇꯥꯏ꯫ ꯅꯍꯥꯛ ꯂꯦꯞꯂꯤꯕ ꯈꯣꯡꯊꯥꯡ ꯑꯗꯨ ꯅꯍꯥꯛꯀꯤ ꯁꯦꯜ ꯊꯤꯕꯅꯤ꯫ ꯈꯣꯡꯊꯥꯡ 5 ꯗ ꯅꯍꯥꯛ ꯌꯨꯅꯤꯠ 7 ꯃꯥꯡꯂꯦ, ꯈꯣꯡꯊꯥꯡ 8 ꯗ 33 ꯃꯥꯡꯂꯦ, ꯑꯃꯁꯨꯡ ꯑꯍꯥꯅꯕ ꯈꯣꯡꯊꯥꯡꯗ ꯍꯜꯂꯛꯂꯕꯗ ꯆꯞꯆꯥꯅ ꯆꯞ ꯃꯥꯟꯅꯔꯦ꯫ ꯀꯥꯟꯅꯕ ꯁꯦꯜ ꯑꯍꯥꯅꯕ ꯈꯣꯡꯊꯥꯡꯒꯤ ꯃꯥꯏꯄꯥꯛꯄꯁꯤꯡꯗꯒꯤ ꯈꯛꯇ ꯂꯥꯀꯏ, ꯑꯃꯨꯛꯇ ꯌꯨꯅꯤꯠ ꯑꯃꯥ꯫
ꯃꯥꯏꯄꯥꯛꯄ ꯑꯃꯁꯨꯡ ꯃꯥꯏꯊꯤꯕ ꯀꯌꯥ ꯃꯔꯥꯡ ꯆꯞ ꯃꯥꯟꯅꯕꯗ, ꯑꯃꯒꯤꯗꯃꯛ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯍꯥꯌꯕꯁꯤ ꯐꯕ ꯌꯦꯟ ꯑꯃꯥ ꯑꯣꯏꯅ ꯇꯥꯏ, ꯑꯃꯁꯨꯡ ꯃꯇꯝ ꯌꯥꯝꯅꯥ ꯀꯥꯡꯂꯣꯟ ꯑꯗꯨꯅ ꯇꯁꯦꯡꯅ ꯃꯈꯥꯗ ꯍꯜꯂꯀꯏ꯫ ꯑꯔꯥꯟ ꯈꯨꯕꯝ ꯑꯗꯨꯗꯤ ꯀꯥꯛꯂꯤꯉꯩꯗ ꯈꯣꯡꯊꯥꯡꯁꯤꯡ ꯍꯦꯟꯅꯥ ꯋꯥꯡꯂꯛꯂꯤ꯫ ꯑꯍꯥꯅꯕ ꯈꯣꯡꯊꯥꯡꯒꯤ ꯃꯥꯏꯄꯥꯛꯄ ꯇꯔꯥꯅ ꯌꯨꯅꯤꯠ 10 ꯄꯤ꯫ ꯈꯣꯡꯊꯥꯡ 6, 7 ꯑꯃꯁꯨꯡ 8 ꯒꯤ ꯃꯥꯏꯊꯤꯕ ꯑꯍꯨꯃꯅ 8 + 13 + 21 = 42 ꯃꯥꯡꯍꯜꯂꯤ꯫
- p10 −$500
- p25 −$500
- ꯃꯤꯗꯤꯌꯥꯟ −$500
- p75 +$250
- p90 +$920
ꯐꯤꯕꯣꯅꯥꯆꯤ ꯁꯤꯁ꯭ꯇꯦꯝꯅ ꯊꯕꯛ ꯇꯧꯕ꯭ꯔꯥ?
It does not produce a positive expected return; individual sessions can still finish ahead. The calculation is the same as for every system: each bet loses 1/37 of its stake on average, so a bounded session has expected lossꯃꯦꯊꯃꯦꯇꯤꯛꯁꯃꯥꯡꯒꯗꯕ ꯁꯦꯜꯐꯪꯒꯗꯕ ꯃꯃꯂꯕꯨ ꯕꯦꯠ ꯊꯝꯂꯕ ꯁꯦꯜ ꯄꯨꯝꯅꯃꯛꯅ ꯃꯅꯥꯡꯕ; ꯁꯦꯁꯟ ꯅꯠꯔꯒ ꯃꯇꯝ ꯑꯃꯒꯤ ꯃꯅꯨꯡꯗ ꯃꯥꯡꯕ ꯑꯦꯚꯔꯦꯖ ꯁꯦꯜ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → equal to 1/37 of expected turnoverꯁꯦꯜꯇꯔꯅꯑꯣꯚꯔꯁꯦꯁꯟ ꯅꯠꯔꯒ ꯃꯇꯝ ꯑꯃꯒꯤ ꯃꯅꯨꯡꯗ ꯕꯦꯠ ꯊꯝꯂꯕ ꯁꯦꯜ ꯄꯨꯝꯅꯃꯛ, ꯑꯃꯨꯛ ꯍꯟꯅꯥ ꯊꯝꯂꯕ ꯃꯥꯏꯄꯥꯛꯇꯨꯅ ꯐꯪꯂꯕ ꯁꯦꯜꯁꯨ ꯌꯥꯎꯅ꯫ ꯑꯇꯣꯞꯄ ꯃꯃꯤꯡ: ꯍꯦꯟꯗꯜ, ꯑꯦꯛꯁꯟ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ →. Using the Fibonacci sequence in roulette does not change that, because the wheel pays the same odds whatever the size of the chipꯁꯦꯜꯆꯤꯞꯂꯦꯞꯂꯕ ꯁꯦꯜꯒꯤ ꯃꯃꯜ ꯇꯥꯛꯄ ꯇꯣꯀꯟ, ꯕꯦꯠ ꯊꯝꯅꯕ ꯂꯦꯑꯥꯎꯠꯇ ꯊꯝꯃꯤ꯫ ꯑꯇꯣꯞꯄ ꯃꯃꯤꯡ: ꯆꯦꯛ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ →. For the same funded number of spins, stakes never below the flat-bet base imply at least as much turnover. Comparisons with other progressionsꯊꯧꯔꯥꯡꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯟꯃꯃꯥꯡꯒꯤ ꯃꯍꯩꯁꯤꯡꯒꯤ ꯃꯈꯥꯗ ꯊꯝꯂꯕ ꯁꯦꯜ ꯍꯣꯡꯍꯟꯕ ꯅꯤꯌꯝ ꯀꯔꯤꯒꯨꯝꯕ꯫ ꯅꯦꯒꯦꯇꯤꯕ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯅꯁꯤꯡꯅ ꯃꯥꯏꯊꯤꯔꯕꯥ ꯃꯇꯨꯡꯗ ꯍꯦꯅꯒꯠꯍꯜꯂꯤ, ꯄꯣꯖꯤꯇꯤꯕꯁꯤꯡꯅ ꯃꯥꯏꯄꯥꯛꯂꯕꯥ ꯃꯇꯨꯡꯗ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → require specified bankrolls, limits and reset rules.
ꯃꯁꯤ ꯃꯥꯔꯇꯤꯟꯒꯦꯜꯗꯒꯤ ꯍꯦꯟꯅꯥ ꯑꯁꯣꯏꯕ ꯌꯥꯎꯗꯕ꯭ꯔꯥ?
It is slower, which is not the same thing. Fibonacci stakes grow by about 1.6× per step instead of 2×, so a $10 start permits nine Fibonacci losses before the next $550 bet exceeds a $500 maximum. Martingaleꯊꯧꯔꯥꯡꯃꯥꯔꯇꯤꯟꯒꯦꯜꯃꯥꯏꯊꯤꯕ ꯈꯨꯗꯤꯡꯒꯤ ꯃꯇꯨꯡꯗ ꯕꯦꯠ ꯑꯗꯨ ꯑꯅꯤ ꯊꯥꯛ ꯍꯦꯅꯒꯠꯍꯟꯕ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯟ꯫ ꯃꯁꯤꯅ ꯀꯔꯤ ꯇꯧꯕꯒꯦ ꯑꯃꯁꯨꯡ ꯀꯔꯤ ꯇꯧꯗꯕꯒꯦ ꯍꯥꯌꯕ ꯊꯧꯔꯥꯡꯒꯤ ꯁꯦꯛꯁꯅꯗ ꯌꯦꯡꯕꯤꯌꯨ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → permits six losses before a $640 bet is refused. The corresponding probabilities for one uninterrupted cycle are (19/37)⁹ ≈ 0.248% and (19/37)⁶ ≈ 1.834%. They are not whole-session failure probabilities. Funds can run out before either limit is reached.
ꯃꯁꯤꯡꯁꯤꯡ ꯑꯁꯤ ꯀꯃꯗꯒꯤ ꯂꯥꯀꯄꯅꯣ?
From a puzzle about rabbits. Leonardo of Pisa, later nicknamed Fibonacci, set it in his Liber Abaci of 1202: start with one breeding pair, let newborn pairs begin breeding in their second month, and count the pairs as each breeding pair produces a new pair every month. The answer runs 1, 2, 3, 5, 8, 13. He was not the first to find the rule. Indian scholars of verse rhythm had written it down earlier: Singh (1985) traces it to Virahanka, between 600 and 800, and then to Gopala and Hemachandra.
These examples concern counting rabbits or poetic meters, not a roulette staking rule. They do not establish who first applied the sequence to betting. The recurrence determines the prescribed stakes; the roulette probabilities and payoutsꯁꯦꯜꯄꯦꯑꯥꯎꯠꯃꯥꯏꯄꯥꯛꯄ ꯕꯦꯠ ꯑꯃꯅ ꯍꯜꯂꯛꯄ ꯁꯦꯜ, ꯍꯜꯂꯀꯄ ꯊꯝꯂꯕ ꯁꯦꯜꯒꯤ ꯃꯊꯛꯇ “X ꯗꯒꯤ 1” ꯍꯥꯌꯅ ꯍꯥꯌꯏ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → determine each stake’s expected return.

ꯃꯥꯏꯊꯤꯕꯒꯤ ꯁ꯭ꯇ꯭ꯔꯤꯛ ꯑꯃꯒꯤ ꯃꯇꯨꯡꯗ ꯀꯌꯥ ꯃꯥꯡꯕꯒꯦ?
ꯑꯥꯏꯗꯦꯟꯇꯤꯇꯤ ꯑꯅꯤꯅ ꯃꯊꯛꯇ ꯂꯩꯕ ꯇꯦꯕꯜ ꯑꯗꯨ ꯌꯦꯡꯁꯤꯟꯕ ꯂꯥꯏꯍꯜꯂꯤ꯫ ꯃꯈꯥ ꯆꯠꯅꯕ ꯃꯥꯏꯊꯤꯕ n ꯒꯤ ꯃꯇꯨꯡꯗ ꯃꯥꯡꯂꯕ ꯄꯨꯝꯅꯃꯛ ꯑꯁꯤ (n + 2) ꯁꯨꯕ ꯐꯤꯕꯣꯅꯥꯆꯤ ꯃꯁꯤꯡꯗꯒꯤ 1 ꯂꯧꯊꯣꯛꯂꯕꯅꯤ, ꯃꯁꯤꯅ 1, 2, 4, 7, 12, 20 ꯑꯁꯤꯅ ꯆꯠꯂꯤ, ꯑꯃꯁꯨꯡ ꯃꯊꯪꯒꯤ ꯊꯝꯂꯕ ꯁꯦꯜ ꯑꯁꯤ (n + 1) ꯁꯨꯕ ꯐꯤꯕꯣꯅꯥꯆꯤ ꯃꯁꯤꯡꯅꯤ꯫ ꯕꯣꯜꯃꯦꯟ (Bollman) (2021) ꯅ 1, 2, 3 ꯗꯒꯤ ꯍꯧꯕ ꯁꯤꯛꯋꯦꯟꯁ ꯑꯃꯒꯤꯗꯃꯛ ꯏꯟꯗꯛꯁꯅꯅ ꯃꯍꯩ ꯑꯗꯨꯃꯛ ꯄ꯭ꯔꯨꯐ ꯇꯧꯏ, ꯃꯁꯤꯅ ꯃꯁꯤꯡ ꯈꯨꯗꯤꯡꯃꯛ ꯃꯐꯝ ꯑꯃꯥ ꯆꯦꯟꯊꯍꯜꯂꯤ꯫ ꯌꯨꯅꯤꯠ 1 ꯗꯒꯤ ꯍꯧꯔꯒ ꯌꯨꯅꯤꯠ 500 ꯒꯤ ꯉꯝꯈꯩꯗ, ꯃꯥꯔꯇꯤꯟꯒꯦꯜꯅ ꯃꯁꯥꯒꯤ 10 ꯁꯨꯕ ꯕꯦꯠ, ꯌꯨꯅꯤꯠ 512, ꯊꯝꯕ ꯉꯝꯗꯦ꯫ ꯐꯤꯕꯣꯅꯥꯆꯤꯅ ꯃꯁꯥꯒꯤ 14 ꯁꯨꯕ, ꯌꯨꯅꯤꯠ 377, ꯊꯝꯕ ꯉꯝꯃꯤ, ꯑꯗꯨꯕꯨ 15 ꯁꯨꯕ, 610, ꯊꯝꯕ ꯉꯝꯗꯦ꯫
ꯗꯖꯟ ꯅꯠꯔꯒ ꯀꯂꯝ ꯑꯃꯗ ꯀꯔꯤ ꯍꯣꯡꯕꯒꯦ?
2 ꯗꯒꯤ 1 ꯄꯤꯕ ꯗꯖꯟꯕꯦꯠꯗꯖꯟ1–12, 13–24 ꯅꯠꯔꯒ 25–36, 2:1 ꯄꯦꯑꯥꯎꯠ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯅꯠꯔꯒ ꯀꯂꯝꯕꯦꯠꯀꯂꯝꯂꯦꯑꯥꯎꯠꯀꯤ ꯊꯣꯡꯅꯥꯡꯒꯤ ꯀꯂꯝ ꯑꯃꯗ ꯂꯩꯕ ꯃꯁꯤꯡ ꯇꯔꯥꯅꯤꯊꯣꯏ, 2:1 ꯄꯦꯑꯥꯎꯠ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯑꯃꯗ ꯃꯇꯨꯡꯗ ꯍꯟꯊꯕ ꯃꯊꯧ ꯇꯥꯗꯦ꯫ ꯊꯝꯂꯕ ꯁꯦꯜ F ꯗ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯃꯅ 2F ꯄꯤ, ꯃꯁꯤ ꯃꯃꯥꯡꯗ ꯃꯥꯡꯈꯤꯕ ꯄꯨꯝꯅꯃꯛꯇꯒꯤ ꯃꯇꯝ ꯄꯨꯝꯕꯗ ꯍꯦꯟꯅꯥ ꯋꯥꯡꯏ, ꯃꯔꯝ ꯑꯗꯨꯅ ꯃꯥꯏꯄꯥꯛꯄ ꯈꯨꯗꯤꯡꯃꯛꯅ ꯁꯤꯛꯋꯦꯟꯁ ꯑꯗꯨ ꯀꯥꯟꯅꯕꯗ ꯂꯣꯏꯁꯤꯜꯂꯤ꯫ ꯃꯃꯜ ꯑꯗꯨꯗꯤ ꯗꯖꯟ ꯑꯃꯅ 37 ꯗ 12 ꯈꯛ ꯃꯥꯏꯄꯥꯛꯏ, ꯃꯔꯝ ꯑꯗꯨꯅ ꯁꯥꯡꯂꯕ ꯃꯥꯏꯊꯤꯕꯒꯤ ꯁ꯭ꯇ꯭ꯔꯤꯛꯁꯤꯡ ꯌꯥꯝꯅ ꯍꯦꯟꯅꯥ ꯊꯣꯀꯏ: ꯃꯈꯥ ꯆꯠꯅꯕ ꯗꯖꯟ ꯃꯥꯏꯊꯤꯕ ꯇꯔꯥꯃꯔꯤ ꯑꯁꯤ ꯍꯣꯠꯅꯕ 242 ꯗ ꯑꯃꯨꯛ ꯔꯣꯝ ꯊꯣꯀꯏ, ꯑꯉꯥꯡꯕꯒꯤꯗꯃꯛꯕꯦꯠꯑꯉꯥꯡꯕꯑꯉꯥꯡꯕ ꯃꯁꯤꯡ 18 ꯗ ꯊꯝꯕ ꯆꯞ ꯃꯥꯟꯅꯕ ꯕꯦꯠ꯫ ꯐ꯭ꯔꯦꯟꯆ: ꯔꯨꯖ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → 11,000 ꯗ ꯑꯃꯨꯛ ꯔꯣꯝ꯫
ꯃꯈꯥ ꯆꯠꯅꯕ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯅꯤꯒꯤ ꯃꯇꯨꯡꯗ ꯈꯛꯇ ꯂꯦꯞꯂꯕꯗꯗꯤ ꯀꯔꯝꯅꯣ?
ꯑꯇꯣꯞꯄ ꯃꯈꯜ ꯑꯃꯅ ꯃꯥꯏꯄꯥꯛꯂꯕꯁꯨ ꯃꯥꯏꯊꯤꯔꯕꯁꯨ ꯁ꯭ꯄꯤꯟ ꯈꯨꯗꯤꯡꯃꯛꯀꯤ ꯃꯇꯨꯡꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯃꯃꯥꯡꯗ ꯆꯠꯂꯤ, ꯑꯃꯁꯨꯡ ꯃꯈꯥ ꯆꯠꯅꯕ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯅꯤꯒꯤ ꯃꯇꯨꯡꯗ ꯈꯛꯇ ꯂꯦꯞꯂꯤ꯫ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯅꯤꯒꯤ ꯃꯃꯥꯡꯗ ꯃꯥꯏꯊꯤꯕ n ꯂꯩꯔꯕꯗ, ꯀꯥꯟꯅꯕ ꯁꯦꯜ ꯑꯁꯤ (n + 1) ꯁꯨꯕ ꯐꯤꯕꯣꯅꯥꯆꯤ ꯃꯁꯤꯡꯗ 1 ꯍꯥꯄꯆꯤꯜꯂꯕꯅꯤ: ꯃꯥꯏꯄꯥꯛꯄꯁꯤꯡ ꯊꯨꯅ ꯂꯥꯀꯄꯗ ꯑꯄꯤꯛꯄ, ꯃꯇꯨꯡꯗ ꯂꯥꯀꯄꯗ ꯍꯦꯟꯅꯥ ꯆꯥꯎꯕ, ꯑꯃꯁꯨꯡ ꯃꯗꯨꯒꯥ ꯆꯥꯅꯕ ꯑꯣꯏꯅ ꯍꯦꯅꯒꯠꯂꯛꯂꯕ ꯊꯝꯂꯕ ꯁꯦꯜꯁꯤꯡꯗ ꯃꯥꯏꯄꯥꯛꯏ꯫ ꯊꯨꯅ ꯂꯥꯀꯄ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯅꯤ ꯃꯇꯝ ꯄꯨꯝꯕꯗ ꯑꯄꯤꯛꯄ ꯊꯝꯂꯕ ꯁꯦꯜꯗ ꯂꯥꯀꯏ; ꯃꯇꯨꯡꯗ ꯂꯥꯀꯄ ꯑꯅꯤꯅ ꯁꯦꯁꯟ ꯑꯗꯨ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯐꯠꯇꯕ ꯃꯇꯝ ꯑꯗꯨꯃꯛꯇ ꯑꯆꯧꯕ ꯕꯦꯠ ꯑꯃꯥ ꯃꯊꯧ ꯇꯥꯍꯅꯕ ꯌꯥꯏ꯫
ꯁꯤꯃꯨꯂꯦꯇꯔ · ꯐꯤꯕꯣꯅꯥꯆꯤ
$1,000ꯒꯤ ꯕꯦꯡꯀꯔꯣꯜꯗꯒꯤ ꯍꯧꯔꯒꯥ ꯆꯞ ꯃꯥꯟꯅꯕ ꯕꯦꯠꯁꯤꯡꯒꯤ ꯁꯦꯁꯟ 2,000꯫
ꯍꯧꯔꯛꯐꯃꯒꯤ ꯕꯦꯠ $10 · ꯇꯦꯕꯜꯒꯤ ꯉꯝꯈꯩ $500 · ꯁꯦꯁꯟ ꯈꯨꯗꯤꯡꯗ ꯁ꯭ꯄꯤꯟ 100
ꯃꯥꯏꯊꯤꯕ ꯁ꯭ꯇ꯭ꯔꯤꯛ ꯀꯌꯥ ꯌꯥꯝꯅ ꯂꯥꯀꯄꯒꯦ
ꯁꯤꯡꯒꯜ ꯖꯤꯔꯣ ꯆꯛꯔ ꯑꯃꯗ ꯆꯞ ꯃꯥꯟꯅꯕ ꯕꯦꯠ ꯑꯃꯅ ꯁ꯭ꯄꯤꯟ 37 ꯈꯨꯗꯤꯡꯗ 19 ꯃꯥꯏꯊꯤ꯫ ꯔꯣ ꯈꯨꯗꯤꯡꯃꯛꯅ ꯁ꯭ꯄꯤꯟ ꯀꯌꯥ ꯄꯨꯝꯅꯃꯛ ꯃꯥꯏꯊꯤꯕꯒꯤ ꯈꯨꯗꯣꯡꯆꯥꯕ ꯑꯃꯁꯨꯡ ꯃꯥꯏꯊꯤꯕ ꯈꯨꯗꯤꯡꯃꯛꯀꯤ ꯃꯇꯨꯡꯗ ꯁꯤꯛꯋꯦꯟꯁꯇ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯆꯠꯂꯤꯕ ꯐꯤꯕꯣꯅꯥꯆꯤ ꯁꯥꯟꯅꯔꯤꯕ ꯑꯃꯅ ꯃꯇꯝ ꯑꯗꯨ ꯐꯥꯑꯣꯕꯥ ꯃꯥꯡꯈꯤꯕ ꯁꯦꯜ ꯎꯠꯂꯤ꯫
| ꯃꯊꯪ ꯃꯊꯪ ꯃꯥꯏꯊꯤꯕ | ꯈꯨꯗꯣꯡꯆꯥꯕ | ꯃꯇꯧ ꯑꯁꯤꯒꯨꯝꯅ 1 / … | ꯍꯧꯖꯤꯛ ꯐꯥꯑꯣꯕꯥ ꯃꯥꯡꯈꯤꯕ | ꯃꯊꯪꯒꯤ ꯕꯦꯠ |
|---|---|---|---|---|
| 1 | 51.4% | 2 | $1 | $1 |
| 2 | 26.4% | 4 | $2 | $2 |
| 3 | 13.5% | 7 | $4 | $3 |
| 4 | 7.0% | 14 | $7 | $5 |
| 5 | 3.6% | 28 | $12 | $8 |
| 6 | 1.8% | 55 | $20 | $13 |
| 7 | 0.94% | 106 | $33 | $21 |
| 8 | 0.48% | 207 | $54 | $34 |
| 9 | 0.25% | 403 | $88 | $55 |
| 10 | 0.13% | 784 | $143 | $89 |
| 11 | 0.065% | 1527 | $232 | $144 |
| 12 | 0.034% | 2974 | $376 | $233 |
| 13 | 0.017% | 5792 | $609 | $377 |
| 14 | 0.0089% | 11279 | $986 | $610 |
| 15 | 0.0046% | 21965 | $1,596 | $987 |
ꯈꯨꯗꯣꯡꯆꯥꯕ ꯑꯁꯤ ꯃꯥꯏꯊꯤꯕ ꯑꯃꯗ ꯑꯃꯨꯛ 19/37 ꯃꯁꯥꯃꯛꯀꯥ ꯃꯜꯇꯤꯞꯂꯥꯏ ꯇꯧꯕꯅꯤ, ꯈꯅꯕ ꯁ꯭ꯄꯤꯟ ꯑꯃꯗꯒꯤ ꯍꯧꯔꯒꯥ ꯊꯤꯕ꯫ ꯁꯥꯡꯕ ꯁꯦꯁꯟ ꯑꯃꯗ ꯑꯁꯤꯒꯨꯝꯕ ꯁ꯭ꯇ꯭ꯔꯤꯛ ꯍꯧꯕ ꯌꯥꯕ ꯁ꯭ꯄꯤꯟ ꯀꯌꯥ ꯂꯩ, ꯃꯔꯝ ꯑꯗꯨꯅ ꯅꯨꯃꯤꯗꯥꯡ ꯑꯃꯒꯤ ꯃꯅꯨꯡꯗ ꯃꯁꯤ ꯊꯣꯛꯄꯒꯤ ꯈꯨꯗꯣꯡꯆꯥꯕ ꯔꯣ ꯑꯃꯅ ꯎꯠꯂꯤꯕꯗꯒꯤ ꯌꯥꯝꯅ ꯍꯦꯟꯅꯥ ꯋꯥꯡꯏ꯫
ꯋꯥꯍꯪꯁꯤꯡ
ꯂꯩ: ꯃꯥꯏꯄꯥꯛꯄꯒꯤ ꯃꯇꯨꯡꯗ ꯃꯃꯥꯡꯗ, ꯃꯥꯏꯊꯤꯕꯒꯤ ꯃꯇꯨꯡꯗ ꯃꯇꯨꯡꯗ꯫ ꯃꯁꯤ ꯍꯦꯟꯅꯥ ꯇꯞꯄ ꯄꯥꯔꯣꯂꯤꯊꯧꯔꯥꯡꯄꯥꯔꯣꯂꯤꯄꯣꯖꯤꯇꯤꯕ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯟ: ꯃꯥꯏꯄꯥꯛꯂꯕꯥ ꯃꯇꯨꯡꯗ ꯑꯅꯤ ꯊꯥꯛ ꯍꯦꯅꯒꯠꯍꯜꯂꯤ, ꯃꯥꯏꯊꯤꯔꯕꯥ ꯃꯇꯨꯡꯗ ꯅꯠꯔꯒ ꯃꯈꯥ ꯆꯠꯅꯅ ꯑꯃꯨꯛ ꯑꯍꯨꯝ ꯃꯥꯏꯄꯥꯛꯂꯕꯥ ꯃꯇꯨꯡꯗ ꯑꯍꯧꯕꯗ ꯍꯜꯂꯀꯏ꯫ ꯑꯇꯣꯞꯄ ꯃꯃꯤꯡ: ꯔꯤꯚꯔꯁ ꯃꯥꯔꯇꯤꯟꯒꯦꯜ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → ꯑꯃꯒꯨꯝ ꯆꯠꯂꯤ꯫
ꯃꯦꯊꯃꯦꯇꯤꯛꯁꯀꯥ ꯁꯥꯟꯅꯕ
ꯃꯁꯤꯁꯤꯡ ꯑꯍꯥꯅꯕꯗ ꯅꯍꯥꯛ ꯃꯁꯥꯃꯛꯅ ꯍꯣꯠꯅꯕꯤꯌꯨ꯫ ꯄꯥꯎꯈꯨꯝ ꯈꯨꯗꯤꯡꯃꯛ ꯊꯨꯡꯗꯨꯅ ꯊꯝꯂꯤ; ꯁꯦꯝ ꯁꯥꯔꯕ ꯃꯇꯃꯗ ꯍꯥꯡꯗꯣꯛꯄꯤꯌꯨ꯫
ꯁ꯭ꯄꯤꯟ ꯈꯨꯗꯤꯡꯒꯤ ꯃꯇꯨꯡꯗ, ꯃꯥꯏꯄꯥꯛꯂꯕꯁꯨ ꯃꯥꯏꯊꯤꯔꯕꯁꯨ, ꯁꯤꯛꯋꯦꯟꯁ ꯑꯗꯨꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯆꯠꯄ ꯑꯃꯁꯨꯡ ꯃꯈꯥ ꯆꯠꯊꯅ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯅꯤꯒꯤ ꯃꯇꯨꯡꯗ ꯂꯦꯞꯄ ꯃꯈꯜ ꯑꯗꯨ ꯁꯥꯟꯅꯕꯤꯌꯨ: ꯊꯝꯂꯕ ꯁꯦꯜ 1, 1, 2, 3, 5, 8 ꯑꯁꯤꯅꯆꯤꯡꯕ꯫ ꯑꯍꯥꯅꯕ ꯃꯍꯩ ꯇꯔꯥꯃꯔꯤ ꯑꯁꯤꯅꯤ: ꯃꯥꯏꯄꯥꯛ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯄꯥꯛ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯄꯥꯛ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯄꯥꯛ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯊꯤ ꯃꯥꯏꯄꯥꯛ꯫ ꯅꯍꯥꯛ ꯀꯗꯥꯏꯗ ꯂꯩꯔꯤꯕꯒꯦ, ꯑꯃꯁꯨꯡ ꯃꯊꯪꯒꯤ ꯕꯦꯠ ꯑꯗꯨ ꯀꯌꯥꯅꯣ?
ꯄꯥꯎꯈꯨꯝ ꯎꯠꯄ
ꯄꯥꯎꯈꯨꯝ ꯌꯨꯅꯤꯠꯁꯦꯜꯌꯨꯅꯤꯠꯁꯤꯁ꯭ꯇꯦꯝ ꯅꯠꯔꯒ ꯁꯥꯟꯅꯔꯤꯕ ꯑꯃꯅ ꯁꯤꯖꯤꯟꯅꯕ ꯃꯔꯨꯑꯣꯏꯕ ꯊꯝꯂꯕ ꯁꯦꯜ꯫ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯅꯁꯤꯡ ꯌꯨꯅꯤꯠꯇ ꯁꯟꯗꯣꯛꯂꯤ, ꯃꯔꯝ ꯑꯗꯨꯅ ꯃꯈꯣꯌ ꯀꯔꯤꯒꯨꯝꯕ ꯇꯦꯕꯜꯗ ꯆꯠꯂꯤ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → 22 ꯃꯥꯡꯂꯤ꯫ ꯃꯊꯪꯒꯤ ꯕꯦꯠ ꯑꯗꯨ ꯌꯨꯅꯤꯠ 610 ꯅꯤ, ꯑꯃꯁꯨꯡ ꯃꯥꯏꯄꯥꯛꯂꯕꯗ ꯁꯦꯁꯟ ꯑꯗꯨ 588 ꯀꯥꯟꯗꯨꯅ ꯂꯣꯏꯁꯤꯅꯒꯅꯤ꯫
The stakes are the first fourteen Fibonacciꯊꯧꯔꯥꯡꯐꯤꯕꯣꯅꯥꯆꯤ1, 1, 2, 3, 5, 8, 13… ꯁꯤꯛꯋꯦꯟꯁ ꯃꯇꯨꯡ ꯏꯟꯕ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯟ: ꯃꯥꯏꯊꯤꯔꯕꯥ ꯃꯇꯨꯡꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯃꯥ ꯃꯃꯥꯡꯗ, ꯃꯥꯏꯄꯥꯛꯂꯕꯥ ꯃꯇꯨꯡꯗ ꯈꯣꯡꯊꯥꯡ ꯑꯅꯤ ꯃꯇꯨꯡꯗ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → numbers: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233 and 377. Add the wins and subtract the losses: +1 −1 +2 −3 −5 −8 +13 −21 −34 −55 +89 −144 −233 +377 = −22.
The last result was a win, so one more win ends it. The next stake is 610: a win leaves +588, a loss leaves −632 and a next stake of 987.
If it can continue until two consecutive wins, this variant ends ahead. A finite bankrollꯁꯦꯜꯕꯦꯡꯀꯔꯣꯜꯁꯥꯟꯅꯅꯕ ꯇꯣꯉꯥꯟꯅ ꯊꯝꯂꯕ ꯁꯦꯜ ꯄꯨꯝꯅꯃꯛ꯫ ꯕꯦꯡꯀꯔꯣꯜ ꯃꯦꯅꯦꯖꯃꯦꯟꯠ ꯍꯥꯌꯕꯁꯤ ꯃꯗꯨꯒꯤ ꯀꯌꯥ ꯕꯦꯠ ꯈꯨꯗꯤꯡꯗ ꯑꯃꯁꯨꯡ ꯁꯦꯁꯟ ꯈꯨꯗꯤꯡꯗ ꯈꯨꯗꯣꯡꯊꯤꯕꯗ ꯊꯃꯒꯗꯒꯦ ꯍꯥꯌꯕ ꯋꯥꯔꯦꯞ ꯂꯧꯕꯅꯤ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → or table limitꯇꯦꯕꯜꯇꯦꯕꯜꯒꯤ ꯉꯝꯈꯩꯌꯥꯍꯜꯂꯤꯕ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯅꯦꯝꯕ ꯑꯃꯁꯨꯡ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯋꯥꯡꯕ ꯕꯦꯠ꯫ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯋꯥꯡꯕ ꯉꯝꯈꯩ ꯑꯗꯨꯅ ꯑꯅꯤ ꯊꯥꯛ ꯍꯦꯅꯒꯠꯍꯟꯕ ꯄ꯭ꯔꯣꯒ꯭ꯔꯦꯁꯅꯁꯤꯡ ꯊꯤꯡꯏ꯫ꯃꯄꯨꯡ ꯄꯥꯕꯤꯌꯨ → may prevent that ending; here the next required bet is 610 units. Under the usual rules, two steps back after a win, the same fourteen results leave you just 1 unit down with a next bet of 2. A different starting sequence defines a different variant. The usual rules lose less here because each win pulls the stakes back down.
ꯁ꯭ꯄꯤꯟꯊꯝꯂꯕ ꯁꯦꯜꯃꯍꯩꯆꯠꯂꯤꯕ ꯄꯨꯝꯅꯃꯛ11ꯃꯥꯏꯄꯥꯛꯄ+121ꯃꯥꯏꯊꯤꯕ032ꯃꯥꯏꯄꯥꯛꯄ+243ꯃꯥꯏꯊꯤꯕ−155ꯃꯥꯏꯊꯤꯕ−668ꯃꯥꯏꯊꯤꯕ−14713ꯃꯥꯏꯄꯥꯛꯄ−1821ꯃꯥꯏꯊꯤꯕ−22934ꯃꯥꯏꯊꯤꯕ−561055ꯃꯥꯏꯊꯤꯕ−1111189ꯃꯥꯏꯄꯥꯛꯄ−2212144ꯃꯥꯏꯊꯤꯕ−16613233ꯃꯥꯏꯊꯤꯕ−39914377ꯃꯥꯏꯄꯥꯛꯄ−22ꯃꯇꯧ ꯑꯁꯨꯝꯕ ꯃꯈꯜ ꯑꯗꯨꯗ, ꯃꯥꯏꯊꯤꯕ n ꯒꯤ ꯃꯇꯨꯡꯗ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯅꯤꯅ ꯀꯔꯤꯒꯤ ꯃꯇꯝ ꯄꯨꯝꯅꯃꯛꯇ (n + 1) ꯁꯨꯕꯥ ꯐꯤꯕꯣꯅꯥꯆꯤ ꯃꯁꯤꯡ ꯍꯥꯄꯆꯤꯜꯂꯒꯥ 1 ꯀꯥꯟꯅꯕ ꯊꯃꯖꯤꯜꯂꯤꯕꯅꯣ?
ꯄꯥꯎꯈꯨꯝ ꯎꯠꯄ
ꯄꯥꯎꯈꯨꯝ ꯃꯥꯏꯊꯤꯕ n ꯄꯨꯟꯁꯤꯜꯂꯕꯗ (n + 2) ꯁꯨꯕꯥ ꯐꯤꯕꯣꯅꯥꯆꯤ ꯃꯁꯤꯡꯗꯒꯤ 1 ꯂꯧꯊꯣꯀꯄ ꯑꯣꯏ, ꯑꯃꯁꯨꯡ ꯃꯥꯏꯄꯥꯛꯄ ꯑꯅꯤ ꯑꯗꯨ ꯃꯊꯪꯒꯤ ꯃꯁꯤꯡ ꯑꯅꯤꯅꯤ, ꯃꯈꯣꯌ ꯄꯨꯟꯅ ꯃꯗꯨꯗꯒꯤ (n + 1) ꯁꯨꯕꯥ ꯃꯁꯤꯡ ꯍꯥꯄꯆꯤꯜꯂꯒꯥ 1 ꯍꯦꯟꯅꯥ ꯆꯥꯎꯏ꯫
1, 1, 2, 3, 5 … ꯒꯤꯗꯃꯛ F₁, F₂, F₃ … ꯏꯕꯤꯌꯨ꯫ ꯃꯁꯤꯡ ꯈꯨꯗꯤꯡꯃꯛ ꯃꯃꯥꯡꯗ ꯂꯩꯕ ꯑꯅꯤꯒꯤ ꯄꯨꯟꯁꯤꯟꯕꯅꯤ꯫
ꯃꯥꯏꯊꯤꯕꯁꯤꯡ: F₁ + F₂ + … + Fₙ꯫ ꯄꯨꯟꯁꯤꯟꯕ ꯑꯗꯨꯗ 1 ꯍꯥꯄꯆꯤꯟꯕꯤꯌꯨ, F₂ ꯑꯣꯏꯅ ꯏꯗꯨꯅ, ꯑꯃꯁꯨꯡ ꯃꯗꯨ ꯄꯨꯟꯁꯤꯟꯗꯨꯅ ꯆꯠꯂꯤ: F₂ + F₁ = F₃, ꯃꯗꯨꯒꯤ ꯃꯇꯨꯡꯗ F₃ + F₂ = F₄, ꯑꯁꯤꯅꯆꯤꯡꯕ, ꯄꯨꯟꯁꯤꯟꯕ ꯄꯨꯝꯅꯃꯛ Fₙ₊₂ ꯑꯣꯏꯕ ꯐꯥꯑꯣꯕ꯫ ꯃꯔꯝ ꯑꯗꯨꯅ ꯃꯥꯏꯊꯤꯕꯁꯤꯡꯒꯤ ꯄꯨꯝꯅꯃꯛ Fₙ₊₂ − 1 ꯅꯤ꯫
ꯃꯥꯏꯄꯥꯛꯄꯁꯤꯡ ꯑꯗꯨ ꯃꯊꯪꯒꯤ ꯊꯝꯂꯕ ꯁꯦꯜ ꯑꯅꯤꯅꯤ, Fₙ₊₁ ꯑꯃꯁꯨꯡ Fₙ₊₂꯫ ꯀꯥꯟꯅꯕ ꯁꯦꯜ: Fₙ₊₁ + Fₙ₊₂ − (Fₙ₊₂ − 1) = Fₙ₊₁ + 1꯫ ꯃꯥꯏꯊꯤꯕ ꯃꯔꯤꯗ, ꯃꯗꯨ F₅ + 1 = ꯌꯨꯅꯤꯠ 6 ꯅꯤ꯫
ꯅꯣꯛꯅꯕꯒꯤ ꯀꯃꯤꯛ

ꯒꯣꯜꯗꯦꯟ ꯔꯦꯁꯤꯑꯣꯅ ꯈ꯭ꯕꯥꯏꯗꯒꯤ ꯋꯥꯡꯕ ꯕꯦꯠꯀꯤ ꯈꯣꯟꯖꯦꯜ ꯎꯅꯈꯤ꯫
ꯍꯧꯔꯛꯐꯃꯁꯤꯡ
- RouletteDoc꯫ ꯊꯧꯔꯥꯡꯒꯤ ꯃꯔꯣꯜ ꯑꯃꯁꯨꯡ ꯈꯨꯗꯃꯁꯤꯡ꯫
- Roulette77꯫ ꯊꯧꯔꯥꯡꯒꯤ ꯃꯔꯣꯜ ꯑꯃꯁꯨꯡ ꯈꯨꯗꯃꯁꯤꯡ꯫
- Ethier, S. N. The Doctrine of Chances: Probabilistic Aspects of Gambling.
- Epstein, R. A. The Theory of Gambling and Statistical Logic, 2nd ed.
- Bollman, M. Mathematics of the Big Four Casino Table Games: Blackjack, Baccarat, Craps, & Roulette.
- Sigler, L. E. Fibonacci’s Liber Abaci: A Translation into Modern English of Leonardo Pisano’s Book of Calculation.
- Singh, P. The so-called Fibonacci numbers in ancient and medieval India.