Preprint
Article

This version is not peer-reviewed.

On ABC Triples

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: 
;  ;  

1. Introduction

The radical of a positive integer n, often denoted as r a d ( n ) , 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 a , b , c be positive integers such that c = a + b and gcd ( a , b , c ) = 1 , then for each positive real number ε > 0 , there are only finite triples ( a , b , c ) such that r a d ( a b c ) 1 + ε < c .
A set of three positive integers ( a , b , c ) 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
log c < K · r a d ( a b c ) 1 3 ( log r a d ( a b c ) ) 3
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]:
log c > log r a d ( a b c ) + k log c log log c
for all k < 4 , and van Frankenhuysen improved k to 6.068 in 2000.[8]
Moreover, Granville and Tucker ([2]) has proposed the following conjecture:
Conjecture 1.2.
Let a , b , c be positive integers such that c = a + b and gcd ( a , b , c ) = 1 , then c < r a d ( a b c ) 2 .
Besides, there is a stronger conjecture proposed by Baker in 2004 [1], stating that
Conjecture 1.3.
Let a , b , c be positive integers such that c = a + b and gcd ( a , b , c ) = 1 , then c < 6 5 r a d ( a b c ) ( log r a d ( a b c ) ) ω ( a b c ) ( ω ( a b c ) ) !
where ω ( a b c ) is the number of distinct prime factors of a b c .
Since it has been shown by Laishram and Shorey (2011,[3]) that 6 5 ( log r a d ( a b c ) ) ω ( a b c ) ( ω ( a b c ) ) ! < r a d ( a b c ) 3 4 , Conjecture 1.3 implies that c < r a d ( a b c ) 7 4 .
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, r a d ( n ) = i = 1 ω ( n ) p i indicates the radical of a positive integer n = i = 1 ω ( n ) p i a i with p 1 , , p ω ( n ) being prime numbers and 1 a 1 , , a ω ( n ) being positive integers, and log n indicates the natural logarithm of n.

2. Main Results

