中文
相关论文

相关论文: Congruences for the Almkvist-Zudilin numbers

200 篇论文

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

数论 · 数学 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

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

In this paper we prove some transformation formulae for congruences modulo a prime and deduce some congruences for Domb numbers and Almkvist-Zudilin numbers. We also pose some conjectures on congruences modulo prime powers.

数论 · 数学 2015-02-18 Zhi-Hong Sun

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

数论 · 数学 2017-04-21 Zhi-Wei Sun

We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Ap\'{e}ry numbers, by means of a general…

数论 · 数学 2019-12-03 Ofir Gorodetsky

Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac p{k+b}\pmod {p^2}$. For $n=0,1,2,\ldots$ let $D_n$ and $b_n$ be Domb…

数论 · 数学 2020-02-28 Zhi-Hong Sun

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

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

数论 · 数学 2025-10-14 Hui-Li Han , Chen Wang

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

组合数学 · 数学 2024-07-16 Rong-Hua Wang , Michael X. X. Zhong

We consider $cp_{a,b,m}(n)$, the number of $(a,b,m)$-copartitions of $n$. We find many infinitelymany congruencesmodulo 2 and 6 for some particular value of $a$, $b$ and $m$.

数论 · 数学 2023-03-27 Yudhisthira Jamudulia

A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…

数论 · 数学 2017-06-22 Julian Rosen

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

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

数论 · 数学 2018-01-08 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

数论 · 数学 2007-09-12 Alexei Panchishkin

We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.

数论 · 数学 2009-12-20 Roberto Tauraso

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…

数论 · 数学 2026-03-18 Sandro Mattarei , Roberto Tauraso

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

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

This article examines the nontrivial solutions of the congruence \[ (p-1)\cdots(p-r) \equiv -1 \pmod p. \] We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical…

数论 · 数学 2013-10-11 Joel Beeren , David Harvey , Tim Trudgian

The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…

数论 · 数学 2023-08-24 Dillon Snyder
‹ 上一页 1 2 3 10 下一页 ›