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

4 votes136 views2 answers
Python map input
Python
0 vote144 views1 answer
Rectangle function numpy
Python
0 vote146 views1 answer
Lista to txt python
Python
4 votes151 views2 answers
Python mkdir
Python
3 votes130 views3 answers
Python socket get ip address
Python
1 vote131 views1 answer
How to watermark a video using python
Python
1 vote141 views1 answer
Cursor python
Python
3 votes201 views2 answers
Range of letters python
Python
0 vote127 views2 answers
NameError: name 'request' is not defined
Python
0 vote138 views1 answer
Funzione generatore python
Python