Last visit was: 31 May 2026, 10:34 It is currently 31 May 2026, 10:34
Close
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
Your Progress

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.
Close
Request Expert Reply
Confirm Cancel
User avatar
kevincan
User avatar
GMAT Instructor
Joined: 04 Jul 2006
Last visit: 31 May 2026
Posts: 1,849
Own Kudos:
2,735
 [1]
Given Kudos: 232
GRE 1: Q170 V170
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
GRE 1: Q170 V170
Posts: 1,849
Kudos: 2,735
 [1]
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
Triloki
Joined: 26 May 2026
Last visit: 31 May 2026
Posts: 1
Own Kudos:
1
 [1]
Posts: 1
Kudos: 1
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
kevincan
User avatar
GMAT Instructor
Joined: 04 Jul 2006
Last visit: 31 May 2026
Posts: 1,849
Own Kudos:
Given Kudos: 232
GRE 1: Q170 V170
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
GRE 1: Q170 V170
Posts: 1,849
Kudos: 2,735
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Edskore
Joined: 29 Dec 2022
Last visit: 31 May 2026
Posts: 331
Own Kudos:
Given Kudos: 5
Posts: 331
Kudos: 146
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Yes! There's a much cleaner approach. Triloki, your brute-force enumeration actually got the right answer (13), but here's how to think through it faster.

The key constraint isn't just "spend at most $50." It's that Sally can't buy even ONE more flower after purchasing. Since daffodils are cheaper at $1.50, the constraint is: leftover money < $1.50.

So: 4r + 1.5d > 48.5, and 4r + 1.5d ≤ 50 (where r = roses, d = daffodils, both non-negative integers).

1. Multiply everything by 2 to kill the decimal: 8r + 3d > 97, and 8r + 3d ≤ 100.

2. So 8r + 3d can only equal 98, 99, or 100.

3. For each target value, figure out which r values work. Since r and d are non-negative integers, you need (target - 8r) to be divisible by 3 and non-negative.

Case A: 8r + 3d = 100 → need 100 - 8r ≡ 0 (mod 3) → 2r ≡ 1 (mod 3) → r ≡ 2 (mod 3)
Valid values: r = 2, 5, 8, 11 → 4 solutions

Case B: 8r + 3d = 99 → need r ≡ 0 (mod 3)
Valid values: r = 0, 3, 6, 9, 12 → 5 solutions

Case C: 8r + 3d = 98 → need r ≡ 1 (mod 3)
Valid values: r = 1, 4, 7, 10 → 4 solutions

Total: 4 + 5 + 4 = 13. Answer is (B).

The concept here is Diophantine equations — a specific Problem Solving skill the GMAT Focus loves to test with "how many combinations" money problems. Once you multiply to clear fractions and find your modular constraint, each case reduces to a simple counting exercise rather than listing every possibility.

The trap most people fall into is forgetting the "can't buy another flower" constraint applies to the cheapest item. If she had $1.49 left, she still can't buy a daffodil. Worth flagging that in your setup before you start crunching.
Moderator:
Math Expert
110986 posts