493
Views
5
CrossRef citations to date
0
Altmetric
Classroom Notes

Binet's formula for generalized tribonacci numbers

Pages 1235-1243 | Received 16 Dec 2014, Published online: 10 Apr 2015
 

Abstract

In this note, we derive Binet's formula for the general term Tn of the generalized tribonacci sequence. This formula gives Tn explicitly as a function of the index n, the roots of the associated characteristic equation, and the initial terms T0, T1, and T2. By way of illustration, we obtain Binet's formula for the Cordonnier, Perrin, and Van der Laan numbers. In addition, we establish a double identity that can be regarded as a parent of Binet's formula for generalized tribonacci numbers.

Acknowledgements

The author thanks an anonymous reviewer for detailed instructive suggestions that led to improvements in the presentation of this note.

Disclosure statement

No potential conflict of interest was reported by the author.

Notes

1. Unfortunately, Mark Feinberg died in a motorcycle accident four years later.

2. The closed-form formula for the nth Fibonacci number, Fn=(ϕn-φn)/5 (where ϕ=(1+5)/2 and φ=(1-5)/2), is usually attributed to the French mathematician Jacques Philippe Marie Binet (1786–1856) who published it in 1843, although it was known in the eighteenth century, to such famous mathematicians as Abraham de Moivre (1667–1754), Daniel Bernoulli (1700–1782), and Leonhard Euler (1707–1783). Amazingly enough, the exponential growth of the Fibonacci numbers played a prominent role in the resolution of Hilbert's 10th problem in 1970 by the combined efforts of Yuri Matiyasevich, Martin Davis, Hilary Putnam, and Julia Robinson.

3. Throughout this note, we will assume that α ≠ β, α ≠ γ, and β ≠ γ. This is tantamount to assuming that Δ, the discriminant, is not zero. That is, Δ2 = (α − β)2(α − γ)2(β − γ)2 = r2s2 − 27t2 + 4s3 − 4r3t − 18rst > 0.

4. Cordonnier numbers are more commonly known in the literature as Padovan numbers.

5. The proof of Theorem 2.1 is analogous to that given in [Citation8] for the case r = s = t = 1.

6. From Equations (Equation10a) and (Equation10b), it is not difficult to show that Pn(α, β, γ) and Qn(α, β, γ) are symmetric functions of α, β, and γ. We omit the proof here for the sake of brevity (although the reader might want to prove that, for example, Pn(α, β, γ) = Pn(β, α, γ)). Moreover, from the expressions (Equation10a) and (Equation10b), it is readily seen that Pn(β, α, γ) = Qn(α, β, γ), from which we conclude that Pn(α, β, γ) = Qn(α, β, γ). Specifically, for n = 1, 2, and 3, we have P1(α,β,γ)=Q1(α,β,γ)=α+β+γαβγ+αβ2+αγ2+βγ2,P2(α,β,γ)=Q2(α,β,γ)=α2+β2+γ2αβγ+αβ2α+β+2γ+αγ2α+2β+γ+βγ22α+β+γ,P3(α,β,γ)=Q3(α,β,γ)=α3+β3+γ3αβγ+3αβγ2+αβ2α+βα+β+2γ-αβ+αγ2α+γα+2β+γ-αγ+βγ2β+γ2α+β+γ-βγ=α2+αβ+β2α2+αγ+γ2β2+βγ+γ2,which are clearly symmetric functions of α, β, and γ.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.