Abstract
Let m be a positive integer. Given an integer u , there exists at most one rational number a/b , gcd( a, b ) = 1 and b ≥ 1, such that u ≡ a/b (mod m ), 1 ≤ b < √ m /2 and |a| < √ m /2. Wang [1] presented an algorithm for calculating a and b for given integers m and u , with insufficient proof of the algorithm. Wang-Guy-Davenport [2] gave a proof of the algorithm, using a theorem in number theory, but the authors cannot understand the proof. This short article gives an elementary proof of Wang's algorithm.
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.
