Erdős problem 888 · problems.science

What is the size of the largest $A\subseteq \{1,\ldots,n\}$ such that if $a\leq b\leq c\leq d\in A$ are such that $abcd$ is a square then $ad=bc$ ?

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:666d47fefafde99fb0ec1e784f213262b59cd7a164679dc425ff6f2d3da6493b
Metadata: sha256:960775c657f90fd088a2ba0b8a68b69a45beb744ea51987b22a203f26d9f32e5
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:66a04f9e6eed2c29f3f1789d834a03a06d546e68b786ecf5ce95bd06e6d6f0a2

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207