1 | initial version |

Sage code which wraps some fast Pari functions and implements a fast solver from Will Jagy

('Conway_positive_primitive' and 'Conway_positive_all') can be found at [1].

The main function combines several important cases in a single function:

```
represented_by_binaryQF(
a, b, c, # the coefficients
M, # limit
primitively, # default false
prime, # default false
verbose # default true
)
```

See the many examples given there.

[1] http://oeis.org/wiki/User:Peter_Luschny/BinaryQuadraticForms

2 | No.2 Revision |

Sage code which wraps some fast Pari functions and implements a fast solver from Will Jagy

('Conway_positive_primitive' and 'Conway_positive_all') can be found at [1].

The main function combines several important cases in a single function:

```
represented_by_binaryQF(
a, b, c, # the coefficients
M, # limit
primitively, # default false
prime, # default false
verbose # default true
)
```

See the many examples given there.

[1] http://oeis.org/wiki/User:Peter_Luschny/BinaryQuadraticForms

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.