List of gcd() Examples

Examples of gcd()

java.math.BigInteger.gcd()
Returns a BigInteger whose value is the greatest common divisor of {@code abs(this)} and {@code abs(val)}. Returns 0 if {@code this==0 && val==0}. @param val value with which the GCD is to be computed. @return {@code GCD(abs(this), abs(val))}
lipstone.joshua.parser.types.BigDec.gcd()
Computes the greatest common divisor of this number and other @param other another integer @return the gcd of this number and other @throws UndefinedResultException if either this number or other is not an integer

Examples of java.math.BigInteger.gcd()

        long longPhase = Math.round(dashPhase);
        BigInteger gcd = BigInteger.valueOf(Math.round(dashArray[0]));
        int sum = 0;
        for (int i = 0; i < longArrLength; i++) {
            longArray[i] = Math.round(dashArray[i % dashArray.length]);
            gcd = gcd.gcd(BigInteger.valueOf(longArray[i]));
            sum += longArray[i];
        }


        if (dashPhase != 0) {
            gcd = gcd.gcd(BigInteger.valueOf(longPhase));

View Full Code Here

Examples of java.math.BigInteger.gcd()

            gcd = gcd.gcd(BigInteger.valueOf(longArray[i]));
            sum += longArray[i];
        }


        if (dashPhase != 0) {
            gcd = gcd.gcd(BigInteger.valueOf(longPhase));
            longPhase /= gcd.longValue();
        }


        sum /= gcd.longValue();

View Full Code Here

Examples of java.math.BigInteger.gcd()

                ++currentSize;
            } while (pointer != start);
            counter += currentSize;
            temp = BigInteger.valueOf(currentSize);
            //calculate l.c.m.
            lcm = (lcm.divide(lcm.gcd(temp))).multiply(temp);
        }
        return lcm;
    }


    /**

View Full Code Here

Examples of java.math.BigInteger.gcd()

                ++currentSize;
            } while (pointer != start);
            counter += currentSize;
            temp = BigInteger.valueOf(currentSize);
            //calculate l.c.m.
            lcm = (lcm.divide(lcm.gcd(temp))).multiply(temp);
        }
        return lcm;
    }


    /**

View Full Code Here

Examples of java.math.BigInteger.gcd()

                ++currentSize;
            } while (pointer != start);
            counter += currentSize;
            temp = BigInteger.valueOf(currentSize);
            //calculate l.c.m.
            lcm = (lcm.divide(lcm.gcd(temp))).multiply(temp);
        }
        return lcm;
    }


    /**

View Full Code Here

Examples of java.math.BigInteger.gcd()

        long longPhase = Math.round(dashPhase);
        BigInteger gcd = BigInteger.valueOf(Math.round(dashArray[0]));
        int sum = 0;
        for (int i = 0; i < longArrLength; i++) {
            longArray[i] = Math.round(dashArray[i % dashArray.length]);
            gcd = gcd.gcd(BigInteger.valueOf(longArray[i]));
            sum += longArray[i];
        }


        if (dashPhase != 0) {
            gcd = gcd.gcd(BigInteger.valueOf(longPhase));

View Full Code Here

Examples of java.math.BigInteger.gcd()

            gcd = gcd.gcd(BigInteger.valueOf(longArray[i]));
            sum += longArray[i];
        }


        if (dashPhase != 0) {
            gcd = gcd.gcd(BigInteger.valueOf(longPhase));
            longPhase /= gcd.longValue();
        }


        sum /= gcd.longValue();

View Full Code Here

Examples of java.math.BigInteger.gcd()

        long longPhase = Math.round(dashPhase);
        BigInteger gcd = BigInteger.valueOf(Math.round(dashArray[0]));
        int sum = 0;
        for (int i = 0; i < longArrLength; i++) {
            longArray[i] = Math.round(dashArray[i % dashArray.length]);
            gcd = gcd.gcd(BigInteger.valueOf(longArray[i]));
            sum += longArray[i];
        }


        if (dashPhase != 0) {
            gcd = gcd.gcd(BigInteger.valueOf(longPhase));

View Full Code Here

Examples of java.math.BigInteger.gcd()

            gcd = gcd.gcd(BigInteger.valueOf(longArray[i]));
            sum += longArray[i];
        }


        if (dashPhase != 0) {
            gcd = gcd.gcd(BigInteger.valueOf(longPhase));
            longPhase /= gcd.longValue();
        }


        sum /= gcd.longValue();

View Full Code Here

Examples of java.math.BigInteger.gcd()

          assertTrue("inverse less than zero: " + a + " inv mod "
              + mod + " equals " + inv, inv
              .compareTo(BigInteger.ZERO) >= 0);
        } catch (ArithmeticException e) {
          assertTrue("should have found inverse for " + a + " mod "
              + mod, !one.equals(a.gcd(mod)));
        }
            }
    }
    for (int j = 1; j < 10; j++) {
      mod = bi2.add(BigInteger.valueOf(j));

View Full Code Here

0 1

TOP

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.