B12 vegetables only

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

62 votes270 views6 answers
Time in python
Python
0 vote278 views1 answer
Sigmoid prime Python
Python
11 votes307 views4 answers
How to make a qr code generator in python
Python
-2 votes278 views2 answers
In python [:-1]
Python
0 vote223 views1 answer
Error: getaddrinfo ENOTFOUND www.python.org www.python.org:443 Downloading Python failed. Error: { Error: getaddrinfo ENOTFOUND www.python.org www.python.org:443
Python
6 votes254 views2 answers
Sys.executable
Python
15 votes274 views5 answers
Tkinter tutorial
Python
2 votes272 views2 answers
Python replace newline
Python
4 votes285 views2 answers
How to get the most common number in python
Python
3 votes272 views2 answers
Char to binary python
Python