1. PARTITIONS INTO m-TH LEHMER NUMBERS AND k-TH POWER RESIDUES IN ℚp.
- Author
-
YONGLI SU, JIANKANG WANG, BO ZHANG, and ZHEFENG XU
- Subjects
TIME complexity ,INTEGERS ,ALGORITHMS ,COMPUTERS - Abstract
Let p be a prime, ℤ
p * = {1,2,..., p - 1}, m, c be integers with m ≥ 2, and ℒm (c) = {x|x ∈ ℤp *, 2 (x +(cxm )p )}, where (cxm)p denotes the least positive residue modulo p. In this paper, we study the representation of any element of ℤp * as sum of a m-th Lehmer number l ∈ ℒm (c) and a k-th power residue in ℤp *, and give an inequality for the number of representations. Moreover, using the algorithm we provided, we examined all the cases for some pairs (k, m) by computer. We also analyzed the time complexity of the algorithm and illustrated that it is extremely difficult to verify all the cases up to the bound of p for larger km. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF