lint recommendations

tests/test_factor_qs.py

@@ -6,4 +6,4 @@
 def test_qs():
     for n in [832283, 2**32+1]:
         m = factor_qs(n)
-        assert n % m == 0 and 1 < m and m < n
+        assert n % m == 0 and 1 < m < n

tests/test_intfuncs.py

@@ -34,20 +34,20 @@ def test_ilog():
 
 def test_perfect_square():
     for n in (-1, 0, 1):
-        assert perfect_square(n) == None
+        assert perfect_square(n) is None
     for n in range(2, maxrange):
         factors = factorint(n)
         res = perfect_square(n)
         if all(not (k % 2) for k in factors.values()):
             assert isinstance(res, int)
             assert res**2 == n
         else:
-            assert res == None
+            assert res is None
 
 
 def test_perfect_power():
     for n in (-1, 0, 1):
-        assert perfect_power(n) == None
+        assert perfect_power(n) is None
     for n in range(2, maxrange):
         factors = factorint(n)
         res = perfect_power(n)
@@ -63,15 +63,15 @@ def test_perfect_power():
                 assert isinstance(res, tuple)
                 assert res[0]**res[1] == n
             else:
-                assert res == None
+                assert res is None
         else:
-            assert res == None
-            assert perfect_power(-n) == None
+            assert res is None
+            assert perfect_power(-n) is None
 
 
 def test_prime_power():
     for n in (-1, 0, 1):
-        assert prime_power(n) == None
+        assert prime_power(n) is None
     for p in sieve_eratosthenes(30):
         for k in range(1, 6):
             assert prime_power(p**k) == (p, k)

tests/test_nt.py

@@ -118,4 +118,4 @@ def test_is_carmichael_number():
     for n in range(OEIS_A002997[4]+2):
         assert is_carmichael_number(n) == (n in OEIS_A002997)
     for n in OEIS_A002997:
-        assert is_carmichael_number(n) == True
+        assert is_carmichael_number(n) is True