Papers
Topics
Authors
Recent
Search
2000 character limit reached

Elliptic Carmichael Numbers and Elliptic Korselt Criteria

Published 18 Aug 2011 in math.NT | (1108.3830v1)

Abstract: Let E/Q be an elliptic curve, let L(E,s)=\sum a_n/ns be the L-series of E/Q, and let P be a point in E(Q). An integer n > 2 having at least two distinct prime factors will be be called an elliptic pseudoprime for (E,P) if E has good reduction at all primes dividing n and (n+1-a_n)P = 0 (mod n). Then n is an elliptic Carmichael number for E if n is an elliptic pseudoprime for every P in E(Z/nZ). In this note we describe two elliptic analogues of Korselt's criterion for Carmichael numbers, and we analyze elliptic Carmichael numbers of the form pq.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.