BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Minr Problem Type

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 162
Joined: Sun Aug 09, 2009 4:17 pm
Location: Minnesota
Thanked: 1 times

Minr Problem Type

by EMAN » Sat Nov 14, 2009 2:48 pm
Shaggy has to learn the same 71 hiragana characters, and also has one week to do so; unlike Velma, he can learn as many per day as he wants. However, Shaggy has decided to obey the advice of a study-skills professional, who has advised him that the number of characters he learns on any one day should be within 4 off the number he learns on any other day.

(A) What is the least number of hiragana that Shaggy could have to learn on Saturday?

(B) What is the greatest number of hiragana that Shaggy could have to learn on Saturday?
Top
Source: — Problem Solving |
Master | Next Rank: 500 Posts
Posts: 199
Joined: Sat Oct 24, 2009 4:43 pm
Thanked: 22 times
GMAT Score:710

by palvarez » Mon Nov 16, 2009 1:21 am
min, all others max.

s, s+4

s + 6(s+4) = 71
7s = 47
s = 6 5/7

Pick the ceiling of that integer, so that ceiling(s+4) gets maximized.

floor(6 5/7) = 7

7, 11,11,11,11,10,10,

2. max, all others min

s, s-4

s+6(s-4) = 71
7s = 95
s =13 4/7

pick the floor of s, since floor(s-4) gets minimized.

13, 10, 10,10,10,9,9
Top
Post new topic Post Reply
• Page 1 of 1