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.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-19506 |
| Date | January 2012 |
| Creators | Ahmad, Qadeer |
| Publisher | Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0024 seconds