G(n) = google-n-plex = G(n-1) ^ G(n-1);
G(google) = google-google-plex;
G(google-plex) = google-google-plex-plex;
G(google-google-plex-plex) = google-google-google-plex-plex-plex;
...
G(google(written a google number of times)-plex(written a google number
of times))
= G(google(written a google - 1 number of times)-plex(written a google -
1 number of times)) ^ G(google(written a google - 1 number of times)-
plex(written a google - 1 number of times))
= google-google(written a google number of times)-plex(written a google
number of times)-plex
= G(g)
G(g+1) = G(g) ^ G(g) = google-g+1-plex;
G(g+2) = G(g+1) ^ G(g+1)= google-g+2-plex;
...
G(g+google) = G(g+google-1) ^ G(g+google-1) = google-g+google-plex;
G(g+google+1) = G(g+google) ^ G(g+google) = google-g+google+1-plex;
G(g+google+2) = G(g+google+1) ^ G(g+google+1)= google-g+google+2-
plex;...
...
G(g+g) = google-g+g-plex;
...
G(g^g) = google-g^g-plex;
G(g^g+1) = google-g^g+1-plex;
G(g^g+2) = google-g^g+2-plex;
...
G(g^g + g^g) = google-g^g+g^g-plex;
...
G((g^g)^(g^g)) = google-(g^g)^(g^g)-plex;
G((g^g) raised to the (g^g) a (g^g) number of times;
G(google-g^g-plex) = google-google-g^g-plex-plex;
Would it bother you terribly to learn that googleplex is not
google^google, but only 10^google?
--
Michael F. Stemper
#include <Standard_Disclaimer>
I feel more like I do now than I did when I came in.
<snip>
... spelled "googleplex".
IT'S GOOGOL, not Google(TM) !!!!
And thus,
IT'S GOOGOLPLEX, not Googleplex!!!!
As Jesse Hughes mentioned in another thread,
Would it bother you terribly to learn that there are no such
numbers? Googol and googolplex are the terms you are both
looking for.
Phil
--
Dear aunt, let's set so double the killer delete select all.
-- Microsoft voice recognition live demonstration
<G>
Not "giggle". Googol!!
Or is that an accented pronunciaton of "googol"?
:-)
Gogol?
Googol = a big number, Googolplex is an even larger number;
Google = a big search engine, Google-plex is the future networked
infrastructure of services owned by Google;
giggle = a small laugh, giggle-plex is a fit of laughter where you
can't stop giggling;
Gogol = a great writer, Gogol-plex is the delusion that you're a great
writer;
Godot = a big deal to two tramps waiting for him to arrive, Godot-plex
is the obsessive mindset of the two tramps;
Godel = a great mathematician, Godel-plex is the delusion that you can
correct an effectively generated mathematical system to be both
consistent and complete.
:-)
Goto = a BASIC command to jump somewhere else in the program
Goto-plex = spaghetti code
... peeking from the shoulders of giants everything looks tiny... :-)
Gottfried
What are these? From the "AS" notation, Abel Summations?
> Not "giggle". Googol!!
Googol!! is considerably larger than Googolplex. In fact, it's equal to
2^(Googol/2) (Googol/2)!, whichy by Stirling's formula is approximately
10^10^(4.978 * 10^101), or slightly less than Googolplex^50 =
10^(50*Googol).
:-)
--
Dave Seaman
Oral Arguments in Mumia Abu-Jamal Case heard May 17
U.S. Court of Appeals, Third Circuit
<http://www.abu-jamal-news.com/>
You use to kinds of magnification:
building the power of
iteration
What about tan?
For example: tan (( 90 - (1/ googol)) [degrees] )= ?
With friendly greetings
Hero
indeed
even i knew that , despite my bad spelling...
tommy1729
Gruggle...
Ah: another one (the last one): did you know: Guglhupf (tm)?
<G>
``The Kappa Child" is a novel by Hiromi Goto.
cf.:
< http://www.herizons.ca/magazine/issues/sum02/reviews.html >
Gottfried Helms wrote:
> That wouldn't be possible... ;-) No. see tetration-forum. Also I posted this
> here some weeks ago. AS: alternating sum
There's also the Ackermann function, a generalized recursive
tetration function.
but not defined for all reals...
and not equal to tetration either.
bucks function is better...
>
> http://en.wikipedia.org/wiki/Ackermann_function
>
tommy1729