Add quotient, modulo, remainder, exact-divide implementations for gaussian integers

[sritchie]

Now that we have complex GCD, we can implement the four functions in the title for gaussian integers. Here is a tip: https://www.quora.com/How-do-I-find-Modulo-of-complex-numbers

[adamhaber]

What would be the best place to put this functionality (new ns, complex, euclid, etc)?

[sritchie]

These should be installed in the complex namespace, I think.

…

On Tuesday, January 25, 2022, Adam Haber ***@***.***> wrote: What would be the best place to put this functionality (new ns, complex, euclid, etc)? — Reply to this email directly, view it on GitHub <https://github.com/sicmutils/placeholder/issues/12>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AAARAA7APZPGP7WW74F3POTUXZVD5ANCNFSM5MTNSCNQ> . Triage notifications on the go with GitHub Mobile for iOS <https://apps.apple.com/app/apple-store/id1477376905?ct=notification-email&mt=8&pt=524675> or Android <https://play.google.com/store/apps/details?id=com.github.android&referrer=utm_campaign%3Dnotification-email%26utm_medium%3Demail%26utm_source%3Dgithub>. You are receiving this because you authored the thread.Message ID: ***@***.***>

-- Sam Ritchie