minimum products needed
Consider a sequence of $n$ nonzero numbers where at least one of them is positive. You are not allowed to see the numbers, but can know the sign of product of any two. Find, with proof, the minimum number of products you need to know if you want to determine the sign of every number in that sequence.
"Je le vois, mais je ne le crois pas!" - Georg Ferdinand Ludwig Philipp Cantor