scientific article; zbMATH DE number 17599
[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.
- scientific article; zbMATH DE number 3966170
- On the lcm-analog of binomial coefficient
- On some multivariate LCM and GCD sums
- On the Least Common Multiple of Q-Binomial Coefficients
- On the greatest common divisor of binomial coefficients
- On the greatest common divisor of binomial coefficients
- A GCD- and LCM-like inequality for multiplicative lattices
- Some congruences for generalized binomial coefficients
- The greatest common divisor of certain sets of binomial coefficients
- A generalization of Lucas' congruence for q-binomial coefficients
- Mean divisibility of multinomial coefficients
- scientific article; zbMATH DE number 845717 (Why is no real title available?)
- scientific article; zbMATH DE number 2213555 (Why is no real title available?)
- Divisibility Properties of Integer Sequences
- Lexicographically minimal extension of a finite binomid index
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974924)
