On the counting function of elliptic Carmichael numbers

DOI10.4153/CMB-2012-037-4MaRDI QIDQ5405296zbMATH OpenFDO

Authors Florian Luca, Igor E. Shparlinski

Publication date 2 April 2014

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.3476

zbMATH Keywords

applications of sieve methodselliptic Carmichael numbers

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Primality (11Y11)

Abstract: We give an upper bound for the number elliptic Carmichael numbers $nlex$ that have recently been introduced by J. H. Silverman. We also discuss several possible ways for further improvements.

Recommendations

• Infinitude of elliptic Carmichael numbers
• The non-existence of universal Carmichael numbers
• On elliptic Carmichael numbers in arithmetic progressions
• On the Number of Elliptic Pseudoprimes
• scientific article; zbMATH DE number 15977

Cited in

(8)

• On Fibonacci numbers which are elliptic Carmichael
• Anomalous primes and the elliptic Korselt criterion
• Infinitude of elliptic Carmichael numbers
• Elliptic Carmichael numbers and elliptic Korselt criteria
• There are infinitely many elliptic Carmichael numbers
• On elliptic Carmichael numbers in arithmetic progressions
• The non-existence of universal Carmichael numbers
• Arithmetic properties of coefficients of L-functions of elliptic curves

This page was built for publication: On the counting function of elliptic Carmichael numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405296)