Last visit was: 30 Dec 2024, 08:00 It is currently 30 Dec 2024, 08:00
Decision Tracker
My Rewards
New comers' posts
New posts
Unanswered

Close

GRE Prep 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
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.

Go to My Error Log Learn more
Close

Request Expert Reply

Confirm Cancel
PREVIOUS TOPIC
NEXT TOPIC

Suppose that M and N are positive 2-digit integers and that

Tags :
Find Similar Topics  About  Add a Tag

Show Tags
Hide Tags

User avatar
D
Carcass
Verbal Expert
Joined: 18 Apr 2015
Posts: 30554
Own Kudos [?]: 36906 [6]
Given Kudos: 26108
Send PM
Suppose that M and N are positive 2-digit integers and that [#permalink] New post   07 Aug 2017, 12:21
2
Expert Reply
4
Bookmarks
00:00

Question Stats:

66% (01:24) correct 33% (01:50) wrong based on 124 sessions

Hide Show timer Statistics

Suppose that M and N are positive 2-digit integers and that \(N=\frac{M+5}{2}\). If \(\frac{M}{3}\) is not an integer, what is the largest possible value of N?

enter your value

Show: :: OA
51
avatar
IlCreatore
Director
Director
Joined: 03 Sep 2017
Posts: 518
Own Kudos [?]: 708 [4]
Given Kudos: 0
Send PM
Re: Suppose that M and N are positive 2-digit integers and that [#permalink] New post   25 Sep 2017, 05:55
3
1
Bookmarks


The fact that M/3 is not an integer means that M is not divisible by 3. Thus, we should start from the highest 2-digit number and go back to find the highest possible value of N.
- M=99 -> it's divisible by 3
- M=98 -> not divisible by 3 but N would be 51.5 that is not an integer
- M=97 -> not divisible by 3 and N would be 51.
The highest value of N is 51!
avatar
ajudd22
Intern
Intern
Joined: 21 Jul 2020
Posts: 3
Own Kudos [?]: 3 [0]
Given Kudos: 0
Send PM
Re: Suppose that M and N are positive 2-digit integers and that [#permalink] New post   05 Sep 2020, 11:36
1
I think in this answer you mean to put M= 99, M=98... etc. Otherwise the explanation is very confusing.
avatar
pranab223
Retired Moderator
Joined: 20 Apr 2016
Posts: 1307
Own Kudos [?]: 2281 [0]
Given Kudos: 251
WE:Engineering (Energy and Utilities)
Send PM

Top Member of the Month
Re: Suppose that M and N are positive 2-digit integers and that [#permalink] New post   05 Sep 2020, 23:26
1
ajudd22 wrote:
I think in this answer you mean to put M= 99, M=98... etc. Otherwise the explanation is very confusing.


thanks, I made the correction.
Hope it is clear now :)
User avatar
bumpbot
GRE Prep Club Legend
GRE Prep Club Legend
Joined: 07 Jan 2021
Posts: 5094
Own Kudos [?]: 76 [0]
Given Kudos: 0
Send PM
Re: Suppose that M and N are positive 2-digit integers and that [#permalink] New post   24 Nov 2023, 07:15
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.
Prep Club for GRE Bot
gmatclubot
Re: Suppose that M and N are positive 2-digit integers and that [#permalink]
24 Nov 2023, 07:15
Moderators:
adewale223
GRE Instructor
88 posts
bronaugust
GRE Forum Moderator
37 posts
BrushMyQuant
Moderator
1116 posts
VibhuAnurag
GRE Instructor
234 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Main navigation

Partners

GRE Resources

www.ets.org/gre | About | Terms and Conditions and Privacy Policy | Prep Club for GRE Rules | Contact