Question

Imagine I chose 10-digit prime numbers p,q and r, such that n=pqr happened to be a Carmichael number. Write down an exact formula for the probability that a random a∈ {0,1, . . . , n−1} detects the compositeness of n when used in Fermat’s compositeness test. That is, how many of these a fail to satisfy a^(n−1)≡1 modn. Show that the probability that a random a will detect the compositeness of n is less than 1 in a billion

Answer 1

Ansues; Fermat's Bitte theore扪States thał pine nx( Pv) and a lastive Ttege, then -> However, the converse false, thata, for integers 'a' and 、甲1 , if Plo.at nt or Instant, a folse Stateme 561 ) a for some intee' 、a' , but S6l 있 actually Compesite number, and such nunbers ae called Carmichael nひmbers Say Such that klaa for cempesite integex, S all integers 、a a nice citiian for Suare force N>I;N凹casmi eha el number p-1 [N-I holus for ever Pime P/N There hee add composite and anly i Tf N is not Sqjuaodd and Comfosite i cannot be cavmîchoel numbex moveever, '4 f Can be Show that N u be atlealt three Prime

Prime acters n-1 |carmichael numbers if each。f3' factors is Prime. This es Sene ekamples oley kt userk Actually tYe value e Plat-a dejert the cempat trey dt、n' te than、'' in bition.