相关论文: Fleck quotients and Bernoulli numbers

Let $N$ be a positive integer and let $f$ be a meromorphic modular function of level $N$ with rational Fourier coefficients. For a prime $p$, define a function $f_p$ on the complex upper half-plane $\mathbb{H}$ by \begin{equation*}…

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

Let $p$ be a prime number. Motivated by the local lifting problem for $(\mathbb{Z}/p\mathbb{Z})^n$ with $n>1$, we prove several new results on certain $\mathbb{F}_p$-vector spaces of logarithmic differential forms on the projective line in…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Let $\ell$ be any fixed prime number. We define the $\ell$-Genocchi numbers by $G_n:=\ell(1-\ell^n)B_n$, with $B_n$ the $n$-th Bernoulli number. They are integers. We introduce and study a variant of Kummer's notion of regularity of primes.…

We present a novel way of realizing the Bernoulli shift on $p$ symbols on the $p$-adic integers, where $p$ is a prime. By showing that suitably small perturbations of the shift are still Bernoulli we find many "nice" maps, such as…

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…

For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…

For a nonnegative integer $n$, and a prime $\wp$ in $\mathbb{F}_q[T]$, we prove a result that provides a method for computing the number of integers $m$ with $0 \le m \le n$ for which the Carlitz binomial coefficients $\binom{n}{m}_C$ fall…

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p for many small primes p, and then reconstruct B(k) via the…

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

For $A,B\in\mathbb Z$, the Lucas sequence $u_n(A,B)\ (n=0,1,2,\ldots)$ are defined by $u_0(A,B)=0$, $u_1(A,B)=1$, and $u_{n+1}(A,B) = Au_n(A,B)-Bu_{n-1}(A,B)$ $(n=1,2,3,\ldots).$ For any odd prime $p$ and positive integer $n$, we establish…

Let $p$ be an odd prime and let $f(x)=\sum_{i=1}^ka_ix^{p^{\alpha_i}+1}\in\Bbb F_{p^n}[x]$, where $0\le \alpha_1<...<\alpha_k$. We consider the exponential sum $S(f,n)=\sum_{x\in\Bbb F_{p^n}}e_n(f(x))$, where $e_n(y)=e^{2\pi…

We prove that if the signed binomial coefficient $(-1)^i\binom{k}{i}$ viewed modulo p is a periodic function of i with period h prime to p in the range $0\le i\le k$, then k+1 is a power of p, provided h is not too large compared to k. (In…

In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…

Let $p$ be an odd prime and let $d$ be an integer not divisible by $p$. We prove that $$ \prod_{1\le m,n\le p-1\atop p\nmid m^2-dn^2}\ (x-(m+n\sqrt{d})) \equiv \begin{cases}\sum_{k=1}^{p-2}\frac{k(k+1)}2x^{(k-1)(p-1)}\pmod p &\text{if}\…

Let $p=2n+1$ be an odd prime. In this paper, we mainly evaluate determinants involving $(\frac {j+k}p)\pm(\frac{j-k}p)$, where $(\frac{\cdot}p)$ denotes the Legendre symbol. When $p\equiv1\pmod4$, we determine the characteristic polynomials…

In this paper, we consider sums of class numbers of the type $\sum_{m\equiv a\pmod{p}} H(4n-m^2)$, where $p$ is an odd prime, $n\in \mathbb{N},$ and $a\in \mathbb{Z}$. By showing that these are coefficients of mixed mock modular forms, we…