On Two Conjectures of Chowla

Abstract
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)

This publication has 7 references indexed in Scilit: