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.
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
30 Jul 2010, 22:53
Kudos
Bookmarks
What is the remainder when the positive integer n is divided by the positive integer k,
where k > 1?
(1) n = (k+1)3
(2) k = 5
Answer is (A) - Need solution
What is the greatest common factor of the positive integers j and k?
(1) k = j + 1
(2) jk is divisible by 5.
Answer is again (A) need solution.
where k > 1?
(1) n = (k+1)3
(2) k = 5
Answer is (A) - Need solution
What is the greatest common factor of the positive integers j and k?
(1) k = j + 1
(2) jk is divisible by 5.
Answer is again (A) need solution.
30 Jul 2010, 23:24
Kudos
Bookmarks
The answer will be A, provided the question says that K>3. Otherwise the answer has to be C. Explanation follows.....
From I, n = 3k+3
Now the remainder when 3k+3 is divided by k is equal to the remainder when 3 is divided by k, since 3k is divisible by k.
So, we need to find the remainder when 3 is divided by k which definitely depends upon the value of k.
Just K>1 is not sufficient...if k=2 the remainder will be 3 and if k=3 the remainder will be 0 and for any value of k greater than 3, the remainder will be 3.
So I alone is not sufficient.
Clearly II alone is also not sufficient.
Combining both I and II, we can conclude the remainder is 3.
So, the answer has to be C.
The answer will be A, provided, the question says that K>3.
Second Question:
From Statement I, it is clear that j and k are consecutive positive integers.
Their GCF must be 1.
So A is the answer.
From I, n = 3k+3
Now the remainder when 3k+3 is divided by k is equal to the remainder when 3 is divided by k, since 3k is divisible by k.
So, we need to find the remainder when 3 is divided by k which definitely depends upon the value of k.
Just K>1 is not sufficient...if k=2 the remainder will be 3 and if k=3 the remainder will be 0 and for any value of k greater than 3, the remainder will be 3.
So I alone is not sufficient.
Clearly II alone is also not sufficient.
Combining both I and II, we can conclude the remainder is 3.
So, the answer has to be C.
The answer will be A, provided, the question says that K>3.
Second Question:
From Statement I, it is clear that j and k are consecutive positive integers.
Their GCF must be 1.
So A is the answer.
mohater
Retired Moderator
Joined: 05 Feb 2008
Last visit: 03 Jan 2020
Posts: 1,823
Own Kudos:
Given Kudos: 234
Status:Accepting donations for the mohater MBA debt repayment fund
Location: United States (CA)
Concentration: Operations, Finance
Schools: Ross '14 (M)
GMAT 1: 710 Q48 V38
GPA: 3.54
WE:Accounting (Manufacturing)
Products:
31 Jul 2010, 05:30
Kudos
Bookmarks
Second one already answered:
what-is-the-greatest-common-factor-of-the-positive-integers-48034.html
posted in the wrong forum.
User warned, thread locked..
what-is-the-greatest-common-factor-of-the-positive-integers-48034.html
posted in the wrong forum.
User warned, thread locked..
