Package java.math

Examples of java.math.BigInteger.divide()


    BigInteger m4 = new BigInteger("-4");
   
    harness.check(p4.divide(p2).equals(p2));
    harness.check(m4.divide(p2).equals(m2));
    harness.check(p4.divide(m2).equals(m2));
    harness.check(m4.divide(m2).equals(p2));

    harness.check(p1.divide(p2).equals(BigInteger.ZERO));
    harness.check(m1.divide(p2).equals(BigInteger.ZERO));
    harness.check(p1.divide(m2).equals(BigInteger.ZERO));
    harness.check(m1.divide(m2).equals(BigInteger.ZERO));
View Full Code Here


      return BigInteger.valueOf(LongMath.binomial(n, k));
    }
    BigInteger result = BigInteger.ONE;
    for (int i = 0; i < k; i++) {
      result = result.multiply(BigInteger.valueOf(n - i));
      result = result.divide(BigInteger.valueOf(i + 1));
    }
    return result;
  }

  // Returns true if BigInteger.valueOf(x.longValue()).equals(x).
View Full Code Here

        while (bigInt.compareTo(BigInteger.ZERO) != 0) {
          int digit = bigInt.mod(BIG_TEN).intValue();

          buf[--digits] = (char) ('0' + digit);

          bigInt = bigInt.divide(BIG_TEN);
        }
      }
     
      for (int i = buf.length - digits; i < _min; i++)
        sb.append(_pad);
View Full Code Here

                }
            }
            if (totalBig != null) {
                if (totalBig.bitLength() > 63) {
                    // overflow, parse 1 less digit
                    totalBig = totalBig.divide(BigInteger.TEN);
                    pos--;
                }
                return setValue(context, totalBig.longValue(), position, pos);
            }
            return setValue(context, total, position, pos);
View Full Code Here

      BigInteger n1, n2, r1;
 
      // test division where the difference in bit length of the dividend and divisor is 32 bits
      n1 = new BigInteger("54975581388");
      n2 = new BigInteger("10");
      r1 = n1.divide(n2);
      if (!r1.toString(10).equals("5497558138"))
      {
          return new SimpleTestResult(false, "BigInteger: failed Divide Test");
      }
     
View Full Code Here

     */
    static public int digits10(BigInteger x) {
        int digits;
        BigInteger value = x.abs();
        for (digits = 1; value.compareTo(BigInteger.ONE) > 0; digits++)
            value = value.divide(BigInteger.TEN);
        return digits - 1;
    } /* digits10 */

} /* BigIntegerMath */
 
View Full Code Here

        int asize = startAt.size();
        if (asize == 1) {
            BigInteger d = BigInteger.ONE;

            try {
                return Node.createExternal(new External_Integer(d.divide(number.get())));
            }
            catch (ArithmeticException ex) {
                // prévoir la gestion de l'exception division par zéro sur exception seulement.
                // c'est plus rapide car on n'a pas besoin de tester la valeur à chaque fois.
                if (ex.getMessage().equals("Division by zero")) {
View Full Code Here

         * s'il y a au moins un argument, on considère la forme (- n [args...])...
         */
        BigInteger r = number.get();
        try {
            for (int i = 1; i < asize; )
                r = r.divide(_getArg_(startAt, i++));
        }
        catch (ArithmeticException ex) {
            // prévoir la gestion de l'exception division par zéro sur exception seulement.
            // c'est plus rapide car on n'a pas besoin de tester la valeur à chaque fois.
            if (ex.getMessage().equals("Division by zero")) {
View Full Code Here

            BigInteger r;
            do {
                old_r = number.get();
                r = old_r;
                for (int i = 0; i < v.length; i++)
                    r = r.divide(v[i]);
            }
            while (!number.compareAndSet(old_r, r));
        }
        catch (ArithmeticException ex) {
            // prévoir la gestion de l'exception division par zéro sur exception seulement.
View Full Code Here

            BigInteger r;
            do {
                old_r = number.get();
                r = old_r;
                for (int i = 0; i < v.length; i++)
                    r = r.divide(v[i]);
            }
            while (!number.compareAndSet(old_r, r));
            return Node.createExternal(new External_Integer(old_r));
        }
        catch (ArithmeticException ex) {
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.