摘要或動機

最後留下數字會是多少？該問題在台灣的全國中小學科學展覽出現多次。而資訊界演算法大師Donlad E. Knuth 在其著作The Art of Programing，CONCRETE MATHEMATICS （具體數學），針對該數列作詳細的說明；但是，不論是歷屆全國中小學科學展覽或是大師著作，對於該問題，都只是談及殺1 留β或是殺α留1。本研究利用獨創α分類、n 及k 分類、d 函數、b 函數及循環、n 及y 分類、碎形數列和演變關係，將約瑟夫問題探討範圍提升至殺α(個數)留β(個數)，直到剩下最後1 個數時就不能再殺了，遊戲終止，倒數第k 個留下的自然數是多少？同時，本研究在殺α(個數)留β(個數)下，指定自然數y 為酋長，酋長不能被殺，殺到酋長時遊戲停止，求剩下的自然數有幾個？會發生什麼情形？The Josephus problem refers to what will be remaining when arranging n natural numbers in a circle and starting killing one and leaving the next one alive. The problem has been on display for many times in Taiwan National Primary and High School Science Exhibitions (as shown in Table 1). And, the information algorithm master, Donald E. Knuth has elaborated on the array in his works The Art of Programming, CONCRETE MATHEMATICS. However, both the past science exhibitions and the master’s works are limited to discussions on cases of killing 1 leaving β or killing α and leaving 1. This research employs uniquely created α classification, n and k classifications, d function, b function and loop theory to extend the Josephus problem scope to killing α leaving β to find out what the remaining natural number is by No. k counted recursively. Meanwhile, this research designates natural number y as the chieftain, which can never be killed. The game is over when the chieftain is to be killed. The problem is to work out how many natural numbers are remaining. And what happened?