I'm trying to find the modulo of a very large number using Fortran.
The number is larger than the precision available.
Example:
[ 1e40 x log(2) ] modulo pi
I hoped there would be some clever theorem out there for a problem like this.
I'm trying to find the modulo of a very large number using Fortran.
The number is larger than the precision available.
Example:
[ 1e40 x log(2) ] modulo pi
I hoped there would be some clever theorem out there for a problem like this.
Copyright © 2021 JogjaFile Inc.