t \Delta
Download:
|
|
by Herbert S. Wilf
http://www.math.upenn.edu/~wilf/website/resclass.ps.gz
Add To MetaCart
Abstract:
Abstract. For a triple (n; t; m) of positive integers, we attach to each t-subset S = fa 1; : : : ; a t g ` f1; : : : ; ng the sum f(S) = a 1 + \Delta \Delta \Delta + a t (modulo m). We ask: for which triples (n; t; m) are the \Gamma n
Citations
| 105 | Advanced Combinatorics – Comtet - 1974 |
| 71 | de Bruijn, ``Asymptotic Methods in Analysis – G - 1958 |
| 8 | Kathy O’Hara’s constructive proof of the unimodality of the Gaussian polynomials – Zeilberger - 1989 |
| 7 | Recurrences for sums of powers of binomial coefficients – Cusick - 1989 |
| 4 | Wilf and Doron Zeilberger – Petkovsek, Herbert - 1996 |
| 3 | Recurrences for alternating sums of powers of binomial coefficients – McIntosh - 1993 |
| 3 | The power of a prime that divides a binomial coefficient, J. fur die reine u. angew – Knuth, Wilf - 1989 |
| 3 | Gaussian binomial coefficients – P'olya, Alexanderson - 1971 |
| 3 | Subsets whose sums are congruent, Problem E3472 – Snevily - 1993 |
