2000 character limit reached
Two-dimensional badly approximable vectors and Schmidt's game
Published 16 Apr 2012 in math.NT | (1204.3610v2)
Abstract: We prove that for any pair $(s,t)$ of nonnegative numbers with $s+t=1$, the set of two-dimensional $(s,t)$-badly approximable vectors is winning for Schmidt's game. As a consequence, we give a direct proof of Schmidt's conjecture using his game.
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.