Publication

Prime Power Terms In Elliptic Divisibility Sequences

Valéry Aurélien Mahé
2014
Journal Articles

Abstract

We study a problem on specializations of multiples of rational points on elliptic curves analogous to the Mersenne problem. We solve this problem when descent via isogeny is possible by giving explicit bounds on the indices of prime power terms in elliptic divisibility sequences associated to points in the image of a nontrivial isogeny. We also discuss the uniformity of these bounds assuming the Hall-Lang conjecture.

Official source

https://infoscience.epfl.ch/entities/publication/0694bb9b-3697-48ee-9e2a-6e52008be4c2

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Valéry Aurélien Mahé
2014
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/0694bb9b-3697-48ee-9e2a-6e52008be4c2

About this result

Related concepts (18)

Mersenne prime

In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2n − 1 for some integer n. They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If n is a composite number then so is 2n − 1. Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form Mp = 2p − 1 for some prime p. The exponents n which give Mersenne primes are 2, 3, 5, 7, 13, 17, 19, 31, .

Elliptic curve primality

In mathematics, elliptic curve primality testing techniques, or elliptic curve primality proving (ECPP), are among the quickest and most widely used methods in primality proving. It is an idea put forward by Shafi Goldwasser and Joe Kilian in 1986 and turned into an algorithm by A. O. L. Atkin the same year. The algorithm was altered and improved by several collaborators subsequently, and notably by Atkin and de, in 1993. The concept of using elliptic curves in factorization had been developed by H. W.

Prime number theorem

In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann (in particular, the Riemann zeta function).

Related publications (24)

Rational Points in the Noether-Lefschetz Locus of Moduli Spaces of K3 Surfaces

Domenico Valloni

We give a characterization of rational points lying on the Noether-Lefschetz locus of moduli spaces of K3 surfaces by studying their lifting properties under some natural coverings of the ambient space. We then prove that the Bombieri-Lang conjecture impli ...

Oxford Univ Press2024

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Generalized Norm-compatible Systems on Unitary Shimura Varieties

Mohamed Réda Boumasmoud

We define and study in terms of integral Iwahoriâ Hecke algebras a new class of geometric operators acting on the Bruhat-Tits building of connected reductive groups over p-adic fields. These operators, which we call U-operators, generalize the geometric n ...

EPFL2019