Infinitely many composite NSW numbers: an inductive proof

MaRDI QIDQ2567532zbMATH OpenFDO

Authors James A. Sellers

Publication date 11 October 2005

Published in Missouri Journal of Mathematical Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Factorization; primality (11A51) Recurrences (11B37)

Review text

The NSW numbers (named in honor of \textit{M. Newman, D. Shanks} and \textit{H. C. Williams} [Acta Arith. 38, 129--140 (1980; Zbl 0365.20025)]) were studied approximately 20 years ago in connection with the order of certain simple groups. These are the numbers \(f_n\) which satisfy the recurrence (1) \(f_{n+1} = 6f_n-f_{n-1}\) with initial conditions \(f_1 = 1\) and \(f_2 = 7\). The goal of this paper is to provide a purely inductive proof of the main theorem of the author and \textit{H. C. Williams}'s paper [Fibonacci Q. 40, No. 3, 253--254 (2002; Zbl 1090.11500)]. Theorem. For all \(m\geq 1\) and all \(n\geq 0\), \(f_m\mid f_{(2m-1)n+m}\).

Recommendations

• scientific article; zbMATH DE number 2211667
• On thenth composite number
• A combinatorial proof of an infinite version of the Hales-Jewett theorem
• Several arithmetic proofs on the infinitude of prime numbers
• scientific article; zbMATH DE number 2124081
• Infinitely many Carmichael numbers in arithmetic progressions
• Two Proofs in Combinatorial Number Theory
• Another Proof of the Infinitude of Primes
• Partitioning the natural numbers to prove the infinitude of primes

Cited in

(2)

• A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)
• scientific article; zbMATH DE number 2211667 (Why is no real title available?)

This page was built for publication: Infinitely many composite NSW numbers: an inductive proof

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