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 vote281 views2 answers
How to make a bill in python
Python
1 vote290 views1 answer
Two elements at a time in list comprehension
Python
0 vote296 views1 answer
Coefficient of variation python
Python
0 vote284 views1 answer
Pandas add days to date
Python
6 votes255 views1 answer
How to get username with userid discord.py
Python
0 vote291 views1 answer
Pyglet on button press
Python
55 votes254 views4 answers
Python compiler online
Python
0 vote223 views0 answer
Python
0 vote222 views1 answer
Cv2.filter2D(image, -2, kernel_3x3)
Python
0 vote264 views1 answer
Replace string between two regex python
Python