Extended Euclidean algorithm;
modular arithmetic;
Euler-Fermat theorem;
(system of) linear congruencies;
Chinese remainder theorem;
divisibility test;
applet;
D O I:
暂无
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
Number theory with modular arithmetic should be permanent part of (military) education. Two topics are recommended: systems of linear congruencies with extended Euclidean algorithm. and divisibility tests in general base B positional number system. Interactive applet is described that generates and applies tests for base = 2..36, and divisor = 2..999.