Re: qfbsolve with nonprime p

[Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>]

On Mon, Mar 19, 2018 at 10:17:59PM +0100, Denis Simon wrote:
> Hi,
> 
> The documentation of qfbsolve says that it can solve
> Q(x,y) = p
> for integers x an y when p is a prime number.
> 
> It seems that it also works with p = 1 or -1.
> Is it true ?

It simply does not check whether p is prime, and it happens that
qfbprimeform accepts 1 for p.

If you like, I have have a git branch that allows p to be arbitrary but
there are lots of technicalities.

Cheers,
Bill.