|Apr7-12, 06:08 AM||#1|
Maximal number of bases for which composite number is Fermat pseudoprime
According to the Wikipedia article a composite number n is a strong pseudoprime to at most one quarter of all bases below n .
Do Fermat pseudoprimes have some similar property ? Is it known what is the largest number of bases for which composite n , that is not Carmichael number is Fermat pseudoprime ?
|Apr10-12, 01:11 AM||#2|
2701 does pretty well, at about 48% bases.
|Apr12-12, 11:54 PM||#3|
Looks like it stays under 50% pseudoprime bases for non-Carmichaels. Typically for the close approaches to 50% there's another root of 1 (other than -1) which also takes almost half of the results. The multiples of the factors take a different value from the Fermat test of course.
|Similar Threads for: Maximal number of bases for which composite number is Fermat pseudoprime|
|number theory problem about Fermat 's little theorem||Calculus & Beyond Homework||4|
|Number Theorems and Number Bases||General Math||4|
|maximal number of independent random variables||Set Theory, Logic, Probability, Statistics||6|
|Group Theory + Fermat's Little Number Theorem||Calculus & Beyond Homework||4|