finding a^2 =by+cz. from a sorted array

Question

There is a sorted array A storing n positive distinct integer. You are given 3 positive integers a,b and c.Design an O(n) algorithm to determine if there exist any two distinct