MORE ON THE SERRET–HERMITE ALGORITHM KEITH MATTHEWS 1. Introduction A well–known correspondence (r, s) → x between positive solutions (r, s) of r2 s2 = n satisfying gcd(r, s) = 1 and x satisfying x2 ≡ −1 (mod - R2 - Document - PDFSEARCH.IO

First Page	Meta Content
	MORE ON THE SERRET–HERMITE ALGORITHM KEITH MATTHEWS 1. Introduction A well–known correspondence (r, s) → x between positive solutions (r, s) of r2 +s2 = n satisfying gcd(r, s) = 1 and x satisfying x2 ≡ −1 (mod Add to Reading List Document Date: 2013-03-13 20:50:07 Open Document File Size: 92,16 KB Share Result on Facebook IndustryTerm positive solutions / / Person KEITH MATTHEWS / John Robertson / / ProgrammingLanguage php / / Technology HERMITE ALGORITHM / / URL http / SocialTag Euclidean algorithm Modular arithmetic

MORE ON THE SERRET–HERMITE ALGORITHM KEITH MATTHEWS 1. Introduction A well–known correspondence (r, s) → x between positive solutions (r, s) of r2 +s2 = n satisfying gcd(r, s) = 1 and x satisfying x2 ≡ −1 (mod Add to Reading List