2000 character limit reached
On multiplicatively badly approximable numbers
Published 10 Jan 2011 in math.NT | (1101.1855v1)
Abstract: The Littlewood Conjecture states that liminf_{q\to \infty} q . ||qx|| . ||qy|| = 0 for all pairs (x,y) of real numbers. We show that with the additional factor of log q . loglog q the statement is false. Indeed, our main result implies that the set of (x,y) for which liminf_{q\to\infty} q . log q . loglog q . ||qx|| . ||qy|| > 0 is of full dimension.
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.