**2014 SMO (Junior-Rd1) 28.** If both and are positive integers, find the maximum value of .

The first step looks like we should **assign some variable to and then square it in the hope of finding some relationship that constrains **. We have 2 choices: we can either set

,

or since we know that must definitely be bigger than , we could set

,

where is some positive integer. Even though the 2nd option seems to incorporate more information, I don’t think that the 2nd option is always the best– sometimes the 1st option allows us to take advantage of some symmetry in the problem. **One way to evaluate which option is better is to try both and see where each one leads after a few steps**.

Squaring option 1, we get

We could treat the above as a quadratic equation in and say that the discriminant must be a perfect square, but the discriminant seems quite large to work with.

Squaring option 2, we get

This looks promising: since we are supposed to find the maximum value of , we just have to maximise the fraction on the right.

**When trying to maximise fractions, look at how the numerator and denominator respond to a change in the variables.** **If increases, does the numerator increase as well? How about the denominator?** For this problem things seem to work out: when increases, the numerator grows larger and the denominator grows smaller, which means both numerator and denominator are working together to make the RHS bigger. Hence, we just need to find the largest possible value of to get the largest possible value of .

Since is positive, the RHS must be positive too. The numerator is definitely positive, hence the denominator must be positive, i.e. , or . can’t be 101 as it results in a value of that is not an integer. The next largest possible value for is 100, which results in

.

A quick check shows that indeed, is valid:

Thus the maximum value for is **2,500**.

### Like this:

Like Loading...

*Related*