Results 1 
2 of
2
AN ANALOGUE OF THE SIEGELWALFISZ THEOREM FOR THE CYCLICITY OF CM ELLIPTIC CURVES MOD p
"... Abstract. Let E be a CM elliptic curve defined over Q and of conductor N. We establish an asymptotic formula, uniform in N and with improved error term, for the counting function of primes p for which the reduction mod p of E is cyclic. Our result resembles the classical SiegelWalfisz theorem regar ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Let E be a CM elliptic curve defined over Q and of conductor N. We establish an asymptotic formula, uniform in N and with improved error term, for the counting function of primes p for which the reduction mod p of E is cyclic. Our result resembles the classical SiegelWalfisz theorem regarding the distribution of primes in arithmetic progressions. 1.