Skip to content

Erdős problem 1097

Start work

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}).

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:284eae3cb5c8da8a4285d109c64214b27e23be81db95f851828e8973804f4c23
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON