Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



A conjecture of Erdös on 3-powerful numbers

Author: J. H. E. Cohn
Journal: Math. Comp. 67 (1998), 439-440
MSC (1991): Primary 11P05
MathSciNet review: 1432127
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Erdös conjectured that the Diophantine equation $x+y=z$ has infinitely many solutions in pairwise coprime 3-powerful integers, i.e., positive integers $n$ for which $p\mid n$ implies $p^3\mid n$. This was recently proved by Nitaj who, however, was unable to verify the further conjecture that this could be done infinitely often with integers $x$, $y$ and $z$ none of which is a perfect cube. This is now demonstrated.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (1991): 11P05

Retrieve articles in all journals with MSC (1991): 11P05

Additional Information

J. H. E. Cohn
Affiliation: Department of Mathematics, Royal Holloway University of London, Egham, Surrey TW20 0EX, United Kingdom

Received by editor(s): May 15, 1996
Received by editor(s) in revised form: September 13, 1996
Article copyright: © Copyright 1998 American Mathematical Society