Name
Abstract | ||
|---|---|---|
An odd composite number n for which a(n-1) equivalent to 1 (mod n) for all integers a coprime to it is called a Carmichael number. This paper shows that some class of Carmichael numbers which have relatively large prime factors can be recognized in deterministic polynomial time under the assumption of the Extended Riemann Hypothesis (ERH). Also some related problems are discussed. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transfun.E92.A.326 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
Carmichael numbers, primality test, integer factoring, Extended Riemann Hypothesis | Carmichael function,Integer,Discrete mathematics,Carmichael number,Combinatorics,Primality test,Fermat's little theorem,Riemann hypothesis,Prime factor,Coprime integers,Mathematics | Journal |
Volume | Issue | ISSN |
E92A | 1 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| masaru uchiyama | 1 | 587 | 90.30 |
| Shigenori Uchiyama | 2 | 371 | 40.90 |