Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 50007

n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined
[#permalink]
Show Tags
11 Jun 2015, 04:46
Question Stats:
56% (02:58) correct 44% (03:08) wrong based on 326 sessions
HideShow timer Statistics




Intern
Joined: 28 Jan 2013
Posts: 31
Location: United States
Concentration: General Management, International Business
GPA: 3.1
WE: Information Technology (Consulting)

Re: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined
[#permalink]
Show Tags
11 Jun 2015, 05:33
\(t_n\)=\(t_{n−1}\)+n The above follows the below sequence t0= Odd, t1=Even, t2=E,t3=O,t4=O,t5=E,t6=E,t7=O,t8=O,t9=E,t10=E. (EEven, OOdd) So starting from t1 the sequence will be EEOOEEOOEEOOEEOO.......
(1) n + 1 is divisible by 3
n+1 being divisible by 3, n will be 2,5,8,11,14.... t2 = E, t5=E, t8=O so we can't say whether tn is either odd or even. Insufficient
(2) n  1 is divisible by 4 n1 being divisible by 4, n will be 5,9,13,17,21.... t5=E,t9=E,t13=E,t17=E ....
Since the sequence is cyclic (EEOO). So tn will be even for all the values of n, where n1 is divisible by 4. Sufficient
Ans: B




CEO
Joined: 08 Jul 2010
Posts: 2560
Location: India
GMAT: INSIGHT
WE: Education (Education)

Re: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined
[#permalink]
Show Tags
11 Jun 2015, 05:44
Bunuel wrote: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined as \(tn = t_{n1} + n\). If \(t_0 = 3\), is \(t_n\) even?
(1) n + 1 is divisible by 3 (2) n  1 is divisible by 4
Kudos for a correct solution. \(tn = t_{n1} + n\) i.e. \(t1 = t_0 + 1 = 3+1 = 4\) i.e. \(t2 = t_1 + 2 = 4+2 = 6\) i.e. \(t3 = t_2 + 3 = 6+3 = 9\) i.e. \(t4 = t_3 + 4 = 9+4 = 13\) i.e. \(t5 = t_4 + 5 = 13+5 = 18\) i.e. \(t6 = t_5 + 6 = 18+6 = 24\) i.e. \(t7 = t_6 + 7 = 24+7 = 31\) i.e. \(t8 = t_7 + 8 = 31+8 = 39\) i.e. \(t9 = t_8 + 9 = 39+9 = 48\) i.e. \(t{10} = t_9 + 10 = 48+10 = 58\) i.e. \(t{11} = t_{10} + 11 = 58+11 = 69\) and so on... Eventually we can Observe that 2 terms are Even and the next two terms are odd and this cycle continuesQuestion : is \(t_n\) even?Statement 1: n + 1 is divisible by 3i.e. n+1 can be 3 or 6 or 9 or 12 etc i.e. n can be 2 or 5 or 8 or 11 etc \(t_2\) is Even \(t_5\) is Even \(t_8\) is Odd \(t_{11}\) is Odd.....i.e. INCONSISTENT answer Hence, NOT SUFFICIENTStatement 2: n  1 is divisible by 4i.e. n1 can be 4 or 8 or 12 etc i.e. n can be 5 or 9 or 13 etc The terms in this pattern will be at the difference of 4 and the property of all terms at difference of 4 terms is alike \(t_5\) is Even \(t_9\) is Even \(t_{13}\) is EVEN.....i.e. CONSISTENT answer Hence, SUFFICIENTAnswer: Option
_________________
Prosper!!! GMATinsight Bhoopendra Singh and Dr.Sushma Jha email: info@GMATinsight.com I Call us : +919999687183 / 9891333772 Online OneonOne Skype based classes and Classroom Coaching in South and West Delhi http://www.GMATinsight.com/testimonials.html
ACCESS FREE GMAT TESTS HERE:22 ONLINE FREE (FULL LENGTH) GMAT CAT (PRACTICE TESTS) LINK COLLECTION



Current Student
Joined: 29 Mar 2015
Posts: 44
Location: United States

Re: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined
[#permalink]
Show Tags
12 Jun 2015, 00:46
Bunuel wrote: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined as \(tn = t_{n1} + n\). If \(t_0 = 3\), is \(t_n\) even?
(1) n + 1 is divisible by 3 (2) n  1 is divisible by 4
Kudos for a correct solution. Listing the first couple of iterations: \(n=0, t_0 = 3\) \(n=1, t_1=1+1=2\) \(n=2, t_2=2+2=4\) \(n=3, t_3=4+3=7\) \(n=4, t_4=7+4=11\) \(n=5, t_5=11+5=16\) \(n=6, t_6=16+6=22\) \(n=7, t_7=22+7=29\) So you can see that when \(n=even\) the pattern is odd, even, odd, even, ..., or odd when n is a multiple of 4 and even otherwise, and when \(n=odd\) the pattern is even, odd, even, odd, ..., or odd when n+1 is a multiple of 4, and even otherwise. 1: if \(n+1=3, n=2, t_2=4\) but if \(n+1=9,n=8,t_8=37\) not sufficient 2: n1 is divisible by 4 means that n+1 is not a multiple of 4, and so \(t_n\) will be even. sufficient. the answer is B.



Math Expert
Joined: 02 Sep 2009
Posts: 50007

Re: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined
[#permalink]
Show Tags
15 Jun 2015, 05:19
Bunuel wrote: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined as \(tn = t_{n1} + n\). If \(t_0 = 3\), is \(t_n\) even?
(1) n + 1 is divisible by 3 (2) n  1 is divisible by 4
Kudos for a correct solution. MANHATTAN GMAT OFFICIAL SOLUTION:Sequence problems are often best approached by charting out the first several terms of the given sequence. In this case, we need to keep track of n, tn, and whether tn is even or odd. Attachment:
20150615_1618.png [ 47.41 KiB  Viewed 2901 times ]
Notice that beginning with n = 1, a fourterm repeating cycle of [even, even, odd, odd] emerges for tn. Thus, a statement will be sufficient only if it tells us how n relates to a multiple of 4 (i.e. n = a multiple of 4 ± known constant). (1) INSUFFICIENT: This statement does not tell us how n relates to a multiple of 4. If n + 1 is a multiple of 3, then n + 1 could be 3, 6, 9, 12, 15, etc. This means that n could be 2, 5, 8, 11, 14, etc. From the chart, if n = 2 or n = 5, then tn is even. However, if n = 8 or n = 11, then tn is odd. (2) SUFFICIENT: This statement tells us exactly how n relates to a multiple of 4. If n – 1 is a multiple of 4, then n – 1 could be 4, 8, 12, 16, 20, etc. and n could be 5, 9, 13, 17, 21, etc. From the chart (and the continuation of the fourterm pattern), tn must be even. The correct answer is B.
_________________
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



Current Student
Joined: 18 Oct 2014
Posts: 856
Location: United States
GPA: 3.98

Re: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined
[#permalink]
Show Tags
13 Jul 2016, 06:40
Bunuel wrote: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined as \(tn = t_{n1} + n\). If \(t_0 = 3\), is \(t_n\) even?
(1) n + 1 is divisible by 3 (2) n  1 is divisible by 4
Kudos for a correct solution. t0= 3 t1= 3+1= 4 E t2=4+2= 6 E t3= 6+3=9 O t4= 9+4= 13 O We see that there is a sequence of EEOOEEOOEEOOEEOO (1) n + 1 is divisible by 3 n can be 2, 5, 8 and hence it can be E or O Not Sufficient. (2) n  1 is divisible by 4 n can be 5, 9, 13, 17 and it will always be E. Sufficient. B is the answer
_________________
I welcome critical analysis of my post!! That will help me reach 700+



Intern
Joined: 16 Aug 2018
Posts: 29
Concentration: General Management, Strategy

Re: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined
[#permalink]
Show Tags
17 Aug 2018, 20:17
my approach: Tn=T0+n(n+1)/2 this is probably the quickest approach to tackle the problem.




Re: n is an integer such that n ≥ 0. For n > 0, the sequence tn is defined &nbs
[#permalink]
17 Aug 2018, 20:17






