What is 37 mod 19?

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

The result of 37 mod 19 is 18.

How to compute 37 mod 19?

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. 37 / 19 = 1.9473684210526
  2. ⌊1.9473684210526⌋ = 1 (We only keep the integer part)
  3. 19 × 1 = 19
  4. 37 - 19 = 18 (Subtracting gives us the remainder)

In short: 37 − (19 × ⌊37 / 19⌋) = 18

Is 37 divisible by 19?

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

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