Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
decfloat -- again
#41
It's going to be fun going over the code when I get few things finished. I've been doing a game for Halloween and some TCP/IP stuff, along with a program line utility. I need to revisit the string math stuff eventually. It's great for +_*? and square roots and non-decimal powers, but nth roots and, their flip side, decimal roots slow it up way to much, even for 58-digits.

Pete
Reply
#42
I updated the code in first post using _offset, it's between 7 and 160+ times faster
Code: (Select All)
3.1415926535897932384...20560010165525637567
3.1415926535897932384...20560010165525637567
3.1415926535897932384...20560010165525637567

Pi to  10000 digits
elapsed time for pi_brent_salamin  .80199999999968  seconds
elapsed time for Pi_Ramanujan      .7240000000019791  seconds
elapsed time for pi_chudnovsky_bs  .5419999999976426  seconds

Press any key to continue
Reply
#43
Whoa!!!
I am new here, Jack002. (Not even that close to Jack, here. )
I'm so impressed with this DECFLOAT. So impressive.
(Anyone who was on the ORG many moons ago might remember me. I was jack002 there. )
I love this work you did here. So putting numbers into strings is a thing? I did some of that with a commodore 64 once.
Finding PI has been a project for me off and on, but this is 2200 lines of pure nuclear fusion. Cool 
I'm looking over the code, I'm still trying to contain it all.
I had a project once where I look at dec equivalents. Like 1/7 is 142857 over and over, try 1/97, see what it repeats  Sleepy
I used LISP to work with long numbers. It can do factorial of 10,000 as I recall.

Jack
                                                                                                                 
Very new here!
Reply




Users browsing this thread: 1 Guest(s)