Return to search

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 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.

Identiferoai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-19506
Date January 2012
CreatorsAhmad, Qadeer
PublisherLinnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM
Source SetsDiVA Archive at Upsalla University
LanguageEnglish
Detected LanguageEnglish
TypeStudent thesis, info:eu-repo/semantics/bachelorThesis, text
Formatapplication/pdf
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.0015 seconds