0

Consider a regular n-gon with side length $A$.

Let $p$ be a point in the polygon. Let the distances from $p$ to the corners of the n-gon be $x_1,x_2,...,x_n$

Are there solutions with $A,x_1,x_2,...x_n$ all positive integers and $gcd(A,x_1,x_2,...,x_n) = 1$.

For the triangle ( $n=3$) this question has been answered already here

Do there exist an infinite number of 'rational' points in the equilateral triangle $ABC$?

https://mathoverflow.net/questions/180191/rational-distance-from-vertices-of-an-equilateral-triangle

--

I assume for sufficiently large $n$ there are no solutions ?

In particular im intrested in $n=4,5,6$.

mick
  • 15,946
  • Another useful source of information: http://mathoverflow.net/questions/180191/rational-distance-from-vertices-of-an-equilateral-triangle – lulu Nov 11 '15 at 12:33
  • Is $A$ rational? Should $ a,b,c $ be individually be rational ? Or should they all be positive integers? The Fermat point is fixed for the minimum sum. – Narasimham Nov 11 '15 at 12:47
  • Im considering a generalization to avoid the duplicate. But I have to read and think first. – mick Nov 11 '15 at 18:49
  • I edited too generalize. Therefore voted to reopen. Plz vote reopen too :) – mick Nov 11 '15 at 21:57

1 Answers1

0

Use Viviani's theorem that says $ x + y + z $ is invariant.

Compute $x=y=z$ for $A=1$.

mick
  • 15,946