GCD properties in Hosoya's triangle (Q2894235)

From MaRDI portal





scientific article; zbMATH DE number 6051051
Language Label Description Also known as
English
GCD properties in Hosoya's triangle
scientific article; zbMATH DE number 6051051

    Statements

    0 references
    0 references
    29 June 2012
    0 references
    recurrence
    0 references
    Hosoya sequence
    0 references
    Fibonacci numbers
    0 references
    Pascal triangle
    0 references
    polygon
    0 references
    Star of David
    0 references
    rhombus
    0 references
    greatest common divisor
    0 references
    GCD properties in Hosoya's triangle (English)
    0 references
    The Hosoya sequence \(H(r, k)\) is defined by the recurrences \(H(r, k)=H(r-1, k)+H(r-2, k)\) and \(H(r, k)=H(r-1, k-1)+H(r-2, k-2)\) with certain initial coditions, (see \textit{H. Hosoya} [Fibonacci Q. 14, 173--179 (1976; Zbl 0359.10011)]). Hosoya proved that \(H(k, r)=F_{k}F_{r-k+1}\), where \(F_n\) is the Fibonacci sequence. The Hosoya sequence gives rise to the Hosoya triangle, analogous to the Pascal triangle.NEWLINENEWLINEThe present authors prove GCD properties for numbers in the Star of David and other polygon configurations formed in the Hosoya triangle. They also give a criterion to determine whether a sequence of points in a polygon or in a rhombus configurations in the Hosoya triangle have GCD equal to one. Several known results from the Pascal triangle are transferred to the Hosoya triangle.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references