中文
相关论文

相关论文: Exponential Sums and Congruences with Factorials

200 篇论文

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

数论 · 数学 2025-10-31 Bernd C. Kellner

In this paper, we study the average size of the product of a number and its multiplicative inverse modulo a prime p. This turns out to be related to moments of L-functions and leads to a curious asymptotic formula for a certain triple…

数论 · 数学 2014-12-30 Tsz Ho Chan

In this paper we compute the exact divisibility of exponential sums associated to binomials $F(X)=aX^{d_1} +b X^{d_2}$. In particular, for the case where $\max\{d_1,d_2\}\leq\sqrt{p-1}$, the exact divisibility is computed. As a byproduct of…

数论 · 数学 2015-12-03 Francis Castro , Raúl Figueroa , Puhua Guan

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

数论 · 数学 2024-05-30 Jean-Marie De Koninck , William Verreault

We have known that most sequences in $\mathcal{M}=\{1,2,\dots, M\}$ with length $n$ will miss $Me^{-\lambda}$ of the total numbers of $\{1,2,\dots,M\}$ as the ratio $n/M$ tends to $\lambda$. Now we consider a more general case where the…

数论 · 数学 2020-11-17 Cristian Cobeli , Alexandru Zaharescu

We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1,…

数论 · 数学 2024-09-13 Anay Aggarwal , Manu Isaacs

For a composite $n$ and an odd $c$ with $c$ not dividing $n$, the number of solutions to the equation $n+a\equiv b\mod c$ with $a,b$ quadratic residues modulus $c$ is calculated. We establish a direct relation with those modular solutions…

数论 · 数学 2020-04-17 Juan Di Mauro

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

数论 · 数学 2026-04-28 Dan Levy

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

数论 · 数学 2026-02-16 Meselem Karras

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

数论 · 数学 2024-08-22 Zubeyir Cinkir

We use the rationality of the generalized $h^{th}$ convergent functions, $Conv_h(\alpha, R; z)$, to the infinite J-fraction expansions enumerating the generalized factorial product sequences, $p_n(\alpha, R) =…

组合数学 · 数学 2017-01-18 Maxie D. Schmidt

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

数论 · 数学 2025-10-24 Lingyu Guo , Victor Zhenyu Guo , Mengyao Jing

In this note, we look at the diophantine equation $$ \prod_{i=1}^ta_i!=\prod_{j=1}^sn_i!, \quad n_1\geq \cdots \geq n_s\geq 2 \quad \textnormal{and}\quad n_1>a_1\geq a_2\geq\cdots \geq a_t\geq2. $$ \noindent Let $s<t$. Under the (explicit)…

数论 · 数学 2026-03-02 Saša Novaković

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

离散数学 · 计算机科学 2021-04-10 Rachel N. Berman , Ron M. Roth

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

数论 · 数学 2009-11-06 Roberto Tauraso

A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…

数据分析、统计与概率 · 物理学 2007-05-23 Bernhard Kaufmann

We investigate the existence of primes $p > 5$ for which the residues of $2!$, $3!$, \dots, $(p-1)!$ modulo $p$ are all distinct. We describe the connection between this problem and Kurepa's left factorial function, and report that there…

数论 · 数学 2018-05-22 Vladica Andrejić , Milos Tatarevic

A study of products of factorials modulo p and complete residues.

数论 · 数学 2007-05-23 Florian Luca , Pantelimon Stanica

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

数论 · 数学 2024-09-25 Kaimin Cheng , Shuhong Gao

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

组合数学 · 数学 2022-10-25 Pankaj Jyoti Mahanta