30 problems
Classification conjecture. A -sequence is complete if and only if
Let be a recurrence sequence, and let its dominating characteristic roots be the characteristic roots of maximal modulus among those occurring with nonzero coefficient in…
Let be a nonzero integer and define the sequence by … A term has a primitive divisor if it has a prime divisor that divides no earlier nonzero term of the s…
Let be the dimension of the base , let be a differential order, and set … Let denote the Wronskian -ary bracket on…
The unrestricted four-squares conjecture. There are at most four distinct integer squares among the . If is a prime power or a perfect square, then there are a…
Unrestricted-power four-squares conjecture. There are at most four distinct integer squares among the . If is a prime power or a perfect square, then there are…
Let , and be positive integers such that is not a square, let have norm … and let be a unit in…
Let be the sequence defined earlier in the paper through the rank-three Witten zeta function of type . Nonvanishing conjecture for . If…
Let be an -Fibonacci sequence, and suppose it falls under case (vi) of the finite-orders conjecture, namely the case where the range of is conjec…
Let -Fibonacci sequences be defined by , , and . Let be the numbe…
Let be even, and let be the -Fibonacci sequence. For a modulus , let denote its Pisano period, let denote the number of zeros in that p…
Simplicity conjecture. The roots of are all simple whenever and for all .
Let , , and be positive integers with nonsquare, let have norm , and let be a unit in…
Let , , and be positive integers with nonsquare, let have norm … and let be a unit in…
Let . The sequence is called polynomially recurrent if it satisfies a polynomial recurrence in . Polynomial-recurrence conjecture. The sequ…
Let , let for , and let satisfy for every and . Let…
Let , let , and let be a recurrence sequence satisfying … for all . The nonlinear Skolem–Mahler–Lech conjec…
Let be the associated Pell sequence. For a prime , let the rank of apparition (or entry point) be the smallest positive integer such that divi…
Let be a finite extension of number fields and let . Let … be a polynomial map from to . For an element , define…
Let be the Narayana sequence, and let an -block repdigit be a positive integer formed by repeating the same decimal block of length at least twice. Block-repdigit ra…
Let and be expansions whose corresponding recurrence relations have multiplicatively independent dominant roots. Let and denote the relevant expansion com…
Let , let be the parameter appearing in the definition of the generalized sequence , and let . Infinitely-many-instances conjecture for . If…
Let and , and let be the parameter appearing in the definition of the generalized sequence . Write for its indicated d…
A 4-free Fibonacci sequence is a Fibonacci-type sequence defined by the paper's 4-free divisibility rule. Non-cycling conjecture. With probability , a 4-free Fibonacci sequence…
A 3-free Fibonacci sequence is a Fibonacci-type sequence in which each newly appended term is obtained by dividing the sum of the preceding two terms by a power of whenever the…