The best way to solve this would be to take small values of n substitute and see what you.
Statement 1 says n is odd. Let's say n = 3 ( or 5)
Then from the sequence we get 1, -1, 3(or -3 and 5) . is the sum of this sequence positive? Yes.
So, can be answered from 1.
Statement 2 says a(K) is Positive. If you observe the above sequence you will see that a(K)is positive only when a(K)is Odd. Which means n is odd. Which is the same as statement 1. And we already know that 1 helps you answer the Question.
So can be answered from two also.
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
Featured Course
Target Test Prep GMAT OnDemand
Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.
- 715+ score guarantee — highest in the industry (99th percentile)
- 52 chapters · 1,500+ lessons · 4,000+ practice questions
- 400 hours of video · 1,500+ instructor-led HD smartboard lessons
- 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
- 24/7 live support + weekly Zoom office hours with GMAT instructors
- TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
- 1,200+ flashcards + AI-powered study assistant & daily calendar
- OnDemand, LiveTeach & GMAT Bootcamp formats available
- Also: GRE, SAT Math & Executive Assessment courses
- MBA Admissions Consulting now available
- 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
- 200,000+ students served
- 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★
5.0
(559 reviews)
130-pt guarantee
$0 to start
then $127/mo
GMAT PREP Arithemtic Sequence one more???
Source: Beat The GMAT — Data Sufficiency |
the poster above has the main idea of this problem well in hand, so i have little to add to that solution. however, you will find the following comment helpful:
if you're given the definition of a sequence, with 'a sub k' or similar, then WRITE OUT THE FIRST FEW TERMS OF THE SEQUENCE.
if you do this here, then you'll realize that the sequence is
1 -1 3 -3 5 -5 ...
and the SUMS after each of those terms are added are
1 0 3 0 5 0 ...
if you do this, then the patterns are quite obvious:
terms: the odd-numbered terms are positive and the even-numbered terms are negative
sums: the sums up to odd-numbered terms are positive and odd, while the sums up to even-numbered terms are all zero
the rest follows.
--
in general, the more formulaic mumbo-jumbo there is in a problem, the more likely it is that you'll be able to solve the problem just by grinding out the sequence until its patterns become apparent.
if you're given the definition of a sequence, with 'a sub k' or similar, then WRITE OUT THE FIRST FEW TERMS OF THE SEQUENCE.
if you do this here, then you'll realize that the sequence is
1 -1 3 -3 5 -5 ...
and the SUMS after each of those terms are added are
1 0 3 0 5 0 ...
if you do this, then the patterns are quite obvious:
terms: the odd-numbered terms are positive and the even-numbered terms are negative
sums: the sums up to odd-numbered terms are positive and odd, while the sums up to even-numbered terms are all zero
the rest follows.
--
in general, the more formulaic mumbo-jumbo there is in a problem, the more likely it is that you'll be able to solve the problem just by grinding out the sequence until its patterns become apparent.
Ron has been teaching various standardized tests for 20 years.
--
Pueden hacerle preguntas a Ron en castellano
Potete chiedere domande a Ron in italiano
On peut poser des questions à Ron en français
Voit esittää kysymyksiä Ron:lle myös suomeksi
--
Quand on se sent bien dans un vêtement, tout peut arriver. Un bon vêtement, c'est un passeport pour le bonheur.
Yves Saint-Laurent
--
Learn more about ron
--
Pueden hacerle preguntas a Ron en castellano
Potete chiedere domande a Ron in italiano
On peut poser des questions à Ron en français
Voit esittää kysymyksiä Ron:lle myös suomeksi
--
Quand on se sent bien dans un vêtement, tout peut arriver. Un bon vêtement, c'est un passeport pour le bonheur.
Yves Saint-Laurent
--
Learn more about ron
