VOOZH about

URL: https://www.erdosproblems.com/forum/thread/366

⇱ Erdős Problem #366 - Discussion thread


👁 Logo
Forum Inbox Favourites Tags
More
Forum
Dual View Random Solved Random Open
VERIFIABLE Open, but could be proved with a finite example.
Are there any $2$-full $n$ such that $n+1$ is $3$-full? That is, if $p\mid n$ then $p^2\mid n$ and if $p\mid n+1$ then $p^3\mid n+1$.
#366: [Er76d,p.31][ErGr80,p.68]
number theory | powerful
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
Erdős originally asked Mahler whether there are infinitely many pairs of consecutive powerful numbers, but Mahler immediately observed that the answer is yes from the infinitely many solutions to the Pell equation $x^2=8y^2+1$.

Note that $8$ is 3-full and $9$ is $2$-full. Erdős and Graham asked if this is the only pair of such consecutive integers. Stephan has observed that $12167=23^3$ and $12168=2^33^213^2$ (a pair already known to Golomb [Go70]) is another example, but (by OEIS A060355) there are no other examples for $n<10^{22}$.

In [Er76d] Erdős asks the weaker question of whether there are any consecutive pairs of $3$-full integers (which is also discussed in problem B16 of Guy's collection [Gu04]).

View the LaTeX source

This page was last edited 23 March 2026. View history

External data from the database - you can help update this
Formalised statement? Yes
Related OEIS sequences: A060355
0 comments on this problem
Likes this problem thomas
Interested in collaborating None
Currently working on this problem None
This problem looks difficult thomas
This problem looks tractable None
The results on this problem could be formalisable None
I am working on formalising the results on this problem None

Additional thanks to: Stijn Cambie, Ralf Stephan, Wouter van Doorn, and Desmond Weisenberg

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #366, https://www.erdosproblems.com/366, accessed 2026-04-11
Order by oldest first or newest first. (The most recent comments are highlighted in a red border.)
All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic.

Log in to add a comment.

Back to the forum