package matrixMultiplication.Prime;

public class ModularOperations {
    public static void main(String[] args) {
        double initialTime = System.currentTimeMillis();
        ModularOperations op = new ModularOperations();

        for (int i = 0; i < 10000; i++) {
            long prime = op.generatePrimeSeeded(i);
            System.out.println(prime);
        }

        double finalTime = System.currentTimeMillis();
        System.out.println(finalTime - initialTime);
    }

    public long generatePrimeSeeded(int seed) {
        int num = (int) (Math.pow(seed * Math.random(), 10 * Math.random()) * Math.random() * Math.random() * 10);
        if (num > 1) {
            for (int i = 1; i < num && num > 1; i++) {
                if (calculateGCD(num, i) > 1) {
                    return generatePrimeSeeded(seed);
                }
            }
            return num;
        }
        return generatePrimeSeeded(seed);
    }

    private int calculateGCD(int a, int b) {
        if (b == 0)
            return b;
        return calculateGCD(b, a % b);
    }
}