What is 60 mod 71?

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

The result of 60 mod 71 is 60.

How to compute 60 mod 71?

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. 60 / 71 = 0.84507042253521
  2. ⌊0.84507042253521⌋ = 0 (We only keep the integer part)
  3. 71 × 0 = 0
  4. 60 - 0 = 60 (Subtracting gives us the remainder)

In short: 60 − (71 × ⌊60 / 71⌋) = 60

Is 60 divisible by 71?

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

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