Prime analogues of the Erdős–Kac theorem for elliptic curves
✍ Scribed by Yu-Ru Liu
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 146 KB
- Volume
- 119
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
✦ Synopsis
Let E/Q be an elliptic curve. For a prime p of good reduction, let E(F p ) be the set of rational points defined over the finite field F p . We denote by ω(#E(F p )), the number of distinct prime divisors of #E(F p ). We prove that the quantity (assuming the GRH if E is non-CM) ω(#E(F p ))log log p √ log log p distributes normally. This result can be viewed as a "prime analogue" of the Erdős-Kac theorem. We also study the normal distribution of the number of distinct prime factors of the exponent of E(F p ).
📜 SIMILAR VOLUMES
An analogue of the Erd6s-Ko-Rado theorem is proved for the distance-regular graphs Hq(k, n) with k x n matrices over GF(q) as vertex set and two matrices A and B adjacent if the rank of A -B is 1, where n >~ k + 1 and (n, q) ~ (k + 1, 2). As an easy corollary, we prove that Hq(k, n) has no perfect e