Definition:

An absolute Fermat pseudoprime, also known as a Carmichael number, is a composite number which passes the Fermat test for any base a s.t.

(a,N) = 1.

Question:

How many values of a are necessary to determine the primality or compositeness of those N in the trial range $\displaystyle <10^6 $

which are not absolute Fermat pseudoprimes?