Binary recurrences for which powers of two are discriminating moduli

zbMath1471.11086arXiv2003.01559MaRDI QIDQ5139867

Max A. Stoumen, Pieter Moree, Maria Matthis, Lilit Martirosyan, Florian Luca, Melvin Weiß, Adriaan A. de Clercq

Publication date: 11 December 2020

Full work available at URL: https://arxiv.org/abs/2003.01559

zbMATH Keywords

permutationcongruenceLucas sequencediscriminatorBinet formulabinary recurrent sequence

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50)

Related Items (2)

On the solutions of the Diophantine equation \(P_n \pm \frac{a(10^m -1)}{9}=k!\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Salajan's conjecture on discriminating terms in an exponential sequence
• A note on the discriminator
• The incongruence of consecutive values of polynomials
• On the discriminator of Lucas sequences
• On functions taking only prime values
• Existence of primitive divisors of Lucas and Lehmer numbers
• Discriminators and k-Regular Sequences
• Browkin’s discriminator conjecture

This page was built for publication: Binary recurrences for which powers of two are discriminating moduli