\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand*\HyPL@Entry[1]{}
\citation{borgmann65}
\citation{gardner66}
\citation{gardner90}
\citation{bgs}
\citation{kravitz}
\citation{zerger}
\citation{ecker86}
\citation{ecker87}
\citation{ecker99}
\HyPL@Entry{0<</S/D>>}
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction and initial definitions}{1}{section.1}}
\newlabel{section:intro}{{1}{1}{Introduction and initial definitions}{section.1}{}}
\citation{sloan}
\citation{ecker99}
\citation{guy}
\citation{grundman}
\citation{cai}
\citation{sloan}
\newlabel{eq:iterates}{{1}{2}{Introduction and initial definitions}{equation.1.1}{}}
\newlabel{convergence}{{1}{2}{}{theorem.1}{}}
\citation{sloan}
\@writefile{toc}{\contentsline {section}{\numberline {2}Zero through six iterations}{3}{section.2}}
\newlabel{section:zerotosix}{{2}{3}{Zero through six iterations}{section.2}{}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces The words needed for naming all nonnegative integers less than 1000 grouped by length.}}{3}{table.1}}
\newlabel{table:words}{{1}{3}{The words needed for naming all nonnegative integers less than 1000 grouped by length}{table.1}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces A partial digraph representation of the first six iterated sets of $\mathcal  {W}$.}}{4}{figure.1}}
\newlabel{fi:graph}{{1}{4}{A partial digraph representation of the first six iterated sets of $\mathcal {W}$}{figure.1}{}}
\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The smallest nonnegative integer $T_n$ that requires exactly $n$ characters to spell.}}{4}{table.2}}
\newlabel{table:tn}{{2}{4}{The smallest nonnegative integer $T_n$ that requires exactly $n$ characters to spell}{table.2}{}}
\citation{flegg}
\citation{flegg}
\citation{marre1}
\citation{marre2}
\citation{marre3}
\@writefile{toc}{\contentsline {section}{\numberline {3}An etymology of the names of large numbers -- and a choice}{5}{section.3}}
\citation{flegg}
\citation{moss}
\citation{locke}
\citation{moss}
\citation{cajori}
\citation{cajori}
\citation{smithd}
\citation{greenwood}
\citation{leonard}
\citation{slack}
\citation{cajori}
\@writefile{toc}{\contentsline {section}{\numberline {4}Representing integers}{7}{section.4}}
\newlabel{t1}{{4}{7}{}{theorem.4}{}}
\citation{kbr}
\@writefile{lot}{\contentsline {table}{\numberline {3}{\ignorespaces The three different naming conventions and the corresponding names of $10^9$.}}{8}{table.3}}
\newlabel{table:scale}{{3}{8}{The three different naming conventions and the corresponding names of $10^9$}{table.3}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Seven iterations}{8}{section.5}}
\newlabel{section:seven}{{5}{8}{Seven iterations}{section.5}{}}
\citation{dictionary}
\newlabel{eq:Mk}{{2}{9}{Seven iterations}{equation.5.2}{}}
\newlabel{theorem:tau7}{{5}{9}{}{theorem.5}{}}
\@writefile{toc}{\contentsline {section}{\numberline {6}Extending the names of large numbers}{9}{section.6}}
\newlabel{section:CGW}{{6}{9}{Extending the names of large numbers}{section.6}{}}
\citation{pike1}
\citation{washington}
\citation{pike2}
\citation{southey}
\citation{slack}
\citation{slack}
\citation{heath}
\citation{holbrook}
\citation{loomis}
\citation{borgmann65}
\citation{slack}
\citation{holbrook}
\citation{henkle}
\citation{brooks}
\citation{borgmann68-1}
\citation{borgmann68-2}
\citation{candelaria75}
\citation{candelaria76}
\citation{ondrejka}
\@writefile{lot}{\contentsline {table}{\numberline {4}{\ignorespaces The Latin name designations as they appear in modern dictionaries. }}{10}{table.4}}
\newlabel{table:dictionarynames}{{4}{10}{The Latin name designations as they appear in modern dictionaries}{table.4}{}}
\citation{conway}
\newlabel{def:CGWsystem}{{6}{11}{\it The CGW system\rm }{theorem.6}{}}
\newlabel{eq:L}{{3}{11}{\it The CGW system\rm }{equation.6.3}{}}
\citation{knn}
\newlabel{eq:Gamma}{{4}{12}{\it The CGW system\rm }{equation.6.4}{}}
\newlabel{eq:etanu}{{5}{12}{\it The CGW system\rm }{equation.6.5}{}}
\@writefile{lot}{\contentsline {table}{\numberline {5}{\ignorespaces The components of the base strings of the Chuquet names and the CGW system.}}{12}{table.5}}
\newlabel{table:CGW}{{5}{12}{The components of the base strings of the Chuquet names and the CGW system}{table.5}{}}
\@writefile{lot}{\contentsline {table}{\numberline {6}{\ignorespaces Components of $\Phi _{\eta _1,\eta _3}$ for the CGW system (where $\eta _2 = 0$).}}{13}{table.6}}
\newlabel{table:Phi}{{6}{13}{Components of $\Phi _{\eta _1,\eta _3}$ for the CGW system (where $\eta _2 = 0$)}{table.6}{}}
\@writefile{lot}{\contentsline {table}{\numberline {7}{\ignorespaces Components of $\Psi _{\eta _1,\eta _2}$ for the CGW system (where $\eta _2 > 0$ and $\eta _3 \in \mathbb  {N}_{10}$).}}{14}{table.7}}
\newlabel{table:Psi}{{7}{14}{Components of $\Psi _{\eta _1,\eta _2}$ for the CGW system (where $\eta _2 > 0$ and $\eta _3 \in \mathbb {N}_{10}$)}{table.7}{}}
\@writefile{toc}{\contentsline {section}{\numberline {7}The Completion of the Proof of Theorem \ref  {convergence}}{14}{section.7}}
\newlabel{section:completion}{{7}{14}{The Completion of the Proof of Theorem \ref {convergence}}{section.7}{}}
\newlabel{eq:lengthWn}{{6}{14}{The Completion of the Proof of Theorem \ref {convergence}}{equation.7.6}{}}
\citation{noll}
\@writefile{toc}{\contentsline {section}{\numberline {8}Counting the contributions of $\mu _\eta $ in the CGW system}{15}{section.8}}
\newlabel{section:mu}{{8}{15}{Counting the contributions of $\mu _\eta $ in the CGW system}{section.8}{}}
\newlabel{eq:setnumbers}{{7}{15}{Counting the contributions of $\mu _\eta $ in the CGW system}{equation.8.7}{}}
\@writefile{toc}{\contentsline {section}{\numberline {9}Generating functions}{16}{section.9}}
\newlabel{lemma:gf}{{7}{16}{{\it Generating functions for base-$b$ digit counting}\rm }{theorem.7}{}}
\newlabel{eq:q}{{8}{16}{{\it Generating functions for base-$b$ digit counting}\rm }{equation.9.8}{}}
\newlabel{eq:s}{{9}{16}{{\it Generating functions for base-$b$ digit counting}\rm }{equation.9.9}{}}
\newlabel{lemma:gfcor}{{8}{18}{}{theorem.8}{}}
\newlabel{lemma:PT}{{9}{18}{}{theorem.9}{}}
\@writefile{toc}{\contentsline {section}{\numberline {10}Eight iterations}{18}{section.10}}
\newlabel{theorem:F}{{10}{19}{}{theorem.10}{}}
\newlabel{eq:F(x)}{{10}{19}{Eight iterations}{equation.10.10}{}}
\newlabel{eq:on}{{11}{20}{Eight iterations}{equation.10.11}{}}
\newlabel{eq:illi}{{12}{20}{Eight iterations}{equation.10.12}{}}
\newlabel{eq:hundreds}{{17}{20}{Eight iterations}{equation.10.17}{}}
\newlabel{eq:D6}{{24}{21}{Eight iterations}{equation.10.24}{}}
\newlabel{theorem:tau8}{{11}{21}{}{theorem.11}{}}
\citation{sloan}
\citation{brooks}
\citation{heath}
\citation{holbrook}
\citation{locke}
\citation{loomis}
\citation{pike1}
\citation{pike2}
\citation{slack}
\citation{southey}
\bibcite{washington}{1}
\@writefile{lot}{\contentsline {table}{\numberline {8}{\ignorespaces A selection of coefficients of $F(x)$ given in Theorem \ref  {theorem:F}.}}{22}{table.8}}
\newlabel{table:coefficients}{{8}{22}{A selection of coefficients of $F(x)$ given in Theorem \ref {theorem:F}}{table.8}{}}
\newlabel{eq:tau8inequality}{{25}{22}{Eight iterations}{equation.10.25}{}}
\@writefile{toc}{\contentsline {section}{\numberline {11}Concluding remarks}{22}{section.11}}
\@writefile{toc}{\contentsline {section}{\numberline {12}Acknowledgement}{22}{section.12}}
\bibcite{bgs}{2}
\bibcite{borgmann65}{3}
\bibcite{borgmann68-1}{4}
\bibcite{borgmann68-2}{5}
\bibcite{brooks}{6}
\bibcite{cai}{7}
\bibcite{cajori}{8}
\bibcite{candelaria75}{9}
\bibcite{candelaria76}{10}
\@writefile{lot}{\contentsline {table}{\numberline {9}{\ignorespaces Minimal nonnegative integer requiring exactly $k$ iterations of $\mathcal  {W}$ to reach the fixed point.}}{23}{table.9}}
\newlabel{table:summary}{{9}{23}{Minimal nonnegative integer requiring exactly $k$ iterations of $\mathcal {W}$ to reach the fixed point}{table.9}{}}
\bibcite{conway}{11}
\bibcite{ecker86}{12}
\bibcite{ecker87}{13}
\bibcite{ecker99}{14}
\bibcite{flegg}{15}
\bibcite{gardner66}{16}
\bibcite{gardner90}{17}
\bibcite{greenwood}{18}
\bibcite{grundman}{19}
\bibcite{guy}{20}
\bibcite{heath}{21}
\bibcite{henkle}{22}
\bibcite{holbrook}{23}
\bibcite{knn}{24}
\bibcite{kbr}{25}
\bibcite{kravitz}{26}
\bibcite{leonard}{27}
\bibcite{locke}{28}
\bibcite{loomis}{29}
\bibcite{marre1}{30}
\bibcite{marre2}{31}
\bibcite{marre3}{32}
\bibcite{moss}{33}
\bibcite{noll}{34}
\bibcite{ondrejka}{35}
\bibcite{pike1}{36}
\bibcite{pike2}{37}
\bibcite{slack}{38}
\bibcite{sloan}{39}
\bibcite{smithd}{40}
\bibcite{southey}{41}
\bibcite{dictionary}{42}
\bibcite{zerger}{43}