Search arXivSearch

arXiv · 2406.14032

Can the quadratrix truly square the circle?

Abstract

The quadratrix received its name from the circle quadrature, squaring the circle, but it only solves it if completed by taking a limit, as pointed out already in antiquity. We ask if it can square the circle without limits and restrict its use accordingly, to converting ratios of angles and segments into each other. The problem is then translated into algebra by analogy to straightedge and compass constructions, and leads to an open question in transcendental number theory. In particular, Lindemann's impossibility result no longer suffices, and the answer depends on whether $π$ belongs to the analog of Ritt's exponential-logarithmic field with an algebraic base. We then derive that it does not from the well-known Schanuel conjecture. Thus, the quadratrix so restricted cannot square the circle after all.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Cruz, Sergiy Koshkin. 2024-06-20. Can the quadratrix truly square the circle?. https://arxiv.org/abs/2406.14032

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT