Optimum Permutation on a Circle
摘要
To the vertices of a regular decagon, allocate digits 0 through 9 (using each digit exactly once) so that the product of all ten two-digit numbers in base 10 formed by adjoining each pair of successive digits (always going clockwise) is minimized.
What if digits 0,1,…, (k − 1) are allocated to the vertices of a regular k-gon and the two-digit numbers are read in base k?