ApSimon的造币厂问题

ApSimon's Mints Problem

给出了在艾波西蒙造币厂问题上若干新的研究成果：（１）给出了ｎ＝６，７时的更好的上界：ｍｉｎ（Ｐ６）≤３２，ｍｉｎ（ｐ７）≤６４，当ｎ＝６时，ａｉ，ｂｉ依次取为（８，６，６，０，４，１），（０，３，６，５，５，２），当ｎ＝７时，ａｉ，ｂｉ依次取为（１１，１１，１０，３，８，８，０），（０，２，２，９，９，８，６）．（２）给出了一种解决艾波西蒙问题的计算机搜索算法，对于给定的ｎ，按此算法可找出较好的ｐｎ．

In this paper,the development on ApSimon’s Mints Problem was presented. It contains (1) For n=6,7, given a better upper bound: min( p 6)<=32,min(p 7)<=64, (2) A algorithm for solving ApSimon Problem was given so far these are best results for ApSimon’s Mints Problem.