Reducing 3SAT to MAX-3SAT
Hint: You have a 3SAT formula $\varphi$ in CNF with $n$ clauses and a maximal $m \le n$ number of clauses can be satisfied. What happens if $m &lt; n$? And what about $m = n$?