What is 60 mod 35?

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 35 is 25.

How to compute 60 mod 35?

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

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

Is 60 divisible by 35?

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 35 is 25, this indicates that dividing 60 by 35 leaves a remainder of 25. Therefore, no, since the remainder isn't zero, 60 is not divisible by 35.