I found 64-bits to be wonderful for multiprecision division. I haven't yet coded Collatz or Fibonacci for my bignum package. A little inconvenient because I make the caller responsible for all memory management.
hello tenkey
would you post an example using your routines?
I'm currently working on a Fibonacci demo.
:thup:
Fibonacci example.
It uses over-allocation of bignum buffers to make it easy to reuse them. Not used are some wrapper functions which have not been tested yet. The wrapper functions make things slower, but the auto-allocation relieves you from calculating the memory needs of temporary buffers and result buffers.
:thumbsup: Very interesting.