What is 97 mod 20?

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

The result of 97 mod 20 is 17.

How to compute 97 mod 20?

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. 97 / 20 = 4.85
  2. ⌊4.85⌋ = 4 (We only keep the integer part)
  3. 20 × 4 = 80
  4. 97 - 80 = 17 (Subtracting gives us the remainder)

In short: 97 − (20 × ⌊97 / 20⌋) = 17

Is 97 divisible by 20?

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

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