Carmichael numbers

Demonstrate that the Carmichael numbers (the smallest few are 561, 1105, 1729, 2465, 2821 and 6601) really do fool the Fermat test. That is, write a procedure carmichael-test that takes an integer n and tests whether a in the power of n is congruent to a modulo n for every a < n , and try your procedure on the given Carmichael numbers.


    # VadymMan
    2 months ago
    Hi, everyone! I'm new here, could u please clarify, why do I get this: program: true: unbound identifier in: true location...: program context...: /app/.heroku/racket/share/pkgs/sandbox-lib/racket/sandbox.rkt:753:18 my assumption: I'm using not orthodoxia Racket lang version here.
    # Feycot Replied to VadymMan #
    1 month ago
    Hi, everyone! I'm new here, could u please clarify, why do I get this: program: true: unbound identifier in: true location...: program context...: /app/.heroku/racket/share/pkgs/sandbox-lib/racket/sandbox.rkt:753:18 my assumption: I'm using not orthodoxia Racket lang version here.
    hi can you save your code and share it?
Authentication required

You must log in to post a comment.

Login