def wilson(n): """ Implementaión del test de primalidad de Wilson, basado en el teorema de Wilson, (p-1)! ≡ -1 mod p :param n: El número a determinar su primalidad. :return: True si n es primo, False en otro caso. """ return fac(n - 1) % n + 1 == n
def test_unexpeted_types(self): for uv in self.unexpected_values: try: self.assertRaises(ValueError, fac(float())) except: pass
def test_int_conversion(self): for i in range(random.randint(1, self.end)): good_value = math.factorial(i) i = str(i) self.assertEqual(good_value, fac(i))
def test_negative(self): try: self.assertRaises(ValueError, fac(-1)) except ValueError: pass
def test_zero(self): self.assertEqual(1, fac(0))
def test_positive(self): for i in range(random.randint(1, self.end)): self.assertEqual(math.factorial(i), fac(i))
def test_number(self): self.assertEqual(24,fac(4)) self.assertEqual(120,fac(5)) self.assertEqual(720,fac(6))
def test_illegal(self): with self.assertRaises(ValueError): fac(-4) with self.assertRaises(ValueError): fac(3.1415)
def test_zero(self): self.assertEqual(1,fac(0))
def test_number(self): self.assertEqual(24, fac(4)) self.assertEqual(120, fac(5)) self.assertEqual(720, fac(6))