Say I have a series of real numbers of arbitrary precision. It is a known fact that the real numbers will eventually result in a pure integer (not rounded)
What would be the most efficient way to predict how many steps to the next integer.
for example in the following series it is simple to determine the next integer value.
2.1, 4.2, 6.3 ...
0.1 divides into 1 10 times therefore the next integer in the series comes after the 10th iteration.
But what if the numbers are not so easy for example in the series...
378.0872915, 496.4625614, 591.2874514, 672.6574576, 745.0246992
The integer number arrives after the 11th iteration and is 1126 but how could I predict that?
example 2 in the series
277.9712215, 382.2844896, 463.3471822, 531.9682234, 592.5199075
The next integer doesn't arrive till the 3234th iteration and is 12120
How could I have predicted that with the least possible number of steps?
It is ok for the prediction to be wrong as we could move to the predicted number in series, test, re-calibrate and try again until the answer is found.
EDIT: I didn't want to add this as I think its an unnecessary diversion and I might start getting answers like 'factor it' The number sequence is generated using this equation $$sqrt(x^2+bx+c)-x$$ the first real number in the series is when $x = 0$
As can be seen from the responses below as soon as I added Edit 1 I have started to get the inevitable 'Factor it' responses. I am looking for a way to predict the next possible integer value. I do not expect the prediction to be correct the first time around, I do hope it can be resolved by an iterative approach to the predictions.
Edit 3: The following image shows a graph of the series. the shape of the graph is always the same although of course the actual numbers are not.