相关论文: Primitive Divisors, Dynamical Zsigmondy Sets, and …

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…

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…

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…

A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $\Omega(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{\Omega(a)}}{a (\log a)^z}$,…

We generalize a theorem of Nymann that the density of points in Z^d that are visible from the origin is 1/zeta(d), where zeta(a) is the Riemann zeta function 1/1^a + 1/2^a + 1/3^a + ... A subset S of Z^d is called primitive if it is a…

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…

For an integer $a$ consider the sequence $(T_{n}(a)-1)_{n=1}^{\infty}$ defined by the Chebyshev polynomials $T_{n}$. We list all pairs $(n,a)$ for which the term $T_{n}(a)-1$ has no primitive prime divisor.

Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many…

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

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…

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

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…

For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $\zeta(m)$, the density of primes $p$ for…

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…

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…

Primitive prime divisors play an important role in group theory and number theory. We study a certain number theoretic quantity, called $\Phi^*_n(q)$, which is closely related to the cyclotomic polynomial $\Phi_n(x)$ and to primitive prime…

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…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

For the polynomial $f(z) \in \mathbb{Q}[z]$, we consider the Zsigmondy set $\mathcal{Z}(f,0)$ associated to the numerators of the sequence $\{f^n(0)\}_{n \geq 0}$. In this paper, we provide an upper bound on the largest element of…

We define a primitive index of an integer in a sequence to be the index of the term with the integer as a primitive divisor. For the sequences $k^u+h^u$ and $k^u-h^u$, we discern a formula to find the primitive indexes of any composite…