A Theorem on Congruences
DOI:
https://doi.org/10.18311/jims/1953/17027Abstract
Let f(x) denote a polynomial with rational integral coefficients and discriminant D. In this note we prove the theorem that if
f(x) = 0 (mod pr), (1.1)
is solvable for r - δ + 1, where pδ is the highest power of the prime p dividing D, then the congruence is solvable for all r. While this theorem is contained in a more general theorem of Hensel [1, p. 68], a direct proof seems of interest. Also Theorem 1 below is perhaps of interest in itself.
Downloads
Metrics
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 1953 L. Carlitz
This work is licensed under a Creative Commons Attribution 4.0 International License.