术语 | moduloN |
释义 | moduloN 模N A ring of integers derived from the set of all integers according to the following rule: Let N be an integer greater than 1, and A and B be two other integers; if N is a factor of A·B, then A is said to be congruent to a B moduloN. 由全体整数的集合按下列规则产生的整数环:设N为大于1的整数,A和B是两个 其它整数,若N是A·B的因子,则称A与B是模N的同余式。 |
随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条,基本涵盖了全部常用计算机术语的翻译及用法,是计算机学习及翻译工作的有利工具。