On Monday, October 13, 2014 4:34:16 AM UTC-4, Laurens Van Houtven wrote:
>
> Hi Ashish,
>
>
> At first sight, this looks like a numerical precision problem. 1e80 is a
> floating point type, not an integer type. You may want to try with e.g.
> 1000N (note the N; that makes it a bigi
Thanks Laurens
That solved it. :)
On Monday, 13 October 2014 14:04:16 UTC+5:30, Laurens Van Houtven wrote:
>
> Hi Ashish,
>
>
> At first sight, this looks like a numerical precision problem. 1e80 is a
> floating point type, not an integer type. You may want to try with e.g.
> 100
Hi Ashish,
At first sight, this looks like a numerical precision problem. 1e80 is a
floating point type, not an integer type. You may want to try with e.g.
1000N (note the N; that makes it a bigint). I don’t know of any
nice syntax for describing extremely large bigints; e.g expone
Hi I am programming in clojure and though the problem of modulo inverse has
nothing to do with language i am stuck at this code -
(defn EulerDiv [x p]
(let [ToMod (+ p 2)]
(loop [num 1 toPow (int p) numDouble x]
(if (= 0 toPow)
num
(let [numDouble2 (rem (* numDoubl
