As part of pruning for my code searching for optimal addition chains I want to try and find some fast ways to discover that certain numbers are not representable in the Frobenius coin problem. An important number for me is $2^{127}-1$ as the shortest addition chain for this number is unknown. I want to experiment with FrobeniusSolve in mathematica. So for example mathematica can see this has no solutions:
FrobeniusSolve[{785518299414867319177,
750840562311845410824}, 170141183460469231731687303715884105727]
I am currently unable to do this same calculation myself since it seems too slow to generate the extended GCD so far. I am having another go at this though but find some of the behavior puzzling. For example this fails with a memory exception:
FrobeniusSolve[{290289902302528,
141751767173}, 170141183460469231731687303715884105727, 3]
Ok so that's probably solving the problem in some general (I know it uses Lattice basis reduction) way while a simple problem to solve with the extended GCD. Stranger still this problem just echos back the command:
FrobeniusSolve[{1, 590464, 1180928,
1771392}, 170141183460469231731687303715884105727, 10]
I was hoping to experiment a little but the behavior seems strange. What does the echoing back mean?