Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

cleetus779

  • 3 years ago

use induction to prove that for all n > 0, n!>n^(2-1)

  • This Question is Open
  1. cleetus779
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    the basis step is 0! = 1, then we assume true the hypothesis, then any ideas on inductive step?

  2. Azteck
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    You sure you wrote down the RHS(Right Hand Side) correctly: \[n^{2-1}\]?

  3. cleetus779
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    sorry, reposted the question as 2^(n-1) on rhs

  4. Azteck
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    I'm not sure, but isn't the "greater than" sign meant to be the "greater than or equal" sign \[\ge \]?

  5. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy