pith. sign in

arxiv: 1402.6276 · v1 · pith:YSV46GXZnew · submitted 2014-02-25 · 🧮 math.MG · cs.CG

Points defining triangles with distinct circumradii

classification 🧮 math.MG cs.CG
keywords pointscasenumberalwaysaskedboundcirclescircumradii
0
0 comments X
read the original abstract

Paul Erdos asked if, among sufficiently many points in general position, there are always $k$ points such that all the circles through $3$ of these $k$ points have different radii. He later proved that this is indeed the case. However, he overlooked a non-trivial case in his proof. In this note we deal with this case using B\'ezout's Theorem on the number of intersection points of two curves and obtain a polynomial bound for the needed number of points.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.