[seqfan] 200000-gon

[Richard Mathar]

> Return-Path: <seqfan-bounces at list.seqfan.eu>
> X-Original-To: mathar at strw.leidenuniv.nl
> Delivered-To: mathar at strw.leidenuniv.nl
> Date: Tue, 15 Nov 2011 12:16:07 +0400
> Subject: [seqfan] Re: =?utf-8?q?A200000=3A_Maximal_area_of_200000-gon=2E?=
> 
> Digital representation of maximal area of 200000-gon
> with sides 1,2,3,...,200000 (or 2,3,5,7,..., prime(200000)).
> 
> Anyone wish to submit this?

There is an arbitrary large upper limit proposed here; usually one would
attack the equivalent problem first for polygons with a smaller number of edges.
Are these signed areas (with the even-odd rule of signs
) if the polygon sides intersect? If yes, the calculation involves
summation of areas of all variants of selecting triangles
with three sides chosen from 1,2,...,200000 . If this needs to be a simply
connected area  or intersecting edges are not allowed or the subareas
are added with absolute values, things get more complicated.
RJM