>>8663

>>8666

>Hint for the non-trivial Lookup.

>In the d[t] at -f,1 there are two values where d from c is between.

>In the d[t] at e,1 there are two values where d from c is between.

>How would help us find n?

>Biggest hint since the start.

I have a good idea.

We need the (-f,1) elements surrounding d as well as the (e,1) elements.

Then do (e,1) a[t] - (-f,1) a[t] for both of the near d values.

Basically we’re calculating possible (an) - a(n-1) = n

This will give us a much smaller range of n values to search.

Should return two possible n values.

Search area is in between those two n values.

Thoughts?

>>8717

Correction:

(an) - a(n-1) =a

Thanks PMA for pointing out my error.

However, it would still give us a limited area to search. And those a[t] values still contain parts of (n-1) and (n).

We're still looking for a(n-1) and (an), which are both products of (a) and (n)

Key idea is limiting the search area (or direct calc) using the (-f,1) and (e,1) offset.

>>8719

Since it returns possible a values, that works too. Just do d[prime]-a = x to get a list of possible x values.

Then Iterate x in a limited search area.

c287 attached, finds a[prime]=7