Congruence formulas obtained by counting irreducibles

Michael Lawrence Fredman

Vol. 35 (1970), No. 3, 613–624

DOI: 10.2140/pjm.1970.35.613

Abstract

This paper shows how a cfass of congruence formulas can be generated by generalizing the process of counting irreducibles in polynomial rings. Among the specific applications of the methods in this paper are a solution to the necklace problem, as well as an enumeration of the solutions to certain Diophantine equations.

Mathematical Subject Classification

Primary: 10.40

Secondary: 12.00

Milestones

Received: 30 January 1970

Published: 1 December 1970