Learn

You’ve seen that when dividing two integer numbers that don’t fit evenly, some amount will be left out. That amount, called the *remainder*, can be directly retrieved by the *modulo* operation.

Most languages enable this with the `%`

operator:

7 % 3 // 1

LOLCODE enables an equivalent with `MOD OF`

:

MOD OF 7 AN 3 BTW 1

Let’s use this and `QUOSHUNT OF`

to create a program that finds the integer result and remainder of two inputs.

### Instructions

**1.**

Create two variables, `bigger`

and `smaller`

, each equal to integer numbers greater than zero.

**2.**

Convert the two variables to integers.

**3.**

Print on the next line the modulo of `bigger`

by `smaller`

.

# Take this course for free

By signing up for Codecademy, you agree to Codecademy's Terms of Service & Privacy Policy.