What is 85 mod 49?

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

The result of 85 mod 49 is 36.

How to compute 85 mod 49?

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. 85 / 49 = 1.734693877551
  2. ⌊1.734693877551⌋ = 1 (We only keep the integer part)
  3. 49 × 1 = 49
  4. 85 - 49 = 36 (Subtracting gives us the remainder)

In short: 85 − (49 × ⌊85 / 49⌋) = 36

Is 85 divisible by 49?

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

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