我的解法
我的解法是0-1规划,直接干
primes = Prime~Array~10;
vars = x~Array~{3, 10};
cons = {(vars[[1]] + vars[[3]]).primes == 2 vars[[2]].primes,
Total@Flatten@vars == 10,
Sum[vars[[i, #]], {i, 3}] == 1 & /@ Range[10],
0 <= Flatten@vars <= 1};
sols = FindInstance[Flatten@cons, Flatten@vars, Integers, 10];
DeleteCases[Map[primes # &, vars /. sols, {2}], 0, 3]
群友的思路
(来自yxllc)
总和129,那么中间那组和一定是43,select出后再随便分一下就是剩下两组,总数直接就出来了
plist = Prime@Range@10;
Total[2^(9 - Length@#) - 1 & /@
Select[Subsets@plist, Total@# == Total@plist/3 &]]
结果是485