2000 character limit reached
A Simple Proof of Schmidt's Conjecture
Published 16 Mar 2012 in math.CO | (1203.3731v2)
Abstract: For any integer $r \geq 1$, the sequence of numbers ${{c{(r)}{k}}}{k \geq 0} $ is defined implicitly by [\sum_k\binom{n}{k}r\binom{n+k}{k}r = \sum_k\binom{n}{k}\binom{n+k}{k}c{(r)}_k,\quad n=0,1,2,...] Asmus Schmidt conjectured that all $c{(r)}_k$ are integers. We give a new proof of this fact.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.