中文
相关论文

相关论文: Binomial coefficients involving infinite powers of…

200 篇论文

Let $p>5$ be a prime. We prove congruences modulo $p^{3-d}$ for sums of the general form $\sum_{k=0}^{(p-3)/2}\binom{2k}{k}t^k/(2k+1)^{d+1}$ and $\sum_{k=1}^{(p-1)/2}\binom{2k}{k}t^k/k^d$ with $d=0,1$. We also consider the special case…

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

数论 · 数学 2012-10-16 Jhon J. Bravo , Florian Luca

Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…

数论 · 数学 2018-04-06 Jianqiang Zhao

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

数论 · 数学 2013-10-09 Sandro Mattarei , Roberto Tauraso

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

数论 · 数学 2020-03-03 Shaofang Hong , Min Qiu

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

数论 · 数学 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

In this paper, we study some topics concerning the additive decompositions of the set $D_k$ of all $k$th power residues modulo a prime $p$. For example, given a positive integer $k\ge2$, we prove that…

数论 · 数学 2025-03-04 Hai-Liang Wu , Ning-Liu Wei , Yu-Bo Li

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

In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any…

组合数学 · 数学 2025-05-12 Rong-Hua Wang , Michael X. X. Zhong

An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.

数论 · 数学 2014-06-13 Jerry Hu

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…

数论 · 数学 2009-12-20 Zhi-Wei Sun

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

数论 · 数学 2022-12-01 Hrishabh Mishra , Anwesh Ray

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$;…

数论 · 数学 2014-06-25 Tewodros Amdeberhan

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

Let n,p,k be three positive integers. We prove that the numbers binomial (n,k) 3F2 (1-k, -p, p-n ; 1, 1-n ; 1) are positive integers which generalize the classical binomial coefficients. We give two generating functions for these integers,…

组合数学 · 数学 2007-05-23 Michel Lassalle

Let b be an odd integer such that b=+/-1 (mod 8) and let q be a prime with primitive root 2 such that q does not divide b. We show that if (p(k)) is a sequence of odd primes, with 0<=k<=q-2 such that p(k)=2p(k-1)+b for all 1<=k<=q-2, then…

数论 · 数学 2009-08-20 Douglas S. Stones

For fixed positive integers $n$, we study the solution of the equation $n = k + p_k$, where $p_k$ denotes the $k$th prime number, by means of the iterative method \[ k_{j+1} = \pi(n-k_j), \qquad k_0 = \pi(n), \] which converges to the…

数论 · 数学 2021-11-30 Juan Luis Varona

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 K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many…

数论 · 数学 2014-02-26 Chad Gratton , Khoa Nguyen , Thomas J. Tucker

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

交换代数 · 数学 2016-12-07 Anuj Jakhar , Neeraj Sangwan