Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.0434

Another generalization of Mason's ABC-theorem

Michiel de Bondt
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show a generalization of Mason's ABC-theorem, with the only conditions that the greatest common divisor has been divided out and no proper subsum of the (possibly multivariate) polynomial sum f_1 + f_2 + ... + f_n = 0 vanishes. As a result, we show that the generalized Fermat-Catalan equation for polynomials: g_1^{d_1} + g_1^{d_2} + ... + g_n^{d_n} = 0 has no non-constant solutions if the greatest common divisor of the terms equals one, no proper subsum vanishes and the hyperbolic sum 1/d_1 + 1/d_2 + ... + 1/d_n is at most 1/(n-2). Furthermore, we show that the generalized Fermat-equation for polynomials g_1^d + g_1^d + ... + g_n^d = 0 has no 'interesting' solutions if d >= n(n-2).

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michiel de Bondt. 2023-07-17. Another generalization of Mason's ABC-theorem. https://arxiv.org/abs/0707.0434

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