1.2.6. Example: Testing for Primality
Exercise 1.27

Carmichael numbers

Demonstrate that the Carmichael numbers listed in footnote 47 really do fool the Fermat test. That is, write a procedure that takes an integer n and tests whether a^n is congruent to a modulo n for every a < n, and try your procedure on the given Carmichael numbers.

There are no comments yet.

Authentication required

You must log in to post a comment.