English
Related papers

Related papers: Primitive divisors of Lucas and Lehmer sequences, …

200 papers

Stewart reduced the problem of determining all Lucas and Lehmer sequences whose $n$-th element does not have a primitive divisor to solving certain Thue equations. Using the method of Tzanakis and de Weger for solving Thue equations, we…

Number Theory · Mathematics 2012-02-01 Paul M Voutier

In this paper we prove that if $n > 30,030$ then the $n$-th element of any Lucas or Lehmer sequence has a primitive divisor.

Number Theory · Mathematics 2015-06-12 Paul Voutier

It is known that all terms $U_n$ of a classical regular Lucas sequence have a primitive prime divisor if $n>30$. In addition, a complete description of all regular Lucas sequences and their terms $U_n$, $2\leq n\leq 30$, which do not have a…

Number Theory · Mathematics 2025-03-14 Joaquim Cera Da Conceição

We study the primitive divisors of the terms of $(\Delta_n)_{n \geq 1}$, where $\Delta_n=N_{K/ \mathbb{Q}}(u^n-1)$ for $K$ a real quadratic field, and $u>1$ a unit element of its ring of integers. The methods used allow us to find the terms…

Number Theory · Mathematics 2007-08-17 Anthony Flatters

We study the existence of primes and of primitive divisors in classical divisibility sequences defined over function fields. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields…

Number Theory · Mathematics 2014-12-30 Patrick Ingram , Valéry Mahé , Joseph H. Silverman , Katherine E. Stange , Marco Streng

We provide some corrections and clarifications of statements in \cite{Ab} and \cite{BHV} regarding elements in Lehmer sequences that have no primitive divisors for small $n$.

Number Theory · Mathematics 2025-05-28 Paul M. Voutier

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

Number Theory · Mathematics 2019-02-06 Nathan McNew

We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive…

Number Theory · Mathematics 2007-05-23 Graham Everest , Igor E Shparlinski

A primitive prime divisor of an element a_n of a sequence (a_1,a_2,a_3,...) is a prime P that divides a_n, but does not divide a_m for all m < n. The Zsigmondy set Z of the sequence is the set of n such that a_n has no primitive prime…

Number Theory · Mathematics 2012-09-18 Joseph H. Silverman

For a class of Lucas sequences ${x_n}$, we show that if $n$ is a positive integer then $x_n$ has a primitive prime factor which divides $x_n$ to an odd power, except perhaps when $n = 1, 2, 3 or 6$. This has several desirable consequences.

Number Theory · Mathematics 2013-01-01 Andrew Granville

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

Number Theory · Mathematics 2013-05-28 G. Everest , S. Stevens , D. Tamsett , T. Ward

Let $(b_n) = (b_1, b_2, ...)$ be a sequence of integers. A primitive prime divisor of a term $b_k$ is a prime which divides $b_k$ but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial $f(z)$ is a…

Number Theory · Mathematics 2011-06-06 Kevin Doerksen , Anna Haensch

In this paper, we obtain analogues of Zsigmondy's theorem and the primitive divisor results for the Lucas and Lehmer sequences in polynomial rings of several variables.

Number Theory · Mathematics 2021-08-27 Min Sha

We study primitive divisors of terms of the sequence P_n=n^2+b, for a fixed integer b which is not a negative square. It seems likely that the number of terms with a primitive divisor has a natural density. This seems to be a difficult…

Number Theory · Mathematics 2007-05-23 Graham Everest , Glyn Harman

A subset of $\{1,2,\ldots,2n\}$ is said to be primitive if it does not contain any pair of elements $(u,v)$ such that $u$ is a divisor of $v$. Let $D(n)$ denote the number of primitive subsets of $\{1,2,\ldots,2n\}$ with $n$ elements.…

Combinatorics · Mathematics 2018-04-06 Sujith Vijay

Let $H(n) = \prod_{p|n}\frac{p}{p-1}$ where $p$ ranges over the primes which divide $n$. It is well known that if $n$ is a primitive non-deficient number, then $H(n) > 2$. We examine inequalities of the form $H(n)> 2 + f(n)$ for various…

Number Theory · Mathematics 2025-02-07 Joshua Zelinsky , Kyle Zhang

Let $\{nP+Q\}_{n\geq0}$ be a sequence of points on an elliptic curve defined over a number field $K$. In this paper, we study the denominators of the $x$-coordinates of this sequence. We prove that, if $Q$ is a torsion point of prime order,…

Number Theory · Mathematics 2023-11-15 Matteo Verzobio

Let $P$ be a non-torsion point on the elliptic curve $E_{a}: y^{2}=x^{3}+ax$. We show that if $a$ is fourth-power-free and either $n>2$ is even or $n>1$ is odd with $x(P)<0$ or $x(P)$ a perfect square, then the $n$-th element of the…

Number Theory · Mathematics 2011-12-06 Paul Voutier , Minoru Yabuta

We show that for an elliptic divisibility sequence on a twist of the Fermat cubic, u^3+v^3=m, with m cube-free, all the terms beyond the first have a primitive divisor.

Number Theory · Mathematics 2007-05-23 Graham Everest , Patrick Ingram , Shaun Stevens

Let F(z) be a rational function in Q(z) of degree at least 2 with F(0) = 0 and such that F does not vanish to order d at 0. Let b be a rational number having infinite orbit under iteration of F, and write F^n(b) = A_n/B_n as a fraction in…

Number Theory · Mathematics 2015-05-13 Patrick Ingram , Joseph H. Silverman
‹ Prev 1 2 3 10 Next ›