(Soft Question) Largest known Fermat Pseudoprime to a particular base
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
I am aware that Carmichael Numbers can produce 300-billion-digit long absolute Fermat Pseudoprimes, which are Fermat Pseudoprimes to all coprime bases k. I was wondering if there are larger known Fermat Pseudoprimes that are only pseudoprime to say one coprime base k, or if the largest known Fermat Pseudoprimes are simply Carmichael Numbers, regardless of whether they are absolute.
elementary-number-theory
add a comment |Â
up vote
0
down vote
favorite
I am aware that Carmichael Numbers can produce 300-billion-digit long absolute Fermat Pseudoprimes, which are Fermat Pseudoprimes to all coprime bases k. I was wondering if there are larger known Fermat Pseudoprimes that are only pseudoprime to say one coprime base k, or if the largest known Fermat Pseudoprimes are simply Carmichael Numbers, regardless of whether they are absolute.
elementary-number-theory
1
Every composite Fermat number $F_n=2^2^n+1$ is a pseudoprime base 2.
â gammatester
Aug 14 at 7:39
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I am aware that Carmichael Numbers can produce 300-billion-digit long absolute Fermat Pseudoprimes, which are Fermat Pseudoprimes to all coprime bases k. I was wondering if there are larger known Fermat Pseudoprimes that are only pseudoprime to say one coprime base k, or if the largest known Fermat Pseudoprimes are simply Carmichael Numbers, regardless of whether they are absolute.
elementary-number-theory
I am aware that Carmichael Numbers can produce 300-billion-digit long absolute Fermat Pseudoprimes, which are Fermat Pseudoprimes to all coprime bases k. I was wondering if there are larger known Fermat Pseudoprimes that are only pseudoprime to say one coprime base k, or if the largest known Fermat Pseudoprimes are simply Carmichael Numbers, regardless of whether they are absolute.
elementary-number-theory
asked Aug 14 at 7:30
Tejas Rao
265
265
1
Every composite Fermat number $F_n=2^2^n+1$ is a pseudoprime base 2.
â gammatester
Aug 14 at 7:39
add a comment |Â
1
Every composite Fermat number $F_n=2^2^n+1$ is a pseudoprime base 2.
â gammatester
Aug 14 at 7:39
1
1
Every composite Fermat number $F_n=2^2^n+1$ is a pseudoprime base 2.
â gammatester
Aug 14 at 7:39
Every composite Fermat number $F_n=2^2^n+1$ is a pseudoprime base 2.
â gammatester
Aug 14 at 7:39
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2882165%2fsoft-question-largest-known-fermat-pseudoprime-to-a-particular-base%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
1
Every composite Fermat number $F_n=2^2^n+1$ is a pseudoprime base 2.
â gammatester
Aug 14 at 7:39