PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 12, 2026Filomat0 citationsOpen Access

On the solution set of additive and multiplicative congruences modulo squares of primes

ZSZhongyan ShenTCTianxin Cai

Key Points

  • To explore the solution sets of mixed additive and multiplicative congruences modulo the squares of odd primes.
  • Defined solution sets S_+ and S_- consisting of integers satisfying certain congruences modulo p^2.
  • Established congruences related to the sum and product within the defined residue systems.
  • Classified prime numbers based on their quadratic residues and non-residues to derive solution counts.
  • Identified distinct solution sets S_+ and S_- based on additive and multiplicative relationships.
  • Derived specific congruences involving sums and products of residues in both solution sets.
  • Achieved counts of solution sets linked to classifications of primes and their quadratic properties.

Abstract

Let p be an odd prime. We consider the solution sets S_+ (p²) = \ n Z₏ℂ^* n a + b ab p² \ and S_- (p²) = \ n Z₏ℂ^* n a - b ab p² \, where Z₏ℂ^* denote a reduced residue system modulo p². We also establish congruences about sum and product of the residues or quadratic residues in S_+ (p²) or in S_- (p²) modulo p². Finally, we obtain the number of solution sets based on the classification of prime numbers, where a and b are quadratic residues or quadratic non-residues, respectively.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Shen et al. (2025) studied this question.

synapsesocial.com/papers/698d6eca5be6419ac0d549bdhttps://doi.org/10.2298/fil2517999s
Ask AI
Helpful
Bookmark
Share
View Full Paper