summary:Let $a_{d-1},\dots ,a_0 \in \mathbb Z$, where $d \in \mathbb N$ and $a_0 \neq 0$, and let $X=(x_n)_{n=1}^{\infty }$ be a sequence of integers given by the linear recurrence $x_{n+d}=a_{d-1}x_{n+d-1}+\dots +a_0x_{n}$ for $n=1,2,3,\dots $. We show that there are a prime number $p$ and $d$ integers $x_1,\dots ,x_d$ such that no element of the sequence $X=(x_n)_{n=1}^{\infty }$ defined by the above linear recurrence is divisible by $p$. Furthermore, for any nonnegative integer $s$ there is a prime number $p \geq 3$ and $d$ integers $x_1,\dots ,x_d$ such that every element of the sequence $X=(x_n)_{n=1}^{\infty }$ defined as above modulo $p$ belongs to the set $\{s+1,s+2,\dots ,p-s-1\}$
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...
International audienceWe improve by one exponential W. M. Schmidt's estimate for the Skolem-Mahler-L...
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...
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...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
Abstract: For a linear recurrence sequence {Gn} n=0 of rational integers of order k ≥ 2 satisfying s...
224 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.Let K be an algebraic number ...
224 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.Let K be an algebraic number ...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been ...
It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for lin...
We prove a discrepancy bound “on average” over all initial values aα(0)=α of congruential pseudorand...
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...
International audienceWe improve by one exponential W. M. Schmidt's estimate for the Skolem-Mahler-L...
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...
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...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
Abstract: For a linear recurrence sequence {Gn} n=0 of rational integers of order k ≥ 2 satisfying s...
224 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.Let K be an algebraic number ...
224 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.Let K be an algebraic number ...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
AbstractLet u=(un)n=0∞ be a Lucas sequence, that is a binary linear recurrence sequence of integers ...
The question of which terms of a recurrence sequence fail to have primitive prime divisors has been ...
It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for lin...
We prove a discrepancy bound “on average” over all initial values aα(0)=α of congruential pseudorand...
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...
International audienceWe improve by one exponential W. M. Schmidt's estimate for the Skolem-Mahler-L...
An integer sequence {a n } is called polynomially recursive, or P-recursive, if it satisfies a nontr...