fermat_little_theorem_test_alt.py

from math import gcd

def test_property(candidate: int, max_progression: int=100):
    """Returns True if Fermat's little theorem's property is verified for a
    limited number of progressions."""
    test_progressions = range(2, max_progression)

    for progression in range(2, max_progression):
        if gcd(progression, candidate) != 1:
            # THIS IS DIFFERENT
            # if the progression and the candidate or not co-prime, skip this test
            continue
        elif (progression ** (candidate - 1)) % candidate != 1:
            # the property isn't verified if any of the n-th-1 power mod p is
            # a number other than 1
            return False

    return True