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?
Retained from Formal Conjectures · not edited here
Formal statements
4 solved
Erdős Problems says
solved
Decision here
No current contribution
Checks
0 checks · 4 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page