Search arXivSearch

arXiv · 1501.04179

On Silverman's conjecture for a family of elliptic curves

Abstract

Let $E$ be an elliptic curve over $\Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(\Bbb{Q})$ be the group of $\Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $E^{(p)}(\Bbb{Q})$ has positive rank, and there are infinitely many primes $q$ for which $E^{(q)}(\Bbb{Q})$ has rank $0$. In this paper, assuming the parity conjecture, we show that for infinitely many primes $p$, the elliptic curve $E_n^{(p)}: y^2=x^3-np^2x$ has odd rank and for infinitely many primes $p$, $E_n^{(p)}(\Bbb{Q})$ has even rank, where $n$ is a positive integer that can be written as biquadrates sums in two different ways, i.e., $n=u^4+v^4=r^4+s^4$, where $u, v, r, s$ are positive integers such that $\gcd(u,v)=\gcd(r,s)=1$. More precisely, we prove that: if $n$ can be written in two different ways as biquartic sums and $p$ is prime, then under the assumption of the parity conjecture $E_n^{(p)}(\Bbb{Q})$ has odd rank (and so a positive rank) as long as $n$ is odd and $p\equiv5, 7\pmod{8}$ or $n$ is even and $p\equiv1\pmod{4}$. In the end, we also compute the ranks of some specific values of $n$ and $p$ explicitly.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Farzali Izadi, Kamran Nabardi. 2015-01-17. On Silverman's conjecture for a family of elliptic curves. https://arxiv.org/abs/1501.04179

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