Ask Question
14 May, 20:59

Prove by mathematical induction, n^2 > 2n for all integers n≥3.

+4
Answers (1)
  1. 15 May, 00:23
    0
    This is how I'd go about the problem:

    It says that n has to be equal to three or greater so plug in three for each of the sides.

    3^2 > 2X3 = 9>6

    (which s greater)

    Plug in four:

    4^2 > 2X4 = 16>8

    And so on ...
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Prove by mathematical induction, n^2 > 2n for all integers n≥3. ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers