**Definition of a mod n**

Let n be a fixed positive integer. For any integer a,
**a mod n**
, read "a mod n" or "a modulo n" is the
**remainder **
of
**a/n. **
Maple can do modular arithmetic very easily.
Execute each example, and then explain in words using the definition

why Maple's answer is correct.

`> `
**8 mod 3;**

Explain why this is correct?

`> `
**23 mod 6;**

Explain why this is correct?

`> `
**-23 mod 6;**

Explain why this is correct?

`> `