scientific article; zbMATH DE number 1022823

DOI10.1080/00150517.1997.12429025MaRDI QIDQ4340260zbMATH OpenFDO

Publication date 19 November 1997

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

Congruences; primitive roots; residue systems (11A07) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50)

Review text

Let \(U_0=0, U_1=1, V_0=2,\) and \(V_1=m.\) For \(n>1,\) define \(U_n=mU_{n-1}+U_{n-2}\), \(V_n=mV_{n-1}+V_{n-2}\). The parameters \(U_n\) and \(V_n\) can also be represented by the Binet forms \(U_n=(\alpha^n-\beta^n)/(\alpha-\beta), V_n=\alpha^n+ \beta^n,\) where \(\alpha+\beta=m\) and \(\alpha\beta=-1.\) If \(p\) is prime, then it follows that \(V_p \equiv m \bmod p.\) More generally, define \(n\) to be a \(V(m)\)-pseudoprime if \(n\) is odd and composite, and \(V_n \equiv m \bmod n.\) The author proves that \(n\) is a \(V(m)\)-pseudoprime if and only if \(n \equiv 1 \bmod R(p^e)\) or \(n \equiv R(p^e)/2-1 \bmod R(p^e)\) for all prime powers \(p^e\) dividing \(n,\) where \(R(p^e)\) is the period of the sequence \(V_n\) when reduced mod \(p^e.\) He uses this criterion to construct other examples of \(V(m)\)-pseudoprimes. He shows that if \(q>3\) is an odd prime and \(U_q\) is composite, then \(U_q\) is a \(V(m)\)-pseudoprime. Similarly, he proves that \(V_q/m\) is a \(V(m)\)-pseudoprime, provided that \((m,q)=1.\) He concludes by generalizing this result to the case where \(q\) is odd and composite, and uses the result to show that there are infinitely many \(V(2)\)-pseudoprimes.

Recommendations

Cited in

(9)

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 Q4340260)