Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^7: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms)

by tmoertel (Chaplain)
on Aug 13, 2005 at 14:29 UTC ( #483553=note: print w/replies, xml ) Need Help??


in reply to Re^6: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms)
in thread Algorithm for cancelling common factors between two lists of multiplicands

As a precision reference, here's the 1e5/2e5 answer computed with my program. It ought to be good for 60 digits:
[thor@redwood fishers-exact-test]$ cat fetbig.dat 100000 200000 200000 100000 [thor@redwood fishers-exact-test]$ time ./fet <fetbig.dat +1.324994596496999433060120009448386330459655228210366819887079e-14760 real 21m8.445s user 20m56.788s sys 0m6.831s
It looks like your FET6 yields about 13 digits of precision for this case:
| 1.32499459649680040e-14760 +1.324994596496999433060120009448386330459655228210366819887079e-14760 |
  • Comment on Re^7: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms)
  • Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://483553]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (6)
As of 2019-11-12 13:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Strict and warnings: which comes first?



    Results (66 votes). Check out past polls.

    Notices?