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

1 vote297 views1 answer
Torch save state dict
Python
0 vote282 views1 answer
How to get the memory location of a varible in python
Python
236 votes644 views6 answers
Import random in python
Python
0 vote287 views1 answer
Concatenate strings of numpy array python
Python
1 vote269 views1 answer
Webhook discord files
Python
0 vote277 views1 answer
Change image in tkinter canvas
Python
0 vote284 views1 answer
Chrome drivers documentation
Python
15 votes330 views2 answers
How to play audio
Python
0 vote277 views1 answer
Python - find columns that are objects
Python
7 votes276 views2 answers
Python pillow crop image
Python