suivant: The integer Euclidean remainder
monter: Integers (and Gaussian Integers)
précédent: The divisors of a
Table des matières
iquo (or intDiv) returns the integer quotient q of the
Euclidean division of two integers a and b given as arguments.
(a = b*q + r with
0 r < b).
The integer Euclidean quotient : iquo intDiv
For Gaussian integers, we choose q so that b*q is as near by a as
possible and it can be proved that r may be choosen so that
| r|2 | b|2/2.
iquo works with integers or with Gaussian integers.
a - b*q = - 4 + i and
| - 4 + i|2 = 17 < | 5 + 7*i|2/2 = 74/2 = 37
giac documentation written by Renée De Graeve and Bernard Parisse