If $f(n) = O(g(n))$ and $g(n) \neq O(f(n))$ than can we say that $f(n)$ and $g(n)$ will never intersect?
The asymptotic behavior of a function only depends on its value on "large" inputs. More formally, let $f$ be an arbitrary function, and let $f'$ be obtained by changing finitely many values of $f'$. Then for every function $g$, $f = O(g)$ iff $f' = O(g)$.
I believe that you can now answer your own question.