Or maybe you seek Ackermann's function (https://en.wikipedia.org/wiki/Ackermann_function)

Statistics: Posted by Traden4Alpha — February 15th, 2018, 5:47 pm

]]>

(Time is Money, Big Money = Big Time)

Statistics: Posted by Collector — February 15th, 2018, 5:23 pm

]]>

Traden4Alpha wrote:What do the specs say? Is there a hidden show-stopper such as a 32-bit "size" variable in the internal data structure of BigInteger? Does the OS barf if a single object exceeds some number of gigabytes in size?

It has no lower/upper bounds, so only Out of Memory can be thrown.

Interesting...Is BigInteger bounded by RAM or by virtual memory?

And does it truly have no upper bounds (e.g., the internal variable encoding the size of a BigInteger is also a BigInteger) or does it just have yuge bounds (e.g., 64 bit int).

Statistics: Posted by Traden4Alpha — February 6th, 2018, 9:28 pm

]]>

What do the specs say? Is there a hidden show-stopper such as a 32-bit "size" variable in the internal data structure of BigInteger? Does the OS barf if a single object exceeds some number of gigabytes in size?

It has no lower/upper bounds, so only Out of Memory can be thrown.

Statistics: Posted by Cuchulainn — February 6th, 2018, 9:02 pm

]]>

]]>

]]>

FaridMoussaoui wrote:why don't store only [$] n [$] instead of [$] 2^n - 1 [$] ? I am speculating as I don't know how it is implemented.

I take n as given, so I want to compute pow(2,n) -1.

Statistics: Posted by Traden4Alpha — February 6th, 2018, 6:45 pm

]]>

why don't store only [$] n [$] instead of [$] 2^n - 1 [$] ? I am speculating as I don't know how it is implemented.

I take n as given, so I want to compute pow(2,n) -1.

Statistics: Posted by Cuchulainn — February 6th, 2018, 6:38 pm

]]>

Indeed, it's plan B

https://msdn.microsoft.com/en-us/librar ... y(v=vs.110).aspx

Statistics: Posted by Cuchulainn — February 6th, 2018, 5:55 pm

]]>

Is there no way to directly serialize a BigInteger as a string of bits in some kind of convenient file wrapper?

Statistics: Posted by Traden4Alpha — February 6th, 2018, 4:40 pm

]]>

]]>

Cuchulainn wrote:FaridMoussaoui wrote:Do you use your own software or one from Great Internet Mersenne Prime Search?

I wrote a simple C# program based on Pingala's Chandah-sutra algorithm using BigInteger (which MS say is yuge). The issue is getting the output into a text file

DOS: BigInteger > Prime.txt (+ WAIT)

which is as we speak. The file will be 9000 pages, so I have no idea how long it will take!Just how big is a 23,249,425 digit number? It's huge!! Big enough to fill an entire shelf of books totalling 9,000 pages! If every second you were to write five digits to an inch then 54 days later you'd have a number stretching over 73 miles (118 km) -- almost 3 miles (5 km) longer than the previous record prime.

It won't be long before we cover all of Norge with prime wallpaper. Collector will be my distributor in The Nordic Countries.

23 million digits isn't large. My smartphone's camera outputs a 36 million digit number every time I take a photo.

That's not very helpful in the current context.

How then do you suggest how to store them? I am using the Console. A bit like streams..

See code snippet.

Code:

` var a = BigInteger.Pow(2, 20996011); // M40`

a = a - 1;

Console.WriteLine("Computed");

var s = a.ToString();

Console.WriteLine("Converted");

Console.WriteLine("2^... {0}",s);

Statistics: Posted by Cuchulainn — February 6th, 2018, 4:06 pm

]]>

FaridMoussaoui wrote:Cuchulainn wrote:I have just computed the world's 2nd biggest Mersenne prime in C# [$]2^{77,232,971} - 1[$]. Took about 6 hours.

http://www.dailymail.co.uk/sciencetech/ ... igits.html

Do you use your own software or one from Great Internet Mersenne Prime Search?

I wrote a simple C# program based on Pingala's Chandah-sutra algorithm using BigInteger (which MS say is yuge). The issue is getting the output into a text file

DOS: BigInteger > Prime.txt (+ WAIT)

which is as we speak. The file will be 9000 pages, so I have no idea how long it will take!

It won't be long before we cover all of Norge with prime wallpaper. Collector will be my distributor in The Nordic Countries.

Statistics: Posted by Traden4Alpha — February 6th, 2018, 2:48 pm

]]>

It will continue to run even if I close the x terminal.

Can you restart the computation when you stop the code?

Statistics: Posted by FaridMoussaoui — February 6th, 2018, 1:30 pm

]]>

Cuchulainn wrote:I have just computed the world's 2nd biggest Mersenne prime in C# [$]2^{77,232,971} - 1[$]. Took about 6 hours.

http://www.dailymail.co.uk/sciencetech/ ... igits.html

Do you use your own software or one from Great Internet Mersenne Prime Search?

I wrote a simple C# program based on Pingala's Chandah-sutra algorithm using BigInteger (which MS say is yuge). The issue is getting the output into a text file

DOS: BigInteger > Prime.txt (+ WAIT)

which is as we speak. The file will be 9000 pages, so I have no idea how long it will take!

It won't be long before we cover all of Norge with prime wallpaper. Collector will be my distributor in The Nordic Countries.

Statistics: Posted by Cuchulainn — February 6th, 2018, 1:17 pm

]]>