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.
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:
MBA Applications is hard and often a numbers game. Join Souvik to learn about how to be more efficient in your application and submit not 1 or 2 but 10 applications in a single round.
Join Malvika Kumar, Asst. Director (Admissions) IESE, to learn about the career prospects and more. Understand how an MBA from IESE can help transform your career by developing essential managerial skills such as leadership, data-driven decision making.
Whether you’re putting the finishing touches on your Round 1 application or you’re just getting started on your application for Round 2, this online chat will provide all of the insider tips and advice you need to help you prepare!
Working in collaboration with examPAL we will provide you with a unique online learning experience which will help you reach that higher score. Start your free 7 day trial today.
GMAT Club Presents MBA Spotlight October 2020 - a dedicated Business School MBA Fair that brings MBA applicants and World’s Top Business Schools together for a fun and unique experience of live presentations, Q&A, and prizes!
For a positive integer n, what is the remainder when n(n+1) is divided
[#permalink]
Updated on: 19 Apr 2020, 06:21
1
Top Contributor
Expert Reply
3
Bookmarks
MathRevolution wrote:
For a positive integer n, what is the remainder when n(n+1) is divided by 12?
1) n is divisible by 3. 2) n is divisible by 4.
Target question:What is the remainder when n(n+1) is divided by 12?
Statement 1: n is divisible by 3 Let's TEST some values. There are several values of n that satisfy statement 1. Here are two: Case a: n = 3, in which case n(n+1) = 3(3+1) = 12. Here, 12 divided by 12 leaves remainder 0 Case b: n = 6, in which case n(n+1) = 6(6+1) = 42. Here, 42 divided by 12 leaves remainder 6 Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT
Statement 2: n is divisible by 4 There are several values of n that satisfy statement 2. Here are two: Case a: n = 4, in which case n(n+1) = 4(4+1) = 20. Here, 20 divided by 12 leaves remainder 8 Case b: n = 8, in which case n(n+1) = 8(8+1) = 72. Here, 72 divided by 12 leaves remainder 0 Since we cannot answer the target question with certainty, statement 2 is NOT SUFFICIENT
Statements 1 and 2 combined Statement 1 tells us that n is divisible by 3 Statement 2 tells us that n is divisible by 4 COMBINED, we know that n is divisible by 12. If n is divisible by 12, then we can be certain that (n)(n+1) is divisible by 12. If (n)(n+1) is divisible by 12, then (n)(n+1) divided by 12 will leave remainder 0 Since we can answer the target question with certainty, the combined statements are SUFFICIENT
Re: For a positive integer n, what is the remainder when n(n+1) is divided
[#permalink]
03 Oct 2016, 13:34
ques- For a positive integer n, what is the remainder when n(n+1) is divided by 12? 1) n is divisible by 3. 2) n is divisible by 4.
answer-
when N is divisible by 3, then N is a multiple of 3 (N can be 3,6,9,12...etc) so this case can have both situations where N(N+1) is divisible by 12 and not divisible by 12. For example- let N=3, thus 3*4 is divisible by 12, but if N=6 then 6*7 is not divisible by 12. we are not certain what the remainder will be. It can either be Zero or any other number
this statement is NOT SUFFICIENT. Thus we can eliminate choices A and D. we are now left with choices B,C,E
following the same above approach for statement 2 when N is divisible by 4, we can have two situations where N(N+1) is divisible by 12 ( for N=8) but N(N+1) is not divisible by 12 (for N=4,16..etc). thus again we are not certain what will be the remainder. it can either be Zero or any other number
So this statement is also NOT SUFFICIENT. We can eliminate choice B. 2 choices are left-C,E
now if we are given N is divisible by both 3 and 4, then N is a multiple of 12. Thus, N(N+1) is divisible by 12. now we are certain about the remainder ANswer is C _________________
Re: For a positive integer n, what is the remainder when n(n+1) is divided
[#permalink]
06 Oct 2016, 04:42
Expert Reply
==> In the original condition, there is 1 variable (n), so D is highly likely to be the answer. In the case of 1), if =3, n(n+1)=12 with the remainder of 0,and if n=6, n(n+1)=42=12*3+6 with the remainder of 6, hence not sufficient. In the case of 2), if n=4, n(n+1)=20=12*1+8 with the remainder of 8, if n=8, n(n+1)=72=12*6 with the remainder of 0, hence not sufficient. Through 1) & 2), n=12, 24, 36… all have the remainder of 0, hence unique, and sufficient. C is the answer. Answer: C _________________
Re: For a positive integer n, what is the remainder when n(n+1) is divided
[#permalink]
01 Aug 2020, 22:28
MathRevolution wrote:
For a positive integer n, what is the remainder when n(n+1) is divided by 12? 1) n is divisible by 3. 2) n is divisible by 4.
Asked: For a positive integer n, what is the remainder when n(n+1) is divided by 12? 1) n is divisible by 3. n = 3k n(n+1) = 3k(3k+1) = 9k^2 + 3k The remainder when n(n+1) is divided by 12 = {0, 6} NOT SUFFICIENT
2) n is divisible by 4. n = 4k n(n+1) = 4k(4k + 1) = 16k^2 + 4k The remainder when n(n+1) is divided by 12 = 4k(k+1) = {8,0} NOT SUFFICIENT
(1) + (2) 1) n is divisible by 3. n = 3k n(n+1) = 3k(3k+1) = 9k^2 + 3k The remainder when n(n+1) is divided by 12 = {0, 6} 2) n is divisible by 4. n = 4k n(n+1) = 4k(4k + 1) = 16k^2 + 4k The remainder when n(n+1) is divided by 12 = 4k(k+1) = {8,0} Combining, we get The remainder when n(n+1) is divided by 12 = 0 SUFFICIENT
In view of challenges brought about by the coronavirus pandemic, MIT SLOAN will allow candidates for the 2020-21 admission cycle to submit their application without the test and review their submitted material as is and without negative inferences. If admitted, candidates will not be required to take a test. MIT Sloan Discussion...
GMAT ONLINE - CHANGE OF POLICIES SEPT 23
GMAT ONLINE Rules are changing on Sept 23: - 1 Retake is allowed - Price is going up to $250 - Change and reschedule Fees are Back - Tests now count towards lifetime and annual test limits