Modulo
id:
modulo-205-5006164
title:
Modulo
text:
In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, called the modulus of the operation. Given two positive numbers a and n, a modulo n is the remainder of the Euclidean division of a by n, where a is the dividend and n is the divisor. For example, the expression "5 mod 2" evaluates to 1, because 5 divided by 2 has a quotient of 2 and a remainder of 1, while "9 mod 3" would evaluate to 0, because 9 divided by 3 has a
brand slug:
wiki
category slug:
encyclopedia
description:
Computational operation
original url:
https://en.wikipedia.org/wiki/Modulo
date created:
2005-01-02T00:12:00Z
date modified:
2024-09-10T08:32:03Z
main entity:
{"identifier":"Q1799665","url":"https://www.wikidata.org/entity/Q1799665"}
image:
fields total:
13
integrity:
15