I am trying to maximize the following function
$$ f(m,n) = \frac{m \log 3 + n \log 2}{\sqrt{m^2+n^2}} $$ where $ n $ and $ m $ are integers, not both $ = 0 $, although one could be $ 0 $.
This is not for a class- it's part of a research problem, and this is a "toy" case. I don't have any background in integer programming, especially nonlinear.
I'm hoping for an proof, that doesn't involve writing a computer program to solve it, if possible.