Ore’s theorem

Let $G$ be a simple graph of order $n\ge 3$ such that, for every pair of distinct non adjacent vertices $u$ and $v$, $\mathrm{deg}(u)+\mathrm{deg}(v)\ge n$.Then $G$ is a Hamiltonian graph.