Florian Luca, Igor E. Shparlinski
Published 2012-06-15Version 1
We give an upper bound for the number elliptic Carmichael numbers $n \le x$ that have recently been introduced by J. H. Silverman. We also discuss several possible ways for further improvements.
On the counting function of sets with even partition functions
On the counting function for numerical monoids
On the counting function of semiprimes
![QR code for arXiv:1206.3476 [math.NT]](http://oss.arxitics.com/images/favicon.svg)