Talk:Diophantine linear system solving: Difference between revisions
Talk:Diophantine linear system solving (view source)
Revision as of 16:41, 25 December 2021
, 2 years ago→Totally lost: slowly getting a few bits
No edit summary |
(→Totally lost: slowly getting a few bits) |
||
Line 38:
But for now: if more people find this task...objectionable, it probably doesn't belong on RC after all.
--M.C., [[User:Udo_e._pops|Udo e.]] ([[User talk:Udo e. pops|talk]])
Thanks, I have slowly figured a couple of things out. That example means, I think, solve {2a+b=2, 6a+5b=2, 7a+6b=2} ==> the answer, from (-2 2)*-1, is {a=2,b=-2}. I was thinking (and about to say) that a proper set of unit tests on Reduce() would help, but actually what I think I really need right now is unit tests (/detailed examples) on Swop(), especially with what it is trying to do to d[], so I can properly visualise (and maybe even understand) it. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 16:40, 25 December 2021 (UTC)
|