Skip to content

Erdős problem 1097

The main conjecture: for any finite set of integers AA with ∣A∣=n|A| = n, the number of distinct common differences in three-term arithmetic progressions is O(n3/2)O(n^{3/2}).

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:81806527f5c4d591e7ffdf802a81e084424c1001b5b23d501050b132f440edca
Metadata
sha256:4df67540e63f313e8485ef472c0f94b13bbff809c2dd3761b47a7835f730403b
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:284eae3cb5c8da8a4285d109c64214b27e23be81db95f851828e8973804f4c23
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page