A student writes the six complex roots of the equation on the blackboard. In each step, he randomly chooses two numbers and from the board, erases them, and replaces them with . At the end of the fifth step, only one number is left. Find the largest possible value of this number.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For any finite collection of complex numbers a 1 , a 2 , . . . , a n consider the quantity X ( a 1 , a 2 , . . . , a n ) = 3 n j = 1 ∏ n ( a j − 1 ) Since 3 a b − 3 a − 3 b + 4 = 3 ( a − 1 ) ( b − 1 ) + 1 , we deduce that X ( a 1 , a 2 , . . . , a n − 2 , a n − 1 , a n ) = X ( a 1 , a 2 , . . . , a n − 2 , 3 a n − 1 a n − 3 a n − 1 − 3 a n + 4 ) Thus, if a 1 , a 2 , . . . , a n are a set of numbers, and b 1 , b 2 , . . . , b n − 1 are the set of numbers obtained when two of the original set are erased and replaced according to the rule given in the problem, then X ( a 1 , a 2 , . . . , a n ) = X ( b 1 , b 2 , . . . , b n − 1 ) .
Thus, if c is the single number left after the fifth step of the given process, then 3 ( c − 1 ) = X ( c ) = X ( ζ 0 , ζ 1 , . . . , ζ 5 ) where ζ j ( 0 ≤ j ≤ 5 ) are the six roots of the equation X 6 + 2 = 0 . But then X ( ζ 0 , ζ 1 , . . . , ζ 5 ) = 3 6 j = 0 ∏ 5 ( ζ j − 1 ) = 3 6 j = 0 ∏ 5 ( 1 − ζ j ) = 3 6 ( X 6 + 2 ) ∣ ∣ ∣ X = 1 = 3 6 × 3 = 3 7 and hence the final number c = 3 6 + 1 = 7 3 0 , irrespective of the order in which the numbers are chosen to be deleted/replaced.