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 vote221 views1 answer
Python compare two json objects and get difference
Python
14 votes189 views3 answers
Create channel
Python
13 votes172 views2 answers
Slug
Python
1 vote189 views1 answer
Python locks
Python
0 vote205 views1 answer
Learn jinja2
Python
22 votes153 views2 answers
Range() function
Python
0 vote188 views1 answer
How to create a numpy array with constant value
Python
0 vote190 views1 answer
Types of system
Python
0 vote214 views1 answer
Save list pickle
Python
17 votes194 views5 answers
Remove punctuation python
Python