Solution 1
2mnp=(m+2)(n+2)(p+2)
Let’s solve for p:
(2mn)p=p(m+2)(n+2)+2(m+2)(n+2)
[2mn−(m+2)(n+2)]p=2(m+2)(n+2)
p=mn−2n−2m−42(m+2)(n+2)=(m−2)(n−2)−82(m+2)(n+2)
Clearly, we want to minimize the denominator, so we test (m−2)(n−2)−8=1⟹(m−2)(n−2)=9. The possible pairs of factors of 9 are (1,9)(3,3). These give m=3,n=11 and m=5,n=5 respectively. Substituting into the numerator, we see that the first pair gives 130, while the second pair gives 98. We now check that 130 is optimal, setting a=m−2, b=n−2 in order to simplify calculations. Since
0≤(a−1)(b−1)⟹a+b≤ab+1
We have
p=ab−82(a+4)(b+4)=ab−82ab+8(a+b)+32≤ab−82ab+8(ab+1)+32=10+ab−8120≤130
Where we see (m,n)=(3,11) gives us our maximum value of 130.
- Note that 0≤(a−1)(b−1) assumes m,n≥3, but this is clear as m+22m=np(n+2)(p+2)>1 and similarly for n.
Solution 2
Similarly as above, we solve for p, but we express the denominator differently:
p=(m+2)(n+2)−4(m+n+2)2(m+2)(n+2)⟹p1=21−(m+2)(n+2)2(m+n+2).
Hence, it suffices to maximize (m+2)(n+2)m+n+2, under the conditions that p is a positive integer.
Then since (m+2)(n+2)m+n+2>21 for m=1,2, we fix m=3.
⟹p1=21−5(n+2)2(n+5)=10(n+2)n−10,
where we simply let n=11 to achieve p=130.
~Generic_Username