Skip to published state

finding record / erdos

recorded

vf_4ff2bf921c9857e2

Erdős Problem #365

Canonical assertion

declared status 'open'. Formalized: no. Do all pairs of consecutive powerful numbers nn and n+1n+1 come from solutions to Pell equations? In other words, must either nn or n+1n+1 be a square? Is the number of such nxn\leq x bounded by (logx)O(1)(\log x)^{O(1)}? Prize: no. OEIS: A060355, A060859, A175155. Tags: number theory.

Notation is rendered from the stored source. The pinned checkout remains the exact record.

  1. database_record
  2. theoretical
  3. 0 spans
  4. recorded
Provenance summary
erdos_deep:365
database_record
Jun 16, 2026, 12:00 AM
not recorded
0
Exact record identityFinding ID, frontier identity, and pinned Git source
vf_4ff2bf921c9857e2
vfr_0a25edabc16db143
ce8ba7d934c848408e0d91caca39e938698e3fc7
03f7371b496485f761f91961027fd48198dc7e93
Exact source and rootsGit ce8ba7d934c8 and content-addressed ledgers
Commit
ce8ba7d934c848408e0d91caca39e938698e3fc7
Tree
03f7371b496485f761f91961027fd48198dc7e93
Committed
2026-07-20T19:20:20-04:00
Repository
Open source
Event log
sha256:a06797bc0d1b0e3c88a2f97507fe0832661e3992d8df41187a0aa6d3ceee9bde
Snapshot
sha256:1faedc24f040a60a22177b456c74b969a61ce8836082297b1835797a57b4fa56
Proposals
sha256:e69b38037814f2e8ca826942cfc50ab370993889be2913cac1c0b3e77711160f
Actor registry
sha256:665f3e1c48f0a50fac949681c0af01bdd28de2991f2cdc5cc4cddbe69df6311b
Artifacts
sha256:3d58619c5cfb7e28de2f344476e35c9f0b80709c996b2a1bfdb2e11496f7e1da