Find Carmichael number sage

for n in range(2,7000):
    if not is_prime(n):
        carmichael = True
        for a in range(1,n):
            if Mod(a,n)^n != Mod(a,n):
                carmichael = False
                break
        if carmichael:
            print n

Source: math.ucdavis.edu

Similar codes

0 vote152 views1 answer
Python join tuple integer to string
Python
0 vote159 views1 answer
Chromebook install pip
Python
7 votes178 views4 answers
Python import timezone
Python
0 vote164 views1 answer
Drf serializer general validate method
Python
0 vote169 views1 answer
Bs
Python
7 votes171 views3 answers
How to display data in ascending order in django
Python
1 vote169 views1 answer
How to find the most similar word in a list in python
Python
0 vote182 views1 answer
A GDAL API version must be specified. Provide a path to gdal-config using a GDAL_CONFIG environment variable or use a GDAL_VERSION environment variable.
Python
0 vote231 views2 answers
Python trace table
Python
1 vote175 views1 answer
Concatenate dataframes pandas without duplicates
Python