## EuclideanRingNumberType

The number type supports the operations +, - and * as well as a function div, which performs an integer division, the modulus operator %, that returns the remainder of integer division and the function gcd. This implies that CGAL::Number_type_traits<EuclideanRingNumberType>::Has_gcd is CGAL::Tag_true.

### Refines

RingNumberType

### Operations

EuclideanRingNumberType
| div ( n1, n2) | returns the result of the integer division n1/n2.
EuclideanRingNumberType
| gcd ( n1, n2) | computes the greatest common divisor between n1 and n2.
EuclideanRingNumberType
| n1 % n2 | returns the remainder achieved when dividing n1 by n2.
EuclideanRingNumberType
| n1 %= n2 | computes the remainder achieved when dividing n1 by n2 and assigns it to n1.

### Has Models

int
long
long long
CGAL::Gmpz
leda_integer

### See Also

FieldNumberType
Kernel
CGAL::Euclidean_ring_tag
Support Library Manual