z-logo
open-access-imgOpen Access
A new lower bound for {\Vert (3/2)^k\Vert }
Author(s) -
Wadim Zudilin
Publication year - 2007
Publication title -
journal de théorie des nombres de bordeaux
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.663
H-Index - 26
eISSN - 2118-8572
pISSN - 1246-7405
DOI - 10.5802/jtnb.588
Subject(s) - mathematics , combinatorics , upper and lower bounds , mathematical analysis
We prove that, for all integers k exceeding some effectively computable number K, the distance from (3/2)k to the nearest integer is greater than 0.5803k

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom