World Library  
Flag as Inappropriate
Email this Article

Moser's number

Article Id: WHEBN0000363106
Reproduction Date:

Title: Moser's number  
Author: World Heritage Encyclopedia
Language: English
Subject: List of numbers, Graham's number, Orders of magnitude (numbers), Steinhaus–Moser notation
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Moser's number

In mathematics, Steinhaus–Moser notation is a notation for expressing certain extremely large numbers. It is an extension of Steinhaus's polygon notation.

Definitions

a number n in a triangle means nn.
a number n in a square is equivalent to "the number n inside n triangles, which are all nested."
a number n in a pentagon is equivalent with "the number n inside n squares, which are all nested."

etc.: n written in an (m + 1)-sided polygon is equivalent with "the number n inside n nested m-sided polygons". In a series of nested polygons, they are associated inward. The number n inside two triangles is equivalent to nn inside one triangle, which is equivalent to nn raised to the power of nn.

Steinhaus only defined the triangle, the square, and a circle , equivalent to the pentagon defined above.

Special values

Steinhaus defined:

  • mega is the number equivalent to 2 in a circle:
  • megiston is the number equivalent to 10 in a circle: ⑩

Moser's number is the number represented by "2 in a megagon", where a megagon is a polygon with "mega" sides.

Alternative notations:

  • use the functions square(x) and triangle(x)
  • let M(n, m, p) be the number represented by the number n in m nested p-sided polygons; then the rules are:
    • M(n,1,3) = n^n
    • M(n,1,p+1) = M(n,n,p)
    • M(n,m+1,p) = M(M(n,1,p),m,p)
  • and
    • mega = M(2,1,5)
    • megiston = M(10,1,5)
    • moser = M(2,1,M(2,1,5))

Mega

A mega, ②, is already a very large number, since ② = square(square(2)) = square(triangle(triangle(2))) = square(triangle(22)) = square(triangle(4)) = square(44) = square(256) = triangle(triangle(triangle(...triangle(256)...))) [256 triangles] = triangle(triangle(triangle(...triangle(256256)...))) [255 triangles] ~ triangle(triangle(triangle(...triangle(3.2 × 10616)...))) [254 triangles] = ...

Using the other notation:

mega = M(2,1,5) = M(256,256,3)

With the function f(x)=x^x we have mega = f^{256}(256) = f^{258}(2) where the superscript denotes a functional power, not a numerical power.

We have (note the convention that powers are evaluated from right to left):

  • M(256,2,3) = (256^{\,\!256})^{256^{256}}=256^{256^{257}}
  • M(256,3,3) = (256^{\,\!256^{257}})^{256^{256^{257}}}=256^{256^{257}\times 256^{256^{257}}}=256^{256^{257+256^{257}}}256^{\,\!256^{256^{257}}}

Similarly:

  • M(256,4,3) ≈ {\,\!256^{256^{256^{256^{257}}}}}
  • M(256,5,3) ≈ {\,\!256^{256^{256^{256^{256^{257}}}}}}

etc.

Thus:

  • mega = M(256,256,3)\approx(256\uparrow)^{256}257, where (256\uparrow)^{256} denotes a functional power of the function f(n)=256^n.

Rounding more crudely (replacing the 257 at the end by 256), we get mega ≈ 256\uparrow\uparrow 257, using Knuth's up-arrow notation.

After the first few steps the value of n^n is each time approximately equal to 256^n. In fact, it is even approximately equal to 10^n (see also approximate arithmetic for very large numbers). Using base 10 powers we get:

  • M(256,1,3)\approx 3.23\times 10^{616}
  • M(256,2,3)\approx10^{\,\!1.99\times 10^{619}} (\log _{10} 616 is added to the 616)
  • M(256,3,3)\approx10^{\,\!10^{1.99\times 10^{619}}} (619 is added to the 1.99\times 10^{619}, which is negligible; therefore just a 10 is added at the bottom)
  • M(256,4,3)\approx10^{\,\!10^{10^{1.99\times 10^{619}}}}

...

  • mega = M(256,256,3)\approx(10\uparrow)^{255}1.99\times 10^{619}, where (10\uparrow)^{255} denotes a functional power of the function f(n)=10^n. Hence 10\uparrow\uparrow 257 < \text{mega} < 10\uparrow\uparrow 258

Moser's number

It has been proven that in Conway chained arrow notation,

\mathrm{moser} < 3\rightarrow 3\rightarrow 4\rightarrow 2,

and, in Knuth's up-arrow notation,

\mathrm{moser} < f(f(f(4))), \text{ where } f(n) = 3 \uparrow^n 3.

Therefore Moser's number, although incomprehensibly large, is vanishingly small compared to Graham's number:

\mathrm{moser} \ll 3\rightarrow 3\rightarrow 64\rightarrow 2 < f^{64}(4) = \text{Graham's number}.

See also

External links

  • Robert Munafo's Large Numbers
  • Factoid on Big Numbers
  • Megistron at mathworld.wolfram.com
  • Circle notation at mathworld.wolfram.com
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.