CUBIC CONGRUENCE EQUATIONS
Let Nm(f(x)) denote the number of solutions of the congruence equation f(x)≡0 (modm), where m≥2 is any composite integer and f(x) is a cubic polynomial. In this thesis, we use different theorems and corollaries to find a number of solutions of the congruence equations without solving then we also co...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM
2012
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-19506 |
| Summary: | Let Nm(f(x)) denote the number of solutions of the congruence equation f(x)≡0 (modm), where m≥2 is any composite integer and f(x) is a cubic polynomial. In this thesis, we use different theorems and corollaries to find a number of solutions of the congruence equations without solving then we also construct the general expression of corresponding congruence equations to demonstrate the solutions of the equations. In this thesis, we use Mathematica software as a tool. |
|---|