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.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|
