Calculate Frobenius number
F(l1, l2)=l1l2
- l1
- l2
F(2, 3)=2*3 - 2 - 3 = 1
F(4, 5, 6)
4*5 - 4 - 5 = 11
Let's represent integers from 11 in descending order as the sum of numbers 4, 5, 6 in various combinations:
11 = 5 + 6
10 = 4 + 6
9 = 4 + 5
8 = 4 + 4
7 does not unfold => F(4, 5, 6) = 7