I solved the question above from the quant practice set using a pattern approach. I am not sure if my logic violates exponent rules. I arrived at the same answer in the answer key but it’s very involved to follow through to get it right. Here is my approach below:
I see, thanks! I was approaching it from the input-output point of view as a function, but I see how that can be a tricky approach and not be a generalization.
Wanted to float another approach to solving this here rather than create a new thread.
I only used the x^{4}+y^{4} = 100 equation. I just kept taking a difference of squares until I got x+y.
Full disclosure, the I did the second half of the page after I saw that the solution included x+y = -/sqrt{10}. The idea is you factor out the -1 from each term and let it cancel out.
Looks like a nice and creative approach to me - you do need to know what you’re doing (eg ignoring x^2 + y^2 = -10), but that’s also the case with the reference solution.
This suggests that, in this case, (a + b)^n = a^n + b^n, which can only happen if all the “middle terms” (in the binomial expansion) sum to zero. Since we know that a, b \geq 0, then it must be the case that either a or b equals 0. The rest follows trivially from here.
I think the point is that (both actually) the solution is exploiting symmetry (not as rigorous as it could be, as you pointed out - but it’s still a nice approach). Admittedly risky given that it’s QC, but I would classify this as “OK as long as you know what you’re doing”.
Your binomial solution is even more elegant though.
I’m going to be honest here. I am not a fan of the solution here. I don’t think it does a good job explaining why the only possible solutions to try are (x, y) = (0, ±(10)^1/2) and (x,y) = (±(10)^1/2), 0).
I think a cleaner way to see the answer is:
set a = x^4 and b = y^4 to end up with the system of equations:
a + b = 10^2
a^25 + b^25 = (10^2)^25
realize that with the constraint a+b = 10^2, it is impossible to make a^25 + b^25 = (a+b)^25 = (10^2)^25 with nonzero a and b. You realize this by applying binomial theorem and that with a, b such that 0 < a, b < 10^2, the binomial expansion of (a+b)^25 will always have nonzero coefficients in front of all the inner a^m * b^n terms meaning that a^25 + b^25 + … = (a+b)^25 → a^25 + b^25 < (a+b)^25 unless a or b equals exactly 0
try out all the ordered pairs setting a or b = 0
(a,b) = (0, 10^2), (a,b) = (10^2, 0)
and use those to find the only possible ordered pairs for x and y
(x, y) = (0, ±(10)^1/2) and (x,y) = (±(10)^1/2), 0)
realize that summing |x| + |y| = sqrt(10) < 4 in all those cases and thus x+b < 4
edit… just realized cylverixxx basically said the same thing but in more elegant latex lol
You mean the reference solution (i.e, as published on the website)? Can you explain the issue you’re seeing with it?
While the binomial solution is elegant, it has a problem in that it is out-of-scope for the GRE. That being said, it should be possible to refactor it in such a way that it works for the GRE.