Open Research Newcastle
Browse

A new lower bound for ||(3/2)k||

Download (478.63 kB)
journal contribution
posted on 2025-05-10, 23:51 authored by W. Zudilin
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.

History

Journal title

Journal de Theorie des Nombres de Bordeaux

Volume

19

Issue

1

Pagination

311-323

Publisher

Universite de Bordeaux I, Centre de Recherces en Mathematiques

Place published

Cedex, France

Language

  • en, English

College/Research Centre

Faculty of Science

School

School of Mathematical and Physical Sciences

Usage metrics

    Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC