Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

See, t0 is odd. Then we add an odd number (n=1), so t1 is even. Then we add an even number(n=2), so t2 is even. Then we add an odd number (n=3), so t3 is odd. Then we add an even number(n=4), so t4 is odd. Then we add an odd number(n=5), so t5 is even. Then we add an even number(n=6), so t6 is even. Then we add an odd number(n=7), so t7 is odd. Then we add an even number(n=8), so t8 is odd. Etc........

As you could see here the sequence is connected with divisibility by 4. So (1) tells us about divisibility by 3 and it should be not sufficient. See countrexample: t2 is even (n+1 is 3), t8 is odd (n+1=9) (2) alone should be sufficient since it tells us about the divisibility by 4, and we see that n which are divided by 4 with remainder of 1 or 2 is even. If the remainder is 0 or 3, it is odd. Here the reminder is 1 (n-1 is divided by 4), so the term should be even.

The answer is (B)
_________________

If my post is useful for you not be ashamed to KUDO me! Let kudo each other!

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

05 Oct 2013, 10: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.
_________________

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

24 Nov 2013, 15:22

It should be E...n-1 being divisible by 4, based on the chart, that means it's either 4 (as you can see if it's 4, then the next term in the sequence is 6), or 24 for (in which case the next term in the series is 31). OA is incorrect.

n is an integer greater than or equal to 0. The sequence \(t_n\) for n > 0 is defined as \(t_n = t_{n-1} + n\). Given that \(t_0 = 3\), is tn even?

(1) n + 1 is divisible by 3 (2) n - 1 is divisible by 4

It should be E...n-1 being divisible by 4, based on the chart, that means it's either 4 (as you can see if it's 4, then the next term in the sequence is 6), or 24 for (in which case the next term in the series is 31). OA is incorrect.

The OA is correct.

(2) n - 1 is divisible by 4 means that \(n=4k+1\), thus n is 1, 5, 9, ...

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

28 Dec 2013, 09:34

2

This post received KUDOS

First off let's see the sequence behavior charting some numbers.

t(0)=3+0 = O t(1)=3+1 = E t(2)=4+2 = E t(3)=6+3 = O t(4)=9+4 = O t(5)=13+5= E t(8) = O

we can notice a repeating pattern (E, E, O, O) we need to figure out how n relates to a multiple of 4.

st1 n could be 2, 5, 8, 11, 14 etc.. checking the chart we can tell that this statement is not sufficient st2 tells us how n relates to a multiple of 4 and indeed if we plug some values in we can safely claim that t(n) is even.
_________________

learn the rules of the game, then play better than anyone else.

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

05 Jan 2014, 08:26

I have a doubt here, 2nd part says that it is divisible by 4 then why have you wrote the expression as n= 4k+1. it doesn't talks about remainder here right? isn't n=4k enough?

Bunuel wrote:

AccipiterQ wrote:

n is an integer greater than or equal to 0. The sequence \(t_n\) for n > 0 is defined as \(t_n = t_{n-1} + n\). Given that \(t_0 = 3\), is tn even?

(1) n + 1 is divisible by 3 (2) n - 1 is divisible by 4

It should be E...n-1 being divisible by 4, based on the chart, that means it's either 4 (as you can see if it's 4, then the next term in the sequence is 6), or 24 for (in which case the next term in the series is 31). OA is incorrect.

The OA is correct.

(2) n - 1 is divisible by 4 means that \(n=4k+1\), thus n is 1, 5, 9, ...

I have a doubt here, 2nd part says that it is divisible by 4 then why have you wrote the expression as n= 4k+1. it doesn't talks about remainder here right? isn't n=4k enough?

Bunuel wrote:

AccipiterQ wrote:

n is an integer greater than or equal to 0. The sequence \(t_n\) for n > 0 is defined as \(t_n = t_{n-1} + n\). Given that \(t_0 = 3\), is tn even?

(1) n + 1 is divisible by 3 (2) n - 1 is divisible by 4

It should be E...n-1 being divisible by 4, based on the chart, that means it's either 4 (as you can see if it's 4, then the next term in the sequence is 6), or 24 for (in which case the next term in the series is 31). OA is incorrect.

The OA is correct.

(2) n - 1 is divisible by 4 means that \(n=4k+1\), thus n is 1, 5, 9, ...

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

07 Jan 2014, 02:14

1

This post received KUDOS

Hi Bunuel pl review the logic below

its a AP where d = tn-tn-1= n where 3 is the first term

Now the tn = 3+ (n-1)n {by formula tn= a+(n-1)d}

in this equation n and n-1 are consecutive numbers

for statement #1: n+1, which is next consecutive number in the sequence, is divisible by 3, but we don't know whether its even or odd ( including 3,6,9,..) so insuff

