
2
Today I am going to reveal the 3rd number in the Lauffer sequence to construct this number we of course must use swoops notation (n)(p)(o)((x))
We denote (n) to equal 1 trillion^trillion^trillion^trillion^trillion...(1 trillion 1 trillion to the power of 1 trillion following the first trillion you write down.) In other words you starts with 1 trillion and you write a tower of 1 trillion 1 trillions after it how simple could that be. we then integrate (p) into the number what this does is that (n) to the power of (n) (n) times to get a better glimpse into what this means read my other blogs on the lauffer sequence. Next we include the (o) what this does is repeats what you did for (p) (n)(p) times. Finally we include the ((x)) what this …
Read more > 
So I decided it was better if I showed you the actual content of the blog posts instead of me trying to explain. It also contains Swoop's notations.
Decagraham10^g64
A Decagraham isdefined as a 1 followed by a g64 (grahams number) number of zeros.
maxilucal number
the Mailucal number is defined as 10^10^10^10^10...10 where the number of ^10's is 10^10^10^10^10.
Franks Number is equal to 10!!!!!!!... where the number of factorial signs exeeds the number of books the library of babel raised to power of itself 65 octillion times.
The kano Loptical number can be defined as 10 then followed by 10 up arrows then 10.
The MCSICKLE number is defined as 5 followed by 5^5^5^5^5 arrows then 5.
The Wollion is equal to 5 followed by a power tower of googolpex n…
Read more > 
So I have decided to invent a new number called forts number I define it as (n) as in the (n) from my swoops notation where (n)= 1 billion with a tower of 1 billion 1 billions following it. 1000,000,000^1000,0000,0000^1000,0000,000...(1 billion ^ 1 billion minus the first billion.) The reason for this number is simply because I liked the look of it and nothing else.
Read more > 
Please do not ignore this blogpost because I have something very important to ask you fellow googologists why do you keep ignoring my blog posts all I'm asking is questions whats wrong with that?
Read more > 
Today I am writing about something not connected to Googology instead I am going to talk about super tasks in other words a task with a countably infinite ammount of steps but the task it self takes a finite length of time. For example imagine that you have a cake ready for your friends birthday celebration and there is an infinite number of people at the celebration is it possible to give all those people a slice of cake. Well to prove that you can cut a cake into an infinite number of pieces in just two pieces I will use a simple thought experiment first take the sharpest knife you have and cut the cake in half. Next wait 1 minute or half the time to cut the cake in half again wait 30 seconds or half of that to cut the cake in half again…
Read more > 
I have been wondering if people have any ideas as to what sbiis saiban's iq could be as he says that he started doing this when he was 7 years old leave your comments down below to what you think .
Read more > 
So I have been wondering if people like my notation leave a comment down below to what you think.
Read more > 
Presuming that you have seen my Lauffers number of the first kind it is now time to go on to the second kind.
As usual we use swoops notation mainly (n)(p)(o)((x)
We make (n)=1000000 followed by a power tower of 1 million 1 millions In other words there is a tower of 1 million 1 millions stacked onto the base number 1 million or in other words the first milllion. This process is the same as the last Lauffers number only instead of one thousand we use million. once you have got that tower of 1 million 1 millions stacked onto the base number one million you now incorporate the (p) into the notation. What this does is that it raises the number you got previously to the power of itself you then repeat the process you then raise that number to…
Read more > 
This is my attempt to create system, which gives possibility to define fundamental sequences for all limit ordinals up to Large Veblen Ordinal (LVO). Unfortunately I found no one sourse where somebody gives detailed definition for fundamental sequences for all limit ordinals between Gamma_0 and LVO. And that is why I created this FSsystem, using only the system of fundamental sequences for binary Veblen function as the prototype. Previously I published part of this system on this page of wikia as well as on my site.
Let
Read more > 
I have decided to invent a brand new number that will be bigger than any number I have written about so far.
I have decided to call it Lauffer number of the 1st kind.
Lauffers number follows my swoops notation in its construction mainly (n)(p)(o)((x))
Here are the instructions or as I like to call them the recipe for making this number.
step 1: begin (n) make it equal to 1000 followed by a power tower of 1000 1000's
In other words there is a tower of 1000 1000's stacked onto the base number 1000.
Like this: 1000^1000^1000^1000^1000^1000..^1000 (1000 1000's in the tower not including the first 1000)
Once you have got that out of the way you move onto the (p) function what this does is raises the number you got previously to the power of itself …
Read more > 
I have been wondering what pataphysics is and also how does it relate to googology any suggestions?
Read more > 
So I was wondering what people felt about my swoops notation anywhats are the pros and cons also any suggestions to how I could improve it?
Read more > 
I was wondering if someone could make a page on the wiki to do with my numbers thank you.
Read more > 
Review of operators from successor function to tetration.
Although people have been saying in the comments that I should just stick to my previous notations I personally feel that I won't be satisfied with the notation until it is absolutely perfect with no chances of confusing any one.
To start off I am going to review what I would call the genesis operators of googology mainly addition and multiplication although this may seem like a waste of time I feel that it is essential for my notation.
Before we start off with that we are going to review the successor function mainly s(n)=n+1
examples of the successor function are s(1)=2
Moving onto addition the 2nd most simple operator it represents the sum of two numbers.
An example of addition is th…
Read more > 
How do you calculate how many different possiple games of chess can be played any suggestions?
Read more > 
 Droppingdropper array notation
 Droppingdropperdropper array notation
 Iterateddropper array notation
 Nestediterateddropper array notation
 Iterateddropperiterateddropper array notation
 Secondorderiterated dropper array notation
 Higherorder iternated dropper array notation
 Nestedorder iterated dropper array notation
 Iteratedorder iterated dropper array notation
 Superiterated dropper array notation
 Iterated superiterated dropper array notation
 Secondorder Iterated superiterated dropper array notation
 Superiterated superiterated dropper array notation
 Secondorder superiterated dropper array notation
 Higherorder superiterated dropper array notation
 Hyperiterated dropper array notation
 Higher superorder iterated array (Iterated means firstsup…

This number is defined using my swoops notation as (10000)(20000)(40000)((500))((1000)).
Read more > 
Can someone please explain to me what recursion is because I need it for constructing new notation and bigger numbers.
Read more > 
So I was wondering about what I could do to improve the notation I created any suggestions.
Read more > 
Do you think I'm intelligent explain your answer.
Read more > 
Laudens number
Although I Have by people in the comments not to use up arrows I feel like I have to express this number in a way that will get people to see just how big it is so here go's.
you start with 10↑10 or in layman's terms 10^10 You then place 10↑10 number of arrows between the tens. you then put that many arrows between the 10's After that you repeat it 10↑↑↑↑10 times.
Read more > 
Improved version of swoops notation
This is the improved version of my 1st notation mainly npo(x)(y)
For this improved version we start like this (n) this means that you take (n) and make a power tower of (n) height.
so if n=2 then you get 2^2^2 although this looks like a tower of 3 2's the base ie the 1st 2 doesn't count.
(n)(p) means that you repeat the (n) operation) (n) times you then repeat that another (n) times then repeat that another (n) times so in total you repeat this process (n) times.
by repeat I mean that you literally copy and past that tower you got from your starting number n and copy that power tower that many times. so for you would copy and paste 2^2^2 2^2^2 times you repeat the process that many times.
(n)(p)(o) …
Read more > 
This is the a new type of notation that I have decided to name swoops notation ii as in 2.
To start off you take n and like before this equals a positive integer.
so for example n could 10
you then place parentheses around the number you have chosen for n l so for example 10 would be (10)
By doing this you raise it to the power of itself of n times so for (10) you get 10^10^10^10^10^10^10^10^10^10.
you then place double parentheses around the number this means that you repeat the (10) operation that many times.
so that means that if you have a tower that looks like this 10^10^10^10^10^10^10^10^10^10 you literally copy and paste this that many times making a gigantic tower.
Triple brackets means that you repeat the double bracket operation double …
Read more > 
Well seeing as people have been saying I should create my own notation I have decided to give it a go.
I call it swoops notation you start with n where n= a positive integer say 5 the next level above that is np this means n raised to itself p times so if n=5 and p=6 then np=5^5^5^5^5^5^5 or 5 followed by a tower of 6 5's. above that is npo this means that you repeat the np operation o times. For example if np=5^5^5^5^5^5^5 and o=10 you repeat the np operation 10 times giving you a tower of 60 5's after that base number 5. Above that is the npo(x)this means that you repeat the npo operation x times this means that if npo =5 followed by a tower of 60 5's and (x)=100 you raise the number of things in the tower to that value (x)b…
Read more > 
I have been wondering how long it would theoretically take for someone to count to a googolplex.
I say theoretically because practically speaking this task is literally impossible to perform.
Read more > 
To construct this number you first start with ten you then multiply it by ten to get 100 after that you multiply the 100 you got previously to get ten thousand you then multiply the ten thousand by ten thousand to get 100 million you multiply the 100 million by 100million to 10 quadrillion you then multiply ten quadrillion by quadrillion to get 100 nonillion or ten to the 32 you then square that number to 10^64 you square that number to get 10^128 you square it again to get 10^256 you square it again to get 10^512 you square it again to get 10^1024 you square it again to get 10^2048. You then move on from squaring and start raising it to the power of 4 and no this isn't a typo.After you raise the number you got previously to the power of …
Read more > 
I have decided to define a Tetrallion as 4^4^4^4 raised to the power of 4 where the number of ^4's is 4^4^4^4.
Although this definition is short it is the best I could come up with at the time of writing this.
Read more > 
http://googology.wikia.com/wiki/Exulinoogol
100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
is exulinoogol
http://googology.wikia.com/wiki/Mega_Bukuwaha
The Big Bukuwaha is equal to \(\{100,100\ E\ 2\}\) in BEAF, where E is a Quabinga Bukuwaha array of lugion marks. It is also equal to \(\{…
Read more > 
to obtain this number you first take the number of ways to arrange 6 objects 720=6!=6*5*4*3*2*1
you then take 6! and factorial that number (720) to get 6!!
you then take 6!! and double how many factorial signs they are to make 6!!!!
you then add another ! sign to make 6!!!!!
after that you double the number of !'s again to get 6!!!!!!!! you then repeated this process of doubling the number of ! signs until you have doubled it 2^10^20^40^80^7687 number of times. Now that's big.
Read more > 
A Frogillion is found the same way Grahams number is found only my number is a lot lot bigger than Grahams. you start with G64(grahams number)you then take 3 place g64 number of arrows to get g65 you repeat this process until you get to gg64 or g grahams number.
Read more > 
This is equal to 5↑ ↑ ↑ ↑ ...↑ ↑ ↑ ↑ 5 where the number of arrows is 5↑ ↑ ↑ ↑ 5.
Read more > 
Tomb number is equal to 10↑↑↑↑↑↑↑...↑↑↑↑↑↑↑10 where the number of arrows is equal to grahams number.
Read more > 
To obtain the Squid number you first start with 10 like so you then raise it to the power of ten like so 10^10 after that you raise that to the power of ten like 10^10^10. You repeat this until you have ten 10^'s like so 10^10^10^10^10^10^10^10^10^10 now although this number is big it is knowhere near the squids number.
You then repeat this 10^10^10^10^10^10^10^10^10^10 times.
you then repeat the process of repeating 10^10^10^10^10^10^10^10^10^10 that many times.
This is squids Number.
Read more > 
OK I was wondering today if anyone could guess my age if they get it to within 5 years I will make a comment on one of their blogs. good luck.
Read more > 
This number is constructed by the following format 3↑3=3^3 then 3↑ ↑ 3=3^3^3=3^27=7625597484987
Read more >
3↑↑↑3=3^3^3... where the number of threes in the power tower is 3↑↑3 3↑↑↑↑3=3^3^3... where the number of threes in the tower is 3↑↑↑3 we call this number g1 g2= 3 followed by a g1 number of arrows then 3 you repeated this process until you get down to g3↑↑↑3 then you are finished. 
Here is the list of the numbers he created, so you don't have to go through all of the blog posts.
 Vargos Number = not defined yet
 Abraham's Number = 666^^666
 Megagoolagon = 10^{9}PT(999) (I don't know what the definition of xPT(y) is.)
 Frank's Number = 10!n, where a!1 = a!, a!b (b>1) = (a!)!b1, and n>(Number of books in the Library of Babel)^{65*1027}
 Wollion = 5^{6^^1010100}
 Tetrallion = (4^^4)^{4} , but f(1) = e((n)(p)(o)((x))), g(x) works the same as f(x) but g(1) = f(e((n)(p)(o)((x)))), h(x) works the same as f(x) but h(1) = g(f(e((n)(p)(o)((x)))), and FINALLY, h(x) = x^^x.
(x) = x^^x
Read more > 
The super silly number is equal to 10↑↑↑10
Read more > 
Abraham's number is equal to 666↑↑666
Read more > 
Hi there just been wandering what books I should get to enhance my abilities as googologist.
Read more > 
I have been wondering where you can get up arrows from since I need them to write up arrow notation.
Read more > 
The megagoolagon is equal to 1000000000PT (power tower) (999)
Read more > 
The Wollion is equal to 5 followed by a power tower of googolpex number 6's
Read more > 
I hereby propose the usage of letters beyond P as an ordinal ruler. This is an semiformal extension of my letter notation (yes, I'm aware none of this is formally defined until I actually define a specific notation for these scales of numbers. I'm not claiming otherwise. It's just a suggestion for a continuation, which  in the mean time  serve as a rough ruler)
For integers n>2, 0
Read more > 
The MCSICKLE number is defined as 5 followed by 5^5^5^5^5 arrows then 5.
Read more > 
The kano Loptical number can be defined as 10 then followed by 10 up arrows then 10.
Read more > 
Franks Number is equal to 10!!!!!!!... where the number of factorial signs exeeds the number of books the library of babel raised to power of itself 65 octillion times.
Read more > 
One disadvantage of my letter notation (defined here) is that one can't immediately tell how a given number is constructed. For example, it is easy to see immediately that G2.671 is between G2=10↑↑↑2 and G3=10↑↑↑3, but there's no way to make sense of the ".671" without doing an actual calculation:
G2.671 = FF(10^{0.671}) ≈ FF4.6881 = FFEEEE(10^{0.6881}) ≈ FEEEE4.8768 ≈ FEEE(75298.683) ≈ FEE(4.8185×10^{75298}) = 10↑↑10↑10↑(4.8185×10^{75298})
My goal in this post is to create an alternative notation which will allow us to see the final result without doing any calculation. Ideally, we also want a notation which can be snipped at any point to get an approximation (just like we can snip G2.671 to get the approximation G2.6)
So instead of G2.671 we'll have som…
Read more > 
maxilucal number
the Mailucal number is defined as 10^10^10^10^10...10 where the number of ^10's is 10^10^10^10^10.
Read more >