Kerem's Number

Kerem's Number is a number coined by Gogology wiki user AblanGG.Kerem's Numbers - Kerem's Number. Retrieved UTC 2023-08-09 05:08. Kerem's Numbers - Kerem's Number. Retrieved UTC 2023-08-09 22:37. Kerem's Numbers - Kerem's Number. Retrieved UTC 2023-08-10 09:35. Unfortunately, the number just has a rough description of the idea of the definition, and hence is ill-defined.
== Definition ==
=== Original version ===
Here is a copy of the original source:
13! = 13x12x....2x1
13¡= (13!x12!x11!....2!x1)^(13!x12!x11!...2!x1)^.......^(13!x12!x11!x.....x1) it has 13!x12!x....2!x1 amount of power tower
13¡¡¡...(n amount of ¡'s)...¡¡^m means that if you want to write without (^m) than you have to write (n!xn-1!...1!)^(n!xn-1!...1!)^.......^(n!xn-1!...1) (m amount of power tower) amount of ¡'s
k1= Googolplexian¡¡¡....¡¡^Googolplexian there is Googolplexian¡¡¡¡....(Googolplexian amount of ¡'s)...¡¡^Googolplexian amount of ¡'s
k2=k1¡¡¡......¡¡^k1 there is k1¡¡¡...(k1 amount of ¡'s)...¡¡^k1 amount of ¡'s
k3= k2¡¡¡......¡¡^k2 there is k2¡¡¡...(k2 amount of ¡'s)...¡¡^k2 amount of ¡'s
.
.
.
K = kk100
K is Kerem's Number.
=== Second version ===
Here is a copy of the updated source:
n! = nxn-1x....2x1
n¡= (n!xn-1!xn-2!....2!x1)^(n!xn-1!xn-2!...2!x1)^.......^(n!xn-1!xn-2!x.....x1) it has n!xn-1!x....2!x1 amount of power tower
n¡¡¡...(z amount of ¡'s)...¡¡^m means that if you want to write without (^m) [n¡¡¡....¡¡¡] than you have to write (z!xz-1!...1!)^(z!xz-1!...1!)^.......^(z!xz-1!...1) (m amount of power tower) amount of ¡'s next to n
k1= Googolplexian¡¡¡....¡¡^Googolplexian there is Googolplexian¡¡¡¡....(Googolplexian amount of ¡'s)...¡¡^Googolplexian amount of ¡'s
k2= k1¡¡¡......¡¡^k1 there is k1¡¡¡...(k1 amount of ¡'s)...¡¡^k1 amount of ¡'s
k3= k2¡¡¡......¡¡^k2 there is k2¡¡¡...(k2 amount of ¡'s)...¡¡^k2 amount of ¡'s
.
.
.
K = kk100
K is Kerem's Number.
=== Third version ===
Here is a copy of the updated source:
Please look at Right-Reverse Factorial Notation
k1= Googolplexian¡¡¡....¡¡^Googolplexian there is Googolplexian¡¡¡¡....(Googolplexian amount of ¡'s)...¡¡^Googolplexian amount of ¡'s
k2= k1¡¡¡......¡¡^k1 there is k1¡¡¡...(k1 amount of ¡'s)...¡¡^k1 amount of ¡'s
k3= k2¡¡¡......¡¡^k2 there is k2¡¡¡...(k2 amount of ¡'s)...¡¡^k2 amount of ¡'s
.
.
.
K = kk100
K is Kerem's Number.
== Issues ==
The description includes massive repetition of ellipses and logical gaps causing the incompleteness of the definition. For example, the explanation just provides examples of the computation of a notation only for the case where the leading number is 13, while the explanation is not applicable to the coined number.
* The creator later half solved the problem, by putting n as the leading number of the notation. However, the domains for m, n and z are not declared.
==Sources==
Category:Numbers
Category:Incomplete
Category:Unformalised