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

14 votes221 views6 answers
Ruby print
Python
7 votes265 views3 answers
Concat dataframes
Python
0 vote282 views1 answer
Minimum Number of Operations to Move All Balls to Each Box in python used in function method
Python
9 votes265 views1 answer
Print current dirfile dir python
Python
0 vote271 views3 answers
Waitress
Python
0 vote263 views1 answer
Add label to colorbar
Python
0 vote260 views1 answer
How to close windows in selenium python without quitting the browser
Python
5 votes335 views1 answer
Pandas version check in python
Python
-1 vote263 views1 answer
What is append use
Python
2 votes276 views1 answer
Get dictionary in array python by value
Python