![]() |
|
|
#23 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×47×101 Posts |
The real poll should have been about semantics:
What is the value of 9^9^9? * 9^81 * 9^(9^9) * 9 Quote:
|
|
|
|
|
|
|
#24 |
|
Oct 2007
Manchester, UK
22·3·113 Posts |
|
|
|
|
|
|
#25 |
|
Nov 2003
22·5·373 Posts |
If you are going to allow functions, there is no limit to the size
of the number. eg A(9^9, 9) where A is Ackerman's Function is far larger, as is BB(9^9^9) where BB is the Busy Beaver Function. Or we could use Goodstein sequences, or other functions in the fast growing hierarchy. ...... 'nuff said??? |
|
|
|
|
|
#26 |
|
Nov 2003
22×5×373 Posts |
|
|
|
|
|
|
#27 |
|
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
4E916 Posts |
This is being the tetration (aka hyperexponentiation) operation
The last few digits rather converges for repeatly iteratively applying this function composition as such Reminding me rather for this Ackermann function, as such The function value Ackermann(9,99) is rather going to be far larger enough, as such, man whereby A(0,n) = n+1 A(1,n) = 2+(n+3)-3 A(2,n) = 2*(n+3)-3 A(3,n) = 2n+3-3 = 2↑(n+3)-3 A(4,n) = n+32 - 3 = 2↑↑(n+3)-3 ... A(m,n) = 2↑n-2(n+3)-3 |
|
|
|
|
|
#28 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
24×389 Posts |
|
|
|
|
|
|
#29 |
|
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
125710 Posts |
A(m,n) = 2↑m-2(n+3)-3
![]() Thanks for pointing it out, that error to me out I was during that time period rushing off to post message number # 300000 some mistake had happened meanwhile rather within away that way For example, A(4,2) = 265536-3 (it is being the 19729 digit number, as such, as since) Last fiddled with by Raman on 2012-05-22 at 13:50 |
|
|
|
|
|
#30 |
|
"Forget I exist"
Jul 2009
Dumbassville
203008 Posts |
I with a little reading I'd read it as a pentation:
[SUP]99[/SUP]9 = 9(99[SUP]9[SUP]9[SUP]9[SUP]9[SUP]9[SUP]9[SUP]9[SUP]9[/SUP][/SUP][/SUP][/SUP][/SUP][/SUP][/SUP][/SUP]) = 9 Last fiddled with by science_man_88 on 2012-05-22 at 15:59 |
|
|
|
|
|
#31 |
|
"Daniel Jackson"
May 2011
14285714285714285714
66410 Posts |
The last 3 digits of 9^(9^9) are 289. I used Pari-gp to calculate 9^489 mod 1000 which is the same as 9^1489 mod 1000, 9^2489 mod 1000, etc. because 9^1000 mod 1000 = 1 and 9^489 mod 1000 is 289. I also voted in the poll.
Last fiddled with by Stargate38 on 2012-05-22 at 22:44 |
|
|
|
|
|
#32 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
185016 Posts |
I thought it was simpler than that. 950 mod 1000 ≡ 1, and 99 mod 50 ≡ 39, leads to 939 mod 1000 ≡ 289.
|
|
|
|
|
|
#33 |
|
Romulan Interpreter
Jun 2011
Thailand
32×29×37 Posts |
So much talking for nothing...
Code:
(11:39:36) gp > lift((x=Mod(9,1000))^lift(Mod(9,znorder(x))^9)) %8 = 289 (11:39:36) gp > ## *** last result computed in 0 ms. (11:39:37) gp > Code:
(11:43:54) gp > digits=100; lift((x=Mod(9,10^digits))^lift(Mod(9,znorder(x))^9)) %11 = 2617004315060225040660196165699439754361026855266374036682906190174923494324178799359681422627177289 (11:43:55) gp > ## *** last result computed in 12 ms. (11:44:06) gp > Last fiddled with by LaurV on 2012-05-23 at 04:46 |
|
|
|