Abstract
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 p r ), (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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
