Search for specific element in sorted array Given sorted array $A[1..n]$. We want to find an element such that
$A[i]=3i+2$  in $O(\log n)$(binary search).

I trying to relate to problem finding element in sorted array $A$ such that $A[i]=i$, but i can't use that technique to solve mentioned problem. Any hint be appreciated.
Define $B[i] = (A[i]-2)/3$. Now you want to find an index $i$ such that $B[i] = i$.