Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Math::BigFloat bnok() question

by danaj (Friar)
on Aug 28, 2015 at 04:36 UTC ( #1140283=note: print w/replies, xml ) Need Help??

in reply to Math::BigFloat bnok() question

You can see how this is solved on RosettaCode by using (0+$n)->bnok($k) with the bigint pragma. In your case you might want Math::BigInt->new($y)->bnok($x) which will make sure the first argument is a proper object.

Shameless plug: if you find performance is an issue, use ntheory and its binomial function. It is faster for small integers, and also for large values if you have GMP on your system. It will return results as Math::BigInt if they're large. Worst case it falls back to Math::BigInt's bnok if the result is >64-bit and you don't have the GMP library.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2022-01-18 20:33 GMT
Find Nodes?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:

    Results (54 votes). Check out past polls.