a:
, n:
, q:, r:. a = q
n+r 
r < n q = (a 
n) & r = (a mod n)a:, n:. a = (a n)n+(a mod n) & (a mod n) < n n == if 0
a
a n ;((-a) rem n)=0-((-a) n) else -((-a) n)+-1 fi
is mentioned by
| Thm* a:, n:, q:, r:. a = qn+r r < n q = (a n) & r = (a mod n) | [div_floor_mod_unique] |
| Thm* a:, n:. a = (a n)n+(a mod n) & (a mod n) < n | [div_floor_mod_properties] |
In prior sections: int 2
Try larger context:
Graphs