中文
相关论文

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

200 篇论文

Let $p>0$ be a prime, $G$ be a finite $p$-group and $\Bbbk$ be an algebraically closed field of characteristic $p$. Dave Benson has conjectured that if $p=2$ and $V$ is an odd-dimensional indecomposable representation of $G$ then all…

表示论 · 数学 2026-05-19 Kent B. Vashaw , Justin Zhang

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

数论 · 数学 2021-10-22 He-Xia Ni

Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac…

数论 · 数学 2022-10-07 Qing-Hu Hou , Hao Pan , Zhi-Wei Sun

Let $p_{-k}(n)$ enumerate the number of $k$-colored partitions of $n$. In this paper, we establish some infinite families of congruences modulo 25 for $k$-colored partitions. Furthermore, we prove some infinite families of Ramanujan-type…

组合数学 · 数学 2017-11-08 Dazhao Tang

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

数论 · 数学 2014-12-30 Igor E Shparlinski , Katherine E. Stange

Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…

组合数学 · 数学 2024-03-04 Nadav Kohen

Call an interval $\{N+1,\dots,N+H\}$ of consecutive natural numbers \emph{bad} if the product $(N+1) \dots (N+H)$ is divisible by the square of its largest prime factor; \emph{very bad} if this product is powerful, and \emph{type $F_3$} if…

数论 · 数学 2026-04-23 Terence Tao

Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such…

数论 · 数学 2022-06-22 Madeline Locus , Ian Wagner

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} ~(\bmod ~…

数论 · 数学 2015-03-12 Zhongyan Shen , Tianxin Cai

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

数论 · 数学 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

组合数学 · 数学 2015-03-09 Shalosh B. Ekhad , N. J. A. Sloane , Doron Zeilberger

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

数论 · 数学 2022-03-30 Ashwin Sah , Mehtaab Sawhney

We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude…

数论 · 数学 2017-04-11 Andrew R. Booker , Carl Pomerance

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

组合数学 · 数学 2025-07-29 Christian Krattenthaler , Thomas W. Müller

Does $14$ have a friend? Until now, this has been an open question. In this note, we prove that a potential friend $F$ of $14$ is an odd, non-square positive integer. $7$ appears in the prime factorization of $F$ with an even exponent while…

综合数学 · 数学 2025-09-17 Sagar Mandal

In this paper we prove the supercongruence $$\sum_{n=0}^{(p-1)/2}\frac{6n+1}{256^n}\binom{2n}n^3\equiv p(-1)^{(p-1)/2}+(-1)^{(p-1)/2}\frac{7}{24}p^4B_{p-3}\pmod{p^5}$$ for any prime $p>3$, which was conjectured by Sun in 2019.

数论 · 数学 2021-09-22 Guo-Shuai Mao , Zhi-Wei Sun

Let s(n) be the number of representations of n as the sum of three squares. We prove a remarkable new identity for s(p^2n)- ps(n) with p being an odd prime. This identity makes nontrivial use of ternary quadratic forms with discriminants…

数论 · 数学 2011-02-01 Alexander Berkovich , Will Jagy

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

数论 · 数学 2007-05-23 Ken Ono

We show that a short truncation of the Fourier expansion for a character sum gives a good approximation for the average value of that character sum over an interval. We give a few applications of this result. One is that for any $b$ there…

数论 · 数学 2014-09-08 Jonathan Bober

We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n}…

组合数学 · 数学 2019-01-31 Darij Grinberg