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 vote136 views1 answer
Python sliding window
Python
4 votes137 views1 answer
What's the equivalent to System.nanotime in python
Python
0 vote133 views1 answer
Only split from third delimiter python
Python
11 votes149 views1 answer
Pipilika search engine
Python
34 votes173 views3 answers
Python add command
Python
0 vote175 views1 answer
Custom auth django channels
Python
0 vote127 views1 answer
Python list files in folder with wildcard
Python
0 vote140 views1 answer
Train_test_split from sklearn.selection
Python
0 vote147 views3 answers
Remove all parentheses from string python
Python
1 vote102 views2 answers
Fibonacci python
Python