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:

Ah, you are right. I have omitted one additional step.

Group the a's together and group the numbers together to get: ka + k(k-1)/2 Factor out a k. k(a+ (k-1)/2) For this to be divisible by k, (a + (k-1)/2) must be a integer. So therefore k must be odd, otherwise the (k-1)/2) term would be a fraction...

Is k2 odd? (1) k - 1 is divisible by 2. (2) The sum of k consecutive integers is divisible by k.

Question Is k^2 odd?

Stmt1: k-1 is divisible by 2.

(k-1)/2 = m where m is some integer k-1 = 2m k = 2m+1. Now this is the equation of any odd number

Hence k is odd. Therefore k^2 is odd. Sufficient.

Stmt2: The sum of k consecutive integers is divisible by k sum = k(k+1)/2 Sum/k = m where m is some integer k(k+1)/2k = m (k+1)/2 = m k=2m-1. This again represents odd number.

Hence k is odd. Therefore k^2 is odd. Sufficient.

OA D
_________________

My dad once said to me: Son, nothing succeeds like success.

I would like to point out a small possible improvement in your analysis, which is otherwise on track.

The sum of k consecutive integers is not k(k+1)/2. This is the expression for the sum of the first k natural numbers. Example: The sum of three consecutive integers 50,51,and 52 is not 3(3+1)/2.

The expression for the sum of k consecutive integers is ak + k(k-1)/2, where a is the first number and k is the number of terms. In this question, you may have assumed that k consecutive integers can also be n consecutive natural numbers and so used the expression k(k+1)/2.

The OA is (D) as explained by cellydan
_________________

Is k2 odd? (1) k - 1 is divisible by 2. (2) The sum of k consecutive integers is divisible by k.

Question Is k^2 odd?

Stmt1: k-1 is divisible by 2.

(k-1)/2 = m where m is some integer k-1 = 2m k = 2m+1. Now this is the equation of any odd number

Hence k is odd. Therefore k^2 is odd. Sufficient.

Stmt2: The sum of k consecutive integers is divisible by k sum = k(k+1)/2 Sum/k = m where m is some integer k(k+1)/2k = m (k+1)/2 = m k=2m-1. This again represents odd number.

Is k2 odd? (1) k - 1 is divisible by 2. (2) The sum of k consecutive integers is divisible by k.

Question Is k^2 odd?

Stmt1: k-1 is divisible by 2.

(k-1)/2 = m where m is some integer k-1 = 2m k = 2m+1. Now this is the equation of any odd number

Hence k is odd. Therefore k^2 is odd. Sufficient.

Stmt2: The sum of k consecutive integers is divisible by k sum = k(k+1)/2 Sum/k = m where m is some integer k(k+1)/2k = m (k+1)/2 = m k=2m-1. This again represents odd number.

Hence k is odd. Therefore k^2 is odd. Sufficient.

OA D

Both statements imply that k is an integer.

Is k^2 odd?

(1) k - 1 is divisible by 2 --> \(k-1=even\) --> \(k=even+1=odd=integer\) --> \(k^2=odd^2=odd\). Sufficient.

(2) The sum of k consecutive integers is divisible by k. Here k must be a positive integer because otherwise the statement does not make sense.

Properties of consecutive integers: • If n is odd, the sum of n consecutive integers is always divisible by n. Given \(\{9,10,11\}\), we have \(n=3=odd\) consecutive integers. The sum is 9+10+11=30, which is divisible by 3. • If n is even, the sum of n consecutive integers is never divisible by n. Given \(\{9,10,11,12\}\), we have \(n=4=even\) consecutive integers. The sum is 9+10+11+12=42, which is NOT divisible by 4.

The statement says that the sum of k consecutive integers is divisible by k, which, according to the above means that k is odd, therefore \(k^2=odd^2=odd\). Sufficient.

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.
_________________

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.
_________________

Here we need to get i k is even/odd Statement 1 (k-1)/2=integer hence k-1=2m for some integer m k=2m+1=> odd hence sufficient Statement 2 Here we can use a simple Rule =>

SUM OF N CONSECUTIVES IS DIVISIBLE BY N FOR N BEING ODD AND NEVER DIVISIBLE BY N FOR N BEING EVEN

Hence K must be odd Alternatively, Since consecutives inters form an AP mean = median It is given that mean = integer so median => integer too hence number of terms must be odd hence K is odd

(1) k - 1 is divisible by 2. (2) The sum of k consecutive integers is divisible by k.

FROM STATEMENT - I( SUFFICIENT )

Since, k - 1 is divisible by 2 ; k must be Odd because -

Odd - 1 = Even ( Which is divisible by 2 )

FROM STATEMENT - II( SUFFICIENT )

Test using numebrs...

Sum of 2 consecutive integers is 3 ( which is not divisible by 2 ) Sum of 3 consecutive integers is 6 ( which is divisible by 3 ) Sum of 4 consecutive integers is 10 ( which is not divisible by 4 ) Sum of 5 consecutive integers is 15 ( which is divisible by 5 )

So, we can safely conclude k = Odd...

And \(Odd^2\) = Odd Thus, EACH statement ALONE is sufficient to answer the question asked, answer will be (D).... _________________

Thanks and Regards

Abhishek....

PLEASE FOLLOW THE RULES FOR POSTING IN QA AND VA FORUM AND USE SEARCH FUNCTION BEFORE POSTING NEW QUESTIONS

PROMPT ANALYSIS K is a natural number of the form 2n (even) or 2n+1 (odd)

SUPERSET The answer will be either YES or NO.

TRANSLATION In order to find the value, we need: Exact value of k. Any equation to solve for k. Any characteristics of k.

STATEMENT ANALYSIS

St 1: if k is 2n, k-1 is 2n -1 which odd and hence cannot be divisible by 2. If k is 2n+1, k-1 is 2n, which is even, hence divisible by 2. Therefore k is odd. SUFFICIENT. Hence option b, c, e eliminated.

St 2: let us take the following set:a, a+1, a+2,a+3 ………. a+k -1. Sum is equal to ka + k(k-1)/2 When sum is divided by k we get a +(k-1)/2. For the expression to be an integer, k-1 has to be even, hence k is odd. SUFFICIENT, hence option a is rejected.

There’s something in Pacific North West that you cannot find anywhere else. The atmosphere and scenic nature are next to none, with mountains on one side and ocean on...

This month I got selected by Stanford GSB to be included in “Best & Brightest, Class of 2017” by Poets & Quants. Besides feeling honored for being part of...

Joe Navarro is an ex FBI agent who was a founding member of the FBI’s Behavioural Analysis Program. He was a body language expert who he used his ability to successfully...