Skip to content

Erdős problem 888

Start work

What is the size of the largest A⊆{1,…,n}A\subseteq \{1,\ldots,n\} such that if a≤b≤c≤d∈Aa\leq b\leq c\leq d\in A are such that abcdabcd is a square then ad=bcad=bc?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:666d47fefafde99fb0ec1e784f213262b59cd7a164679dc425ff6f2d3da6493b
Metadata
sha256:960775c657f90fd088a2ba0b8a68b69a45beb744ea51987b22a203f26d9f32e5
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:66a04f9e6eed2c29f3f1789d834a03a06d546e68b786ecf5ce95bd06e6d6f0a2
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON