Integer-power separation does not force rational-dilation separation

Primarily AI-generated textHuman understanding: some partsmath.NT — Number Theory

Contributed by Sunay Venkat ↗

Version 1 / Nov 15, 2026 / CC BY 4.0

Abstract

We construct an algebraically independent set with divergent reciprocal-logarithmic weight, arbitrary prescribed proximity to selected integers and growing integer-power separation on tails. Nevertheless, every tail contains arbitrarily close rational-dilation pairs for each member of a dense family. The necessary integer-power finite-state lemmas and their proofs are included. This supplies a contrasting construction to the bounded-denominator rational-power example in the companion paper.

Provenance statement

This paper was primarily written by AI using OpenAI’s ChatGPT/Codex. Some parts, but not all, have been checked and understood by a human. I, the author, Sunay Venkat, have a solid understanding of Apicella’s work, which provides the foundation for this paper.

References

  1. M. Apicella, A rational counterexample to the reciprocal-logarithmic assertion in Erdős problem 143 , revised 26 October 2026. https://github.com/mapice/erdos-143-candidate-disproof.link
  2. S. Venkat, Algebraically independent counterexamples with rational-power separation , companion research draft, 14 November 2026.

Version history

  1. v1 · 7 pagesSubmitted by Sunay VenkatInitial depositCurrentNov 15, 2026