Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-26T00:59:03.065Z Has data issue: false hasContentIssue false
  • English
  • Français

ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS

Part of: Multiplicative number theory Elementary number theory Computational number theory

Published online by Cambridge University Press:  26 April 2010

WILLIAM D. BANKS  and
CARL POMERANCE
WILLIAM D. BANKS*
Affiliation:
Department of Mathematics, University of Missouri, Columbia, MO 65211, USA (email: [email protected])
CARL POMERANCE
Affiliation:
Department of Mathematics, Dartmouth College, Hanover, NH 03755-3551, USA (email: [email protected])
*
✉For correspondence; e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Assuming a conjecture intermediate in strength between one of Chowla and one of Heath-Brown on the least prime in a residue class, we show that for any coprime integers a and m≥1, there are infinitely many Carmichael numbers in the arithmetic progression a mod m.

Keywords

Carmichael numberarithmetic progression

MSC classification

Secondary: 11N13: Primes in progressions 11A51: Factorization; primality 11N25: Distribution of integers with specified multiplicative constraints 11Y11: Primality
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 88 , Issue 3 , June 2010 , pp. 313 - 321
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2010

Footnotes

The second author was supported in part by NSF grant DMS-0703850.

References

[1]Alford, W., Granville, A. and Pomerance, C., ‘There are infinitely many Carmichael numbers’, Ann. of Math. (2) 139 (1994), 703–722.CrossRefGoogle Scholar
[2]Alford, W., Granville, A. and Pomerance, C., ‘On the difficulty of finding reliable witnesses’, in: Algorithmic Number Theory (Ithaca, NY, 1994), Lecture Notes in Computer Science, 877 (Springer, Berlin, 1994), pp. 1–16.Google Scholar
[3]Chowla, S., ‘On the least prime in an arithmetical progression’, J. Indian Math. Soc. (N.S.) 1 (1934), 1–3.Google Scholar
[4]Friedlander, J. B., ‘Shifted primes without large prime factors’, in: Number Theory and Applications (ed. Mollin, R. A.) (Kluwer, Dordrecht, 1989), pp. 393–401.Google Scholar
[5]Harman, G., ‘Watt’s mean value theorem and Carmichael numbers’, Int. J. Number Theory 4 (2008), 241–248.CrossRefGoogle Scholar
[6]Heath-Brown, D. R., ‘Almost-primes in arithmetic progressions and short intervals’, Math. Proc. Cambridge Philos. Soc. 83 (1978), 357–375.CrossRefGoogle Scholar
[7]Pinch, R. G. E., ‘The Carmichael numbers up to 1015’, Math. Comp. 61 (1993), 381–391.Google Scholar
[8]Pomerance, C., Selfridge, J. L. and Wagstaff, S. S. Jr, ‘The pseudoprimes to 25×109’, Math. Comp. 35 (1980), 1003–1026.Google Scholar
[9]Rotkiewicz, A., ‘Sur les nombres pseudopremiers de la forme ax+b’, C. R. Acad. Sci. Paris 257 (1963), 2601–2604.Google Scholar
[10]Rotkiewicz, A., ‘On the pseudoprimes of the form ax+b’, Proc. Cambridge Philos. Soc. 63 (1967), 389–392.CrossRefGoogle Scholar
[11]van der Poorten, A. J. and Rotkiewicz, A., ‘On strong pseudoprimes in arithmetic progressions’, J. Aust. Math. Soc. Ser. A 29 (1980), 316–321.CrossRefGoogle Scholar