Re: [Scheme-reports] Complex gcd? John Cowan (26 May 2014 18:24 UTC)
Re: [Scheme-reports] Complex gcd? Fredrik Noring (26 May 2014 19:11 UTC)

Re: [Scheme-reports] Complex gcd? Fredrik Noring 26 May 2014 19:05 UTC

26 maj 2014 kl. 20:20 skrev John Cowan <cowan@mercury.ccil.org>:
> Correct.  `gcd` and those like it are applicable to both exact and inexact
> integers, but not to non-integers exact or inexact, and in Scheme (as in
> mathematics generally) the integers are a subset of the reals.

Divisibility, and in this case, a greatest common divisor, is equally valid
for complex integers in a mathematical sense. One can, of course, choose to
disregard this property.

> It would be a library of procedures applicable to Gaussian integers
> specifically, where the standard procedures can't handle them, or produce
> the wrong results, or do not yet exist.  Not being a mathematician,
> I can't say what procedures should be provided.

Thanks for the clarification!

All the best,
Fredrik

_______________________________________________
Scheme-reports mailing list
Scheme-reports@scheme-reports.org
http://lists.scheme-reports.org/cgi-bin/mailman/listinfo/scheme-reports