On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-\(p\) digits. (English) Zbl 1479.11028

A Carmichael number is a composite number \(m\) such that the congruence \(a^m\equiv 1 \pmod{m}\) holds for all integers \(a\) coprime to \(m\). This congruence holds for all prime \(m\) by Fermat’s little theorem. This paper complements two different characterizations of Carmichael numbers, due to Korselt and Carmichael. It draws new and interesting connections between Carmichael numbers and the function \(s_p(m)\), where \(s_p(m)\) denotes the sum of the digits of \(m\) expressed in base \(p\).
This paper defines {primary Carmichael numbers}, a subset of the Carmichael numbers given by those squarefree \(m\) such that \(s_p(m)= p\) for all prime divisors of \(m\). It also defines a subset of the integers containing the Carmichael numbers, given by those squarefree \(m\) such that \(s_p(m)\geq p\) for all prime divisors of \(m\).
This paper then offers a new characterization of the Carmichael numbers in terms of the sum of digits function, as squarefree \(m\) satisfying \[\{m: p|m \text{ implies } s_p(m)\geq p,\quad s_p(m) \equiv 1 \pmod{p-1}\},\] complementing the characterizations of Korselt and Carmichael. It then proves some results expressing the denominators of the Bernoulli polynomials in terms of \(s_p(m)\). It also provides another explicit characterization of the Carmichael numbers in terms of polygonal numbers and \(s_p(m)\). The proofs follow from from clever elementary number theoretic considerations.


11A51 Factorization; primality
11B68 Bernoulli and Euler numbers and polynomials
11A63 Radix representation; digital problems
Full Text: arXiv Link


[1] W. R. Alford, A. Granville, and C. Pomerance, There are infinitely many Carmichael numbers, Ann. of Math.139(1994), 703-722. · Zbl 0816.11005
[2] A. H. Beiler,Recreations in the Theory of Numbers, Dover, New York, 1966. · Zbl 0154.04001
[3] R. D. Carmichael, Note on a new number theory function,Bull. Amer. Math. Soc.16(1910), 232-238. · JFM 41.0226.04
[4] R. D. Carmichael, On composite numbersPwhich satisfy the Fermat congruenceaP−1≡ 1 (modP),Amer. Math. Monthly19(1912), 22-27.
[5] T. Clausen, Lehrsatz aus einer Abhandlung ¨uber die Bernoullischen Zahlen,Astr. Nachr.17 (1840), 351-352.
[6] K. Conrad, Carmichael numbers and Korselt’s criterion, expository paper (2016), 1-3. Availableathttp://www.math.uconn.edu/ kconrad/blurbs/ugradnumthy/carmichaelkorselt. pdf.
[7] J. H. Conway and R. K. Guy,The Book of Numbers, Springer-Verlag, New York, 1996. · Zbl 0866.00001
[8] R. Crandall and C. B. Pomerance,Prime Numbers: A Computational Perspective, 2nd ed., Springer, New York, 2005. · Zbl 1088.11001
[9] P. Erd˝os, On pseudoprimes and Carmichael numbers,Publ. Math. Debrecen4(1956), 201-206.
[10] A. Granville and C. Pomerance, Two contradictory conjectures concerning Carmichael numbers,Math. Comp.71(2002), 883-908. · Zbl 0991.11067
[11] R. K. Guy,Unsolved Problems in Number Theory, 3rd ed., Springer, New York, 2004. · Zbl 1058.11001
[12] G. H. Hardy,Ramanujan, Cambridge Univ. Press, New York, 1940.
[13] G. Harman, Watt’s mean value theorem and Carmichael numbers,Int. J. Number Theory4 (2008), 241-248. · Zbl 1221.11194
[14] D. R. Heath-Brown, Carmichael numbers with three prime factors,Hardy-Ramanujan J.30 (2007), 6-12. · Zbl 1151.11047
[15] B. C. Kellner, On a product of certain primes,J. Number Theory179(2017), 126-141. · Zbl 1418.11045
[16] B. C. Kellner and J. Sondow, Power-sum denominators,Amer. Math. Monthly124(2017), 695-709. · Zbl 1391.11052
[17] B. C. Kellner and J. Sondow, The denominators of power sums of arithmetic progressions, Integers18(2018), #A95, 1-17. · Zbl 1423.11029
[18] W. Kn¨odel, Carmichaelsche Zahlen,Math. Nachr.9(1953), 343-350.
[19] W. Kn¨odel, Eine obere Schranke f¨ur die Anzahl der Carmichaelschen Zahlen kleiner alsx, Arch. Math.4(1953), 282-284.
[20] A. Korselt, Probl‘eme chinois,L’Interm´ediaire Math.6(1899), 142-143.
[21] A. Makowski, Generalization of Morrow’sDnumbers,Simon Stevin36(1962), 71.
[22] R. G. E. Pinch, The Carmichael numbers up to 1021, Proceedings of Conference on Algorithmic Number Theory 2007, A. Ernvall-Hyt¨onen et al., eds.,TUCS General Publication46, Turku Centre for Computer Science, 2007, 129-131.
[23] C. Pomerance, J. L. Selfridge, and S. Wagstaff, The pseudoprimes to 25·109,Math. Comp. 35(1980), 1003-1026. · Zbl 0444.10007
[24] P. Ribenboim,The New Book of Prime Number Records, Springer, New York, 2012. · Zbl 0856.11001
[25] A. M. Robert,A Course inp-adic Analysis, GTM198, Springer-Verlag, New York, 2000.
[26] K. G. C. von Staudt, Beweis eines Lehrsatzes die Bernoullischen Zahlen betreffend,J. Reine Angew. Math.21(1840), 372-374
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.