A new lower bound for
Wadim Zudilin (2007)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We prove that, for all integers exceeding some effectively computable number , the distance from to the nearest integer is greater than .
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Wadim Zudilin (2007)
Journal de Théorie des Nombres de Bordeaux
Similarity:
We prove that, for all integers exceeding some effectively computable number , the distance from to the nearest integer is greater than .
Sever S. Dragomir (2005)
Kragujevac Journal of Mathematics
Similarity:
Chu, Wenchang (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Tsagareishvili, V. (2003)
Georgian Mathematical Journal
Similarity:
Nikonorov, Yu.G. (2000)
Siberian Mathematical Journal
Similarity:
Ngoc, Ngo Phuoc Nguyen, Van Vinh, Nguyen, Hien, Pham Thi Thao (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Liu Lanzhe, Wang Hua (2006)
Kragujevac Journal of Mathematics
Similarity:
Kuroki, Kazunori (2009)
SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]
Similarity:
Foss, S. G., Chernova, N. I. (2001)
Sibirskij Matematicheskij Zhurnal
Similarity:
Oinarov, Ryskul (2002)
Sibirskij Matematicheskij Zhurnal
Similarity: