<p>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.</p><p>What if digits 0,1,…, (<i>k</i> − 1) are allocated to the vertices of a regular <i>k</i>-gon and the two-digit numbers are read in base <i>k</i>?</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Optimum Permutation on a Circle

  • Jyotirmoy Sarkar

摘要

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?