exercise:05ecec9aab: Difference between revisions

From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> The ''Labouchere system'' for roulette is played as follows. Write down a list of numbers, usually 1, 2, 3, 4. Bet the sum of the first and last, <math>1 + 4 = 5</math>, on red. If you win, delete the first and last numbers from your list. If...")
 
No edit summary
 
Line 1: Line 1:
<div class="d-none"><math>
The ''Labouchere system'' for roulette is played as follows.  Write down a list of numbers, usually 1, 2, 3, 4.  Bet the sum of the first and last, <math>1 + 4 = 5</math>, on red.  If you win, delete the first and last numbers from your list.  If you lose, add the amount that you last bet to the end of your list.  Then use the new list and bet the sum of the first and last numbers (if there is only one number, bet that amount).  Continue until your list becomes empty.  Show that, if this happens, you win the sum, <math>1 + 2 + 3 + 4= 10</math>, of your original list.  Simulate this system and see if you do always stop and, hence, always win.  If so, why is this not a foolproof gambling system?
\newcommand{\NA}{{\rm NA}}
\newcommand{\mat}[1]{{\bf#1}}
\newcommand{\exref}[1]{\ref{##1}}
\newcommand{\secstoprocess}{\all}
\newcommand{\NA}{{\rm NA}}
\newcommand{\mathds}{\mathbb}</math></div> The ''Labouchere system''  
for roulette is played
as follows.  Write down a list of numbers, usually 1, 2, 3, 4.  Bet the sum
of
the first and last, <math>1 + 4 = 5</math>, on red.  If you win, delete the first and
last
numbers from your list.  If you lose, add the amount that you last bet to the
end of your list.  Then use the new list and bet the sum of the first and
last
numbers (if there is only one number, bet that amount).  Continue until your
list becomes empty.  Show that, if this happens, you win the sum, <math>1 + 2 + 3
+ 4
= 10</math>, of your original list.  Simulate this system and see if you do always
stop and, hence, always win.  If so, why is this not a foolproof gambling
system?

Latest revision as of 21:13, 12 June 2024

The Labouchere system for roulette is played as follows. Write down a list of numbers, usually 1, 2, 3, 4. Bet the sum of the first and last, [math]1 + 4 = 5[/math], on red. If you win, delete the first and last numbers from your list. If you lose, add the amount that you last bet to the end of your list. Then use the new list and bet the sum of the first and last numbers (if there is only one number, bet that amount). Continue until your list becomes empty. Show that, if this happens, you win the sum, [math]1 + 2 + 3 + 4= 10[/math], of your original list. Simulate this system and see if you do always stop and, hence, always win. If so, why is this not a foolproof gambling system?