Arbitrary-precision integers (included): Difference between revisions

{{trans|Python}}

 

 

{{out}}

 

=={{header|8th}}==

200000 n#

5 4 3 2 bfloat ^ ^ ^

dup s:len . " digits" . cr

dup 20 s:lsub . "..." . 20 s:rsub . cr

{{out}}

<pre>

 

=={{header|ACL2}}==

 

(include-book "arithmetic-3/floor-mod/floor-mod" :dir :system)

(subseq s 0 20)

(mod x (expt 10 20))

 

{{out}}

=={{header|Ada}}==

{{libheader|GMP}} Using GMP, Ada bindings provided in GNATColl

with GNATCOLL.GMP; use GNATCOLL.GMP;

with GNATCOLL.GMP.Integers; use GNATCOLL.GMP.Integers;

Put_Line ("Size is:"& Natural'Image (len));

Put_Line (str (1 .. 20) & "....." & str (len - 19 .. len));

{{out}}

<pre>Size is: 183231

 

=={{header|ALGOL 68}}==

BEGIN

COMMENT

printf (($gxg(0)l$, "Number of digits:", digits))

END

<pre>

First 20 digits: 62060698786608744707

 

=={{header|Alore}}==

var len as Int

var result as Str

Print(result[:20])

Print(result[len-20:])

 

=={{header|bc}}==

 

y = 5 ^ 4 ^ 3 ^ 2

" Last 20 digits: "; y % (10 ^ 20)

"Number of digits: "; c

 

Output: <pre>$ time bc 5432.bc

0m24.81s real 0m24.81s user 0m0.00s system</pre>

 

 

=={{header|Bracmat}}==

At the prompt type the following one-liner:

{!} 62060698786608744707...92256259918212890625

length 183231

 

=={{header|C}}==

=== {{libheader|GMP}} ===

#include <stdio.h>

#include <string.h>

// free(s); /* we could, but we won't. we are exiting anyway */

return 0;

{{out}}

<pre>GMP says size is: 183231

==={{libheader|OpenSSL}}===

OpenSSL is about 17 times slower than GMP (on one computer), but still fast enough for this small task.

 

#include <openssl/bn.h> /* BN_*() */

 

return 0;

{{out}}

<pre>$ make LDLIBS=-lcrypto 5432

<code>System.Numerics.BigInteger</code> was added in C# 4. The exponent of <code>BigInteger.Pow()</code> is limited to a 32-bit signed integer, which is not a problem in this specific task.

{{works with|C sharp|C#|4+}}

using System.Diagnostics;

using System.Linq;

Console.WriteLine("n digits = {0}", result.Length);

}

{{out}}

<pre>

=== {{libheader|Boost-Multiprecision (GMP Backend)}} ===

To compile link with GMP <code>-lgmp</code>

#include <boost/multiprecision/gmp.hpp>

#include <string>

return 0;

}

{{out}}

<pre>62060698786608744707...92256259918212890625</pre>

=={{header|Ceylon}}==

Be sure to import ceylon.whole in your module.ceylon file.

wholeNumber,

two

print("The last twenty digits are ``bigString[(bigSize - 20)...]``");

print("The number of digits in 5^4^3^2 is ``bigSize``");

{{output}}

<pre>The first twenty digits are 62060698786608744707

 

=={{header|Clojure}}==

 

(def big (->> 2 (exp 3) (exp 4) (exp 5)))

(println (str (.substring sbig 0 20) ".."

(.substring sbig (- (count sbig) 20)))

{{out}}

<pre>output> 62060698786608744707..92256259918212890625 (183231 digits)</pre>

Redefining ''exp'' as follows speeds up the calculation of ''big'' about a hundred times:

(cond

(zero? (mod k 2)) (recur (* n n) (/ k 2))

(zero? (mod k 3)) (recur (* n n n) (/ k 3))

 

=={{header|COBOL}}==

{{works with|GnuCOBOL}}

{{libheader|GMP}}

program-id. arbitrary-precision-integers.

remarks. Uses opaque libgmp internals that are built into libcob.

 

end program arbitrary-precision-integers.

 

{{out}}

=={{header|Common Lisp}}==

Common Lisp has arbitrary precision integers, inherited from MacLisp: "[B]ignums—arbitrary precision integer arithmetic—were added [to MacLisp] in 1970 or 1971 to meet the needs of Macsyma users." [''Evolution of Lisp'' [http://dreamsongs.com/Files/Hopl2.pdf], 2.2.2]

(format t "~a...~a, length ~a" (subseq s 0 20)

{{out}}

<pre>

62060698786608744707...92256259918212890625, length 183231

</pre>

 

=={{header|D}}==

import std.stdio, std.bigint, std.conv;

 

auto s = text(5.BigInt ^^ 4 ^^ 3 ^^ 2);

writefln("5^4^3^2 = %s..%s (%d digits)", s[0..20], s[$-20..$], s.length);

{{out}}

<pre>5^4^3^2 = 62060698786608744707..92256259918212890625 (183231 digits)</pre>

=={{header|Dart}}==

Originally Dart's integral type '''int''' supported arbitrary length integers, but this is no longer the case; Dart now supports integral type '''BigInt'''.

 

int fallingPowers(int base) =>

print('Last twenty: ${s.substring(s.length - 20)}');

print('Number of digits: ${s.length}');

{{out}}

<pre>First twenty: 62060698786608744707

=={{header|dc}}==

{{trans|bc}}

 

5 4 3 2 ^ ^ ^ sy [y = 5 ^ 4 ^ 3 ^ 2]sz

[ First 20 digits: ]P ly 10 lc 20 - ^ / p sz [y / (10 ^ (c - 20))]sz

[ Last 20 digits: ]P ly 10 20 ^ % p sz [y % (10 ^ 20)]sz

{{out}}

<pre>$ time dc 5432.dc

{{libheader| System.SysUtils}}

{{libheader| Velthuis.BigIntegers}}Thanks for Rudy Velthuis, BigIntegers Library [https://github.com/rvelthuis/DelphiBigNumbers].

program Arbitrary_precision_integers;

 

Writeln(' (', result.Length,' digits)');

readln;

{{out}}

<pre>5^4^3^2 = 62060698786608744707...92256259918212890625 (183231 digits)</pre>

=={{header|E}}==

E implementations are required to support arbitrary-size integers transparently.

? def decimal := value.toString(10); null

? decimal(0, 20)

 

? decimal.size()

 

=={{header|EchoLisp}}==

;; to save space and time, we do'nt stringify Ω = 5^4^3^2 ,

;; but directly extract tail and head and number of decimal digits

 

 

 

=={{header|Elixir}}==

{{trans|Erlang}}

def pow(_,0), do: 1

def pow(b,e) when e > 0, do: pow(b,e,1)

end

end

 

{{out}}

As of Emacs 27.1, bignums are supported via GMP. However, there is a configurable limit on the maximum bignum size. If the limit is exceeded, an overflow error is raised.

 

(answer (number-to-string (expt 5 (expt 4 (expt 3 2)))))

(length (length answer)))

(substring answer (- length 20) length))

answer)

 

Emacs versions older than 27.1 do not support bignums, but include Calc, a library that implements big integers. The <code>calc-eval</code> function takes an algebraic formula in a string, and returns the result in a string.

 

{{libheader|Calc}}

(length (length answer)))

(message "%s has %d digits"

(substring answer (- length 20) length))

answer)

 

This implementation is ''very slow''; one computer, running GNU Emacs 23.4.1, needed about seven minutes to find the answer.

 

Erlang supports arbitrary precision integers. However, the math:pow function returns a float. This implementation includes an implementation of pow for integers with exponent greater than 0.

-module(arbitrary).

-compile([export_all]).

Suffix = lists:sublist(S,L-19,20),

io:format("Length: ~b~nPrefix:~s~nSuffix:~s~n",[L,Prefix,Suffix]).

{{out}}

23> arbitrary:test().

* bigint does not support raising to a power of a bigint

* The int type does not support the power method

let answer = 5I **(int (4I ** (int (3I ** 2))))

let sans = answer.ToString()

printfn "Length = %d, digits %s ... %s" sans.Length (sans.Substring(0,20)) (sans.Substring(sans.Length-20))

;;

 

=={{header|Factor}}==

Factor has built-in bignum support. Operations on integers overflow to bignums.

IN: rosettacode.bignums

 

5 4 3 2 ^ ^ ^ number>string

[ 20 head ] [ 20 tail* ] [ length ] tri

It prints: <code>5^4^3^2 is 62060698786608744707...92256259918212890625 and has 183231 digits</code>

 

Here is the solution:

 

 

big_digit_pointer *exp \ iteration counter

 

\ compute 5^(4^(3^2))

 

and the output:

Here is a solution using David M. Smith's FM library, available [http://myweb.lmu.edu/dmsmith/fmlib.html here].

 

use fmzm

implicit none

call im_print(a / to_im(10)**(n - 19))

call im_print(mod(a, to_im(10)**20))

 

<pre>

freebasic has it's own gmp static library.

Here, a power function operates via a string and uinteger.

Dim Shared As Zstring * 100000000 outtext

 

Print Left(ans,20) + " ... "+Right(ans,20)

Print "Number of digits ";Len(ans)

{{out}}

<pre>GMP version 5.1.1

 

Fun Fact: The drastically faster arbitrary-precision integer operations that landed in Java 8 (for much faster multiplication, exponentiation, and toString) were taken from Frink's implementation and contributed to Java. Another fun fact is that it took employees from Java 11 years to integrate the improvements.

as = "$a" // Coerce to string

This prints <CODE>Length=183231, 62060698786608744707...92256259918212890625</CODE>

 

=={{header|Fōrmulæ}}==

 

 

 

 

=={{header|GAP}}==

s := String(n);;

m := Length(s);

# "62060698786608744707"

s{[m-19..m]};

 

=={{header|Go}}==

Using <code>math/big</code>'s

<code>[https://golang.org/pkg/math/big/#Int.Exp Int.Exp]</code>.

 

import (

str[len(str)-20:],

)

{{out}}

<pre>

 

=={{header|Golfscript}}==

`.. # Convert to string and make two copies

20<p # Print the first 20 digits

-20>p # Print the last 20 digits

The ''p'' command prints the top element from the stack, so the output of this program is just three lines:

<pre>"62060698786608744707"

=={{header|Groovy}}==

Solution:

Test:

 

assert bigString[0..<20] == "62060698786608744707"

assert bigString[-20..-1] == "92256259918212890625"

 

{{out}}

<pre>183231</pre>

=={{header|Haskell}}==

Haskell comes with built-in support for arbitrary precision integers. The type of arbitrary precision integers is <tt>Integer</tt>.

main = do

let y = show (5 ^ 4 ^ 3 ^ 2)

putStrLn

("5**4**3**2 = " ++

{{out}}

<pre>5**4**3**2 = 62060698786608744707...92256259918212890625 and has 183231 digits</pre>

 

=={{header|Hoon}}==

=+ big=(pow 5 (pow 4 (pow 3 2)))

=+ digits=(lent (skip <big> |=(a/* ?:(=(a '.') & |))))

[digits (div big (pow 10 (sub digits 20))) (mod big (pow 10 20))]

{{out}}<pre>[183.231 62.060.698.786.608.744.707 92.256.259.918.212.890.625]</pre>

 

 

Note: It takes far longer to convert the result to a string than it does to do the computation itself.

x := 5^4^3^2

write("done with computation")

write("The first twenty digits are ",x[1+:20])

write("The last twenty digits are ",x[0-:20])

{{out|Sample run}}

<pre>->ap

=={{header|J}}==

J has built-in support for extended precision integers. See also [[J:Essays/Extended%20Precision%20Functions]].

Pow5432=: ^/ 5 4 3 2x NB. alternate J solution

# ": Pow5432 NB. number of digits

183231

20 ({. , '...' , -@[ {. ]) ": Pow5432 NB. 20 first & 20 last digits

 

=={{header|Java}}==

Java library's <tt>BigInteger</tt> class provides support for arbitrary precision integers.

 

class IntegerPower {

str.substring(0, 20), str.substring(len - 20), len);

}

{{out}}

<pre>5**4**3**2 = 62060698786608744707...92256259918212890625 and has 183231 digits</pre>

 

BigInt is already implemented by Chrome and Firefox, but not yet by Explorer or Safari.

>>> console.log(`5**4**3**2 = ${y.slice(0,20)}...${y.slice(-20)} and has ${y.length} digits`);

 

=={{header|jq}}==

 

There is a BigInt.jq library for jq, but gojq, the Go implementation of jq, supports unbounded-precision integer arithmetic, so the output shown below is that produced by gojq.

def power($b): . as $in | reduce range(0;$b) as $i (1; . * $in);

5|power(4|power(3|power(2))) | tostring

| .[:20], .[-20:], length

{{out}}

<pre>

Julia includes built-in support for arbitrary-precision arithmetic using the [http://gmplib.org/ GMP] (integer) and [http://www.mpfr.org/ GNU MPFR] (floating-point) libraries, wrapped by the built-in <code>BigInt</code> and <code>BigFloat</code> types, respectively.

 

0.017507363

"62060698786608744707"

 

=={{header|Klong}}==

=={{header|Kotlin}}==

{{trans|Java}}

 

fun main(args: Array<String>) {

val len = y.length

println("5^4^3^2 = ${y.substring(0, 20)}...${y.substring(len - 20)} and has $len digits")

 

{{out}}

<pre>

5^4^3^2 = 62060698786608744707...92256259918212890625 and has 183231 digits

</pre>

 

=={{header|Lasso}}==

Interestingly, we have to define our own method for integer powers.

#factor <= 0

? return 0

#bigint->sub(1,20) + ` ... ` + #bigint->sub(#bigint->size - 19)

"\n"

 

{{out}}

 

Note the brackets are needed to enforce the desired order of exponentiating.

print len( a$)

{{out}}

183231

=={{header|Lua}}==

Pure/native off-the-shelf Lua does not include support for arbitrary-precision arithmetic. However, there are a number of optional libraries that do, including several from an author of the language itself - one of which this example will use. (citing the "..''may'' be used instead" allowance)

-- since 5$=5^4$, and IEEE754 can handle 4$, this would be sufficient:

-- n = bc.pow(bc.new(5), bc.new(4^3^2))

n = bc.pow(bc.new(5), bc.pow(bc.new(4), bc.pow(bc.new(3), bc.new(2))))

s = n:tostring()

{{out}}

<pre>62060698786608744707...92256259918212890625 (183231 digits)</pre>

=={{header|Maple}}==

Maple supports large integer arithmetic natively.

> n := 5^(4^(3^2)):

> length( n ); # number of digits

> s[ 1 .. 20 ], s[ -20 .. -1 ]; # extract first and last twenty digits

"62060698786608744707", "92256259918212890625"

In the Maple graphical user interface it is also possible to set things up so that only (say) the first and last 20 digits of a large integer are displayed explicitly. This is done as follows.

> interface( elisiondigitsbefore = 20, elisiondigitsafter = 20 ):

> 5^(4^(3^2)):

62060698786608744707[...183191 digits...]92256259918212890625

 

=={{header|Mathematica}} / {{header|Wolfram Language}}==

Mathematica can handle arbitrary precision integers on almost any size without further declarations.

To view only the first and last twenty digits:

{{out}}

62060698786608744707...92256259918212890625 (183231 digits)

=={{header|MATLAB}}==

Using the [http://www.mathworks.com/matlabcentral/fileexchange/22725-variable-precision-integer-arithmetic Variable Precision Integer] library this task is accomplished thusly:

>> numDigits = order(answer) + 1

 

ans =

 

 

=={{header|Maxima}}==

/* 62060698786608744707...92256259918212890625

 

=={{header|Nanoquery}}==

Integer values are arbitrary-precision by default in Nanoquery.

 

first20 = value.substring(0,20)

end

 

{{out}}

<pre>The first twenty digits are 62060698786608744707

=={{header|Nemerle}}==

{{trans|C#}}

using System.Numerics;

using System.Numerics.BigInteger;

WriteLine($"Length of result: $len digits");

}

Output:

<pre>Result: 62060698786608744707 ... 92256259918212890625

=

=={{header|NewLisp}}==

;;; No built-in big integer exponentiation

(define (exp-big x n)

(println "First 20 digits: " (0 20 res))

(println "Last 20 digits: " (-20 20 res))))

{{out}}

<pre>

=={{header|NetRexx}}==

=== Using Java's BigInteger Class ===

 

options replace format comments java crossref savelog symbols

say "Result does not satisfy test"

 

{{out}}

<pre>

</pre>

=== Using Java's BigDecimal Class ===

 

options replace format comments java crossref savelog symbols

say "Result does not satisfy test"

 

{{out}}

<pre>

==== Note ====

{{trans|REXX}}

 

options replace format comments java crossref savelog symbols

say "Result confirmed"

else

{{out}}

<pre>

 

{{libheader|bigints}}

 

var x = 5.pow 4.pow 3.pow 2

echo s[0..19]

echo s[s.high - 19 .. s.high]

Output:

<pre>

 

=={{header|OCaml}}==

open Str

open String

(length answer_string)

(first_chars answer_string 20)

 

A more readable program can be obtained using [http://forge.ocamlcore.org/projects/pa-do/ Delimited Overloading]:

let answer = Num.(5**4**3**2) in

let s = Num.(to_string answer) in

Printf.printf "has %d digits: %s ... %s\n"

{{out}}

<pre>

Oforth handles arbitrary precision integers :

 

 

 

{{out}}

 

=={{header|Ol}}==

(define x (expt 5 (expt 4 (expt 3 2))))

(print

(mod x (expt 10 20)))

(print "totally digits: " (log 10 x))

{{out}}

<pre>

{{trans|REXX}}

 

--REXX program to show arbitrary precision integers.

numeric digits 200000

if check=sampl then say 'passed!'

else say 'failed!'

 

{{out}}

 

=={{header|Oz}}==

Pow5432 = {Pow 5 {Pow 4 {Pow 3 2}}}

S = {Int.toString Pow5432}

{System.showInfo

{List.take S 20}#"..."#

{{out}}

<pre>

=={{header|PARI/GP}}==

PARI/GP natively supports integers of arbitrary size, so one could just use <code>N=5^4^3^2</code>. But this would be foolish (using a lot of unneeded memory) if the task is to get just the number of, and the first and last twenty digits. The number of and the leading digits are given as 1 + the integer part, resp. 10^(fractional part + offset), of the logarithm to base 10 (not as log(N) with N=A^B, but as B*log(A); one needs at least 20 correct decimals of the log, on 64 bit machines the default precision is 39 digits, but on 32 bit architecture one should set <code>default(realprecision,30)</code> to be on the safe side). To get the trailing digits, one would use modular exponentiation which is also built-in and very efficient even for extremely huge exponents:

[L\1+1, 10^frac(L)\10^(1-n), lift(m)] \\ where x\y = floor(x/y) but more efficient

}

{{out}}

<pre>Length, first and last 20 digits of 5^4^3^2: [183231, 62060698786608744707, 92256259918212890625]</pre>

 

An alternate but much slower method for counting decimal digits is <code>#Str(n)</code>. Note that <code>sizedigit</code> is not exact&mdash;in particular, it may be off by one (thus the function below).

my(s=sizedigit(x)-1);

if(x<10^s,s,s+1)

 

N=5^(4^(3^2));

{{out}}

<pre>[6.20606987866087447074832055728 E183230, Mod(92256259918212890625, 100000000000000000000), 183231]</pre>

{{libheader|GMP}}

FreePascal comes with a header unit for gmp. Starting from the C program, this is a Pascal version:

 

uses

write(out[i]);

writeln;

{{out}}

<pre>

=={{header|Perl}}==

Perl's <tt>Math::BigInt</tt> core module handles big integers:

my $x = Math::BigInt->new('5') ** Math::BigInt->new('4') ** Math::BigInt->new('3') ** Math::BigInt->new('2');

my $y = "$x";

You can enable "transparent" big integer support by enabling the <tt>bigint</tt> pragma:

my $x = 5**4**3**2;

my $y = "$x";

 

<tt>Math::BigInt</tt> is very slow. Perl 5.10 was about 120 times slower than Ruby 1.9.2 (on one computer); Perl used more than one minute, but Ruby used less than one second.

{{out}}

5**4**3**2 = 62060698786608744707...92256259918212890625 and has 183231 digits

 

=={{header|Phix}}==

{{libheader|Phix/basics}}

{{libheader|Phix/mpfr}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">include</span> <span style="color: #004080;">mpfr</span><span style="color: #0000FF;">.</span><span style="color: #000000;">e</span>

<span style="color: #000000;">e</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">t0</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"5^4^3^2 = %s (%s)\n"</span><span style="color: #0000FF;">,</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">s</span><span style="color: #0000FF;">,</span><span style="color: #000000;">e</span><span style="color: #0000FF;">})</span>

{{out}}

<pre>

 

The first is the BC library.[http://us3.php.net/manual/en/book.bc.php] It represents the integers as strings, so may not be very efficient. The advantage is that it is more likely to be included with PHP.

$y = bcpow('5', bcpow('4', bcpow('3', '2')));

printf("5**4**3**2 = %s...%s and has %d digits\n", substr($y,0,20), substr($y,-20), strlen($y));

{{out}}

<pre>

</pre>

The second is the GMP library.[http://us3.php.net/manual/en/book.gmp.php] It represents the integers as an opaque type, so may be faster. However, it is less likely to be compiled into your version of PHP (it isn't compiled into mine).

 

=={{header|PicoLisp}}==

(prinl (head 20 L) "..." (tail 20 L))

{{out}}

<pre>62060698786608744707...92256259918212890625

 

=={{header|Pike}}==

> res[..19] == "62060698786608744707";

Result: 1

Result: 1

> sizeof(result);

 

=={{header|PowerShell}}==

$BigNumber = [BigInt]::Pow( 5, [BigInt]::Pow( 4, [BigInt]::Pow( 3, 2 ) ) )

# Display number of digits

{{out}}

<pre>62060698786608744707...92256259918212890625

183231</pre>

 

=={{header|Prolog}}==

{{works with|SWI-Prolog|6.6}}

 

task(Length) :-

N is 5^4^3^2,

length(Codes, Length).

 

Query like so:

 

?- task(N).

N = 183231 ;

false.

 

=={{header|PureBasic}}==

 

Using [http://www.purebasic.fr/english/viewtopic.php?p=309763#p309763 Decimal.pbi], e.g. the same included library as in [[Long multiplication#PureBasic]], this task is solved as below.

 

;- Declare the variables that will be used

out$+"and the result is "+digits+" digits long."

 

[[Image:Arbitrary-precision_integers,_PureBasic.png]]

 

=={{header|Python}}==

Python comes with built-in support for arbitrary precision integers. The type of arbitrary precision integers is <tt>[http://docs.python.org/library/stdtypes.html#typesnumeric long]</tt> in Python 2.x (overflowing operations on <tt>int</tt>'s are automatically converted into <tt>long</tt>'s), and <tt>[http://docs.python.org/3.1/library/stdtypes.html#typesnumeric int]</tt> in Python 3.x.

>>> print ("5**4**3**2 = %s...%s and has %i digits" % (y[:20], y[-20:], len(y)))

 

=={{header|Quackery}}==

 

=={{header|R}}==

{{out}}

<pre>first 20 digits: 62060698786608744707

 

=={{header|Racket}}==

 

(define answer (number->string (foldr expt 1 '(5 4 3 2))))

(substring answer 0 20)

(substring answer (- len 20) len))

{{out}}<pre>Got 183231 digits

62060698786608744707 ... 92256259918212890625</pre>

=={{header|Raku}}==

(formerly Perl 6)

 

{{out}}

 

=={{header|REXX}}==

:::* &nbsp; ROO

:::* &nbsp; ooRexx &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; (tested by Walter Pachl)

numeric digits 200000 /*two hundred thousand decimal digits. */

 

if true == rexx then say 'passed!' /*either it passed, ··· */

else say 'failed!' /* or it didn't. */

{{output|output}}

<pre>

 

===automatic setting of decimal digits===

numeric digits 5 /*just use enough digits for 1st time. */

 

if true == rexx then say 'passed!' /*either it passed, ··· */

else say 'failed!' /* or it didn't. */

{{out|output|text=&nbsp; is the same as the 1^st REXX version.}}

<br><br>

Ruby comes with built-in support for arbitrary precision integers.

 

puts "5**4**3**2 = #{y[0..19]}...#{y[-20..-1]} and has #{y.length} digits"

{{out}}

<pre>

 

=={{header|Run BASIC}}==

print "Length:";len( x$)

{{out}}

<pre>Length:183231

This is accomplished via the `num` crate. This used to be part of the standard library, but was relegated to an external crate when Rust hit 1.0. It is still owned and maintained by members of the Rust core team and is the de-facto library for numerical generics and arbitrary precision arithmetic.

 

use num::bigint::BigUint;

use num::FromPrimitive;

println!("Number of digits: {}", answer_as_string.len());

println!("First and last digits: {:?}..{:?}", first_twenty, last_twenty);

{{out}}

<pre>

 

=={{header|Sather}}==

main is

r:INTI;

#OUT + "# of digits: " + sr.size + "\n";

end;

{{out}}

<pre>result is ok..

=={{header|Scala}}==

Scala does not come with support for arbitrary precision integers powered to arbitrary precision integers, except if performed on a module. It can use arbitrary precision integers in other ways, including powering them to 32-bits integers.

res21: scala.math.BigInt = 92256259918212890625

 

res24: Int = 183231

 

 

=={{header|Scheme}}==

[http://people.csail.mit.edu/jaffer/r4rs_8.html#SEC52 R⁴RS] and [http://schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-9.html#%_sec_6.2.3 R⁵RS] encourage, and [http://www.r6rs.org/final/html/r6rs/r6rs-Z-H-6.html#node_sec_3.4 R⁶RS] requires, that exact integers be of arbitrary precision.

(define y (number->string x))

(define l (string-length y))

(display (string-append "5**4**3**2 = " (substring y 0 20) "..." (substring y (- l 20) l) " and has " (number->string l) " digits"))

{{out}}

<pre>5**4**3**2 = 62060698786608744707...92256259918212890625 and has 183231 digits</pre>

 

=={{header|Seed7}}==

include "bigint.s7i";

 

"..." <& numberAsString[length(numberAsString) - 19 ..]);

writeln("decimal digits: " <& length(numberAsString));

{{out}}

<pre>

 

=={{header|Sidef}}==

{{out}}

<pre>

{{incomplete|SIMPOL|Number of digits in result not given.}}

SIMPOL supports arbitrary precision integers powered to arbitrary precision integers. This is the only integer data type in SIMPOL. SIMPOL supports conversion from its integer data type to other formats when calling external library functions.

constant LAST20 "92256259918212890625"

 

end if

end if

 

=={{header|Smalltalk}}==

 

A very simple approach:

num := (5 raisedTo: (4 raisedTo: (3 raisedTo: 2))) asString.

Transcript

show: (num first: 20), '...', (num last: 20); cr;

 

On a Transcript window:

digits: 183231</pre>

And a more advanced one:

num := (2 to: 5) fold: [:exp :base| base raisedTo: exp].

numstr := num asString.

expandMacrosWith: (numstr first: 20)

with: (numstr last: 20)

{{out}}

<pre>'62060698786608744707...92256259918212890625 digits: 183231'</pre>

 

=={{header|SPL}}==

n = #.size(t)

#.output(n," digits")

{{out}}

<pre>

 

=={{header|Standard ML}}==

val answer = IntInf.pow (5, IntInf.toInt (IntInf.pow (4, IntInf.toInt (IntInf.pow (3, 2)))))

val s = IntInf.toString answer

substring (s, 0, 20) ^ " ... " ^

substring (s, len-20, 20) ^ "\n")

it took too long to run

 

=== mLite ===

mLite does not have a logarithm function so one was constructed (see fun log10)

fun

ntol (0, x) = if len x < 1 then [0] else x

val top20 = fiveFourThreeTwo div (10^(digitCount - 20));

print "Top 20 = "; println top20;

Output

<pre>

Tcl supports arbitrary precision integers (and an exponentiation operator) from 8.5 onwards.

{{works with|Tcl|8.5}}

puts "5**4**3**2 has [string length $bigValue] digits"

if {[string match "62060698786608744707*92256259918212890625" $bigValue]} {

} else {

puts "Value does not match 62060698786608744707...92256259918212890625"

{{out}}

<pre>

5**4**3**2 has 183231 digits

Value starts with 62060698786608744707, ends with 92256259918212890625

</pre>

 

=={{header|TXR}}==

@(let* ((str (tostring (expt 5 4 3 2)))

(len (length str)))

@f20...@l20

ndigits=@ndig

{{out}}

<pre>62060698786608744707...92256259918212890625

 

===Usage===

decl unbounded_int x

x.set ((x.valueof 5).pow ((x.valueof 4).pow ((x.valueof 3).pow 2)))

else

out "FAIL" endl console

 

===Output===

 

There is no distinction between ordinary and arbitrary precision integers, but the binary converted decimal representation used here is more efficient than the usual binary representation in calculations that would otherwise be dominated by the conversion to decimal output.

#import nat

#import bcd

#show+

 

With this calculation taking about a day to run, correct results are attainable but not performant.

<pre>62060698786608744707...92256259918212890625

{{libheader|System.Numerics}}

Addressing the issue of the '''BigInteger.Pow()''' function having the exponent value limited to '''Int32.MaxValue''' (2147483647), here are a couple of alternative implementations using a '''BigInteger''' for the exponent.

Imports BI = System.Numerics.BigInteger

 

End Sub

 

{{out}}

<pre>n = 5^4^3^2

Iterative elasped: 2412.5477 milliseconds.</pre>'''Remarks:''' Not much difference in execution times for three methods. But the exponents are relatively small. If one does need to evaluate an exponent greater than '''Int32.MaxValue''', the execution time will be measured in hours.

 

import math

 

str := y.str()

println("5^(4^(3^2)) has $str.len digits: ${str[..20]} ... ${str[str.len-20..]}")

 

{{out}}

{{libheader|Wren-fmt}}

{{libheader|Wren-big}}

 

var p = BigInt.three.pow(BigInt.two)

Fmt.print("5 ^ 4 ^ 3 ^ 2 has $,d digits.\n", s.count)

System.print("The first twenty are : %(s[0..19])")

 

{{out}}

 

=={{header|Zig}}==

const bigint = std.math.big.int.Managed;

 

pub fn main() !void {

defer a.deinit();

 

 

std.debug.print("{s}...{s}\n", .{ as[0..20], as[as.len - 20 ..] });

std.debug.print("{} digits\n", .{as.len});

{{out}}

<pre>

=={{header|zkl}}==

Using the GNU big num library:

n:=BN(5).pow(BN(4).pow(BN(3).pow(2)));

s:=n.toString();

"%,d".fmt(s.len()).println();

{{out}}

<pre>

</pre>

 

{{omit from|AutoHotkey}}

{{omit from|Batch File}}

{{omit from|Brainf***}}

{{omit from|PostScript}}