Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

cleetus779

  • one year ago

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

  • This Question is Open
  1. cleetus779
    • one year 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
    • one year 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
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  4. Azteck
    • one year 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.

    Search OpenStudy
    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.