Erdős problem 366 · problems.science

Are there any $2$ -full $n$ such that $n+1$ is $3$ -full?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:617e03e1610c77c37abed4f5fece0d0610dcba2dd75f730e73d31769b97f409a
Metadata: sha256:eca50b8a31819d646651c3a18dfc8d10d103db7ae2d339a51440cb0afae0f18d
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:a8a4d4f02ff5525142e36610da8d27cd47b25fc5e25fe0cffb8d1f61646d3dd2

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207