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: | Ahmad, Qadeer |
---|---|
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 |
Similar Items
-
The least common multiple of consecutive terms in a cubic progression
by: Zongbing Lin, et al.
Published: (2020-02-01) -
On the number of unit solutions of cubic congruence modulo n
by: Junyong Zhao
Published: (2021-09-01) -
A remark for Gauss sums of order 3 and some applications for cubic congruence equations
by: Ge, W., et al.
Published: (2022) -
The Commutator of Fuzzy Congruences in Universal Algebras
by: Gezahagne Mulat Addis, et al.
Published: (2021-04-01) -
Fanny Hensel's <em>Das Jahr</em>: Emergent Meaning at the Intersection of Textual, Visual, and Aural Modalities
by: Clavere, Lindsay Gray
Published: (2019)