Let A be a 1- dimensional array with integers and "min" , "max", "number"

three integer numbers. find an algorithm that answers, if the value "number" is in the array e.g a [i] = number for some i, 1<= min <= i <= max <= n, and the complexity of the algorithms must be O(lgn)

I need some help on that! Thanks in advance!