中文
相关论文

相关论文: On Fleck quotients

200 篇论文

Let $p$ be an odd prime, and let $m$ be an integer with $p\nmid m$. In this paper show that $$\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k} \equiv 0\pmod p \quad\hbox{implies}\quad\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak…

数论 · 数学 2015-03-12 Zhi-Hong Sun

Define $g_n(x)=\sum_{k=0}^n\binom nk^2\binom{2k}kx^k$ for $n=0,1,2,...$. Those numbers $g_n=g_n(1)$ are closely related to Ap\'ery numbers and Franel numbers. In this paper we establish some fundamental congruences involving $g_n(x)$. For…

数论 · 数学 2016-07-20 Zhi-Wei Sun

Let $\F_p$ be the field of residue classes modulo a large prime $p$. The present paper is devoted to the problem of representability of elements of $\F_p$ as sums of fractions of the form $x/y$ with $x,y$ from short intervals of $\F_p$.

数论 · 数学 2015-10-28 C. A. Díaz , M. Z. Garaev

Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…

数论 · 数学 2007-05-23 Zhi-Wei Sun

Let $p$ be an odd prime and $r\geq 1$. Suppose that $\alpha$ is a $p$-adic integer with $\alpha\equiv2a\pmod p$ for some $1\leq a<(p+r)/(2r+1)$. We confirm a conjecture of Sun and prove that…

数论 · 数学 2018-03-06 Guo-Shuai Mao , Hao Pan

Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…

数论 · 数学 2015-05-18 Zhi-Wei Sun

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

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

数论 · 数学 2022-01-06 Błażej Żmija

In recent years, the congruence $$ \sum_{\substack{i+j+k=p\\ i,j,k>0}} \frac1{ijk} \equiv -2 B_{p-3} \pmod{p}, $$ first discovered by the last author have been generalized by either increasing the number of indices and considering the…

数论 · 数学 2021-01-22 Megan McCoy , Kevin Thielen , Liuquan Wang , Jianqiang Zhao

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

数论 · 数学 2007-05-23 Zhi-Wei Sun

In this article, we present streamlined proofs of results of Ankeny, Artin, and Chowla concerning the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{p})$ for primes $p\equiv 1 \bmod{4}$ while providing a generalization of…

数论 · 数学 2023-04-07 Nic Fellini , M. Ram Murty

Let $d(n)$ denote the number of divisors of $n$. In this paper, we study the average value of $d(a(p))$, where $p$ is a prime and $a(p)$ is the $p$-th Fourier coefficient of a normalized Hecke eigenform of weight $k \ge 2$ for $\Gamma_0(N)$…

数论 · 数学 2014-03-20 Sanoli Gun , M. Ram Murty

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

Recently, using modular forms F. Beukers posed a unified method that can deal with a large number of supercongruences involving binomial coefficients and Ap\'ery-like numbers. In this paper, we use Beukers' method to prove some conjectures…

数论 · 数学 2024-09-20 Zhi-Hong Sun , Dongxi Ye

The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*}…

数论 · 数学 2016-04-19 Song Guo , Victor J. W. Guo

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many…

数论 · 数学 2018-11-13 Zhi-Wei Sun

Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…

数论 · 数学 2018-04-11 Heng Huat Chan , Liuquan Wang

Let f(n)= Sum binomial(n,k)^(-1). First, we show that f:N to Q_p is nowhere continuous in the p-adic topology. If x is a p-adic integer, we say that f(x) is p-definable if lim f(x_j) exists in Q_p, where x_j denotes the jth partial sum for…

数论 · 数学 2012-08-02 Donald M. Davis

Let $\Bbb Z$ be the set of integers, and let $(m,n)$ be the greatest common divisor of integers $m$ and $n$. Let $p\equiv 1\mod 4$ be a prime, $q\in\Bbb Z$, $2\nmid q$ and $p=c^2+d^2=x^2+qy^2$ with $c,d,x,y\in\Bbb Z$ and $c\e 1\mod 4$.…

数论 · 数学 2012-09-24 Zhi-Hong Sun

Let $p$ be an odd prime and let $n$ be a positive integer. For any positive integer $\alpha$ and $m\in\{1,2,3\}$, we have \begin{align*}…

数论 · 数学 2018-10-23 Yong Zhang , Hao Pan