Talk:Diophantine linear system solving: Difference between revisions
Talk:Diophantine linear system solving (view source)
Revision as of 15:02, 26 December 2021
, 2 years agodeserves to be on rc
(→Totally lost: slowly getting a few bits) |
(deserves to be on rc) |
||
Line 40:
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)
=== Deserves to be on rc ===
Regarding objectional/belong, this task has more merit than 9/10 tasks that get added to rc. I won't deny there was a
little (and irrelevant) grumpage (sorry), but that was much more about timing you could not possibly have known about.
If a task author wants to see an algorithm in different languages, it belongs on rc, and that want should be incentive
enough to take some extra trouble to explain it in layman terms. From my point of view I'd like to know more about
how this might be used/prove useful in some future (non-rc) project, and that requires my understanding it well enough
to debug and/or extend it. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:01, 26 December 2021 (UTC)
| |||