Skip to main content
16 events
when toggle format what by license comment
Aug 26 at 4:48 vote accept internet
Aug 24 at 23:26 answer added cvgmt timeline score: 3
Aug 24 at 17:30 answer added ubpdqn timeline score: 2
Aug 22 at 21:40 answer added Daniel Lichtblau timeline score: 4
Aug 22 at 19:08 comment added Bob Hanlon @cvgmt - that appears to be the Union rather than the Intersection
Aug 22 at 13:58 history became hot network question
Aug 22 at 9:13 answer added rhermans timeline score: 3
Aug 22 at 8:14 answer added Daniel Huber timeline score: 3
Aug 22 at 5:56 comment added cvgmt The result should be {x - y == 0, x + 2y == 0, 3x - y == 0,3 x - 2 y==0}
Aug 22 at 5:08 comment added Bob Hanlon SubtractSides /@ Intersection @@ Map[Simplify, {list1, list2}, 2]
Aug 22 at 5:06 comment added ydd Perhaps something like this? we Or all the equations together and use Reduce to get the reduced set of solutions and then subtract the RHS to get them equal to 0
Aug 22 at 5:04 comment added internet @lericr The equations in my case differ only by flipping the sign of the entire equation and are quite simple, though they involve more variables. Do you think that simplifying them is reliable in this case?
Aug 22 at 4:42 comment added lericr Since all of your equations are ... == 0, the problem would seem to be reducible to determining whether the polynomials on the LHSs are equivalent. For that, I think you can use CoefficientRules. I'm not super familiar with CoefficientRules, so there might be gotchas there as well.
Aug 22 at 4:36 comment added internet @lericr I tried ChatGPT, and it did the same thing. I'm worried about it too.
Aug 22 at 4:34 comment added lericr I assume that if you apply Simplify to all of the equations you'll end up with each of them being in a canonical form. From there you could do direct comparisons. I'm not entirely sure if this is robust for all the cases you might need.
Aug 22 at 4:18 history asked internet CC BY-SA 4.0