On a combinatorial problem of Asmus Schmidt | NOVA. The University of Newcastle's Digital Repository

Home

Description	Size	Format
Publisher version (open access)	93 KB	Adobe Acrobat PDF	View/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/934890

Title: On a combinatorial problem of Asmus Schmidt
Author/Creator: Zudilin, W.
Description: For any integer r ≥ 2, define a sequence of numbers {c^(r)_k} _k=0,1,…, independent of the parameter n , by ⁿ∑_k=0 ⁽ⁿ⁾_(k) ^r ^(n+k)_(k) ^r = ⁿ∑_k=0 ⁽ⁿ⁾_(k) ^(n+k)_(k)c^(r)_k, n = 0, 1, 2,... . We prove that all the numbers c^(r)_k are integers.
Relation: Journal of Combinatorics Vol. 11, Issue 1
Relation: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v11i1r22
Date: 2004
Publisher: Electronic Journal of Combinatorics
Keyword(s): integers; combinatorial problem; Asmus Schmidt
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/934890
Identifier: ISSN:1097-1440
Language: eng

5 Visitors

12 Hits

NOVA. The University of Newcastle's Digital Repository