def zad_3(): n = 5 solutions = [] primes = Modular.nPrime(n) ran = range(1, 2048) for i in range(1, n + 1): solutions.append(Modular.ModuloEquatation(1, i, primes[i - 1], ran)) base = set(solutions[0]) for i in range(1, n): B = set(solutions[i]) base = base.intersection(B) x = min(base) print(x) is_prime = Modular.is_prime(x) print("is prime:", is_prime) result1 = Modular.tau(x) print(result1) result2 = Modular.phi(x) print(result2) result3 = Modular.jota(x) print(result3) result4 = Modular.kanon(x) print(result4)
def test_nPrimeNumbers(self): expected = [2, 3, 5, 7, 11] n = 5 self.assertEquals(expected, Modular.nPrime(n))