Displaying similar documents to “Factorization representations in the boundary crossing problems for random walks on a Markov chain.”

A new lower bound for ( 3 / 2 ) k

Wadim Zudilin (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

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 . 5803 k .