Definition 1.
R ( n ) = r a d ( n ) n
Theorem 1.
If c = a + b and gcd ( a , b , c ) = 1 , then c < r a d ( a b c ) 2
Proof. 
W.l.o.g. assume that a < b . First, we cannot have r a d ( a b c ) 2 = c , because if r a d ( a ) 2 r a d ( b ) 2 r a d ( c ) 2 = r a d ( a b c ) 2 = c , then we have r a d ( a ) r a d ( b ) c gcd ( a , b , c ) > 1 , which is a contradiction, thus we either have r a d ( a b c ) 2 > c or r a d ( a b c ) 2 < c .
Claim: Assume that z = 1 4 r a d ( a b c ) and r a d ( a b c ) 2 < c , then for all nonnegative integers 0 m , ( 1 + z 2 b ) m r a d ( a b c ) 2 < c implies that ( 1 + z 2 b ) m + 1 r a d ( a b c ) 2 < c .
Proof of the claim:
We prove the claim by mathematical induction.
First, since r a d ( a b c ) 2 < c and since c = a + b < 2 b , we have r a d ( a b c ) 2 < c < 2 b
Therefore, we have
R ( a b ) = r a d ( a b ) a b < r a d ( a b ) a ( r a d ( a b c ) 2 2 ) = 2 r a d ( a b ) a · r a d ( a b c ) 2
and
R ( c ) = r a d ( c ) c < r a d ( c ) r a d ( a b c ) 2
This implies that R ( a b ) 2 r a d ( a b ) a · r a d ( a b c ) 2 < 0 and R ( c ) r a d ( c ) r a d ( a b c ) 2 < 0
Therefore we have
0 < ( R ( a b ) 2 r a d ( a b ) a · r a d ( a b c ) 2 ) ( R ( c ) r a d ( c ) r a d ( a b c ) 2 )
Which implies that
2 r a d ( a b ) a · r a d ( a b c ) 2 R ( c ) + r a d ( c ) r a d ( a b c ) 2 R ( a b ) < R ( a b c ) + ( 2 a · r a d ( a b c ) 3 )
Multiplying a on both sides, we have
2 c · r a d ( a b c ) + 1 b · r a d ( a b c ) < a · R ( a b c ) + ( 2 r a d ( a b c ) 3 ) = a · r a d ( a b c ) a b c + ( 2 r a d ( a b c ) 3 ) .
Since r a d ( a b c ) 2 < c , (6) implies that
2 c · r a d ( a b c ) + 1 b · r a d ( a b c ) < 1 b c + 2 r a d ( a b c ) 3
Let ρ = 1 r a d ( a b c ) , then by multiplying b c on both sides, we have
( 2 b + c ) ρ < c + 2 ρ 3 b c
Which implies that
2 b + c c ρ 2 b c < ρ 2 r a d ( a b c ) 2 < 2 b 2 b + c c ρ c
If 2 b + c c ρ 2 b + z , then we have
c c ρ z 0 c 1 2 ( 1 ρ + 1 ρ 2 + 4 z ) c 1 4 ( 2 ρ 2 + 2 ρ 1 ρ 2 + 4 z ) 1 ρ 2 + z
By Bernoulli’s inequality, we have 1 ρ 2 + 4 z 1 ρ ( 1 + 2 z ρ 2 ) = 1 ρ + 2 z ρ , therefore, we have
c 1 4 ( 2 ρ 2 + 2 ρ 1 ρ 2 + 4 z ) 1 ρ 2 + z = r a d ( a b c ) 2 + 1 4 r a d ( a b c )
but since r a d ( a b c ) and c are positive integers with 6 r a d ( a b c ) , we have 1 4 r a d ( a b c ) < 1 , this implies that c r a d ( a b c ) 2 , which contradicts with our assumption.
Therefore we have 2 b + z < 2 b + c c ρ , and by (10) we have
r a d ( a b c ) 2 < 2 b 2 b + c c ρ c < 2 b 2 b + z c ( 1 + z 2 b ) r a d ( a b c ) 2 < c
Thus the claim holds for m = 0 .
Now assume that the proposition holds for all positive integers 1 m k 1 , then for the case m = k , since ( 1 + z 2 b ) k r a d ( a b c ) 2 < c and since c = a + b < 2 b , we have ( 1 + z 2 b ) k r a d ( a b c ) 2 < c < 2 b . For the sake of brevity, we may have ζ = ( 1 + z 2 b ) k in the following paragraphs.
Therefore, we have
R ( a b ) = r a d ( a b ) a b < r a d ( a b ) a ( ζ r a d ( a b c ) 2 2 ) = 2 r a d ( a b ) ζ a · r a d ( a b c ) 2
and
R ( c ) = r a d ( c ) c < r a d ( c ) ζ r a d ( a b c ) 2
This implies that R ( a b ) 2 r a d ( a b ) ζ a · r a d ( a b c ) 2 < 0 and R ( c ) r a d ( c ) ζ r a d ( a b c ) 2 < 0
Therefore we have
0 < ( R ( a b ) 2 r a d ( a b ) ζ a · r a d ( a b c ) 2 ) ( R ( c ) r a d ( c ) ζ r a d ( a b c ) 2 )
Which implies that
2 r a d ( a b ) ζ a · r a d ( a b c ) 2 R ( c ) + r a d ( c ) ζ r a d ( a b c ) 2 R ( a b ) < R ( a b c ) + ( 2 ζ 2 a · r a d ( a b c ) 3 )
Since ζ r a d ( a b c ) 2 < c , (17) implies that
2 r a d ( a b c ) ζ a c · r a d ( a b c ) 2 + r a d ( a b c ) ζ a b · r a d ( a b c ) 2 = 2 r a d ( a b ) ζ a · r a d ( a b c ) 2 R ( c ) + r a d ( c ) ζ r a d ( a b c ) 2 R ( a b ) < R ( a b c ) + ( 2 ζ 2 a · r a d ( a b c ) 3 ) .
Multiplying a on both sides, we have
2 ζ c · r a d ( a b c ) + 1 ζ b · r a d ( a b c ) < a · R ( a b c ) + ( 2 ζ 2 r a d ( a b c ) 3 ) = a · r a d ( a b c ) a b c + ( 2 ζ 2 r a d ( a b c ) 3 ) .
Since ζ r a d ( a b c ) 2 < c , we have
2 ζ c · r a d ( a b c ) + 1 ζ b · r a d ( a b c ) < r a d ( a b c ) b c + ( 2 ζ 2 r a d ( a b c ) 3 ) < c ζ b c + 2 ζ 2 r a d ( a b c ) 3 = 1 b ζ c + 2 ζ 2 r a d ( a b c ) 3
Let ρ = 1 ζ r a d ( a b c ) , then by multiplying ζ b c on both sides, we have
( 2 b + c ) ρ < c + 2 ρ 3 b c
Which implies that
2 b + c c ρ 2 b c < ρ 2 ζ r a d ( a b c ) 2 < 2 b 2 b + c c ρ c
If 2 b + c c ρ 2 b + z , then since ζ r a d ( a b c ) 2 + 1 c , 2 b + c c ρ 2 b + z imply that
c ( ζ r a d ( a b c ) ) c + z c ( c ζ r a d ( a b c ) ) z = 1 4 r a d ( a b c ) c ζ r a d ( a b c ) + 1 4 r a d ( a b c ) c .
which implies that
c ζ r a d ( a b c ) 2 + 2 ζ r a d ( a b c ) 4 r a d ( a b c ) c + 1 16 c · r a d ( a b c ) 2 ζ r a d ( a b c ) 2 + 2 ζ r a d ( a b c ) 4 r a d ( a b c ) ζ r a d ( a b c ) + 1 16 c · r a d ( a b c ) 2 = ζ r a d ( a b c ) 2 + 1 2 r a d ( a b c ) + 1 16 c · r a d ( a b c ) 2 ζ r a d ( a b c ) 2 + 1 + 1 2 r a d ( a b c ) + 1 16 c · r a d ( a b c ) 2
But since 3 c is a positive integer and since gcd ( a , b , c ) = 1 and a + b = c , we have 6 r a d ( a b c ) , thus 1 2 r a d ( a b c ) + 1 16 c · r a d ( a b c ) 2 < 1 12 + 1 16 × 6 2 < 1 , therefore, (24) implies that ζ r a d ( a b c ) 2 + 1 c ζ r a d ( a b c ) 2 + 1 , which indicates that c = ζ r a d ( a b c ) 2 + 1 .
By (21) and c = ζ r a d ( a b c ) 2 + 1 , we have
2 b < c ρ + ( 2 ρ 2 b 1 ) c = ζ r a d ( a b c ) 2 + 1 ζ r a d ( a b c ) 2 + ( 2 b ζ r a d ( a b c ) 2 1 ) ( ζ r a d ( a b c ) 2 + 1 )
Here we must have 2 b ζ r a d ( a b c ) 2 1 1 , this is because if 1 < 2 b ζ r a d ( a b c ) 2 1 , then we have ζ r a d ( a b c ) 2 < b ( c 1 ) , which implies that ζ r a d ( a b c ) 2 + 1 < c ζ r a d ( a b c ) 2 + 1 , a contradiction.
Also, we must have b a = 1 , this is because if 2 b a , then we have
2 b a a + 2 b a b 2 c = a + b 2 b 2 c + 2 2 b
Therefore, (25) implies that
ζ r a d ( a b c ) 2 + 3 = c + 2 2 b < ζ r a d ( a b c ) 2 + 1 + ζ r a d ( a b c ) 2 + 1 ζ r a d ( a b c ) 2 4 < ζ r a d ( a b c ) 2 + 1 ζ r a d ( a b c ) 2 4 ζ r a d ( a b c ) 2 < ζ r a d ( a b c ) 2 + 1
However, since ζ r a d ( a b c ) 2 ζ r a d ( a b c ) 2 , (27) implies that 4 ζ r a d ( a b c ) 2 < ζ r a d ( a b c ) 2 + 1 , which further implies that 3 r a d ( a b c ) 2 3 ζ r a d ( a b c ) 2 < 1 , a contradiction.
Therefore, we have b a = 1 , and by b a = 1 we have a = b 1 , which implies that c = a + b = 2 b 1 .
Again, by (21), we have
2 b = c + 1 < c ρ + ( 2 ρ 2 b 1 ) c 2 c + 1 < c ρ + ρ 2 ( c + 1 ) 2 c + 1 < c + ζ r a d ( a b c ) 2 + 2 ζ r a d ( a b c ) 2 c + 1 + 2 ζ r a d ( a b c ) 2 c < 2 ζ r a d ( a b c ) 2
But since 6 r a d ( a b c ) and 1 < ζ = ( 1 + z 2 b ) k , we have 2 ζ r a d ( a b c ) 2 < 1 , therefore, (28) implies that c < 1 , which is a contradiction.
Therefore we have 2 b + z < 2 b + c c ρ , and by 2 b + z < 2 b + c c ρ and (22), we have
( 1 + z 2 b ) k r a d ( a b c ) 2 < 2 b 2 b + c c ρ c < 2 b 2 b + z c ( 1 + z 2 b ) k + 1 r a d ( a b c ) 2 = ( 1 + z 2 b ) k ( 1 + z 2 b ) r a d ( a b c ) 2 < c
Thus the claim holds for m = k as well.
Therefore, by mathematical induction, the claim holds for all 0 m , which implies that if r a d ( a b c ) 2 < c , then ( 1 + z 2 b ) m r a d ( a b c ) 2 < c holds for all non-negative integers 0 m .
However, since c is finite and 1 < 1 + z 2 b , by the Archimedean property, there is a positive integer τ such that c < ( 1 + z 2 b ) τ r a d ( a b c ) 2 , therefore, the claim leads to a contradiction, thus r a d ( a b c ) 2 < c is false.
Therefore c < r a d ( a b c ) 2 . □

Conflicts of Interest

The research received no external funding.

References

  1. Baker, A. Experiments on the abc-conjecture. Publicationes Mathematicae Debrecen 2004, n. pag. [Google Scholar] [CrossRef]
  2. Granville, A.; Tucker, T. J. It’s As Easy As abc. Notices of the AMS 2002, 49(10), 1224–1231. [Google Scholar]
  3. Laishram, S.; Shorey, T.N. Baker’s explicit abc-conjecture and applications. Acta Arithmetica 2011, 155, 419–429. [Google Scholar] [CrossRef]
  4. Masser, D. W. Open problems. In Proceedings of the symposium on Analytic Number Theory, Imperial College, London, 1985. [Google Scholar]
  5. 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/.
  6. Stewart, C.L.; Yu, K. On the abc conjecture, II. Duke Mathematical Journal 2001, 108, 169–181. [Google Scholar] [CrossRef]
  7. Stewart, C.L.; Tijdeman, R. On the Oesterl’e-Masser conjecture. Monatshefte für Mathematik 1986, 102, 251–257. [Google Scholar] [CrossRef]
  8. 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.
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.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated