Fermat's Challenge of composition of numbers

Question

In his letter to Carcavi (August 1659), Fermat mentions the following challenge

There is no number, one less than a multiple of $3$, composed of a square and the triple of another square.

He says that he has solved it using infinite descent. The next problem that he proposes in the same letter is also solved by him using infinite descent (which was discovered in his copy of Diophantus Arithematica).

However, this question is not particularly clear to me, as to what is being asked to prove here. Can anyone please restate it using modern notations and provide a proof using Infinite Descent?

Thanks in advance.

Answer 1

Not entirely sure...but it sounds like the question is "Show that, if $n=3k-1$ then $n$ can not be expressed as $a^2+3b^2$ for integers $a,b$".

But, that is obviously true (as it would imply that $-1$ was a square $\pmod 3$ which it is not).

Answer 2

Infinite Descent is not required.

Well first note that all squares have a form of $3m$ or $3m+1$.

It can be observed that then

$$a^2 + 3b^2 \neq 3k -1$$

See that the RHS is of the form $3k_1+2$.

$3b^2$ is a multiple of 3 so $a^2$ must be of the form $3m+2$ which is not possible.

Answer 3

This letter to Carcavi is not preserved; what we do have is a copy of the main part of the letter made, I think, by Huygens. I believe that Huygens misread Fermat's statement, since Fermat would not have included such a trivial statement in a letter that may be seen as his number theoretical testament. What Fermat probably wrote is that numbers divisible by some prime of the form $3n-1$ cannot be written in the form $x^2 + 3y^2$, and this may be proved by infinite descent in the usual way (see https://mathoverflow.net/questions/88539/sums-of-rational-squares).