Related papers: Primes Generated by Recurrence Sequences

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.

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…

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…

We discuss several two-dimensional generalizations of the familiar Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…

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…

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

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…

If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…

We define an Artin prime for an integer $g$ to be a prime such that $g$ is a primitive root modulo that prime. Let $g\in \mathbb{Z}\setminus\{-1\}$ and not be a perfect square. A conjecture of Artin states that the set of Artin primes for…

A set is primitive if no element of the set divides another. We consider primitive sets of monic polynomials over a finite field and find natural generalizations of many of the results known for primitive sets of integers. In particular we…

The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in…

In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…

Classifications of twin primes are established and then applied to triplets that generalize to all higher multiplets. Mersenne and Fermat twins and triplets are treated in this framework. Regular prime number multiplets are related to…

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 prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.