Re: qfrep of binary forms

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

To: pari-users@list.cr.yp.to
Subject: Re: qfrep of binary forms
From: Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr>
Date: Thu, 11 Sep 2008 21:35:03 +0200
Delivery-date: Thu, 11 Sep 2008 21:41:50 +0200
In-reply-to: <alpine.DEB.1.00.0809111136550.7258@lab10.ma.utexas.edu>
Mail-followup-to: pari-users@list.cr.yp.to
Mailing-list: contact pari-users-help@list.cr.yp.to; run by ezmlm
References: <513125605036439C8082D602BE10A177@estrella> <48BFB103.5050205@t-online.de> <alpine.DEB.1.00.0809111136550.7258@lab10.ma.utexas.edu>
User-agent: Mutt/1.5.13 (2006-08-11)

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.

Cheers,
Bill.

References:
- Re: Readline
  - From: Annette/Gottfried <Annette.Warlich@t-online.de>
- qfrep of binary forms
  - From: Ariel Pacetti <apacetti@math.utexas.edu>

Prev by Date: qfrep of binary forms
Next by Date: Re: qfrep of binary forms
Previous by thread: qfrep of binary forms
Next by thread: Re: qfrep of binary forms
Index(es):
- Date
- Thread