Effective Algorithms for Finding the Remainder of Multi-Digit Numbers

被引:0
|
作者
Ivasiev, Stepan [1 ]
Kasianchuk, Mykhailo [1 ]
Yakymenko, Igor [1 ]
Shevchuk, Ruslan [2 ]
Karpinski, Mikolaj [3 ]
Gomotiuk, Oksana [4 ]
机构
[1] Ternopil Natl Econ Univ, Dept Cyber Secur, Ternopol, Ukraine
[2] Ternopil Natl Econ Univ, Dept Comp Sci, Ternopol, Ukraine
[3] Univ Bielsko Biala, Dept Comp Sci & Automat, Bielsko Biala, Poland
[4] Ternopil Natl Econ Univ, Dept Document Studies Informat Act & Ukrainian St, Ternopol, Ukraine
关键词
remainder; Mersenne number; time complexity; iteration;
D O I
10.1109/acitt.2019.8779899
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, the theoretical foundations of the developed methods for finding the remains of multi-digit numbers and the Mersenne number in a binary number system are given, the use of which allows reducing the time complexity. The numerical experiments of the time characteristics of program implementations of the proposed approaches and the classical method are given. The scheme of the algorithm for finding the remainder of the multi-digit number and the multi-digit Mersenne number is given.
引用
收藏
页码:175 / 178
页数:4
相关论文
共 50 条