An almost all result on $q_1 q_2 \equiv c \pmod q$
Tsz Ho Chan

TL;DR
This paper investigates the solvability of the congruence q_1 q_2 ≡ c mod q within specific intervals, demonstrating solutions for almost all parameters, and extends the results to multiple variables with new analytical methods.
Contribution
It provides new results on the solvability of a specific congruence in short intervals and introduces a novel approach using higher moments for analysis.
Findings
Solutions exist for almost all parameter choices within specified intervals.
Generalization of results to multiple variables.
Introduction of a higher moments method for analyzing the congruence.
Abstract
In this paper we consider the congruence equation with and and show that it has solution for almost all and . Then we apply it to a question of Fujii and Kitaoka as well as generalize it to more variables. At the end, we will present a new way to attack the above congruence equation question through higher moments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Algebraic Geometry and Number Theory
