Prime factors of with an irreducible polynomial .
Prime factors of binomial coefficients and related problems
Prime numbers along Rudin–Shapiro sequences
For a large class of digital functions , we estimate the sums (and , where denotes the von Mangoldt function (and the Möbius function). We deduce from these estimates a Prime Number Theorem (and a Möbius randomness principle) for sequences of integers with digit properties including the Rudin-Shapiro sequence and some of its generalizations.
Prime numbers with Beatty sequences
A study of certain Hamiltonian systems has led Y. Long to conjecture the existence of infinitely many primes which are not of the form p = 2⌊αn⌋ + 1, where 1 < α < 2 is a fixed irrational number. An argument of P. Ribenboim coupled with classical results about the distribution of fractional parts of irrational multiples of primes in an arithmetic progression immediately implies that this conjecture holds in a much more precise asymptotic form. Motivated by this observation, we give an asymptotic...
Prime power divisors of binomial coefficients.
Prime power divisors of binomial coefficients: Reprise.
Primefree shifted Lucas sequences
We say a sequence is primefree if |sₙ| is not prime for all n ≥ 0, and to rule out trivial situations, we require that no single prime divides all terms of . In this article, we focus on the particular Lucas sequences of the first kind, , defined by u₀ = 0, u₁ = 1, and uₙ = aun-1 + un-2 for n≥2, where a is a fixed integer. More precisely, we show that for any integer a, there exist infinitely many integers k such that both of the shifted sequences are simultaneously primefree. This result extends...
Prime-like sequences
Primes in Fibonacci -step and Lucas -step sequences.
Primes in intervals
Primitive divisors of Lucas and Lehmer sequences, II
Let and are 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 all and with h, the -th element of these sequences has a primitive divisor for . In the course of proving this result, we give an improvement of a result of Stewart concerning more general sequences.
Primitive divisors of the expression An - Bn in algebraic number fields.
Primitive Lucas d-pseudoprimes and Carmichael-Lucas numbers
Let d be a fixed positive integer. A Lucas d-pseudoprime is a Lucas pseudoprime N for which there exists a Lucas sequence U(P,Q) such that the rank of appearance of N in U(P,Q) is exactly (N-ε(N))/d, where the signature ε(N) = (D/N) is given by the Jacobi symbol with respect to the discriminant D of U. A Lucas d-pseudoprime N is a primitive Lucas d-pseudoprime if (N-ε(N))/d is the maximal rank of N among Lucas sequences U(P,Q) that exhibit N as a Lucas pseudoprime. We derive...
Primitive prime divisors in polynomial arithmetic dynamics.
Primitive prime factors in second-order linear recurrence sequences
Primitive quadratics reflected in -sequences.
Primitive substitutive numbers are closed under rational multiplication
Let denote the set of real numbers whose base- digit expansion is ultimately primitive substitutive, i.e., contains a tail which is the image (under a letter to letter morphism) of a fixed point of a primitive substitution. We show that the set is closed under multiplication by rational numbers, but not closed under addition.
Primitivmengen in additiven abelschen Gruppen.
Primzahlfragen in der Diophantischen Geometrie.
Principle of Minimax and Rise Phyllotaxis (Mechanistic Phyllotaxis Model)