MathDB

Given

n

numbers different from

0

, (

n \in \mathbb{N}

) which are arranged randomly. We do the following operation: Choose some consecutive numbers in the given order and change their sign (i.e.

x \rightarrow -x

). What is the minimum number of operations needed, in order to make all the numbers positive for any given initial configuration of the

n

numbers?

1