← Latest papers
🔢 mathematics

Irrationality of finite logarithms in a congruence-class adèle ring

This paper extends previous results on the irrationality of finite logarithms in the "poor man's adèle ring" to primes restricted to specific arithmetic progressions and demonstrates, conditional on the $abc$-conjecture, that these logarithms cannot be quadratic irrational.

Original authors: Daniel Evans

Published 2026-07-31
📖 4 min read🧠 Deep dive

Original authors: Daniel Evans

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine the world of numbers not just as a straight line stretching from negative infinity to positive infinity, but as a vast, multi-dimensional city. In this city, the familiar rational numbers (like 1/2, 3, or -7/4) are the main streets everyone knows. But mathematicians have built a special, slightly chaotic neighborhood called the "poor man's adèle ring." Think of this neighborhood as a giant library where every book represents a different prime number (2, 3, 5, 7, 11, and so on). To live in this neighborhood, a number has to have a "passport" for every single prime number, showing what it looks like when you divide it by that prime. It's a place where we can study how numbers behave when they are squeezed through the tiny, unique filters of prime numbers.

In this strange neighborhood, mathematicians have invented a tool called the "finite logarithm." In the normal world, a logarithm tells you how many times you need to multiply a base number to get a result (like how 2 multiplied by itself 3 times gives 8). In this prime-number library, the finite logarithm is a special code generated by a process called the "Fermat quotient." It's like taking a number, raising it to a massive power based on a specific prime, subtracting one, and seeing what's left over when you divide by that prime. The big question mathematicians have been asking is: "What kind of numbers do these codes turn out to be?" Are they just simple, boring fractions (rational numbers), or are they wild, unpredictable, and irrational? This matters because understanding these codes helps us see the hidden, deep structure of how numbers relate to one another across the entire universe of primes.

In this paper, Daniel Evans takes a closer look at these finite logarithms, but with a twist. Instead of looking at all the prime numbers in the library, he decides to only look at primes that follow a specific marching order: those that leave a remainder of 1 when divided by a fixed number mm (like primes that are 1 more than a multiple of 3, or 1 more than a multiple of 5). He calls this a "congruence class."

Evans proves two major things about these restricted codes. First, he shows that for almost any starting number you pick (as long as it's not 1 or -1), the resulting finite logarithm code is never a simple, non-zero rational number. It's not just a fraction like 3/4 or 5/2; it's something much more complex that cannot be written down as a single, neat fraction in this special library. Second, he shows that these codes are never zero, provided we accept a famous, unproven guess in mathematics called the "abc-conjecture." If that guess is true, the code never vanishes into nothingness.

The paper also tackles a slightly more complex idea: could these codes be "quadratic irrational"? In the world of numbers, a quadratic irrational is a number that involves a square root of a non-square number (like 2\sqrt{2} or 3\sqrt{3}), which can't be written as a simple fraction but follows a specific, predictable pattern. Evans demonstrates that, again assuming the abc-conjecture is true, these finite logarithms are not quadratic irrationals either. They are even more chaotic and unpredictable than that.

To reach these conclusions, Evans uses a clever mathematical trick involving "cyclotomic polynomials." You can think of these as special, multi-layered filters that sort numbers based on their relationship to roots of unity (imaginary numbers that circle back to 1). By analyzing how these filters behave when applied to the Fermat quotients, Evans finds that if the logarithm were a simple rational number or a quadratic irrational, it would create a mathematical contradiction—like a puzzle piece that simply doesn't fit the shape of the hole it's supposed to fill.

The paper doesn't just say "it's irrational"; it rigorously proves that these values cannot be simple fractions and, under the assumption of the abc-conjecture, cannot be zero or simple square-root-based numbers. It extends previous work that looked at all primes to this specific, restricted group of primes marching in arithmetic progressions. The result is a stronger, more refined map of the "poor man's adèle ring," showing us that the finite logarithms of rational numbers are deeply, fundamentally irrational, hiding in the shadows of prime numbers where simple patterns just don't exist.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →