Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ACITT.2019.8779899 | 2019 9th International Conference on Advanced Computer Information Technologies (ACIT) |
Keywords | DocType | ISBN |
remainder,Mersenne number,time complexity,iteration | Conference | 978-1-7281-0451-5 |
Citations | PageRank | References |
2 | 0.41 | 1 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stepan Ivasiev | 1 | 2 | 0.41 |
| Mykhailo Kasianchuk | 2 | 2 | 0.75 |
| Igor Yakymenko | 3 | 2 | 0.75 |
| Ruslan Shevchuk | 4 | 2 | 0.41 |
| Mikolaj Karpinski | 5 | 2 | 2.44 |
| Oksana Gomotiuk | 6 | 2 | 0.75 |