Abstract
Let be an elliptic curve with complex multiplication (CM), and for each prime of good reduction, let denote the trace of Frobenius. By the Hasse bound, for a unique . In this paper, we prove that the least prime such that satisfies where is the conductor of and the implied constant and exponent are absolute and effectively computable. Our result is an analogue for CM elliptic curves of Linnik's Theorem for arithmetic progressions, which states that the least prime for satisfies for an absolute constant .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.