What is 17 mod 3?

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

The result of 17 mod 3 is 2.

How to compute 17 mod 3?

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. 17 / 3 = 5.6666666666667
  2. ⌊5.6666666666667⌋ = 5 (We only keep the integer part)
  3. 3 × 5 = 15
  4. 17 - 15 = 2 (Subtracting gives us the remainder)

In short: 17 − (3 × ⌊17 / 3⌋) = 2

Is 17 divisible by 3?

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

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