On the Proof of GCD and LCM Equalities Concerning the Generalized Binomial and Multinomial Coefficients

Shiro Ando and Daihachiro Sato

A chapter in Applications of Fibonacci Numbers, 1991, pp 9-16 from Springer

Abstract: Abstract A strong divisibility sequence (or SDS) is a sequence of nonzero integers { an } (n=1, 2, 3,…)that satisfies 1.1 $$\left( {{{a}_{m}},{{a}_{n}}} \right) = {{a}_{{\left( {m,n} \right)}}} $$ for any positive integers m, n, where (a, b) stands for the greatest common divisor of a and b. This terminology was named by Kimberling [7], although this concept had been studied before by Ward [9] and others.

Keywords: Basic Property; Rational Number; Simple Proof; Numbers Volume; Great Common Divisor (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-011-3586-3_2

Ordering information: This item can be ordered from
http://www.springer.com/9789401135863

DOI: 10.1007/978-94-011-3586-3_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().