Bill Allombert on Thu, 11 Sep 2008 21:41:50 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: qfrep of binary forms

On Thu, Sep 11, 2008 at 11:39:42AM -0500, Ariel Pacetti wrote:
> Is there an easy way to compute the numbers represented by a binary 
> quadratic form?

I am not sure it will help you, but there is a function qfbsolve()
that check whether a binary quadratic form represent a given prime
number, and how.