![]() |
|
|
#12 |
|
Romulan Interpreter
Jun 2011
Thailand
100101101110012 Posts |
|
|
|
|
|
|
#14 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×47×101 Posts |
I am channelling V.I."electron is as inexhaustible as the atom, nature is infinite"Lenin who would remark that one "9" is all you need:
9!!!!!!!!!!!!!!!!!!!!!!...!!!!!!!!!!!!!!!!!!!!!!!!!!...!!!!!!!!!!!!!!!!!!!
Last fiddled with by Batalov on 2012-05-16 at 03:52 Reason: corrected Lenin's middle name |
|
|
|
|
|
#15 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
24×389 Posts |
I think you will find you need brackets for that: eg. ((((9!)!)!)!)! (and other larger variants that I am too lazy to type in).
|
|
|
|
|
|
#16 | |
|
Romulan Interpreter
Jun 2011
Thailand
32×29×37 Posts |
Quote:
:gotcha:
Last fiddled with by LaurV on 2012-05-16 at 06:04 |
|
|
|
|
|
|
#17 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
251616 Posts |
What rule?
Quote:
Code:
GP> ? 3!! %1 = 720 ? 3!!! %2 = 2601218943565795100204903227081043611191521875016945785727541837850835631156947382240678577958130457082619920575892247259536641565162052015873791984587740832529105244690388811884123764341191951045505346658616243271940197113909845536727278537099345629855586719369774070003700430783758997420676784016967207846280629229032107161669867260548988445514257193985499448939594496064045132362140265986193073249369770477606067680670176491669403034819961881455625195592566918830825514942947596537274845624628824234526597789737740896466553992435928786212515967483220976029505696699927284670563747137533019248313587076125412683415860129447566011455420749589952563543068288634631084965650682771552996256790845235702552186222358130016700834523443236821935793184701956510729781804354173890560727428048583995919729021726612291298420516067579036232337699453964191475175567557695392233803056825308599977441675784352815913461340394604901269542028838347101363733824484506660093348484440711931292537694657354337375724772230181534032647177531984537341478674327048457983786618703257405938924215709695994630557521063203263493209220738320923356309923267504401701760572026010829288042335606643089888710297380797578013056049576342838683057190662205291174822510536697756603029574043387983471518552602805333866357139101046336419769097397432285994219837046979109956303389604675889865795711176566670039156748153115943980043625399399731203066490601325311304719028898491856203766669164468791125249193754425845895000311561682974304641142538074897281723375955380661719801404677935614793635266265683339509760000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 |
|
|
|
|
|
|
#18 | |
|
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3·419 Posts |
I was supposed to put it into the Programming forum
The main intention was being to make the program to store the 369693100 digit number into the text file. I didn't post there due to the fact that most of the library was being used from the apfloat.org, I did few minor modifications, changes http://apfloat.org/apfloat_java/applet/calculator.html http://mathforum.org/library/drmath/view/58235.html http://mathforum.org/library/drmath/view/59172.html http://mathforum.org/library/drmath/view/61451.html Quote:
99[SUP]9[/SUP] is not being the same as (99)9 at all, as such the latter is being merely 981 = 3162 = 196627050475552913618075908526912116283103450944214766927315415537966391196809 9^9^9 is rather being quite ambiguous, in my opinion Tuch: What's the largest number that can be made with 3 threes? Tay: 33[SUP]3[/SUP] = 327 = 7625597484987 Tuch: Wrong. 333 = 5559060566555523 is being much more greater Tay: What about it when we can add one more factorial? Tuch: We could add two factorials to it at the end, as such Tay: We could add any number of factorials, in order to make the result to be diverging to infinity Tuch: What's the largest number that can be made with 4 ones? Tay: 1111 = 285311670611 Tuch: If I ask the largest number, then it is ambiguous, not being well defined at all, I will rather ask something to make it into a fixed thing, as such Tay: Yes, please go ahead Tuch: How do you make 127 by using the digits 1, 2, 7 Tay: A = -1+27 digits in the same order, as such! Tuch: How do you make 127 by using the digits 1, 2, 7 twice Tay: B = (71*2)-(17-2) Tuch: How do you make 127 by using the digits 1, 2, 7 n times Tay: n = 1 mod 2 => (n-1)/2 A - (n-1)/2 A + A n = 0 mod 2 => (n-2)/2 A - (n-2)/2 A + B Last fiddled with by Raman on 2012-05-16 at 14:00 Reason: Optional |
|
|
|
|
|
|
#19 |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3×29×83 Posts |
It's a fact that the ^ is right associative, so 9^9^9 is un-ambiguously the same as 9^(9^9).
http://en.wikipedia.org/wiki/Exponentiation Quote:
Last fiddled with by Dubslow on 2012-05-16 at 14:30 Reason: Fixed by Raman's comments |
|
|
|
|
|
#20 | ||
|
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3×419 Posts |
Quote:
Try typing out, feeding off 9^9^9 into FX-4800P calculator and then see what it says rather Quote:
You should have to be meant Code:
Exponentiation is not associative either. Addition and multiplication are. For example, (2+3)+4 = 2+(3+4) = 9 and (2·3)·4 = 2·(3·4) = 24, but 23 to the 4 is 84 or 4096, whereas 2 to the 34 is 281 or 2417851639229258349412352. Without parentheses to modify the order of calculation, by convention the order is top-down, not bottom-up: |
||
|
|
|
|
|
#21 | |
|
Romulan Interpreter
Jun 2011
Thailand
32·29·37 Posts |
Quote:
My former post was a joke, but if you insist... Last fiddled with by LaurV on 2012-05-16 at 17:18 |
|
|
|
|
|
|
#22 |
|
Feb 2007
24×33 Posts |
Well, in a case like this one, it is not *so* bad to write 9^(9^9) to make things 100% unambiguous. (Though I concede that a^b^c should mean a^(b^c), in particular because (a^b)^c could (and thus should and would) at no more cost rather be written as a^(bc), while there's no such simplification for a^(b^c).
OTOH, calculation of 9^9^9 is indeed no particular exploit, /any/ arbitrary precision calculator can do this [provided enough memory], and about any computer algebra package will calculate the last N digits of this in a fraction of a second (via binary exponentiation in Z/nZ, n=10^N) (and even faster the first N digits, for any arbitrary precision calculator). (It is more challenging to implement a powmod(x,m) function (almost never available by default), which would (efficiently and accurately) calculate x[1]^....^x[n] mod m for any n-component (integer) vector x.) And obviously "the largest number which can be written using 3 digits" depends on the operations you allow between these digits, as well as the digits you allow. It has been mentioned that we are to consider the decimal representation of the result, but I did not see any specification about the numbering system used for the "input" - e.g. z^z^z is quite a bit larger, using three times the largest base-36 digit. Last fiddled with by m_f_h on 2012-05-16 at 23:26 |
|
|
|