Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 1 of 1 for Tres (0.17 sec)

  1. android/guava/src/com/google/common/math/LongMath.java

        /** Returns a^p mod m. */
        private long powMod(long a, long p, long m) {
          long res = 1;
          for (; p != 0; p >>= 1) {
            if ((p & 1) != 0) {
              res = mulMod(res, a, m);
            }
            a = squareMod(a, m);
          }
          return res;
        }
    
        /** Returns true if n is a strong probable prime relative to the specified base. */
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Wed Feb 07 17:50:39 GMT 2024
    - 44.6K bytes
    - Viewed (0)
Back to top