Find the largest element in a sorted array, with increasing consecutive differences, smaller than X , in O( log(log (max_value)))

Question

I want to find the largest element in a sorted array, where the differences between the consecutive elements of the array are increasing, that is smaller than x.

For