Residue number system provides high computational performance and finds wide application in signal processing, cryptography, neural networks and blockchain technologies. The most computationally complex non-modular operation is division. In this paper, division algorithms using inverse conversion and Akushsky core function are proposed and their performance is analysed. The proposed division algorithm using Chinese remainder theorem and Akushsky core function reduces the average division time by 43.93% compared to other proposed approaches.