What is 89 mod 30?

Often represented by the operator "mod", the modulo is a mathematical operation that gives the remainder of an integer division.

The result of 89 mod 30 is 29.

How to compute 89 mod 30?

The simplest approach is to use the "mod" operator (often denoted as "%" in many programming languages), but you could do it manually in the following way:

Remainder = N − ( M × ⌊ N M ⌋ )

(where N is the dividend, M is the divisor and ⌊ N M ⌋ represents the integer part of the quotient)

  1. 89 / 30 = 2.9666666666667
  2. ⌊2.9666666666667⌋ = 2 (We only keep the integer part)
  3. 30 × 2 = 60
  4. 89 - 60 = 29 (Subtracting gives us the remainder)

In short: 89 − (30 × ⌊89 / 30⌋) = 29

Is 89 divisible by 30?

A number is said to be divisible by another number, if the remainder of the division is zero.

Given that the result of 89 mod 30 is 29, this indicates that dividing 89 by 30 leaves a remainder of 29. Therefore, no, since the remainder isn't zero, 89 is not divisible by 30.