I try, without success, to create an algorithm that can compute the average greatest common divisor of a series of integers.
For example, I have the following numbers:
399, 710, 105, 891, 402, 102, 397, ...
As you can see, the average gcd is approximately 100, but how to compute it ?
I try to find the carrier signal length of a HF signal. This signal is an alternation of high levels and low levels.
I have the duration of each level, but this time is not accurate.
My aim is to find as quick as possible the base time of the signal.
My first idea was to compute the gcd of the first times I get, to find the carrier of the signal. But I cannot use the classical gcd because the values are not very accurate.
With a perfect signal I would have gcd(400, 700, 100, 900, 400, 100, 400) = 100