Simple prove that product of the diagonals of a polygon = N There is a beautiful fact:

If you take a regular N-sided polygon, which is inscribed in the unit circle and find the product of all its diagonals (including two sides) carried out from one corner you will get N exactly:
$A_1A_2\cdot A_1A_3\cdot ...\cdot A_1A_N = N$

For example, for a square we have $\sqrt{2}\cdot 2\cdot \sqrt{2} = 4$.

I know there is some prove, which is based on complex numbers. But the result is so simple that I wonder is there much more simple prove, which you can explain to a school boy easily?
P.S. Please, use spoiler tag >! in your answers.
 A: Here is an extremely simple proof but it requires working in the field $\mathbb{C}$.
For any natural $n > 0$:
  Let $w = e^{i\frac{2\pi}{n}}$
  $\prod_{k=1}^n (z-w^k) = z^n-1$ because both are monic polynomials of degree $n$ with the same $n$ roots
  Thus $\prod_{k=1}^{n-1} (z-w^k) = \lim_{t \to z} \frac{t^n-1}{t-1} = \sum_{k=0}^{n-1} z^k$
  In particular  $\prod_{k=1}^{n-1} (1-w^k) = \sum_{k=0}^{n-1} 1^k = n$
  Therefore the product of the diagonals desired is $|n| = n$
A: Consider the complex solutions $z_0, \ldots , z_{n-1}$ to $(z+1)^n-1 = 0$. These solutions are evenly spaced on the circle centered at $z = -1$ with radius $1$. Thus, they form a regular $n$-gon. 
Since $0 = (z+1)^n-1 = z^n + \cdots + nz+1-1 = z(z^{n-1}+\cdots +n)$, we know that $z_0 = 0$ is one solution, and the product of the other $n-1$ solutions is $z_1 \cdots z_{n-1} = (-1)^{n-1}n$. 
Then, the product of the distances from $z_0$ to each of the $z_i$'s is $|z_1-z_0| \cdots |z_{n-1}-z_0| = |z_1| \cdots |z_{n-1}| = |z_1 \cdots z_{n-1}| = |(-1)^{n-1}n| = n$, as desired. 
A: Not a proof, but an interesting visualization (using $n=7$) ...

Here, $|\overline{P_0P_1}| = 1$, and each $\triangle P_0 P_k P_{k+1}$ is isosceles with vertex angle $\angle P_k = \frac{2\pi k}{n}$ (or $2\pi-\frac{2\pi k}{n}$). Thus,
$$|\overline{P_0 P_{k+1}}| \;=\; 2\;|\overline{P_0 P_{k}}|\;\sin \frac{1}{2}\angle P_{k} \;=\; 2\;|\overline{P_0 P_{k}}|\;\sin\frac{\pi k}{n}$$
so that, ultimately, (with $A_i$ as in your figure)
$$|\overline{P_0 P_n}| = 2 \sin\frac{\pi}{n} \cdot 2\sin\frac{2\pi}{n}\cdot\;\cdots\;\cdot 2 \sin\frac{(n-1)\pi}{n} = |\overline{A_1 A_2}| \cdot |\overline{A_1 A_3}| \cdot\;\cdots\;\cdot |\overline{A_1 A_n}|$$
As the diagram makes clear, $P_0$, $P_1$, and $P_n$ are certainly collinear (as are, more generally, points $P_0$, $P_k$, $P_{n-k+1}$ for any $k$). However, while the diagram appears to show that $\overline{P_0 P_7} = 7$ (as it should, because we know that to be the case), this doesn't qualify as a proof.

OP notes that there exist proofs of the relation using "complex arithmetics". This answer, for instance, essentially gives one. (All we need to do is multiply the formula there by $|\overline{A_1A_2}|\cdot|\overline{A_1A_n}| = 2^2 \sin^2\frac{\pi}{n}$ to include the "diagonals" that are actually sides of the polygon.)
In reference to @StevenStadnicki's comment, it does seem that this ...
$$|\overline{P_0 P_n}| = |\overline{A_1 A_2}| \cdot |\overline{A_1 A_3}| \cdot\;\cdots\;\cdot |\overline{A_1 A_n}|$$
... asserts equality between a one-dimensional quantity on the left, and an $(n-1)$-dimensional quantity on the right. Perhaps we should instead write the dimensionless relation ...
$$\frac{|\overline{P_0 P_n}|}{|\overline{P_0 P_1}|} = \frac{|\overline{A_1 A_2}|}{|\overline{A_0 A_1}|} \cdot \frac{|\overline{A_1 A_3}|}{|\overline{A_0 A_1}|} \cdot\;\cdots\;\cdot \frac{|\overline{A_1 A_n}|}{|\overline{A_0 A_1}|}$$
... where $A_0$ is the center of the $A$-polygon's circumcircle. (This is effectively @JimmyK4542's suggestion.)
A: Here is my attempt at an elementary proof. After hours of staring, I believe (at minimum) a few trigonometric identities would be required in any elementary demonstration. 
Given our circle with $n$ nodes going around the circle, it is clear that each edge of interest, $a_k$, $1\le k\le n-1$, is part of an isosceles triangle with node at the center, sides, $1,1,a_k$, and inner angle $(2\pi)/n$. Thus, using law of cosines and a product to some formula, we gain, 
$$a_k^2=1^2+1^2-2\cos\left(\frac{2\pi k}{n}\right)=4\sin\left(\frac{k\pi}{n}\right)\sin\left(\frac{(n-k)\pi}{n}\right).$$ We now have, using this (formula 24), 
$$a_1^2\cdots a_{n-1}^2 = \prod_{k=1}^{n-1}\left(4 \sin\left(\frac{k\pi}{n}\right)\sin\left(\frac{(n-k)\pi}{n}\right)\right) =\\ 4^{n-1} \left(\prod_{k=1}^{n-1} \sin\left(\frac{k\pi}{n}\right)\right)^2 = 4^{n-1}\left(\frac{n}{2^{n-1}}\right)^2 = n^2.$$ Hence, our theorem holds, $$a_1\cdots a_{n-1}=n.$$
