Difference between revisions of "Polynomial congruences"
(Created page with "'''Polynomial Congruences''' are congruences in the form <cmath>f(x) \equiv 0 \pmod {m}</cmath> where <math>f(x)</math> is an arithmetic function whose range is the inte...") |
m (→See Also) |
||
| Line 12: | Line 12: | ||
{{stub}} | {{stub}} | ||
| − | [[Category: | + | [[Category:Definition]] |
Revision as of 20:34, 18 January 2025
Polynomial Congruences are congruences in the form
![\[f(x) \equiv 0 \pmod {m}\]](http://latex.artofproblemsolving.com/1/5/5/155003e2c4a7d9491adc7609f91ef131b648b195.png)
where 
is an arithmetic function whose range is the integers and 
is an integer.
To solve polynomial congruences, we use a result called Hensel's Lemma.
See Also
This article is a stub. Help us out by expanding it.
