Search arXivSearch

arXiv · 1612.06268

Product formulas for the $5$-division points on the Tate normal form and the Rogers-Ramanujan continued fraction

Abstract

Explicit formulas are proved for the $5$-torsion points on the Tate normal form $E_5$ of an elliptic curve having $(X,Y)=(0,0)$ as a point of order $5$. These formulas express the coordinates of points in $E_5[5] - \langle(0,0)\rangle$ as products of linear fractional quantities in terms of $5$-th roots of unity and a parameter $u$, where the parameter $b$ which defines the curve $E_5$ is given as $b=(\varepsilon^5 u^5- \varepsilon^{-5})/(u^5+1)$ and $\varepsilon = (-1+\sqrt{5})/2$. If $r(τ)$ is the Rogers-Ramanujan continued fraction and $b=r^5(τ)$, then the coordinates of points of order $5$ in $E_5[5] - \langle(0,0)\rangle$ are shown to be products of linear fractional expressions in $r(5τ)$ with coefficients in $\mathbb{Q}(ζ_5)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Patrick Morton. 2018-06-11. Product formulas for the $5$-division points on the Tate normal form and the Rogers-Ramanujan continued fraction. https://doi.org/10.1016/j.jnt.2018.12.013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT