Re: Common divisor, smaller than a delta

asterisc wrote:
Hi there,

I have a question for you guys:
does anyone knows if there is any method of calculating a 'common
divisor' of n numbers, but this 'common divisor' must be smaller than a
'delta' value.
I must say that the numbers are non-integgers, but there is a limit of
precision needed.
For example, EPSILON = 0.001.

Thanks in advance!

Now that we know what this poster means, I am surprised
that nobody else has pointed out the known method for two
numbers: expand their ratio as a continued fraction, and
take the first convergent which gives a small enough delta
(or epsilon). But I too have wondered how this extends to
three or more numbers.
--

.

Relevant Pages

  • Re: A gcd proposition
    ... A non-negative common ... divisor d is their gcd if and only if c | d for every common ... and let d' be a non-negative common divisor divisible ... all common divisors divide the gcd (which is a nongegative common ...
    (sci.math)
  • Re: Common divisor, smaller than a delta
    ... does anyone knows if there is any method of calculating a 'common ... divisor' of n numbers, but this 'common divisor' must be smaller than a ... If s and t are the two real numbers, then the ratio ... you obtain approximating matrices ...
    (sci.math)
  • Re: A gcd proposition
    ... A non-negative common ... divisor d is their gcd if and only if c | d for every common ... and let d' be a non-negative common divisor divisible ... In the step to prove sufficiency, it did not prove the existence ...
    (sci.math)
  • A gcd proposition
    ... A non-negative common ... divisor d is their gcd if and only if c | d for every common ... and let d' be a non-negative common divisor divisible ... In the step to prove sufficiency, it did not prove the existence ...
    (sci.math)
  • Re: A gcd proposition
    ... I found a proof in Rotman's Abstract Algebra book that might be ... A non-negative common ... divisor d is their gcd if and only if c | d for every common ... and let d' be a non-negative common divisor divisible ...
    (sci.math)