scientific article; zbMATH DE number 1022824

DOI10.1080/00150517.1997.12429026MaRDI QIDQ4340261zbMATH OpenFDO

Authors Peter Hilton, Jean Pedersen, Lawrence Somer

Publication date 10 December 1997

Full work available at URL https://doi.org/10.1080/00150517.1997.12429026

zbMATH Keywords

Fibonacci sequence Lucas sequence Lucasian numbers

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

Let \(u(r,s)\) and \(v(r,s)\) be Lucas sequences satisfying the same second-order recursion relation \[ w_{n+2}=rw_{n+1}+sw_n\tag{*} \] and having initial terms \(u_0=0\), \(u_1=1\), \(v_0=2\), \(v_1=r\), respectively, where \(r\) and \(s\) are integers. Let \(D=r^2+4s\). The integer \(m\) is a divisor of the recurrence \(w(r,s)\) satisfying (*) if \(m\mid w_n\) for some \(n\geq 1\). The integer \(m\) is Lucasian if \(m\) is a divisor of \(v(r,s)\). The following two assertions are proved. Theorem 1: Consider the Lucas sequences \(u(r,s)\) and \(v(r,s)\). Suppose that \(rs\neq 0\), \((r,s)=1\) and \(D>0\). Let \(a\) and \(b\) be positive integers. Then \(u_a\mid v_b\) if and only if the following conditions hold: (i) \(a=1\); (ii) \(|r|=1\) or \(2\) and \(a=2\); (iii) \(|r|\geq 3\), \(a=2\) and \(b\) is odd; (iv) \(|r|=1\), \(s=1\), \(a=3\), and \(3\mid b\); (v) \(|r|=1\), \(a=4\), and \(2\mid b\) oddly, where \(m\mid n\) oddly if \(n/m\) is an odd integer. Theorem 2: Consider the non-negative Lucas sequences \(u(r,s)\) and \(v(r,s)\). If \((r,s)=1\) and \(D<0\), then \(u_n\) is not Lucasian for \(n>e^{452}2^{68}\). If \((r,s)>1\), then there exists a constant \(N(r,s)\) dependent on \(r\) and \(s\) such that \(u_n\) is not Lucasian for \(n\geq N(r,s)\).

Recommendations

Cited in

(38)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340261)