A simple proof of Schmidt's conjecture

被引：1

作者：

Thanatipanonda, Thotsaporn 'Aek' ^{[1
]}

机构：

[1] Johannes Kepler Univ Linz, Symbol Computat Res Inst, A-4040 Linz, Austria

来源：

关键词：

Zeilberger's algorithm; difference equation; Schmidt's problem; COMBINATORIAL; POLYNOMIALS;

D O I：

10.1080/10236198.2013.838564

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Using difference equations and Zeilberger's algorithm, we give a very simple proof of a conjecture of Asmus Schmidt that was first proved by Zudilin.

引用

页码：413 / 415

页数：3

共 7 条

[1]

Graham Ronald L., 1994, Concrete Mathematics: A Foundation For Computer Science, V2nd

Guo, Victor J. W. ;

Jouhet, Frederic ;

Zeng, Jiang .

Guo, Victor J. W. ;

Zeng, Jiang .

[4] GENERALIZED Q-LEGENDRE POLYNOMIALS [J].

SCHMIDT, AL .

[5] LEGENDRE TRANSFORMS AND APERYS SEQUENCES [J].

SCHMIDT, AL .

JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY SERIES A-PURE MATHEMATICS AND STATISTICS, 1995, 58 :358-375

[6] BINOMIAL IDENTITIES - COMBINATORIAL AND ALGORITHMIC ASPECTS [J].

STREHL, V .

[7]

Zudilin W, 2004, ELECTRON J COMB, V11