Back to Problems

erdos_503.variants.upper_bound

Specification

The best upper bound known in general is due to Blokhius [Bl84] who showed that $$ |A| \leq \binom{n + 2}{2} $$ [Bl84] Blokhuis, A., Few-distance sets. (1984), iv+70.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_503.variants.upper_bound (n : ℕ) :
    ∀ m ∈ {(A.ncard) | (A : Set (ℝ^n)) (hA : A.IsIsosceles)}, m ≤ (n + 2).choose 2
ID: ErdosProblems__503__erdos_503.variants.upper_bound
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.