Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T22:32:40.057Z Has data issue: false hasContentIssue false

Small Solutions of the Congruence ax2 + by2 ≡ c(mod k)

Published online by Cambridge University Press:  20 November 2018

Kenneth S. Williams*
Affiliation:
Carleton University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In 1957, Mordell [3] proved

Theorem. If p is an odd prime there exist non-negative integers x, y ≤ A p3/4 log p, where A is a positive absolute constant, such that

(1.1)

provided (abc, p) = 1.

Recently Smith [5] has obtained a sharp asymptotic formula for the sum where r(n) denotes the number of representations of n as the sum of two squares.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1969