中文
相关论文

相关论文: Character Sums and Congruences with n!

200 篇论文

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

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

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

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

数论 · 数学 2017-06-28 Yoshiyuki Kitaoka

Let $p$ be an odd prime. Define the Gaussian power sum \[ G_n(p)=\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}(a+bi)^n\in\mathbb Z[i]. \] We determine $G_p(p)$ modulo high powers of $p$: if $p\equiv 1\pmod 4$ then $$G_p(p)\equiv p^2(1+i)\pmod{p^3},$$…

综合数学 · 数学 2026-02-04 Nikita Kalinin , Faith Shadow Zottor

We prove several results which imply the following consequences. For any $\varepsilon>0$ and any sufficiently large prime $p$, if $\cI_1,\ldots, \cI_{13}$ are intervals of cardinalities $|\cI_j|>p^{1/4+\varepsilon}$ and $abc\not\equiv…

数论 · 数学 2017-01-26 M. Z. Garaev

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

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

数论 · 数学 2016-01-28 Liuquan Wang

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

数论 · 数学 2024-09-04 Fernando Szechtman

Let p be a prime = 3 (mod 4). A number of elegant number-theoretical properties of the sums T(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} tan(n^2\pi/p) and C(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} cot(n^2\pi/p) are proved. For example, T(p) equals p times…

数论 · 数学 2012-05-21 A. Laradji , M. Mignotte , N. Tzanakis

It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for…

数论 · 数学 2020-09-15 Max Alekseyev , Jose Maria Grau , Amtonio Oller-Marcen

Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…

数论 · 数学 2021-09-16 Riyajur Rahman , Nipen Saikia

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

数论 · 数学 2014-10-14 Liuquan Wang

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

数论 · 数学 2025-06-17 Frits Beukers

Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…

数论 · 数学 2013-08-23 Shaofang Hong , Jianrong Zhao , Wei Zhao

We study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that…

数论 · 数学 2017-10-16 Bernd C. Kellner

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

数论 · 数学 2025-02-11 Joshua Zelinsky

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

组合数学 · 数学 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a non-empty subset of $\mathbb{F}_p.$ In this paper we give an explicit version of the sum-product estimate of Bourgain, Katz, Tao and Bourgain,…

数论 · 数学 2007-05-23 M. Z. Garaev

We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…

数论 · 数学 2016-02-09 Tim Beyne , Gerold Brändli

Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac…

数论 · 数学 2022-02-15 Zhi-Hong Sun