Determining the rank of a number in the residue number system | Zendy

Mikhail Babenko | Zendy; Nikolay Kucherov | Zendy; Andrei Tchernykh | Zendy; Viktor Kuchukov | Zendy; Elena Golimblevskaia | Zendy; Ekaterina A. Kuchukova | Zendy; Irina Vashchenko | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Determining the rank of a number in the residue number system

Author(s) -

Mikhail Babenko,

Nikolay Kucherov,

Andrei Tchernykh,

Viktor Kuchukov,

Elena Golimblevskaia,

Ekaterina A. Kuchukova,

Irina Vashchenko

Publication year - 2021

Language(s) - English

Resource type - Conference proceedings

DOI - 10.47350/iccs-de.2021.01

Subject(s) - rank (graph theory) , mathematics , residue number system , residue (chemistry) , value (mathematics) , combinatorics , discrete mathematics , algorithm , statistics , chemistry , biochemistry

In this article, the formulation and proof of the theorem on the difference in the ranks of the numbers represented in the Residue Number System is carried out. A method is proposed that allows to reduce the amount of necessary calculations and increases the speed of calculating the rank of a number relative to the method for calculating the rank of a number based on the approximate method. To find the rank of a number in the method for calculating the rank of a number based on the approximate method, it is necessary to calculate n operations with numbers exceeding the modulus value; in the proposed method, it is necessary to calculate n·(n−1)/2 operations not exceeding the value of the module.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research