What is 91 mod 46?

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

The result of 91 mod 46 is 45.

How to compute 91 mod 46?

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. 91 / 46 = 1.9782608695652
  2. ⌊1.9782608695652⌋ = 1 (We only keep the integer part)
  3. 46 × 1 = 46
  4. 91 - 46 = 45 (Subtracting gives us the remainder)

In short: 91 − (46 × ⌊91 / 46⌋) = 45

Is 91 divisible by 46?

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

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