Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of positive integers n such that either ω)(n) orΩ(n) divides u n is of asymptotic density zero, where ω(n) and Ω(n) are the numbers of prime and prime power divisors of n, respectively. The same also holds for the set of positive integersn such that τ(n)u n , where τ(n) is the number of the positive integer divisors of n, provided that u n satisfies some mild technical conditions.14 page(s
The set of indices that correspond to the positive entries of a sequence of numbers is called its po...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
Let F and G be linear recurrences over a number field K, and let R be a finitely generated subring ...
We give upper and lower bounds on the count of positive integers n <= x dividing the nth term of a n...
summary:Let $a_{d-1},\dots ,a_0 \in \mathbb Z$, where $d \in \mathbb N$ and $a_0 \neq 0$, and let $X...
summary:Let $a_{d-1},\dots ,a_0 \in \mathbb Z$, where $d \in \mathbb N$ and $a_0 \neq 0$, and let $X...
summary:Let $a_{d-1},\dots ,a_0 \in \mathbb Z$, where $d \in \mathbb N$ and $a_0 \neq 0$, and let $X...
Abstract Here, we give upper and lower bounds on the count of positive integers n ≤ x dividing the n...
AbstractIt is shown that, on average but independent of any hypothesis, the density of prime divisor...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
Let F be an integral linear recurrence, G be an integer-valued polynomial splitting over the rationa...
Abstract: For a linear recurrence sequence {Gn} n=0 of rational integers of order k ≥ 2 satisfying s...
AbstractWe prove that there are only finitely many terms of a non-degenerate linear recurrence seque...
We prove that there are only finitely many terms of a non-degenerate linear recurrence sequence whic...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
The set of indices that correspond to the positive entries of a sequence of numbers is called its po...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
Let F and G be linear recurrences over a number field K, and let R be a finitely generated subring ...
We give upper and lower bounds on the count of positive integers n <= x dividing the nth term of a n...
summary:Let $a_{d-1},\dots ,a_0 \in \mathbb Z$, where $d \in \mathbb N$ and $a_0 \neq 0$, and let $X...
summary:Let $a_{d-1},\dots ,a_0 \in \mathbb Z$, where $d \in \mathbb N$ and $a_0 \neq 0$, and let $X...
summary:Let $a_{d-1},\dots ,a_0 \in \mathbb Z$, where $d \in \mathbb N$ and $a_0 \neq 0$, and let $X...
Abstract Here, we give upper and lower bounds on the count of positive integers n ≤ x dividing the n...
AbstractIt is shown that, on average but independent of any hypothesis, the density of prime divisor...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
Let F be an integral linear recurrence, G be an integer-valued polynomial splitting over the rationa...
Abstract: For a linear recurrence sequence {Gn} n=0 of rational integers of order k ≥ 2 satisfying s...
AbstractWe prove that there are only finitely many terms of a non-degenerate linear recurrence seque...
We prove that there are only finitely many terms of a non-degenerate linear recurrence sequence whic...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
The set of indices that correspond to the positive entries of a sequence of numbers is called its po...
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart...
Let F and G be linear recurrences over a number field K, and let R be a finitely generated subring ...