## Abstract

We give a deterministic algorithm for finding all primitive representations of a natural number n in the form fu^{2}+gv^{2}where f and g are given positive coprime integers, and n ≥ f + g+ 1, (n, fg) = 1. The running time of this algorithm is at most ≥ (n^{1 4}(logn)^{3}(loglogn)(logloglogn)), uniformly in and g.

Original language | English |
---|---|

Pages (from-to) | 327-343 |

Number of pages | 17 |

Journal | Mathematics of Computation |

Volume | 55 |

Issue number | 191 |

DOIs | |

State | Published - Jul 1990 |

## Fingerprint

Dive into the research topics of 'A deterministic algorithm for solving n = fu^{2}+gv

^{2}in coprime integers u and v'. Together they form a unique fingerprint.