Find the largest integer value for the upper limit k if the two series are equal...
\[\sum_{n}^{k}=1(n ^{2}+n)=\sum_{n}^{k}=1[(n-1)(n-2)(n-3)(n-4)(n-5)+n ^{2}+n]\]
you think you could help me out with this problem?
any tips, biddy?
yeah, blacklabel :)
any tips or hints?
ahh
I just don't really know where to start with this problem :(
do you think anyone else could help me?
hello saeddiscover, do you think you could help me out with this problem?
That sounds interesting! I will try ...
thank you :)
what is lower limit of n ?? It is needed to evaluate the summation...
hmm
would the lower limit be 1?
It may be. Are you given any lower limit for n? it should be known ..
I'm not given it
unless the problem has a typo or something
supposing it was 1...
the lower limit?
Yep
how would I write it out as?
I think it is an unwise question, it has no solution.
but if the lower limit was 1, how would I solve it?
what is equal sign (=) for in right hand side of your equation?
my professor wrote the problem during the weekend; do you think he made a typo?
Oops! I meant left-hand side of your equation.
phi!!!!!! do you think you could help me out with this problem :)?
out of curiosity, are you sure that is a one in 1(n^2 + n) people don't put in leading ones... so maybe it's a typo or means something else ?
oh, I think it is part of n=1 (the lower limit) \[\sum_{n=1}^{k}(n^2+n)\]
so that is wat the lower limit is?
my bad
yes, the =1 part belongs below the sigma (summation sign)
so, what do I do next? The reason I have so much trouble with these problems is because I have a Professor that has trouble speaking English and trouble expressing his ideas :(.
so anymore tips, phi?
if we write it like this \[ \sum_{n=1}^{k}(n^2+n)= \sum_{n=1}^{k}(n^2+n) + \sum_{n=1}^{k}(n-1)(n-2)(n-3)(n-4)(n-5)\] it seems the complicated sum must be zero : \[ \sum_{n=1}^{k}(n-1)(n-2)(n-3)(n-4)(n-5)=0\]
that suggests that as you increase n from 1 to 2 to 3, you keep getting 0 until n is bigger than 5 so we can go from n=1 to n=5 and get a sum of zero
wait so
(1-1)(2-2)(3-3)(4-4)(5-5)?
But there are no (n-6)(n-7)(n-8)...
so is the upper limit 5?
the professor seems to be very crazy...
the sum \[ \sum_{n=1}^{k}(n-1)(n-2)(n-3)(n-4)(n-5) \] means, add up (1-1)(1-2)(1-3)(1-4)(1-5) + (2-1)(2-2)(2-3)(2-4)(2-5) + and so on
phi, sorry about earlier, apparently open study had to reboot
notice that the first term in the summation is (1-1)(1-2)(1-3)(1-4)(1-5) and (1-1) is 0, so this turns into 0 the second term (2-1)(2-2)(2-3)(2-4)(2-5) is also 0 (because you have (2-2) in it) each term will be zero... when you get to n=5 you have the term (5-1)(5-2)(5-3)(5-4)(5-5) and again you get 0 (because you are multiplying by (5-5)=0 if you go to n=6, that term is (6-1)(6-2)(6-3)(6-4)(6-5) and this is NOT zero. so the biggest k can be (and still get a sum of zero) is k=5
wow
incredible
so phi
is that the solution to the problem?
how bout the n squared+n part?
to summarize \[ \sum_{n=1}^{k}(n^2+n)= \sum_{n=1}^{k}(n^2+n) +(n-1)(n-2)(n-3)(n-4)(n-5) \\ \sum_{n=1}^{k}(n^2+n)= \sum_{n=1}^{k}(n^2+n) + \sum_{n=1}^{k}(n-1)(n-2)(n-3)(n-4)(n-5) \] subtract \(\sum_{n=1}^{k}(n^2+n)\) from both sides to get \[ 0=\sum_{n=1}^{k}(n-1)(n-2)(n-3)(n-4)(n-5) \] you can go up to n=5 and get a sum of zero \[ (1-1)(1-2)(1-3)(1-4)(1-5) + (2-1)(2-2)(2-3)(2-4)(2-5) +...+\\ (5-1)(5-2)(5-3)(5-4)(5-5) =0\]
if you go to n=6, that term is (6-1)(6-2)(6-3)(6-4)(6-5) and this is NOT zero. so the biggest k can be (and still get a sum of zero) is k=5
ahh
you are such a big help
I give you an S+
Join our real-time social learning platform and learn together with your friends!