Additive congruences with factorials modulo a prime
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914012684353536 |
|---|---|
| author | Garaev, Moubariz Z. Pardo, Julio C. |
| author_facet | Garaev, Moubariz Z. Pardo, Julio C. |
| contents | Let $p$ be a large prime number. We prove that any integer $λ$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv λ\pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the exponent $1350/1351$ of Garaev, Luca and Shparlinski (2005). Furthermore, we prove that any integer $λ$ can be represented in the form $$ m_1!n_1! +m_2!n_2!+m_3!n_3! +m_4!n_4!+m_5!n_5! \equiv λ\pmod p $$ with $\max\{m_1,n_1,\ldots,m_5,n_5\}\le p^{97/113 +o(1)}.$ This improves the exponent $27/28$ of Garaev and Garcia (2007). The proofs of these two results are based on the recent work of Grebennikov, Sagdeev, Semchankau and Vasilevskii (2024).
We also obtain some lower bound estimates on the cardinality of the product set of two factorials modulo a prime. For instance, we prove that if $N<p^{3/5},$ then $$ \#\{m!n!\pmod p; \, 1\le m,n\le N\}\gg N^{1-o(1)}. $$ The proof of this result is based on works of Banks and Shparlinski (2020), Cilleruelo and Garaev (2016), and the work of Katz and Shen (2008) related to the Ruzsa-Plünnecke inequality from additive combinatorics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_12127 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Additive congruences with factorials modulo a prime Garaev, Moubariz Z. Pardo, Julio C. Number Theory Let $p$ be a large prime number. We prove that any integer $λ$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv λ\pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the exponent $1350/1351$ of Garaev, Luca and Shparlinski (2005). Furthermore, we prove that any integer $λ$ can be represented in the form $$ m_1!n_1! +m_2!n_2!+m_3!n_3! +m_4!n_4!+m_5!n_5! \equiv λ\pmod p $$ with $\max\{m_1,n_1,\ldots,m_5,n_5\}\le p^{97/113 +o(1)}.$ This improves the exponent $27/28$ of Garaev and Garcia (2007). The proofs of these two results are based on the recent work of Grebennikov, Sagdeev, Semchankau and Vasilevskii (2024). We also obtain some lower bound estimates on the cardinality of the product set of two factorials modulo a prime. For instance, we prove that if $N<p^{3/5},$ then $$ \#\{m!n!\pmod p; \, 1\le m,n\le N\}\gg N^{1-o(1)}. $$ The proof of this result is based on works of Banks and Shparlinski (2020), Cilleruelo and Garaev (2016), and the work of Katz and Shen (2008) related to the Ruzsa-Plünnecke inequality from additive combinatorics. |
| title | Additive congruences with factorials modulo a prime |
| topic | Number Theory |
| url | https://arxiv.org/abs/2508.12127 |