Skip to main content
added 8 characters in body; edited title
Source Link
Cynasty
  • 159
  • 7

How tocan we find n points on a plane so that as many pairs of points as possible have the same distance?

There are $n$ points on the plane, and we need to maximize the number of pairs of points which have the same Euclidean distance.

How to find n points on a plane so that as many pairs of points as possible have the same distance?

There are $n$ points on the plane, we need to maximize the number of pairs of points which have same Euclidean distance.

How can we find n points on a plane so that as many pairs of points as possible have the same distance?

There are $n$ points on the plane, and we need to maximize the number of pairs of points which have the same Euclidean distance.

edited tags
Link
YCor
  • 63.9k
  • 5
  • 187
  • 285
Corrected plural in title, edited text to better reflect what I think is being asked for
Source Link

How to find n points on a plane so that as many pairpairs of points as possible have the same distance?

There are $n$ points on the plane, we need to maximize the number of pairs of pointpoints which have same Euclidean distance.

How to find n points on a plane so that as many pair of points as possible have the same distance?

There are $n$ points on the plane, we need to maximize pairs of point which have same Euclidean distance.

How to find n points on a plane so that as many pairs of points as possible have the same distance?

There are $n$ points on the plane, we need to maximize the number of pairs of points which have same Euclidean distance.

Became Hot Network Question
added 2 characters in body
Source Link
Shahrooz
  • 4.8k
  • 1
  • 24
  • 36
Loading
Removed inappropriate tag “constructive mathematics”
Link
Loading
Post Undeleted by Cynasty
Post Deleted by Cynasty
Source Link
Cynasty
  • 159
  • 7
Loading