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 GRE 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:
Your score will improve and your results will be more realistic
Is there something wrong with our timer?Let us know!
You’ll LOVE this deal – 20% off J-Term Application Packages! (Valid through 17 March 2024). Upon initial inquiry (phone or online), reference GMAT Club code GMATClub20, and the discount will automatically be applied.
Join Manhattan Prep instructor Ryan Starr as he explain the key differences among the exams and how business schools view each test—and help you determine which one may be best for you.
Get the inside scoop on what makes Emory’s Goizueta Business School great and how you can present a strong MBA application. Explore the difference between our One-Year MBA and Two-Year MBA programs, talk to our admissions team, and meet students.
Re: If the remainder is 1, when integer n(n>1) is divided by 3,
[#permalink]
30 Jul 2020, 22:59
1
When n is divided by 3, the remainder is 1. So lets say n is 7, when when divided by 3 gives remainder as 1. Now, according to the equation, (n^2+n-2) 49 + 7 - 2 = 54 Only 18 can divide 54 completely. Thus, answer is D
Re: If the remainder is 1, when integer n(n>1) is divided by 3,
[#permalink]
04 Aug 2020, 12:23
Saraforgre wrote:
n is an integer greater than 1. If the remainder is 1, when n is divided by 3, then (n² + n - 2) must be divisible by which double-digit number?
A. 12 B. 14 C. 16 D. 18 E. 20
If n/3 yields a remainder of 1, then n must be one greater than a multiple of 3. Since the problem specifies that the given equation MUST be divisible by one of the answers choices, we know that we can choose any value that satisfies the criteria.
Let n = 4. (4)^2 + 4 - 2 = 18, so D is clearly the correct answer.
If the remainder is 1, when integer n(n>1) is divided by 3,
[#permalink]
29 Oct 2021, 06:00
2
Saraforgre wrote:
n is an integer greater than 1. If the remainder is 1, when n is divided by 3, then (n² + n - 2) must be divisible by which 2-digit number?
A. 12 B. 14 C. 16 D. 18 E. 20
Approach #1: Test a number For many Integer Properties questions, the fastest and easiest approach is to simply test a value that satisfies the given information. We're told that, when n is divided by 3, the remainder is 1. So it could be the case that n = 4
If n = 4, then n² + n - 2 = 4² + 4 - 2 = 18 Check the answer choices. . . . . . answer choice D is the only option that is a divisor of 18 Answer: D
Approach #2: Apply some algebra When n is divided by 3, the remainder is 1 This means n is 1 greater than some multiple of 3. In other words: n = 3k + 1 (for some integer k)
n² + n - 2 must be divisible by which 2-digit number Since n = 3k + 1, we can determine the value of n² + n - 2 by replacing n with 3k + 1. We get: n² + n - 2 = (3k + 1)² + (3k + 1) - 2 = 9k² + 6k + 1 + 3k + 1 - 2 = 9k² + 9k = 9(k² + k) = 9(k)(k + 1)
At this point, we can see that 9(k)(k + 1) it's definitely divisible by 9. Also recognize that k and k+1 are consecutive integers, which means one of them is ODD and one of them is EVEN. This mean (k)(k + 1) is definitely divisible by 2. Since 9(k)(k + 1) is divisible by 9 and by 2, we can be certain that it is divisible by 18
Re: If the remainder is 1, when integer n(n>1) is divided by 3,
[#permalink]
07 Feb 2023, 17:46
Hello from the GRE Prep Club BumpBot!
Thanks to another GRE Prep 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.