Question

what is mod function ​

Answer 1

In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus). Given two positive numbers, a (the dividend) and n (the divisor), a modulo n (abbreviated as a mod n) is the remainder of the Euclidean division of a by n.

Answer 2

$\huge\boxed{\texttt{\fcolorbox{red}{aqua}{ANSWER}}}$

|x| = x for a positive x

|x| = −x for a negative x

and |0| = 0.