So, I have been working on a problem for a while. I am trying to see what sort of maximum and minimum values it can attain. I have for a while conjectured that it attains a maximum value of . I want to see if my proof follows. If anyone is willing to take a look, I would be most appreciative.

Define (Note: the 's are all positive integers, but for not all positive integers produce elements of , so it doesn't span all positive integers).

Claim: where the denominator is an element of .

Proof by induction on .

For , this is simply . Since , it must be that , so . Assume the claim is true for all sets up to . Then, if

, then

We can apply the induction hypothesis to the first term, and for the second term, we know that the bottom is an element of with a minimum value of (since every element of is an element of . And the top is then . So, evaluating this, we get:

. Eliminating the logs from both sides (2 to the power of each side) yields the inequality desired, and hence by induction, proves the claim.

Is this proof correct? Am I overlooking something?