中文
相关论文

相关论文: Primitive divisors of Lucas and Lehmer sequences, …

200 篇论文

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…

数论 · 数学 2012-02-01 Paul M Voutier

Let $\al$ and $\be$ be conjugate complex algebraic integers which generate Lucas or Lehmer sequences. We present an algorithm to search for elements of such sequences which have no primitive divisors. We use this algorithm to prove that for…

数论 · 数学 2012-11-14 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…

数论 · 数学 2025-03-14 Joaquim Cera Da Conceição

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.

数论 · 数学 2013-01-01 Andrew Granville

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…

数论 · 数学 2007-08-17 Anthony Flatters

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,…

数论 · 数学 2023-11-15 Matteo Verzobio

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.

数论 · 数学 2021-08-27 Min Sha

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…

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.

数论 · 数学 2007-05-23 Graham Everest , Patrick Ingram , Shaun Stevens

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.…

组合数学 · 数学 2018-04-06 Sujith Vijay

Let u(n) be the n-th term of a Lucas sequence or a Lehmer sequence.In this article we shall establish an estimate from below for the greatest prime factor of u(n) which is of the form nexp(logn/104loglogn). In so doing we are able to…

数论 · 数学 2010-08-10 C. L. Stewart

For integer a let us consider the sequence X_a={x_0,x_1,x_2,...} defined by x_0=a, x_1=1 and, for n>=1, x_{n+1}=x_n+x_{n-1}. We say that a prime p divides X_a if p divides at least one term of the sequence. It is easy to see that every…

数论 · 数学 2007-05-23 Pieter Moree , Peter Stevenhagen

For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…

数论 · 数学 2009-08-27 Chris Smyth

A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering…

数论 · 数学 2007-05-23 Zhi-Wei Sun

In this note, we prove that for any given positive integer $\kappa$, when $n$ is bigger than a constant explicitly depending on $\kappa$, the $n$-th Fibonacci number has a primitive divisor not less than $(\kappa+1)n-1$.

数论 · 数学 2023-12-12 Haojie Hong

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…

数论 · 数学 2012-09-18 Joseph H. Silverman

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…

数论 · 数学 2013-05-28 G. Everest , S. Stevens , D. Tamsett , T. Ward

Let $P$ be a non-torsion point on an elliptic curve defined over a number field $K$ and consider the sequence $\{B_n\}_{n\in \mathbb{N}}$ of the denominators of $x(nP)$. We prove that every term of the sequence of the $B_n$ has a primitive…

数论 · 数学 2023-11-16 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…

数论 · 数学 2011-12-06 Paul Voutier , Minoru Yabuta

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…

数论 · 数学 2025-02-07 Joshua Zelinsky , Kyle Zhang
‹ 上一页 1 2 3 10 下一页 ›