a:
, n:
, q,r:. a = q
n+r 
|r| < |n| (r < 0 a < 0) (r > 0 a > 0) q = (a 
n) & r = (a rem n)a:, n:. a = (a n)n+(a rem n) & |a rem n| < |n| & ((a rem n) < 0 a < 0) & ((a rem n) > 0 a > 0)is mentioned by
| Thm* a:, n:, q,r:. a = qn+r |r| < |n| (r < 0 a < 0) (r > 0 a > 0) q = (a n) & r = (a rem n) | [div_rem_unique] |
| Thm* a:, n:. a = (a n)n+(a rem n) & |a rem n| < |n| & ((a rem n) < 0 a < 0) & ((a rem n) > 0 a > 0) | [div_rem_properties] |
In prior sections: int 2
Try larger context:
Graphs