You can absolutely solve this by elimination. Let me walk you through how.
First,
infinity?
Not possible. x and y are just numbers between
0 and
25. You'll always get a finite answer. Gone.
That leaves
29,600,
337,500, and
400,000. Now we need to figure out which one is the maximum.
If you don't know any optimization principle, what would you naturally try? One of two things:
"y is being cubed, that's powerful, let me give almost everything to y."Okay, let's try that. And this is very easy to compute:
x =
1, y =
24: f =
1 ×
13,824 =
13,824x2 became
1, and
1 times anything is just... that thing. We basically threw x away. That clearly didn't work.
"Okay then, let me just split it equally." x =
12, y =
13: f =
144 ×
2,197 =
316,368Now that's way better! We're already close to
337,500.
So look at what we just learned from two tries. Giving almost everything to y was a disaster because x died. Splitting equally was pretty strong because both contributed. But y is still the more powerful one (cubed vs squared), so maybe y deserves a
little more than equal?
From 12/13, slide a little toward y. And go for clean numbers that are easy to compute:
x =
10, y =
15: f =
100 ×
3,375 =
337,500 ✓ that matches an option!
Check one neighbor to confirm:
x =
9, y =
16: f =
81 ×
4,096 =
331,776 ← went down
We're at the peak.
400,000 is unreachable.
✓
Maximum = 337,500But Why Did 10 and 15 Turn Out to Be the Sweet Spot?No formula needed. It's pure logic.
Look at what x2y3 actually means when you expand it:
x2 × y3 =
x × x ×
y × y × yThat's x showing up
2 times and y showing up
3 times.
5 appearances total.
You have
25 to split. If you spread it fairly across all
5 appearances, each one gets
25 ÷
5 =
5.
x shows up 2 times → x = 2 × 5 = 10y shows up 3 times → y = 3 × 5 = 15That's it. y gets more not because of some optimization formula, but because y literally shows up more times in the multiplication. It's just fair distribution.
Answer: Minimum = 0, Maximum = 337,500 dp1234
egmatFound that that you have arrived at optimization principle using the calculus. The process would take a lot of time and also calculus is not part of gmat scope. So i think best way to arrive at Max value is by eliminating options. OR is there any generalist optimization priniciple/logic ? IMO remembering so many specific cases would not be practical.