No label defined (Q3974924)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 17599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17599 |
Statements
26 June 1992
0 references
generalized binomial coefficients
0 references
least common multiple
0 references
strong divisibility sequence
0 references
greatest common divisor
0 references
generalized Fibonacci sequence
0 references
generalized multinomial coefficients
0 references
0.8896967
0 references
0 references
0.8859509
0 references
0.8847302
0 references
0.8847302
0 references
0.87720686
0 references
0.8730517
0 references
0.86592484
0 references
[For the entire collection see Zbl 0725.00005.] A sequence \(\{a_ n\}\) of non-zero integers is called a strong divisibility sequence (SDS) if the GCD (greatest common divisor) (\(a_ m, a_ n\)) of \(a_ m\) and \(a_ n\) equals \(a_{(m,n)}\). Defining generalized Fibonacci sequences and generalized multinomial coefficients by \[ {n\choose h}=\prod^ n_{i=1}a_ i/\prod^ h_{i=1}a_ i\prod^ k_{i=1}a_ i\;,\quad h+k=n; \] \[ {n\choose k_ 1,\ldots,k_ m}=\prod^ n_{i=1}a_ i/\prod^{k_ 1}_{i=1}a_ i\ldots\prod^{k_ m}_{i=1}a_ i\;,\quad k_ 1+\ldots+k_ m=n \] respectively, the authors show that the basic property of SDS, i.e. \((a_ m,a_ n)| a_ n\) if \(p=sm+tn\) is useful to give non \(p\)-adic proofs on GCD and LCM equalities concerning these numbers.
0 references