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?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/888.lean

Formal Conjectures

FormalConjectures/ErdosProblems/888.leanErdos888.erdos_8881 lineExact file
(fun n => ↑(Nat.findGreatest (Erdos888.p n) n)) =Θ[Filter.atTop] fun n => ↑n * Real.log (Real.logn) / Real.logn
SolvedStatement only, no proof

Reported activity

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

Continue

Search problems.science

Find a Problem, Result, source, or page