exercise:162ab46596: 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> Consider the process described in the text in which an <math>n</math>-card deck is repeatedly labelled and 2-unshuffled, in the manner described in the proof of Theorem. (See Figures \ref{fig 3.12} and \ref{fig 3.1...") |
No edit summary |
||
| Line 1: | Line 1: | ||
Consider the process described in the text in which an <math>n</math>-card deck is repeatedly labelled and 2-unshuffled, in the manner | |||
described in the proof of [[guide:21bfd24860#thm 3.3.1 |Theorem]]. (See [[guide:21bfd24860#fig 3.12|Figure]] and [[guide:21bfd24860#fig 3.13|Figure]].) The process continues until the labels are all different. Show that the process never terminates until at least <math>\lceil \log_2(n) \rceil</math> unshuffles have been done. | |||
<math>n</math>-card deck is repeatedly labelled and 2-unshuffled, in the manner | |||
described in the proof of [[guide:21bfd24860#thm 3.3.1 |Theorem]]. (See | |||
different. Show that the process never terminates until at least | |||
<math>\lceil \log_2(n) \rceil</math> unshuffles have been done. | |||
Latest revision as of 00:35, 13 June 2024
Consider the process described in the text in which an [math]n[/math]-card deck is repeatedly labelled and 2-unshuffled, in the manner described in the proof of Theorem. (See Figure and Figure.) The process continues until the labels are all different. Show that the process never terminates until at least [math]\lceil \log_2(n) \rceil[/math] unshuffles have been done.