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

0 vote225 views2 answers
Iterate a list of tuples
Python
1 vote193 views1 answer
5**5
Python
71 votes174 views10 answers
Sus sus sus
Python
0 vote201 views1 answer
Merge all mp4 video files into one file python
Python
0 vote214 views1 answer
Python while loop
Python
0 vote200 views1 answer
Convert from R to python
Python
0 vote184 views1 answer
In <lambda> tk.Button(self.frame, text = text, command= lambda:self.new_window(number, _class)).grid(padx= 5, pady= 5, sticky= N + E + W + S) File "C:\Users\CSB\Desktop\python program\triple_window.py", line 50, in new_window
Python
0 vote157 views1 answer
Python extract mails from string
Python
0 vote235 views1 answer
Non preemptive priority scheduling in c#
Python
0 vote215 views1 answer
Python os path safe string
Python