 It is currently 30 Sep 2020, 20:39 ### 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

we will pick new questions that match your level based on your Timer History

Track

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. # m is a three-digit integer such that when it is divided by  Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS: Founder  Joined: 18 Apr 2015
Posts: 13432
Followers: 292

Kudos [?]: 3418  , given: 12318

m is a three-digit integer such that when it is divided by [#permalink]
1
KUDOS
Expert's post 00:00

Question Stats: 60% (01:40) correct 39% (02:16) wrong based on 56 sessions

m is a three-digit integer such that when it is divided by 5, the remainder is y, and when it is divided by 7, the remainder is also y. If y is a positive integer, what is the smallest possible value of m?

[Reveal] Spoiler: OA
106

_________________

Need Practice? 20 Free GRE Quant Tests available for free with 20 Kudos
GRE Prep Club Members of the Month: Each member of the month will get three months free access of GRE Prep Club tests. GRE Instructor Joined: 10 Apr 2015
Posts: 3841
Followers: 149

Kudos [?]: 4513  , given: 69

Re: m is a three-digit integer such that when it is divided by [#permalink]
4
KUDOS
Expert's post
Carcass wrote:
m is a three-digit integer such that when it is divided by 5, the remainder is y, and when it is divided by 7, the remainder is also y. If y is a positive integer, what is the smallest possible value of m?

[Reveal] Spoiler: OA
106

There's a nice rule that say, "If N divided by D equals Q with remainder R, then N = DQ + R"
For example, since 17 divided by 5 equals 3 with remainder 2, then we can write 17 = (5)(3) + 2
Likewise, since 53 divided by 10 equals 5 with remainder 3, then we can write 53 = (10)(5) + 3

When m is divided by 5, the remainder is y
So, m = 5k + y for some integer k

When m is divided by 7, the remainder is y
So, m = 7j + y for some integer j

Since both equations are set to equal m, we can write: 5k + y = 7j + y
Subtract y from both sides to get: 5k = 7j
Well, 5k represents a multiple of 5, and 7j represents a multiple of 7
So, what's the smallest 3-digit number that is a multiple of 5 AND a multiple of 7?

The smallest 3-digit number is 100
100 is a multiple of 5, but it's NOT a multiple of 7

Next we have 105
105 is a multiple of 5, AND it's a multiple of 7
Now be careful. This does NOT mean that m = 105

When we divide 105 by 5 we get a remainder of 0, but we're told that the remainder (y) is a POSITIVE INTEGER.
To MINIMIZE the value of m, we need a super small remainder.
The smallest possible non-zero remainder is 1.
105 + 1 = 106

So, 106 is the smallest possible 3-digit value of m.

RELATED VIDEO

_________________

Brent Hanneson – Creator of greenlighttestprep.com
If you enjoy my solutions, you'll like my GRE prep course.  Intern Joined: 14 Jun 2018
Posts: 36
Followers: 0

Kudos [?]: 9  , given: 100

Re: m is a three-digit integer such that when it is divided by [#permalink]
1
KUDOS
GreenlightTestPrep wrote:
Carcass wrote:
m is a three-digit integer such that when it is divided by 5, the remainder is y, and when it is divided by 7, the remainder is also y. If y is a positive integer, what is the smallest possible value of m?

[Reveal] Spoiler: OA
106

There's a nice rule that say, "If N divided by D equals Q with remainder R, then N = DQ + R"
For example, since 17 divided by 5 equals 3 with remainder 2, then we can write 17 = (5)(3) + 2
Likewise, since 53 divided by 10 equals 5 with remainder 3, then we can write 53 = (10)(5) + 3

When m is divided by 5, the remainder is y
So, m = 5k + y for some integer k

When m is divided by 7, the remainder is y
So, m = 7j + y for some integer j

Since both equations are set to equal m, we can write: 5k + y = 7j + y
Subtract y from both sides to get: 5k = 7j
Well, 5k represents a multiple of 5, and 7j represents a multiple of 7
So, what's the smallest 3-digit number that is a multiple of 5 AND a multiple of 7?

The smallest 3-digit number is 100
100 is a multiple of 5, but it's NOT a multiple of 7

Next we have 105
105 is a multiple of 5, AND it's a multiple of 7
Now be careful. This does NOT mean that m = 105

When we divide 105 by 5 we get a remainder of 0, but we're told that the remainder (y) is a POSITIVE INTEGER.
To MINIMIZE the value of m, we need a super small remainder.
The smallest possible non-zero remainder is 1.
105 + 1 = 106

So, 106 is the smallest possible 3-digit value of m.

RELATED VIDEO

How could i know which numbers i should use in general? What is your strategy of restricting the range of possible values for this problem? Founder  Joined: 18 Apr 2015
Posts: 13432
Followers: 292

Kudos [?]: 3418  , given: 12318

Re: m is a three-digit integer such that when it is divided by [#permalink]
3
KUDOS
Expert's post
This question is quite tricky.

However, 99% of the time, the more a tricky question is, the more there is always a shortcut or at a closer inspection a solution is suddenly behind the curve.

Reading carefully the stem, it says that you have to consider a 3 digit integer number and you have to find the least possible value.

So, a 3 digit number at least is 100. Now, you do also know that when it is divided by 5 y is the remainder and when it is divided by 7 is yet y the remainder, which means is the same number.

A common number that divides evenly 7 and 5 is 105. 105 divided by 5 AND 7 has no rest or reminder. From this is easy to think that a number divided by both 5 and 7 with the same reminder y, for instance, the reminder is 1, is 106.

106 is the least number with 3 digits you can have when you divide it by 5 and 7.

Hope this helps
_________________

Need Practice? 20 Free GRE Quant Tests available for free with 20 Kudos
GRE Prep Club Members of the Month: Each member of the month will get three months free access of GRE Prep Club tests. Intern  Joined: 04 May 2017
Posts: 36
Followers: 0

Kudos [?]: 29  , given: 6

Re: m is a three-digit integer such that when it is divided by [#permalink]
1
KUDOS
We have m=5a+y=7b+y where 0<y<5 -> m=35c+y where 0<y<5 (hence min y = 1).

Note that 35*3=105 -> m=35*3+1=106.
_________________

Do not pray for an easy life, pray for the strength to endure a difficult one - Bruce Lee Re: m is a three-digit integer such that when it is divided by   [#permalink] 10 Jul 2018, 02:50
Display posts from previous: Sort by

# m is a three-digit integer such that when it is divided by  Question banks Downloads My Bookmarks Reviews Important topics  Powered by phpBB © phpBB Group Kindly note that the GRE® test is a registered trademark of the Educational Testing Service®, and this site has neither been reviewed nor endorsed by ETS®.