claim: The two most cited composites are PMOD and ACRIM.
evidence: A Fibonacci pseudoprime is often defined as a composite number n not divisible by 5 for which congruence ( 1 ) holds with P = 1 and Q = −1 ( but n is  ).