Let \(a\), \(b\), \(c\) be positive numbers. There are *finitely* many *positive whole* numbers \(x\), \(y\) which satisfy the inequality \[a^x > cb^y\] if

\(a>1\) or \(b<1\).

\(a<1\) or \(b<1\).

\(a<1\) and \(b<1\).

\(a<1\) and \(b>1\).

It’s important to notice that the question refers to a *finite* number of solutions…

Can we use logarithms to rewrite the inequality?