Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
|
|
GMAT Club Daily Prep
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.
Dec 1310:00 AM EST
-12:00 PM EST
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Dec 1411:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test.- Dec 15
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Dec 1608:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes!- Dec 17
09:00 AM PST
-10:00 AM PST
Join Manhattan Prep instructor Whitney Garner for a fun—and thorough—review of logic-based (non-math) problems, with a particular emphasis on Data Sufficiency and Two-Parts. - Dec 18
10:00 AM PST
-11:00 AM PST
Here is the essential guide to securing scholarships as an MBA student! In this video, we explore the various types of scholarships available, including need-based and merit-based options.
23 Jul 2017, 19:35
Kudos
Bookmarks
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
(N/A)
Question Stats:
0% (00:00) correct
0%
(00:00)
wrong
based on 2
sessions
History
Date
Time
Result
Not Attempted Yet
Q. n is an integer greater than or equal to 0. The sequence Tn for n>0 is defined by Tn = Tn-1 + n. If T0 = 3, is nth Term, i.e. Tn even ?
1) n+1 is divisible by 3
2) n-1 is divisible by 4
1) n+1 is divisible by 3
2) n-1 is divisible by 4
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
jinxxedreaper
Joined: 10 Apr 2017
Last visit: 25 Mar 2018
Posts: 1
Location: India
Concentration: Leadership, Operations
GMAT 1: 690 Q49 V35
GPA: 4
WE:Manufacturing and Production (Manufacturing)
23 Jul 2017, 19:40
Kudos
Bookmarks
23 Jul 2017, 19:56
Kudos
Bookmarks
amsey1382
Q. n is an integer greater than or equal to 0. The sequence Tn for n>0 is defined by Tn = Tn-1 + n. If T0 = 3, is nth Term, i.e. Tn even ?
1) n+1 is divisible by 3
2) n-1 is divisible by 4
1) n+1 is divisible by 3
2) n-1 is divisible by 4
I tried to solve this.
Testing 1st premise:
If your prepare the list , it will come something like : 3,4,6,9,13,18,24,31,39,48,58,69,81,94,108,123,139,156..
if you notice the sequence become..OEEOOEEOOEEOOEEOO... IF n+1 is divisible by 3 ..n has to be 2,5,8,11,14..term...clearly ,this gives that Tn can be even or odd..so Insufficient.
Testing 2nd premise:
if n-1 is divisible by 4 , term has to be 5,9,13,17,21..and so on...if you notice, this will always give an even number , because sequence OEEO repeats at every 4th term, giving O in every 4th
SO B is sufficient . didn't have OA , that's why posted ?
