Skip to content

Erdős problem 937

Are there infinitely many four-term arithmetic progressions of coprime powerful numbers? (A number nn is *powerful* if p∣n→p2∣np \mid n \to p^2 \mid n; Nat.Powerful.)

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:23157a260dce77d33eaecdab023e6b68166fb9812ea21c9fe0e86a0082592d55
Metadata
sha256:777f835887b9a64f5f40dee68cc966c544c634e9be4ae0f6e83f4609fe070d61
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:2bec07a237d869adf2965295abf6228fc2b0bad3aaa5a441b024831f3e21c428
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page