What is the mechanism for extracting the remainder of the division? #618

Activity

1. asmaalkdor

   added

   Question

   on Oct 29, 2023
2. WhiteBlackGoose commented on Oct 29, 2023

   

   WhiteBlackGoose

   on Oct 29, 2023

   Member

   More actions

   There isn't an operator in AngouriMath for that, sadly
3. Rafael-SOWNet

   added a commit that references this issue on Aug 4, 2026

   Add a modulus node (#402, #618) (#703)

   ...

   70fcbea
4. Rafael-SOWNet commented on Aug 4, 2026

   

   Rafael-SOWNet

   on Aug 4, 2026

   Member

   More actions

   There is one now — implemented in #703, merged as 70fcbead.

   Your example works as written:

   "(b0 - b1) mod x0 = 0"
   

   parses, and MathS.Mod(a, b) builds the same node from code. It is spelled mod rather than % in a parsed string, since % is left free to mean percent.

   One caveat worth stating plainly: solving an equation with a modulus in it is not implemented. x mod 3 = 1 has one solution per period and answering it properly needs an integer parameter, the way the trigonometric inversions do. Rather than return wrong roots the solver returns none, and there is a test pinning that so whoever implements it sees the change. If solving is what you were after rather than just expressing the remainder, say so and I will open that as its own issue.
5. Rafael-SOWNet

   closed this as completedon Aug 4, 2026