153
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Computation of the Infimum in the Littlewood Conjecture

 

Abstract

The famous Littlewood Conjecture states that for any two real numbers , the value is equal to zero. In this article, we provide an algorithm which for given ε > 0 checks if the value is less than ε. In particular with its help, we show that mLC < 1/19. We also provide a similar algorithm for p-adic counterpart of the Littlewood Conjecture and show that an analog of mLC in 2-adic case is at most 1/9.

2000 AMS Subject Classification::

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.