for statement #2: n-1 is divisible by 4 so n-1 is even hence n is odd and n(n-1) is even. And 3 + even = odd suff

T_n can only be even if the sum of integers from 1 to n is odd, as odd (3)+ odd=even

1. n+1 can only be divisible by 3 if T_n= T_2, T_5, T_8, T_11.... sum of integers from 1 to 2=3 (odd) sum of integers from 1 to 5=15 (odd) sum of integers from 1 to 8=36 (even)

Not sufficient

2. n-1 can only be divisible by 4 if T_n= T_5, T_9, T_13, T_17..... sum of integers from 1 to 5=15 (odd) sum of integers from 1 to 9=45 (odd) sum of integers from 1 to 13= 91 (odd) sum of integers from 1 to 17=153 (odd)

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

07 Jul 2014, 08:55

gmat6nplus1 wrote:

First off let's see the sequence behavior charting some numbers.

t(0)=3+0 = O t(1)=3+1 = E t(2)=4+2 = E t(3)=6+3 = O t(4)=9+4 = O t(5)=13+5= E t(8) = O

we can notice a repeating pattern (E, E, O, O) we need to figure out how n relates to a multiple of 4.

st1 n could be 2, 5, 8, 11, 14 etc.. checking the chart we can tell that this statement is not sufficient st2 tells us how n relates to a multiple of 4 and indeed if we plug some values in we can safely claim that t(n) is even.

how exactly does st.1 tell us n could be 2, 5, 8 ,11 ,14 could you show the plugging in?

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

25 Jan 2015, 05:22

sagnik2422 wrote:

gmat6nplus1 wrote:

First off let's see the sequence behavior charting some numbers.

t(0)=3+0 = O t(1)=3+1 = E t(2)=4+2 = E t(3)=6+3 = O t(4)=9+4 = O t(5)=13+5= E t(8) = O

we can notice a repeating pattern (E, E, O, O) we need to figure out how n relates to a multiple of 4.

st1 n could be 2, 5, 8, 11, 14 etc.. checking the chart we can tell that this statement is not sufficient st2 tells us how n relates to a multiple of 4 and indeed if we plug some values in we can safely claim that t(n) is even.

how exactly does st.1 tell us n could be 2, 5, 8 ,11 ,14 could you show the plugging in?

Statement says 3k=n+1 so n =3k-1, putting k=1 we get n=2, k=2 gives n=5 , k=3 gives n=8 and so on......
_________________

Beat verbal, Beat GMAT... Trying Hard to do that..... Kudos if my post helped you

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

29 May 2016, 07:38

Hi,

Any help would be appreciated. I just can't seem to get my head around this question.

1. I don't understand what is the meaning of "is Tn even"? How do we even prove that. Further what help are both the statements providing in helping to prove it.

Below mentioned is all i understand and gather from the question. Upon substitution of the values, we get Tn as follows -

t(0)=3+0 = 3 = ODD t(1)=3+1 = 4 = EVEN t(2)=4+2 = 6 = EVEN t(3)=6+3 = 9 = ODD t(4)=9+4 = 13 = ODD t(5)=13+5= 18 = EVEN t(6) =18 + 6 = 24 = EVEN

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

18 Sep 2016, 08:51

Hi Bunnel,

If we apply the nth term of an AP formula, we have tn= 3 + (n-1)* d In this AP, (this is an AP because tn -tn-1=n) we get, tn=3 + (n-1)*n now because (n-1)*n is always even (product of two consecutive numbers is always even), we get tn= 3 + even = odd. So clearly, tn is odd so (A) should be sufficient.

Moving to B, (n-1) is divisible by 4, that means n-1 is even so n is odd, again tn = 3+n-1*n = 3+ even = odd

If we apply the nth term of an AP formula, we have tn= 3 + (n-1)* d In this AP, (this is an AP because tn -tn-1=n) we get, tn=3 + (n-1)*n now because (n-1)*n is always even (product of two consecutive numbers is always even), we get tn= 3 + even = odd. So clearly, tn is odd so (A) should be sufficient.

Moving to B, (n-1) is divisible by 4, that means n-1 is even so n is odd, again tn = 3+n-1*n = 3+ even = odd

Why is th e answer not D?

The given sequence is NOT an arithmetic progression. You'd notice it if you'd try to write down several terms: \(t_0=3\) \(t_1=t_0+1=4\) \(t_2=t_1+2=6\) \(t_3=t_2+3=9\) \(t_4=t_3+4=13\) \(t_5=t_4+5=18\) \(t_6=t_5+6=24\) \(t_7=t_6+7=31\) \(t_8=t_7+8=39\)

...

(1) n + 1 is divisible by 3 --> n + 1 = 3x --> n = 3x - 1, thus n can be 2, 5, 8, ... tn ca be even (for example, t2) and odd (for example, t8).
_________________

