| New Reply |
Discrete Math Proof n^2 > n +1 |
Share Thread | Thread Tools |
| Aug5-12, 12:00 AM | #1 |
|
|
Discrete Math Proof n^2 > n +1
1. The problem statement, all variables and given/known data
For any given n, where n is an element of the natural number set, prove n^2 > n +1, for all n > 1. 2. Relevant equations This week in lecture we defined the greater than relationship as: Let S = Natural numbers Let R = {(a,b): [itex]\exists[/itex] c: a = b+c} then aRb 3. The attempt at a solution My first thought was show a general expression of either an odd of even number (n = 2x + 1 or n = 2x), but the resultant (4x^2 + 4x +1 > 2x + 2 and 4x^2 > 2x +1 for odd/even respectively) doesn't really give me anything useful as far as I can see. I can see that it would be true, as n = 2 would be 4 > 3, and n= 3 would be 9 > 4, I'm just not sure on how to get started. Some literature on approaches to getting started on proofs would be great, as I find I'm fairly hit/miss. I can either see the approach or I stand there going "I know it's true, but I can't show it's true". |
| Aug5-12, 12:11 AM | #2 |
|
|
Here's one approach.
n^2-n = n(n-1) n>1 thus (n-1)>=1, now n(n-1)>= n >1 |
| Aug5-12, 12:29 AM | #3 |
|
|
Sorry, still not sure how having the form,
n(n-1) > 1 for all n > 1, helps me in this? |
| Aug5-12, 12:42 AM | #4 |
|
|
Discrete Math Proof n^2 > n +1
One way to do it would be to rewrite it as n^2 - n -1 > 0, and show that that is true for n > 1
|
| Aug5-12, 01:04 AM | #5 |
|
|
Hmm.. explain it to me like I'm 5. I last did math proof type subjects in '99, prior to this my degree has had calculus and stats which I had no issue with.
|
| Aug5-12, 01:27 AM | #6 |
Recognitions:
|
n2-n=n(n-1). So you have to prove that n(n-1)>1 if n>1 integer. If n>1 n-1≥1. You multiply n with a number greater then 1. Will the result greater or less than n? ehild |
| Aug5-12, 01:57 AM | #7 |
|
|
Alright, that makes sense. Issue is I'm not sure if this is the sort of proof I'm meant to be doing for it.
I think I'll go bang my head on a book. Thanks. |
| Aug5-12, 02:20 AM | #8 |
Recognitions:
|
ehild EDITED! |
| Aug5-12, 04:04 AM | #9 |
|
|
ehild, you meant n^2-n-1>0 not n^2-n+1.
You can do this also by induction, though it's really easy without. |
| Aug5-12, 05:10 AM | #10 |
Recognitions:
|
ehild |
| New Reply |
| Thread Tools | |
Similar Threads for: Discrete Math Proof n^2 > n +1
|
||||
| Thread | Forum | Replies | ||
| Discrete Math Proof | Calculus & Beyond Homework | 3 | ||
| Discrete Math: Proof by contradiction | Precalculus Mathematics Homework | 11 | ||
| Discrete Math proof | Calculus & Beyond Homework | 3 | ||
| proof in Discrete math | Calculus & Beyond Homework | 3 | ||
| discrete math and proof | Calculus & Beyond Homework | 2 | ||