document.write( "Question 744549: There are n>=3 people positioned on a field (euclidean plane)so that each has a unique neighbor. Each person has a cream pie.At a signal,everybody hurles his or her pie at the nearest neighbor.assuming that n is odd and that nobody can miss his or her target,true or false:there always remains at least one person not hit by a pie?Explain the method so that i can implement a program on it...
\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #453377 by lynnlo(4176)\"\" \"About 
You can put this solution on YOUR website!
\n" ); document.write( "
\n" );