Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
1. n(n+1)/2 = 3124 => solving for n gives -3 or 2. Therefore 2. Sufficient 2. n(n+1)/2n = 4 => solving for n gives 0 or 7. Therefore 7. Sufficient
Not really sure where you're going here. First, if you think each statement is sufficient, you should be choosing D, not E. You also seem to be assuming that the sequence is a sequence of consecutive integers beginning from 1 - that's the only situation where you could use the "sum = n(n+1)/2" formula. You aren't told what kind of sequence this is, so you can't use any formula for the sum here. Finally, I don't understand how you arrived at the solutions -3 and 2 from the equation n(n+1)/2 = 3124.
prosper's solution is correct. _________________
Nov 2011: After years of development, I am now making my advanced Quant books and high-level problem sets available for sale. Contact me at ianstewartgmat at gmail.com for details.
Re: If the terms of a sequence are t1, t2, t3, . . . , tn, what [#permalink]
10 Aug 2014, 07:54
Hello from the GMAT Club BumpBot!
Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).
Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________