Steinhaus–Moser notation
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, Steinhaus–Moser notation is a
notation In linguistics and semiotics, a notation is a system of graphics or symbols, characters and abbreviated expressions, used (for example) in artistic and scientific disciplines to represent technical facts and quantities by convention. Therefore, ...
for expressing certain
large number Large numbers are numbers significantly larger than those typically used in everyday life (for instance in simple counting or in monetary transactions), appearing frequently in fields such as mathematics, physical cosmology, cosmology, cryptograph ...
s. It is an extension (devised by
Leo Moser Leo Moser (11 April 1921, Vienna – 9 February 1970, Edmonton) was an Austrian-Canadian mathematician, best known for his polygon notation. A native of Vienna, Leo Moser immigrated with his parents to Canada at the age of three. He received his ...
) of
Hugo Steinhaus Hugo Dyonizy Steinhaus ( ; ; January 14, 1887 – February 25, 1972) was a Polish mathematician and educator. Steinhaus obtained his PhD under David Hilbert at Göttingen University in 1911 and later became a professor at the Jan Kazimierz Unive ...
's polygon notation.


Definitions

: 20px, n in a triangle a number in a triangle means nn. : 20px, n in a square a number in a square is equivalent to "the number inside triangles, which are all nested." : 20px, n in a pentagon a number in a pentagon is equivalent with "the number inside squares, which are all nested." etc.: written in an ()-sided polygon is equivalent with "the number inside nested -sided polygons". In a series of nested polygons, they are
associated Associated may refer to: *Associated, former name of Avon, Contra Costa County, California * Associated Hebrew Schools of Toronto, a school in Canada *Associated Newspapers, former name of DMG Media, a British publishing company See also *Associati ...
inward. The number inside two triangles is equivalent to nn inside one triangle, which is equivalent to nn raised to the power of nn. Steinhaus defined only the triangle, the square, and the circle 20px, n in a circle, which is 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". Megagon is here the name of a polygon with "mega" sides (not to be confused with the polygon with one million sides). Alternative notations: *use the functions square(x) and triangle(x) *let be the number represented by the number in nested -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)...))) 56 triangles= triangle(triangle(triangle(...triangle(256256)...))) 55 triangles~ triangle(triangle(triangle(...triangle(3.2 × 10616)...))) 54 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) = f^(2) where the superscript denotes a
functional power In mathematics, function composition is an operation that takes two function (mathematics), functions and , and produces a function such that . In this operation, the function is function application, applied to the result of applying the ...
, not a numerical power. We have (note the convention that powers are evaluated from right to left): *M(256,2,3) = (256^)^=256^ *M(256,3,3) = (256^)^=256^=256^256^ Similarly: *M(256,4,3) ≈ *M(256,5,3) ≈ *M(256,6,3) ≈ etc. Thus: *mega = M(256,256,3)\approx(256\uparrow)^257, where (256\uparrow)^ 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 In mathematics, Knuth's up-arrow notation is a method of notation for very large integers, introduced by Donald Knuth in 1976. In his 1947 paper, R. L. Goodstein introduced the specific sequence of operations that are now called ''hyperoperati ...
. 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^ *M(256,2,3)\approx10^ (\log _ 616 is added to the 616) *M(256,3,3)\approx10^ (619 is added to the 1.99\times 10^, which is negligible; therefore just a 10 is added at the bottom) *M(256,4,3)\approx10^ ... *mega = M(256,256,3)\approx(10\uparrow)^1.99\times 10^, where (10\uparrow)^ denotes a functional power of the function f(n)=10^n. Hence 10\uparrow\uparrow 257 < \text < 10\uparrow\uparrow 258


Moser's number

It has been proven that in
Conway chained arrow notation Conway chained arrow notation, created by mathematician John Horton Conway, is a means of expressing certain extremely large numbers. It is simply a finite sequence of positive integers separated by rightward arrows, e.g. 2\to3\to4\to5\to6. As wit ...
, :\mathrm < 3\rightarrow 3\rightarrow 4\rightarrow 2, and, in
Knuth's up-arrow notation In mathematics, Knuth's up-arrow notation is a method of notation for very large integers, introduced by Donald Knuth in 1976. In his 1947 paper, R. L. Goodstein introduced the specific sequence of operations that are now called ''hyperoperati ...
, :\mathrm < f^(4) = f(f(f(4))), \text f(n) = 3 \uparrow^n 3. Therefore, Moser's number, although incomprehensibly large, is vanishingly small compared to
Graham's number Graham's number is an immense number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers such as Skewes's number and Moser's number, both of which ar ...
:Proof that G >> M
/ref> :\mathrm \ll 3\rightarrow 3\rightarrow 64\rightarrow 2 < f^(4) = \text.


See also

*
Ackermann function In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total ...


References


External links


Robert Munafo's Large Numbers


(Steinhaus referred to this number as "megiston" with no "r".)
Steinhaus-Moser Notation - Pointless Large Number Stuff
{{DEFAULTSORT:Steinhaus-Moser notation Mathematical notation Large numbers