/** * Checking polynomial for irreducibility * * @param p polinomial * @return true if p is irreducible and false otherwise */ public static boolean isIrreducible(int p) { if (p == 0) { return false; } int d = degree(p) >>> 1; int u = 2; for (int i = 0; i < d; i++) { u = modMultiply(u, u, p); if (gcd(u ^ 2, p) != 1) { return false; } } return true; }
/** * Checking polynomial for irreducibility * * @param p polinomial * @return true if p is irreducible and false otherwise */ public static boolean isIrreducible(int p) { if (p == 0) { return false; } int d = degree(p) >>> 1; int u = 2; for (int i = 0; i < d; i++) { u = modMultiply(u, u, p); if (gcd(u ^ 2, p) != 1) { return false; } } return true; }