教學共 6 個步驟，在同一個工作階段中依序執行。每一步都在引擎上實際執行過，下方的輸出就是它產生的結果。

步驟 1

FrobeniusSolve[{12, 16, 20, 27}, 123]

輸出

{{0, 1, 4, 1}, {0, 6, 0, 1}, {1, 4, 1, 1}, {2, 2, 2, 1}, {3, 0, 3, 1}, {4, 3, 0, 1}, {5, 1, 1, 1}, {8, 0, 0, 1}}

步驟 2

FrobeniusSolve[{12, 16, 20, 27}, 123, 1]

輸出

{{0, 1, 4, 1}}

步驟 3

FrobeniusNumber[{12, 16, 20, 27}]

輸出

步驟 4

FrobeniusSolve[{12, 16, 20, 27}, 89, 1]

輸出

{}

步驟 5

FrobeniusSolve[{1, 5, 10, 25}, 42]

輸出

{{2, 0, 4, 0}, {2, 1, 1, 1}, {2, 2, 3, 0}, {2, 3, 0, 1}, {2, 4, 2, 0}, {2, 6, 1, 0}, {2, 8, 0, 0}, {7, 0, 1, 1}, {7, 1, 3, 0}, {7, 2, 0, 1}, {7, 3, 2, 0}, {7, 5, 1, 0}, {7, 7, 0, 0}, {12, 0, 3, 0}, {12, 1, 0, 1}, {12, 2, 2, 0}, {12, 4, 1, 0}, {12, 6, 0, 0}, {17, 0, 0, 1}, {17, 1, 2, 0}, {17, 3, 1, 0}, {17, 5, 0, 0}, {22, 0, 2, 0}, {22, 2, 1, 0}, {22, 4, 0, 0}, {27, 1, 1, 0}, {27, 3, 0, 0}, {32, 0, 1, 0}, {32, 2, 0, 0}, {37, 1, 0, 0}, {42, 0, 0, 0}}

步驟 6

FrobeniusNumber[{24, 29, 31, 34, 37, 39}]

輸出

在 Qurak 上執行所有操作範例

Frobenius read

使用到的函式