There are obviously only 4 cases!
Plug in sequentially n=1, 2, 3, and 4 and show that the assertion holds for each one.
Michelle P.
asked 04/27/21Proof by Exhaustion is proving that something is true by showing that it is true for each and every case considered. Using this method (sometimes also called Proof by Cases) prove the following;
(n+1)3 >= 3n for n N, n<=4
There are obviously only 4 cases!
Plug in sequentially n=1, 2, 3, and 4 and show that the assertion holds for each one.
Get a free answer to a quick problem.
Most questions answered within 4 hours.
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.