Yes, the % operator will return the remainder of the Integer division. If a and d are integers, with d non-zero, it can be proven that there exist unique integers q and r, such that a = qd + r and 0 ≤ r < |d|. The number q is called the quotient, while r is called the remainder. int remainder = a % b; will sort you.

For More Information Please Refer:

You May Also Like to Read: