Abstract
The rank of a number in a residue number system indicates the count of transitions through a range when a number is converted to a positional number system and allows for more efficient non-modular operations and detection of values out of range. The main approach to calculate the rank is the use of the Chinese Remainder Theorem. In this article the approach which allows to compute the rank using a set of special numbers for which ranks are computed in advance is proposed. The simulation of the considered methods is done in the Python programming language. The results are analyzed and recommendations for further use of the proposed method are given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
