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 vote343 views1 answer
Pyubx
Python
36 votes273 views6 answers
Remove letter from string python
Python
1 vote326 views1 answer
Any python type hint
Python
0 vote302 views1 answer
Sql to python converter
Python
0 vote283 views1 answer
Display all resources in table pandas
Python
17 votes296 views3 answers
Python get current file location
Python
0 vote291 views1 answer
Escape sequence in python
Python
23 votes392 views5 answers
Flask app example
Python Flask
2 votes288 views1 answer
Range python iterate by 2
Python
0 vote302 views1 answer
In deserialize_keras_object raise ValueError('Unknown ' + printable_module_name + ':' + object_name) ValueError: Unknown loss function:contrastive_loss
Python