Number of prime divisors of recurrence sequences (Q1073822): Difference between revisions

Let u(x), \(x=1,2,...\), be a linear recurrence of integers of order n (\(\geq 2)\) defined by \(u(x+n)=a_{n-1} u(x+n-1)+...+a_ 0 u(x).\) For a natural number n let \(Q(N)=q(u(N)),\quad \omega (N)=\nu (\prod^{N}_{x=1}u(x))\) and \(P(N)=q(\prod^{N}_{x=1}u(x)),\) where q(m) and \(\nu\) (m) denote the largest prime divisor and the number of distinct prime divisors of m, respectively. Among others the author proves: if \(u(1)=0\), then \(\omega (N)\geq c\cdot N^{2/n}\cdot \log^{- 1} N\) and \(P(N)\geq c\cdot N^{2/n}\) for every N, furthermore \(\nu (u(N))\geq c\cdot \log N/\log \log N\) and \(Q(N)\geq c\cdot N^{2/n}\) for infinitely many N (c is a positive constant depending only on the sequence). The results can be applied to the sequences of numerators and denominators of convergents of certain quadratic irrational numbers.