mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

View Poll Results: The last three digits for the number 9^387420489
089 2 9.09%
289 16 72.73%
489 2 9.09%
689 1 4.55%
889 1 4.55%
Voters: 22. You may not vote on this poll

Reply
 
Thread Tools
Old 2012-05-17, 00:05   #23
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

251616 Posts
Default

The real poll should have been about semantics:

What is the value of 9^9^9?
* 9^81
* 9^(9^9)
* 9 \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ if ^ is XOR operation :-)

Quote:
Hans Landa: Is that the way you say it? "That's a bingo?"
Aldo Raine: You just say "bingo".
Hans Landa: Ah! BINGO! How fun! But, I digress. Where were we?
Batalov is offline   Reply With Quote
Old 2012-05-17, 02:49   #24
lavalamp
 
lavalamp's Avatar
 
Oct 2007
Manchester, UK

54C16 Posts
Default

Quote:
Originally Posted by Raman View Post
99[SUP]9[/SUP] = 9387420489 is being the largest number that can be written with 3 digits.
[SUP]99[/SUP]9
lavalamp is offline   Reply With Quote
Old 2012-05-17, 12:08   #25
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22×5×373 Posts
Default

Quote:
Originally Posted by Batalov View Post
9!^9!^9! seems to be slightly larger.
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???
R.D. Silverman is offline   Reply With Quote
Old 2012-05-17, 12:10   #26
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

164448 Posts
Default

Quote:
Originally Posted by m_f_h View Post
Well, in a case like this one, it is not *so* bad to write 9^(9^9) to make things 100% unambiguous. .
They are unambiguous. Order of operations in an exponential tower
is well-defined. There is no need for parens.
R.D. Silverman is offline   Reply With Quote
Old 2012-05-21, 20:30   #27
Raman
Noodles
 
Raman's Avatar
 
"Mr. Tuch"
Dec 2007
Chennai, India

3×419 Posts
Default The post # 299999 its this preparation process as such

Quote:
Originally Posted by lavalamp View Post
[SUP]99[/SUP]9
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
Raman is offline   Reply With Quote
Old 2012-05-22, 12:24   #28
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

24×389 Posts
Default

Quote:
Originally Posted by Raman View Post
A(m,n) = 2↑n-2(n+3)-3
Where is m on the RHS?
retina is offline   Reply With Quote
Old 2012-05-22, 13:09   #29
Raman
Noodles
 
Raman's Avatar
 
"Mr. Tuch"
Dec 2007
Chennai, India

100111010012 Posts
Default

Quote:
Originally Posted by retina View Post
Where is m on the RHS?
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
Raman is offline   Reply With Quote
Old 2012-05-22, 15:57   #30
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by Raman View Post
This is being the tetration (aka hyperexponentiation) operation
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\uparrow3 9

Last fiddled with by science_man_88 on 2012-05-22 at 15:59
science_man_88 is offline   Reply With Quote
Old 2012-05-22, 22:43   #31
Stargate38
 
Stargate38's Avatar
 
"Daniel Jackson"
May 2011
14285714285714285714

23×83 Posts
Default

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
Stargate38 is online now   Reply With Quote
Old 2012-05-23, 03:10   #32
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

24×389 Posts
Default

Quote:
Originally Posted by Stargate38 View Post
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.
I thought it was simpler than that. 950 mod 1000 ≡ 1, and 99 mod 50 ≡ 39, leads to 939 mod 1000 ≡ 289.
retina is offline   Reply With Quote
Old 2012-05-23, 04:37   #33
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

32×29×37 Posts
Default

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 >
edit: more digits:
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
LaurV is offline   Reply With Quote
Reply



All times are UTC. The time now is 17:05.


Mon Aug 2 17:05:08 UTC 2021 up 10 days, 11:34, 0 users, load averages: 1.96, 2.20, 2.20

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.