33 citations · 193 across the 95 of their papers we have counts for
122 papers
Linear Combinations of Factorial and -unit in a Ternary recurrence sequence with a double root
Florian Luca, Armand Noubissie
Here, we show that if , then the largest prime factor of for tends to infinity with . In particular, the largest partic…
Skolem Meets Bateman-Horn
Florian Luca, James Maynard, Armand Noubissie +2
The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, incl…
Bad witnesses for a composite number
Johnathan Djella Legnongo, Tony Ezome, Florian Luca
We describe the average sizes of the set of bad witnesses for a pseudo-primality test which is the product of a multiple-rounds Miller-Rabin test by the Galois test.
On equal values of products and power sums of consecutive elements in an arithmetic progression
András Bazsó, Dijana Kreso, Florian Luca +2
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\righ…
On the iterates of shifted Euler's function
Paolo Leonetti, Florian Luca
Let be the Euler's function and fix an integer . We show that, for every initial value , the sequence of positive integers defined by $x_{n+1…
Three essays on Machin's type formulas
Armengol Gasull, Florian Luca, Juan L. Varona
We study three questions related to Machin's type formulas. The first one gives all two terms Machin formulas where both arctangent functions are evaluated -integers, that is va…