Add to ORKGTo Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a class of Lucas sequences {xn}, we show that if n is a positive integer then xn has a primitive prime factor which divides xn to an odd power, except perhaps when n = 1; 2; 3 or 6. This has several desirable consequences. 1
Let \ell be any fixed prime number. We define the \ell-Genocchi numbers by G_n:=\ell(1-\ell^n)B_n, w...
Abstract. In this paper, we show that 242081442+1=293·372·53·612·89 is the largest instance in which...
In this paper we study some structure properties of primitive weird numbers in terms of their factor...
We present an application of difference equations to number theory by considering the set of linear ...
By utilizing the very recent work of Yu [Y3] on linear forms in padic logarithms of algebraic number...
The distribution of prime numbers in Lucas sequences was investigated by independently changing the ...
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been ...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
Abstract: For a linear recurrence sequence {Gn} n=0 of rational integers of order k ≥ 2 satisfying s...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
In the paper the authors, using general formulas, determine and describe a class of infinite sequenc...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
In this paper, we give some heuristics suggesting that if (un)n≥0 is the Lucas sequence given by un ...
Abstract. In 1876, E. Lucas showed that a quick proof of primality for a prime p could be attained t...
AbstractA sequence A = {ai} of positive integers a1 < a2 < ⋯ is said to be primitive if no term of A...
Let \ell be any fixed prime number. We define the \ell-Genocchi numbers by G_n:=\ell(1-\ell^n)B_n, w...
Abstract. In this paper, we show that 242081442+1=293·372·53·612·89 is the largest instance in which...
In this paper we study some structure properties of primitive weird numbers in terms of their factor...
We present an application of difference equations to number theory by considering the set of linear ...
By utilizing the very recent work of Yu [Y3] on linear forms in padic logarithms of algebraic number...
The distribution of prime numbers in Lucas sequences was investigated by independently changing the ...
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been ...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
Abstract: For a linear recurrence sequence {Gn} n=0 of rational integers of order k ≥ 2 satisfying s...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
In the paper the authors, using general formulas, determine and describe a class of infinite sequenc...
AbstractLet Fq denote the finite field of q elements, q an odd prime power, and let f(x)=xn+∑i=1nfix...
In this paper, we give some heuristics suggesting that if (un)n≥0 is the Lucas sequence given by un ...
Abstract. In 1876, E. Lucas showed that a quick proof of primality for a prime p could be attained t...
AbstractA sequence A = {ai} of positive integers a1 < a2 < ⋯ is said to be primitive if no term of A...
Let \ell be any fixed prime number. We define the \ell-Genocchi numbers by G_n:=\ell(1-\ell^n)B_n, w...
Abstract. In this paper, we show that 242081442+1=293·372·53·612·89 is the largest instance in which...
In this paper we study some structure properties of primitive weird numbers in terms of their factor...