9 problems
Congruences for Domb numbers and Lucas sequences. For every odd prime : (i) if one of the Legendre symbols and is , then
Refined moment conjecture. As ,
Chebyshev-like bias conjecture. (Weak) If is a regular Lucas sequence with , then
Gordon–Pomerance conjecture. With the same hypotheses as Lemma Gordon–Pomerance, the displayed upper bound holds. The conjecture is used to obtain the conditional upper bound for t…
Let . The sequence is called polynomially recurrent if it satisfies a polynomial recurrence in . Polynomial-recurrence conjecture. The sequ…
Let be a Lucas sequence, and let denote the gcd function associated with it. Assume that . Then the maximal gcd conjecture asserts th…
For integers , define the Lucas sequence by … The sequence is said to satisfy the Dold condition when its associated Dold congruences hold. Lucas-sequence conject…
Pairwise coprimality conjecture. For any two different primes and , the terms and are relatively prime:
Let and denote the Fibonacci and Lucas sequences, respectively. A sequence term is positive when its value is positive, and a term is odd when it is not divisible by…