A family of criteria for irrationality of Euler's constant
Abstract
Following earlier results of Sondow, we propose another criterion of irrationality for Euler's constant γ. It involves similar linear combinations of logarithm numbers L\n,m. To prove that γ is irrational, it suffices to prove that, for some fixed m, the distance of d\n L\n,m (d\n is the least common multiple of the n first integers) to the set of integers Z does not converge to 0. A similar result is obtained by replacing logarithms numbers by rational numbers: it gives a sufficient condition involving only rational numbers. Unfortunately, the chaotic behavior of d\n is an obstacle to verify this sufficient condition. All the proofs use in a large manner the theory of Pad\'e approximation.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.