Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T00:24:29.994Z Has data issue: false hasContentIssue false

On Two Conjectures of Chowla

Published online by Cambridge University Press:  20 November 2018

Kenneth S. Williams*
Affiliation:
Carleton University, Ottawa
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.

Let p denote a prime and n a positive integer ≥ 2. Let Nn(p) denote the number of polynomials xn + x + a, a = 1, 2,…, p-l, which are irreducible (mod p). Chowla [5] has made the following two conjectures:

Conjecture 1. There is a prime p0(n), depending only on n, such that for all primes p ≥ p0(n)

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1969