Скачать или смотреть Find the greatest negative integer x satisfying x≡6(mod 14) and x≡12(mod 17)

The Chinese Remainder Theorem formula was NOT directly used, BUT a solution was constructed ONLY by a knowledge of the definition of multiplicative inverses! Math Doctor Dave Peterson took a similar naive approach August 2019. Not bad for a retired computer programmer teaching at the community college. a and b are said to be multiplicative inverses modulo n provided ab≡1 modulo n (formal definition)
Joffan showed how Bezout Identity gives one the multiplicative inverse "for free" Also Gerry Myerson of Australia October 2019 expounded lucidly on the way the Euclidian Algorithm computes said inverse.
Godin expounds thoughtfully and circumspectly 2019 with respect to artificial intelligence as a disruptive technology from the point of view of an educator’s classroom perspective.

Find Greatest Negative Integer Solution To Two By Two System Of Congruences with coprime moduli