Submitted:
03 December 2025
Posted:
05 December 2025
You are already at the latest version
Abstract
In this paper, we study the properties of co-prime positive integers $a,b,c$ such that \(a+b=c\) in relation to their radicals. We establish an explicit upper bound for \(c\) in relation to $rad(abc)$.
Keywords:
radical of an integer
; abc conjecture
; Diophantine equations
MSC: 11A25, 11D75, 11J25
1. Introduction
The radical of a positive integer n, often denoted as , is the product of all prime factors of n, that is, the largest square-free factor of n. The abc conjecture is a conjecture in number theory first proposed by Joseph Oesterlé and David Masser in 1985 that is related to the radicals of positive integers [4,5]. The statement of the abc conjecture is as follows:
Conjecture 1.1.
Let be positive integers such that and , then for each positive real number , there are only finite triples such that .
A set of three positive integers that is a subject of Conjecture 1 is called an abc triple. So far there is no widely accepted proof for the abc conjecture and the conjecture is still regarded as an open problem.
A proven upper bound for c in an abc triple is
with K being a constant independent of a, b and c. This upper bound was proven by Stewart and Yu in 2001 [6].
In addition, Stewart and Tijdeman proved that the following lower bound holds for infinitely many abc triples in 1986 [7]:
for all , and van Frankenhuysen improved k to in 2000.[8]
Moreover, Granville and Tucker ([2]) has proposed the following conjecture:
Conjecture 1.2.
Let be positive integers such that and , then .
Besides, there is a stronger conjecture proposed by Baker in 2004 [1], stating that
Conjecture 1.3.
Let be positive integers such that and , then
where is the number of distinct prime factors of .
Since it has been shown by Laishram and Shorey (2011,[3]) that , Conjecture 1.3 implies that .
In this paper, we intend to discuss some properties of triples involved in the abc conjecture, improving the upper bound for c in an abc triple. Unless otherwise specified, indicates the radical of a positive integer with being prime numbers and being positive integers, and indicates the natural logarithm of n.
2. Main Results
Definition 1.
Theorem 1.
If and , then
Proof.
W.l.o.g. assume that . First, we cannot have , because if , then we have , which is a contradiction, thus we either have or .
Claim: Assume that and , then for all nonnegative integers , implies that .
Proof of the claim:
We prove the claim by mathematical induction.
First, since and since , we have
Therefore, we have
and
This implies that and
Therefore we have
Which implies that
Multiplying a on both sides, we have
Since , (6) implies that
Let , then by multiplying on both sides, we have
Which implies that
If , then we have
By Bernoulli’s inequality, we have , therefore, we have
but since and c are positive integers with , we have , this implies that , which contradicts with our assumption.
Therefore we have , and by (10) we have
Thus the claim holds for .
Now assume that the proposition holds for all positive integers , then for the case , since and since , we have . For the sake of brevity, we may have in the following paragraphs.
Therefore, we have
and
This implies that and
Therefore we have
Which implies that
Let , then by multiplying on both sides, we have
Which implies that
If , then since , imply that
which implies that
But since is a positive integer and since and , we have , thus , therefore, (24) implies that , which indicates that .
By (21) and , we have
Here we must have , this is because if , then we have , which implies that , a contradiction.
Also, we must have , this is because if , then we have
Therefore, (25) implies that
However, since , (27) implies that , which further implies that , a contradiction.
Therefore, we have , and by we have , which implies that .
Again, by (21), we have
But since and , we have , therefore, (28) implies that , which is a contradiction.
Therefore we have , and by and (22), we have
Thus the claim holds for as well.
Therefore, by mathematical induction, the claim holds for all , which implies that if , then holds for all non-negative integers .
However, since c is finite and , by the Archimedean property, there is a positive integer such that , therefore, the claim leads to a contradiction, thus is false.
Therefore . □
Conflicts of Interest
The research received no external funding.
References
- Baker, A. Experiments on the abc-conjecture. Publicationes Mathematicae Debrecen 2004, n. pag. [Google Scholar] [CrossRef]
- Granville, A.; Tucker, T. J. It’s As Easy As abc. Notices of the AMS 2002, 49(10), 1224–1231. [Google Scholar]
- Laishram, S.; Shorey, T.N. Baker’s explicit abc-conjecture and applications. Acta Arithmetica 2011, 155, 419–429. [Google Scholar] [CrossRef]
- Masser, D. W. Open problems. In Proceedings of the symposium on Analytic Number Theory, Imperial College, London, 1985. [Google Scholar]
- Oesterlé, J. Nouvelles approches du “théorème” de Fermat, Astérisque (1988)(161-162), Exp. No. 694, 4, 165–186 (1989), Séminaire Bourbaki, Vol. 88 1987. Available online: http://www.numdam.org/item/SB_1987-1988__30__165_0/.
- Stewart, C.L.; Yu, K. On the abc conjecture, II. Duke Mathematical Journal 2001, 108, 169–181. [Google Scholar] [CrossRef]
- Stewart, C.L.; Tijdeman, R. On the Oesterl’e-Masser conjecture. Monatshefte für Mathematik 1986, 102, 251–257. [Google Scholar] [CrossRef]
- van Frankenhuysen, M. A Lower Bound in the abc Conjecture. Journal of Number Theory 2000, 82, 91–95. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.