n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

24 Sep 2016, 02:23

Hi Buneul, Kindly correct me if I am right.

Given t0=3 then t1=3+1 t2= 3+1+2 t3=3+1+2+3 t4=3+1+2+3+4 and so on So the general term for tn= 3+sum of n natural numbers => tn=3 + n(n+1)/2........(1)As per this only if either n or n+1 is a multiple of 4, will the term n(n+1)/2 be even, otherwise not.

Now, as per the statements 1) n+1 is divisible by 3 => tn is divisible by 3 but we cant determine whether the 2nd term of eqn (1) is even or odd. INSUFFICIENT 2) n-1 is divisible by 4 => n-1 is even, n is odd and n-1+2=n+1 is also even but not a multiple of 4 => (n+1)/2 is odd So, the 2nd term of eqn (1) is odd. Hence, tn=odd+ (oddxodd)= even. SUFFICIENT

Re: n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

08 Jan 2017, 00:19

Bunuel please help:

I get why (1) is NS: - T_0 => yes N even - T_1 => No N not even

I'm confused on (2):

- if T_7 then no N = odd - if T_2 then yes N = odd

where is my logic off? Thanks!!

Bunuel wrote:

gauravprashar17 wrote:

Hi Bunnel,

If we apply the nth term of an AP formula, we have tn= 3 + (n-1)* d In this AP, (this is an AP because tn -tn-1=n) we get, tn=3 + (n-1)*n now because (n-1)*n is always even (product of two consecutive numbers is always even), we get tn= 3 + even = odd. So clearly, tn is odd so (A) should be sufficient.

Moving to B, (n-1) is divisible by 4, that means n-1 is even so n is odd, again tn = 3+n-1*n = 3+ even = odd

Why is th e answer not D?

The given sequence is NOT an arithmetic progression. You'd notice it if you'd try to write down several terms: \(t_0=3\) \(t_1=t_0+1=4\) \(t_2=t_1+2=6\) \(t_3=t_2+3=9\) \(t_4=t_3+4=13\) \(t_5=t_4+5=18\) \(t_6=t_5+6=24\) \(t_7=t_6+7=31\) \(t_8=t_7+8=39\)

...

(1) n + 1 is divisible by 3 --> n + 1 = 3x --> n = 3x - 1, thus n can be 2, 5, 8, ... tn ca be even (for example, t2) and odd (for example, t8).

I get why (1) is NS: - T_0 => yes N even - T_1 => No N not even

I'm confused on (2):

- if T_7 then no N = odd - if T_2 then yes N = odd

where is my logic off? Thanks!!

Bunuel wrote:

gauravprashar17 wrote:

Hi Bunnel,

If we apply the nth term of an AP formula, we have tn= 3 + (n-1)* d In this AP, (this is an AP because tn -tn-1=n) we get, tn=3 + (n-1)*n now because (n-1)*n is always even (product of two consecutive numbers is always even), we get tn= 3 + even = odd. So clearly, tn is odd so (A) should be sufficient.

Moving to B, (n-1) is divisible by 4, that means n-1 is even so n is odd, again tn = 3+n-1*n = 3+ even = odd

Why is th e answer not D?

The given sequence is NOT an arithmetic progression. You'd notice it if you'd try to write down several terms: \(t_0=3\) \(t_1=t_0+1=4\) \(t_2=t_1+2=6\) \(t_3=t_2+3=9\) \(t_4=t_3+4=13\) \(t_5=t_4+5=18\) \(t_6=t_5+6=24\) \(t_7=t_6+7=31\) \(t_8=t_7+8=39\)

...

(1) n + 1 is divisible by 3 --> n + 1 = 3x --> n = 3x - 1, thus n can be 2, 5, 8, ... tn ca be even (for example, t2) and odd (for example, t8).

(2) n - 1 is divisible by 4 means that \(n=4k+1\), thus n is 1, 5, 9, ... So, n cannot be 2 or 7.

n is an integer greater than or equal to 0. The sequence tn [#permalink]

Show Tags

08 Jan 2017, 05:54

After evaluating for different values of n using equation \(t_n = t_{n-1} + n\) we get sequence: 3,4,5,6,7,8......

which shows that , when n is odd, the corresponding term,tn is odd and when n is even ,the corresponding term, tn is even We need to find : n is even or odd

statement(1) : n + 1 is divisible by 3 there are two possibilities of n , odd and even (as multiples of 3 can be odd or even) Ex. n=5 , n+1=6 : divisible by 3 n=2 , n+1=3 : divisible by 3 n could be odd or even >> not sufficient.

statement(2) : n - 1 is divisible by 4 for n-1 to be divisible by 4, n-1 has to be even (as multiples of 4 are always even) Hence, n is odd. >> sufficient.