Let P n be the n-th perfect power. In this article we obtain asymptotic formulae for the sum n i=1 P i. We also prove the following formulae n i=1 1 √ P i = log n + C + o(1), Pn≤x 1 √ P n = 1 2 log x + C + o(1), where C is a constant.
Let P n be the n-th perfect power. In this article we obtain asymptotic formulae for the sum n i=1 P i. We also prove the following formulae n i=1 1 √ P i = log n + C + o(1), Pn≤x 1 √ P n = 1 2 log x + C + o(1), where C is a constant.
Let P n be the n-th perfect power and d n the difference P n+1 − P n. The Pillai's conjecture establish the following limit lim n→∞ d n = ∞. This is an unsolved problem. In this article we establish a more strong conjecture on d n .
“…Proof. We have P 1 = 1 2 = 1, P 2 = 2 2 = 4, P 3 = 8 and P 4 = 3 2 . Consequently if n ≥ 4 then P n ≤ (n − 1) 2 , since the squares are perfect powers.…”
Section: Introduction and Preliminary Resultsmentioning
Let Pn be the n-th perfect power. In this article we prove various theorems on the difference dn = Pn+1 - Pn. In the literature there does not exist an article dedicated to a general study on the difference dn between consecutive perfect powers. This article is the first attempt to study it.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.