說明

除了自身之外，無法被其它整數整除的數稱之為質數，要求質數很簡單，但如何快速的求出質數則一直是程式設計人員與數學家努力的課題，在這邊介紹一個著名的 Eratosthenes求質數方法

解。



以背包問題為例，我們使用兩個陣列value與item，value表示目前的最佳解所得之總價，item表示最後一個放至背包的水果，假設有負重量 1～8的背包8個，並對每個背包求其最佳解。 -Apart from their own descr iption, the other can not be an integer divisible by the number of prime number called, asked a few very simple quality, but how fast prime number has been obtained is the programming efforts with the subject of a mathematician, in the introduction here of a well-known Eratosthenes solution for qualitative methods. To knapsack problem as an example, we use two array value with the item, value that the current optimal solution of total income, item Finally a place to express backpack fruit, assuming one has a negative weight of the backpack 8 ~ 8, and its optimal solution for each backpack.