[seqfan] Re: a Diophantine equation

[Max Alekseyev]

On Wed, Nov 12, 2008 at 4:21 AM, Max Alekseyev <maxale at gmail.com> wrote:

> I also confirm that Jack Brennen's solutions are complete for n up to 22.
> The following addition makes the solutions complete for n up to 30:
>
> 23! = 2 * 83545862400 * 154717516800
> 24! no solutions
> 25! no solutions
> 26! = 2 * 134316040320000 * 1501278105600
> = 2 * 12817284480000 * 15732328550400
> = 2 * 16354735488000 * 12329501184000
> = 2 * 1117404288000 * 180459062784000
> 27! = 2 * 42237882086400 * 128899330560000
> 28! no solutions
> 29! no solutions
> 30! no solutions

Further solutions:

31! = 2 * 10212294652560000 * 402595054977024000
32! no solutions
33! no solutions
34! = 2 * 4516751526819840000 * 32681983643172864000
35! no solutions
36! no solutions
37! no solutions

Max