Add to ORKGWe prove that for~${n>30}$, every~$n$-th Lucas and Lehmer number has a primitive divisor. This allows us to list all Lucas and Lehmer numbers without a primitive divisor
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
Abstract. In this paper we prove that there are only fmitely many Balu numbers. Key words. Smarandac...
It is shown under Schinzel's Hypothesis that for a given l≥ 1, there are infinitely many k such that...
We prove that for~${n>30}$, every~$n$-th Lucas and Lehmer number has a primitive divisor. This allow...
We prove that for $n$ > 30, every $n$-th Lucas and Lehmer number has a primitive divisor. This allow...
In this article we build on the work of Schinzel \cite{schinzelI}, and prove that if $n>4$, $n\neq 6...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
A real Lucas sequence—named for the French mathematician Édouard Lucas—is determined recursively by...
A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for...
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 divisibility properties of palindromic numbers in a fixed base g ≥ 2. I...
AbstractLet n be a fixed odd integer with n>1. In this paper, using a recent result on the existence...
To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a ...
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been ...
AbstractSilverman proved the analogue of Zsigmondy's Theorem for elliptic divisibility sequences. Fo...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
Abstract. In this paper we prove that there are only fmitely many Balu numbers. Key words. Smarandac...
It is shown under Schinzel's Hypothesis that for a given l≥ 1, there are infinitely many k such that...
We prove that for~${n>30}$, every~$n$-th Lucas and Lehmer number has a primitive divisor. This allow...
We prove that for $n$ > 30, every $n$-th Lucas and Lehmer number has a primitive divisor. This allow...
In this article we build on the work of Schinzel \cite{schinzelI}, and prove that if $n>4$, $n\neq 6...
A Lehmer number modulo a prime p is an integer a with 1 ≤ a ≤ p − 1 whose inverse a¯ within the sam...
A real Lucas sequence—named for the French mathematician Édouard Lucas—is determined recursively by...
A research report submitted to the Faculty of Science, in partial fulfilment of the requirements for...
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 divisibility properties of palindromic numbers in a fixed base g ≥ 2. I...
AbstractLet n be a fixed odd integer with n>1. In this paper, using a recent result on the existence...
To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a ...
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been ...
AbstractSilverman proved the analogue of Zsigmondy's Theorem for elliptic divisibility sequences. Fo...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
Abstract. In this paper we prove that there are only fmitely many Balu numbers. Key words. Smarandac...
It is shown under Schinzel's Hypothesis that for a given l≥ 1, there are infinitely many k such that...