Congratulations to Curt from Reigate College for cracking this tough
nut problem. Here is Curt's solution:
If
, I first assert that for an
, then
is larger than 1
If
then, raising both sides to the power of
yields
. So
is larger than 1 no
matter what the value of
. Therefore, one could make
. As
is always larger than 1,
is always a
positive real number. Now, raising both sides to the power
one
obtains:
(Incidentally,
, therefore
and so
)
As n is an integer larger than one, at least the third term of
expansion must exist. It is clear that:
So
as
and
So
as
.
As a corollary, I will show that
grows smaller for
successive values of
. Assume that for some positive
,
. Now if this is to be true
, therefore
, therefore
,
contrary to our conditions. Therefore the assertion that for some
positive B the value of the function increases is fallacious. This
will prove useful later.
For
etc. we have
and we see that the values increase to a
maximum of
and then start to decrease.
Now to prove that 3 is the value of
pertaining to the maximum of
this discrete function, I will find an
such that
is less that the cube root of 3. From that point
onwards, it is known that for successive values
decreases, therefore beyond this point the value of
decreases; more importantly, is less than
. For
this holds true, as it will for subsequent values. The ïn-between"
values have been checked and are less than
.
If
then