Читать книгу Handbook of Intelligent Computing and Optimization for Sustainable Development - Группа авторов - Страница 97

4.2 Modular Arithmetic 4.2.1 Introduction

Оглавление

The modular arithmetic is a whole-number approximation scheme in that dividing a dividend by a divisor results the value of the residue, with the quotient ignored. The (mod) represents a modular operator which have two operands: an integer number and a modulus (n), and results a nonnegative residue. For instance, 15 mod 7 = 1. The operator (mod) gives an integer number between 0 and n − 1, which is constant. The operator (mod) produces a finite set of integer numbers known as residues and the set is defined as Zn [5, 7]. For instance, Zn = {0,1,2,3,…,n − 1}.

Handbook of Intelligent Computing and Optimization for Sustainable Development

Подняться наверх