January 22, 2019 January 22, 2019 10:00 PM PST 11:00 PM PST In case you didn’t notice, we recently held the 1st ever GMAT game show and it was awesome! See who won a full GMAT course, and register to the next one. January 26, 2019 January 26, 2019 07:00 AM PST 09:00 AM PST Attend this webinar to learn how to leverage Meaning and Logic to solve the most challenging Sentence Correction Questions.
Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 01 Aug 2011
Posts: 17

If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
07 Jun 2012, 03:53
Question Stats:
70% (01:12) correct 30% (00:57) wrong based on 197 sessions
HideShow timer Statistics
If n > 2, then the sum, S, of the integers from 1 through n can be calculated by the following formula: S = n(n + 1)/2. Which one of the following statements about S must be true? A. S is always odd. B. S is always even. C. S must be a prime number D. S must not be a prime number E. S must be a perfect square Can you please explain between B & D. Both need to be correct in order for the question to be valid right ? (S needs to be even to be divisible by 2 & S shouldn't be a prime number) Thanks, Shreya
Official Answer and Stats are available only to registered users. Register/ Login.



Manager
Joined: 19 Mar 2012
Posts: 152
Location: United States
Concentration: Finance, General Management
GPA: 3.69
WE: Analyst (Mutual Funds and Brokerage)

Re: If n > 2, then the sum, S, of the integers
[#permalink]
Show Tags
07 Jun 2012, 04:41
S does not necessarily have to be even. For example, when n=5, you have:
S = [(5)(5+1)]/2 = 15, an odd number



Current Student
Joined: 28 Mar 2012
Posts: 311
Location: India
GMAT 1: 640 Q50 V26 GMAT 2: 660 Q50 V28 GMAT 3: 730 Q50 V38

Re: If n > 2, then the sum, S, of the integers
[#permalink]
Show Tags
07 Jun 2012, 04:49
Hi,
S = n(n + 1)/2, n > 2 for ex, n = 3, S = 6 n=5, S = 15 = 3*5 and so on
Now, if n is even, then, n = 2k, S = k(2k+1)....(a)
if n is odd, then, n = 2k+1, S = (2k+1)(k+1)...(b)
Depending on value of k (integer), S can be odd/even But for n>2, it will always be a product of two numbers....(from (a) & (b))
Thus, answer is (D)
Regards,



Math Expert
Joined: 02 Sep 2009
Posts: 52402

Re: If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
07 Jun 2012, 13:26
If n > 2, then the sum, S, of the integers from 1 through n can be calculated by the following formula: S = n(n + 1)/2. Which one of the following statements about S must be true? A. S is always odd. B. S is always even. C. S must be a prime number D. S must not be a prime number E. S must be a perfect square Notice that we are asked "which of the following MUST be true, not COULD be true. For such kind of questions if you can prove that a statement is NOT true for one particular set of numbers, it will mean that this statement is not always true and hence not a correct answer. A. S is always odd > not necessarily true if n=3 then 1+2+3=6=even. B. S is always even > not necessarily true if n=5 then 1+2+3+4+5=15=odd. C. S must be a prime number > not true if n=3 then 1+2+3=6=not prime. E. S must be a perfect square > not necessarily true if n=3 then 1+2+3=6=not a perfect square. Only choice D is left. Answer: D.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Intern
Joined: 02 Nov 2012
Posts: 31

Re: If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
06 Nov 2012, 03:43
Correct me if I am not right, but since n > 2, S is always even since odd * even = even and 2 is the only even prime number S can never be a prime number!



Math Expert
Joined: 02 Sep 2009
Posts: 52402

Re: If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
06 Nov 2012, 03:56



Intern
Joined: 12 Jan 2012
Posts: 21

Re: If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
06 Jan 2013, 00:05
shreya717 wrote: If n > 2, then the sum, S, of the integers from 1 through n can be calculated by the following formula: S = n(n + 1)/2. Which one of the following statements about S must be true?
A. S is always odd. B. S is always even. C. S must be a prime number D. S must not be a prime number E. S must be a perfect square
Can you please explain between B & D. Both need to be correct in order for the question to be valid right ?
(S needs to be even to be divisible by 2 & S shouldn't be a prime number)
Thanks, Shreya S = [n(n+1)]/2 for n>2 S should be divisible by either n or n+1 (for n = odd S is divisible by n and for n=even S is divisible by n+1) so it cannot be a prime no. Answer: D



Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 8806
Location: Pune, India

Re: If n > 2, then the sum,
[#permalink]
Show Tags
06 Jan 2014, 20:49
akankshasoneja wrote: If n > 2, then the sum, S, of the integers from 1 through n can be calculated by the following formula: S = n(n + 1)/2. Which one of the following statements about S must be true? (A) S is always odd. (B) S is always even. (C) S must be a prime number. (D) S must not be a prime number. (E) S must be a perfect square. Though i agree that the OA is right but even option B should be correct. Put n = 5 S = 5*6/2 = 15 S is not always even. It may be even, it may be odd. If the even integer (out of n and n+1) is not a multiple of 4, then S will be odd.
_________________
Karishma Veritas Prep GMAT Instructor
Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >



Intern
Joined: 10 Oct 2013
Posts: 33
Concentration: Marketing, Entrepreneurship

Re: If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
07 Jan 2014, 22:54
S= n (n+1) /2 , Either n or n+1 , is even & also n > 2, Thus after dividing by 2, S can be shown to be a product of two distinct numbers (not including 1) > S can never be prime . So D it is



SVP
Joined: 06 Sep 2013
Posts: 1705
Concentration: Finance

Re: If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
16 Feb 2014, 08:43
Bunuel wrote: If n > 2, then the sum, S, of the integers from 1 through n can be calculated by the following formula: S = n(n + 1)/2. Which one of the following statements about S must be true? A. S is always odd. B. S is always even. C. S must be a prime number D. S must not be a prime number E. S must be a perfect square
Notice that we are asked "which of the following MUST be true, not COULD be true. For such kind of questions if you can prove that a statement is NOT true for one particular set of numbers, it will mean that this statement is not always true and hence not a correct answer.
A. S is always odd > not necessarily true if n=3 then 1+2+3=6=even. B. S is always even > not necessarily true if n=5 then 1+2+3+4+5=15=odd. C. S must be a prime number > not true if n=3 then 1+2+3=6=not prime. E. S must be a perfect square > not necessarily true if n=3 then 1+2+3=6=not a perfect square.
Only choice D is left.
Answer: D. Does anyone know why can't the sum be a prime number? So I began trying to understand this. First since all prime numbers greater than 3 are of the form 6k+1 or 6k1 Now then let's take 1+6k, that means that 2+3+4......+n cannot be a multiple of 6, but i'm trying to figure out why this can't be true? Thanks Cheers J Bumpinggg



NonHuman User
Joined: 09 Sep 2013
Posts: 9462

Re: If n > 2, then the sum, S, of the integers from 1 through n
[#permalink]
Show Tags
30 Oct 2018, 01:13
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.
_________________
GMAT Books  GMAT Club Tests  Best Prices on GMAT Courses  GMAT Mobile App  Math Resources  Verbal Resources




Re: If n > 2, then the sum, S, of the integers from 1 through n &nbs
[#permalink]
30 Oct 2018, 01:13






