You are not logged in.
Prove that a graph of order n with at least
Edges must be connected.A graph of order n can be made up of two disjoint components of order k and n-k. A complete graph of order k has more edges than any other graph of order k and after that the complete graph of order n-k. Given these two graphs we will construct an edge between the two disjoint sets to make a connected graph of order n.
This gives the inequality (k choose 2) + (n-k choose 2) < [(n-1)(n-2)]/2 + 1 for 1<=k<=n-1.
The proof goes as follows:
First we notice that the inequality we want to establish is equivalent to (k choose 2)+(n-k choose 2)<= [(n-1)(n-2)]/2
THEN THE PROOF GOES ON.
I'm confused on the bold and italic parts.
Bold: I get where the left side of the inequality comes from but I'm not seeing where the right side comes from.
Italics: Why this inequality? Why does the right side lose the +1?
Any help would be great!
He. Right. So I try doing that... and it gets pretty complicated quickly.
I get:
So, yes i did know that. But when I try to simplify its... not easy?
Trying to find the radius of convergence of:
Trying to do b and e that can be seen at the following link:
http://www.cornbrain.com/upload/qimages/1207701916046.jpg
any ideas on steps / theorems to use or try??
Oh, note. I'm pretty sure that a) is correct and b) is not. But i'm unsure how to prove this. Especially for b.
Consider the series:
1/(2*3) + 1/(3*4) + ... + 1/[(k+1)(k+2)]
Which evaluates the series? Where is the flaw in the wrong one?
a) (1/2 - 1/3) + (1/3 - 1/4) + ... + [1/(k+1) - 1/(k+2)] + ... = 1/2
b) (1 - 5/6) + (5/6 - 3/4) + ... + [(k+3)/(2k+2) - (k+4)/(2k+4)] + ... = 1
Find the domain of convergence of the power series:
Now, I did the root test
So now I say when n is even i get:
Here's where I need help!
I believe now that I am supposed to look at the sup limit which is 3/4? Thus, the radius of convergence is 4/3? So the series converges between (-4/3, 4/3)????
You're right. I was looking in the textbook. And it said use the ratio test but looking at the reason WHY i see that root test is the same. And as you point out above is CLEARLY easier.
So my 2nd question is this:
If I graph the summands for n=3,6,9, and 12. I get:
http://render-2.snapfish.com/render2/is=Yup6aQQ%7C%3Dup6RKKt%3Axxr%3D0-qpDPfRt7Pf7mrPf
rj7t%3DzrRfDUX%3AeQaQxg%3Dr%3F87KR6xqpxQQ0QxJPPxQ0oxv8uOc5xQQQGloQnaanGPqpfVtB
%3F*KUp7BHSHqqy7XH6gX0QPGe%7CRup6GQP%7C/of=50,590,369
(dont think i can add pics to this)
Then the question asks, "do you expect convergence at either or both of the endpoints of the interval of convergence of the infinite series and prove it."
I'm not sure what this is asking?
Is it asking if the summands approach 0 when |x| equals the radius of convergence? or...?
Find radius of convergence for:
What I know / have done:
I know I am supposed to use the limit ratio test.
So I got
[side note: then I take the limit of that, say L, and do L|x|<1??? and the radius of convergence is 1/L?]
Okay, new question (similar i suppose)... If i calculated the limits of the r(n) and p(n) from above using Mathematica and I get an interval, what exactly does that mean?
For
For
I have that
for the two following:
Now I can plug these into the equations and I get:
(for
(for
)Okay, so now my real task is to take the limit of these r(n) and p(n) as n goes to infinity. Should i simplify these, or is there an easier way to do this? THANKS FOR READING AND ANY HELP!
Prove that the Stirling numbers of the second kind satisfy the following relations:
1) S(n,1)=1 when n>=1
2) S(n,2)=2^(n-1)-1 when n>=2
3) S(n, n-1) = (n choose 2) when n>=1
4) S(n, n-2) = (n choose 3) + 3(n choose 4) when n>=2
[note:
S(n,p) means the number of ways to partition n elements into p subsets.
Prove that :::
|lnx lnc| < {|x-c|/c, if x>c, and |x-c|/x, if x<c.
Could I possible say...
The mean value theorem states "Given a function f that is differentiable at all points strictly between a and x and continuous at all points on the closed interval from a to x, there
exists a real number c strictly between a and x such that [f(x)-f(a)]/x-a = f'(c)."
Thus we can prove the question by the contrapositive. Assume f(b)=f(a) and show that there must be an f'(x)=0. By the mean value theorem we have:
[f(b)-f(a)]/b-a = 0/(b-a) = 0 = f'(x) for x strictly between a and b.
It's cool.
Common denominator: see the follow: http://en.wikipedia.org/wiki/Common_denominator
And stop posting on other peoples. I've seen you put this sort of thing on a few different posts.
Really? I guess I'm not seeing it.
Rolle's says, "Let f be a function that is continuous on [a,b] and differentiable on (a,b) AND for which f(a)=f(b)=0. There exists at least one c, a<c<b for which f'(c)=0."
So i see that I'm assuming f(a)=f(b) but they dont necessarily have to equal 0?
This proof is killing me.
I also kind of feel like using the Intermediate Value Theorem... but that's not in this section of the book.
( what is: Generalized Mean Value Theorem, Cauchy's Remainder Theorem, L'Hospital's Rule
and Darboux's Theorem.)
Question from book:
"Prove that if F is continuous on [a,b] and differentiable on (a,b) and if F'(x) is not zero for any x strictly between a and b, then
My question:
So I know that I have to prove this using the contrapositive. I also know that for (if p then q) the contrapositive is (if not q then not p). So for my question I want to assume if F(b)=f(a) then ____________________________.
I don't know what to fill the ______ in with though?
I need a cominatorial proof of:
((n choose 2) choose 2) = 3(n choose 4) + 3(n choose 3)
for example, (n choose k) means from a total of n people we choose a committe of size k.
(though this may not be relevant equation)
I'm thinking for the left hand side that out of a total of n people we find the all the possible committees of size 2. Then of all these committees we pick two of the duos picked? No idea how to do the right hand side - or make the left side equal
I have two questions, help with either would be greatly appreciated.
1. f is continuous on [a, infinity) and lim f(x) exists thn f is bouned on [a, infinity)
2. Let f(x) be any polynomial of degree at least 2, all of whose roots are real and distinct. Prove that all of the roots of f'(x) must be real. What happens if some roots of f are multiple roots?
For #2 I'm certain that I will have to use either Rolles Theorem of Fermat's Theorem on Extrema. Ideas?
Gotcha mathsyperson thanks!
So because h(0) is less than 0 and h(1) is greater than 0 then at some point in the interval of (0,1) we will have a value,c, so that h(c) = 0. And thus, since h(x)=f(x)-g(x) this point is shared by f(x) and g(x)!
Thank you!!!
Alright, I have h(x) = f(x) - g(x).
By def. of IVT (from my book) it says "Given h(x) on interval [a,b] and any x1 and x2 in the interval; then for any number, N, such that h(x1)<N<h(x2) then there exists as c in (a,b) such that h(c)=N."
So I have h(x) on the interval [0,1] with x1=0 and x2=1. So for any N between h(0) and h(1) there is a c such that h(c)=N.
So what new do i know? h(0)<=f(0)<=g(0) and g(1)<h(1)<f(1)...
So what? I'm not sure how this exactly helps.
if f and g are continuous functions on [0,1] such that
f(0)<g(0) and f(1)>g(1). Show that there must be an x in (0,1) for which f(x)=g(x)...
I know it's true and can prove it geometrically... but i think i should be proving it using calculus. I should probably be using the intermediate value theorem right?
I need to prove Vandermonde's Convolution and i'm stuck...
Vandermonde's Convolution =
I do know that I should probably use:
Ideas? thanks!
Actually... for #1 (the verify by substitution part) is this correct:
n choose r = n! / [r!(n-r)!]
Applied to left side:
2n choose (n+1) = (2n)! / [(n+1)! (2n-(n+1)!]
= (2n)! / [(n+1)!(n-1)!]
2n choose n = (2n)! / [(n!(2n-n)!]
= (2n)! / [n!n!]
Then
(2n)! / [(n+1)!(n-1)!] + (2n)! / [n!n!]
= (2n)! {1/[(n+1)!(n-1)!] + 1/(n!n!)}
The common denominator will be (n+1)!n!
= (2n)! {n/[(n+1)!n!] + (n+1)/[(n+1)!n!]
= (2n)! {(n+n+1) / [(n+1)!n!]}
= (2n)! {(2n+1) / [(n+1)!n!]}
= (2n+1)! / [(n+1)!n!]
Multiply the top and bottom by (2n+2)
= (2n+2)! / [(2n+2)(n+1)!n!]}
= (2n+2)! / [2(n+1)(n+1)!n!]
= (1/2)(2n+2)! / [(n+1)!(n+1)!]
= (1/2) (2n+2 choose n+1)
?
I hate asking this because I'm usually extremely good at these but I'm STUCK on two (this is the first time this semester in this class)...
1. If n is a positive integer Verify by substitution that: (2n choose n+1) + (2n choose n) = ½(2n+2 choose n+1). Then count combinatorially.
2. Also Need to prove that Sum(k from 0 to n) (
choose k)( choose n-k )= (+ choose n).I realize this is a lot to ask. So I thank anyone who can help.