Skip to content

Erdős problem 888

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

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#888
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Search problems.science

Find a Problem, Result, source, or page