Issue |
Wuhan Univ. J. Nat. Sci.
Volume 29, Number 5, October 2024
|
|
---|---|---|
Page(s) | 391 - 396 | |
DOI | https://doi.org/10.1051/wujns/2024295391 | |
Published online | 20 November 2024 |
Mathematics
CLC number: O156
Counting the Unit Solutions of Certain Quartic Diagonal Congruence Modulo n
一类模n四次对角同余方程的单位解的个数
1
School of Mathematics and Physics, Nanyang Institute of Technology, Nanyang 473004, Henan, China
2
School of Science, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
† Corresponding author. E-mail: hushuangnian@163.com
Received:
6
May
2024
Given a positive integer and the residue class ring , we set to be the group of units in, i.e., . Let be the number of solutions of with . In this note, we determine an explicit expression of . This extends the results of Sun and Yang in 2014.
摘要
给定正整数和剩余类环, 记为中所有单位构成的群。设表示, 的解的个数, 本文给出了的一个明确表达式, 这推广了孙和杨于2014年给出的结论。
Key words: quartic diagonal congruence / character sums / units solutions
关键字 : 四次对角同余方程 / 特征和 / 单位解
Cite this article: ZHAO Junyong, HU Shuangnian, YIN Qiuyu. Counting the Unit Solutions of Certain Quartic Diagonal Congruence Modulo n[J]. Wuhan Univ J of Nat Sci, 2024, 29(5): 391-396.
Biography: ZHAO Junyong, male, Ph. D., Lecturer, research direction: number theory. E-mail: jyzhao_math@163.com
Fundation item: Supported by the Natural Science Foundation of Henan Province (232300420123), the National Natural Science Foundation of China (12026224)
© Wuhan University 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
0 Introduction
Let be a positive integer and be the residue classes ring modulo .We set to be the set of units in , i.e., , and let . For , we set to be the radical of , i.e., is the product of all distinct prime factors of . For any prime number , we set to be the -adic valuation of Let , in 1926, Brauer[1] derived an explicit expression of
The results in Ref. [1] answered a problem in Ref. [2]. Sun and Yang[3], in 2014, extended Brauer's theorem in Ref. [1] by deriving a more explicit expression for the number of solutions of the following diagonal congruence
For the diagonal quadratic congruence, Ramy[4] derived an expression for the number of solutions of
These results generalized the theorem of Yang and Tang[5]. For the following cubic congruence
Chowla et al[6] presented an explicit expression for the number of zeros of the above cubic congruence when is prime, and . In addition, Hu et al[7] gave a formula for the number of solutions of the cubic diagonal equation over finite field.
Naturally, we ask for the number of solutions of the following quartic congruence:
where We will investigate some special cases of the above congruence in this note, mainly focusing on their unit solutions. That is, we study the following congruence:
We set to be the number of solutions of (1) and we will present the formulas of . Explicitly, we have the following two main results.
Theorem 1 Let be a positive integer and be an odd prime. Then the following statements are true.
1) Let , we have
and for every , we have
(i) if, then
(ii) if, then
whereis uniquely determined by .
2) Let, then
whereandis the quadratic character of.
Corollary 1 Let be an odd integer and be a positive integer. Then
wherewas obtained in Theorem 1.
The note is organized as follows. In Section 1, we present some preliminary lemmas. Then, we give the proofs of Theorem 1 and Corollary 1 in Section 2.
1 Preliminaries
In this section, we always set as an odd prime integer. Let be a finite set, we denote the number of elements of by . For each integer, we set to be the element in the ring with We define Let be complex numbers. For any positive integer , we denote the -elementary symmetrical polynomial of by , i.e.,
In the following, we will present some lemmas which are needed in the proofs of our results.
Lemma 1[8] Letbe pairwise relatively prime andLetbe the number of solutions of and letbe the number ofsolutions of. Then
Lemma 2[8] Letthen
Next, we present the following famous theorem[9].
Lemma 3[9] In the notation of above statement, thenare theroots of equationif, or the roots of equation if,whereis uniquely determined byandis a primitive root modulo.
Lemma 4 In the notation of above statement, ifwitha primitive root modulo,then there exists a uniquesatisfyingfor each
Proof For each ,becauseis a primitive root modulo,withis true. Supposewhere. One has
This completes the proof of Lemma 4.
Let be a polynomial over . We denote the number of zeros ofby . That is, Then the following lemma is true.
Lemma 5 Letandwitha quadratic character of. One has
Proof Letand letbe a multiplicative character ofof order It is famous that (for example, Ref. [10]) Sinceone has. Hence,
Then the desired results are true by Theorem 6.26 and Theorem 6.27 in Ref. [10].
2 Proofs of Theorem 1 and Corollary 1
In this section, we present the proofs of Theorem 1 and Corollary 1.
Proof of Theorem 1 The proof will be divided into two cases.
Case 1 . From Lemma 4 and Lemma 2, one can get
If , from Lemma 3, it follows that are roots of
where satisfies the condition in Lemma 3. Therefore,
Similarly, if , from Lemma 3, it follows that are roots of
where satisfies the condition in Lemma 3, which implies that
Now, using (2), (4) and (6), we can get the explicit formula of . First, it is easy to see that. Next, by (2), one has
By (4), (6) and direct calculation, one has
Similarly, we can get that
and
Now, let . For each integer with , using (3) and (5), one has
if , and
if, where satisfies the condition in Lemma 3.
If, then it follows from (2) and (7) that
Therefore, we have
as expected.
If, one can use the similar argument to get the desired result by (2) and (8), and we omit it here.
Theorem 1 is proved in this case.
Case 2 . For each integer with , define
By principle of cross-classification, one can get
For any integer with , and for each -tuple integer with , one can deduce that
Thus by Lemma 5, (9) and (10) one has
The proof of Theorem 1 is completed.
Finally, we present the proof of Corollary 1.
Proof of Corollary 1 Let be the prime decomposition of . It follows that from Lemma 1. It is easy to obtain from .
Let be a solution of with It is easy to get that
if and only if
Since with, for any -tuple , there is a unique such that (11) holds. Therefore, we have
It then follows that
The proof of Corollary 1 is completed.
References
- Brauer A. Losung der Aufgabe 30[J]. Jahresber Dtsch Math-Ver, 1926, 35: 92-94. [Google Scholar]
- Rademacher H. Aufgabe 30[J]. Jahresbe Dtsch Math-Ver, 1925, 34:158. [Google Scholar]
- Sun C F, Yang Q H. On the sumset of atoms in cyclic groups[J]. International Journal of Number Theory, 2014, 10(6): 1355-1363. [CrossRef] [MathSciNet] [Google Scholar]
- Ramy T E. On the number of incongruent solutions to a quadratic congruence over algebraic integers[J]. International Journal of Number Theory, 2019, 15(1):105-130. [CrossRef] [MathSciNet] [Google Scholar]
- Yang Q H, Tang M. On the addition of squares of units and nonunits modulo [J]. Journal of Number Theory, 2015, 155: 1-12. [CrossRef] [MathSciNet] [Google Scholar]
- Chowla S, Cowles J, Cowles M. On the number of zeros of diagonal cubic forms[J]. Journal of Number Theory, 1977, 9(4): 502-506. [CrossRef] [MathSciNet] [Google Scholar]
- Hu S N, Wang S H, Li Y Y, et al. Note on the number of solutions of cubic diagonal equations over finite fields [J]. Wuhan University Journal of Natural Sciences, 2023, 28(5): 369-372. [CrossRef] [EDP Sciences] [Google Scholar]
- Apostol T M. Introduction to Analytic Number Theory[M]. New York: Springer-Verlag, 1976. [Google Scholar]
- Berndt B C, Evans R J, Williams K S. Gauss and Jacobi Sums[M]. New York: John Wiley & Sons, Inc, 1999. [Google Scholar]
- Lidl R, Niederreiter H. Finite Fields: Encyclopedia of Mathematics and Its Applications[M]. Cambridge: Cambridge University Press, 1997. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.