I am wondering how can I solve following problem.
I would like to see how can it be solved.
And we would like to see your thoughts on the problem.
I was trying to make n random numbers in the selected a side lenght but I do not know how to make sure that the point-to-point distance between every of the n points will be always bigger than 1.
I believe this is an open question - that is, you are expected to show you can think, and there is one correct solution.
Can you think of any grid of (not random) points, where the shortest distance is guaranteed to be 1?
Can you think of an a for which there is no solution?
Separate names with a comma.