What is the smallest possible sum for a labeled 63-gon?

[Numeriprimi]

Hello.
When I was in Mathematical Olympiad in our district, I got a example which I can not solve :-(
Now, I am very interested in, how to do it. I don't know, my brother - teacher don't know, my friends don't know. I think you can solve it :-) Can you help me? It isn't my homework and I really don't know how to do it easily (don't draw a 63-gon :-D)

To each of vertexes of regular 63-gon assign one of the numbers 1 or -1.
To each of his sides ascribe the product of numbers of her boundaring vertexes. Then add all numbers at sides. What is the smallest possible non.negative value of this sum?

Thank you very much and sorry for my bad English.

 

[economicsnerd]

This wouldn't have been an IMO question.

 

[economicsnerd]

You have $d$ edges with different numbers on the vertices (product =-1) and $s$ edges with the same number on each vertex (product =1), and you're constrained to have
- $s+d=63$;
- $d$ an even number (because of the cyclical arrangement);
- $d\leq s$.
You want to make $s-d$ as small as possible, subject to the above constraints, i.e. $$\min_{d\in\{0,...,63\}} [(63-d) - d] \text{ subject to } d \text{ even}, \enspace d\leq 63 -d.$$ It's straightforward to check that the solution to the above problem is 3.

Indeed, the constraints require that $d$ be an even number which is $\leq 31.5$, the largest such number being $30$. Since minimizing $63-2d$ just amounts to maximizing $d$, the above problem is solved by $d=30$, which yields $s-d=33-30=3$.

If you want an example of a labeling that attains this, try labeling the vertices $((1,1,-1,-1)^{15},1,1,1)$.