Anonymous user
Chernick's Carmichael numbers: Difference between revisions
m
added a category.
m (→{{header|Phix}}: added syntax colouring the hard way) |
m (added a category.) |
||
Line 1:
{{task|Mathematics}}
[[category:Prime Numbers]]
In 1939, Jack Chernick proved that, for '''n ≥ 3''' and '''m ≥ 1''':
|