## On the infinitude of elliptic Carmichael numbers

dc.contributor.advisor | Thakur, Dinesh S. | en_US |

dc.contributor.author | Ekstrom, Aaron Todd | |

dc.creator | Ekstrom, Aaron Todd | en_US |

dc.date.accessioned | 2013-05-09T09:27:54Z | |

dc.date.available | 2013-05-09T09:27:54Z | |

dc.date.issued | 1999 | en_US |

dc.identifier.uri | http://hdl.handle.net/10150/289053 | |

dc.description.abstract | For any elliptic curve E with complex multiplication by an order in K=Q(√-d), a point Q of infinite order on E, and any prime p with gcd{Δ(E),p} = 1, (-dǀp) = -1 , we have that [p+1]·Q = O (mod p) where Δ(E) is the discriminant of E, O is the point at infinity and calculations are done using the addition law for E. Any composite number p which satisfies these conditions for any rational point on any CM elliptic curve over Q with discriminant prime to p is called an elliptic Carmichael number. For our main result, we modify the techniques of Alford, Granville and Pomerance to show there exist infinitely many elliptic Carmichael numbers under the assumption that the smallest prime congruent to -1 modulo q is at most q exp[(log q)¹⁻ᵋ]. (Note that this assumption is much weaker than current conjectures about the smallest prime in an arithmetic progression.) We modify the construction of Chernick to provide many examples of elliptic Carmichael numbers. We also show that elliptic Carmichael numbers are squarefree, and modify the techniques of Pomerance, Selfridge, and Wagstaff to prove that the number of elliptic Carmichael numbers up to x with exactly k factors is at most x⁽²ᵏ⁻¹⁾/⁽²ᵏ⁾⁺ᵋ for large enough x. Finally, we prove there are no strong elliptic Carmichael numbers, an analogue of Lehmer's result about strong Carmichael numbers. | |

dc.language.iso | en_US | en_US |

dc.publisher | The University of Arizona. | en_US |

dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |

dc.subject | Mathematics. | en_US |

dc.title | On the infinitude of elliptic Carmichael numbers | en_US |

dc.type | text | en_US |

dc.type | Dissertation-Reproduction (electronic) | en_US |

thesis.degree.grantor | University of Arizona | en_US |

thesis.degree.level | doctoral | en_US |

dc.identifier.proquest | 9957966 | en_US |

thesis.degree.discipline | Graduate College | en_US |

thesis.degree.discipline | Mathematics | en_US |

thesis.degree.name | Ph.D. | en_US |

dc.identifier.bibrecord | .b40143417 | en_US |

refterms.dateFOA | 2018-08-29T06:21:37Z | |

html.description.abstract | For any elliptic curve E with complex multiplication by an order in K=Q(√-d), a point Q of infinite order on E, and any prime p with gcd{Δ(E),p} = 1, (-dǀp) = -1 , we have that [p+1]·Q = O (mod p) where Δ(E) is the discriminant of E, O is the point at infinity and calculations are done using the addition law for E. Any composite number p which satisfies these conditions for any rational point on any CM elliptic curve over Q with discriminant prime to p is called an elliptic Carmichael number. For our main result, we modify the techniques of Alford, Granville and Pomerance to show there exist infinitely many elliptic Carmichael numbers under the assumption that the smallest prime congruent to -1 modulo q is at most q exp[(log q)¹⁻ᵋ]. (Note that this assumption is much weaker than current conjectures about the smallest prime in an arithmetic progression.) We modify the construction of Chernick to provide many examples of elliptic Carmichael numbers. We also show that elliptic Carmichael numbers are squarefree, and modify the techniques of Pomerance, Selfridge, and Wagstaff to prove that the number of elliptic Carmichael numbers up to x with exactly k factors is at most x⁽²ᵏ⁻¹⁾/⁽²ᵏ⁾⁺ᵋ for large enough x. Finally, we prove there are no strong elliptic Carmichael numbers, an analogue of Lehmer's result about strong Carmichael numbers. |