中文
相关论文

相关论文: Linear recurrence relations for binomial coefficie…

200 篇论文

Let $p$ be an odd prime. In the paper, by using the properties of Legendre polynomials we prove some congruences for $\sum_{k=0}^{\frac{p-1}2}\binom{2k}k^2m^{-k}\mod {p^2}$. In particular, we confirm several conjectures of Z.W. Sun. We also…

数论 · 数学 2010-12-20 Zhi-Hong Sun

Polynomially-recursive sequences generally have a periodic behavior mod $m$. In this paper, we analyze the period mod $m$ of a second order polynomially-recursive sequence. The problem originally comes from an enumeration of avoiding…

数论 · 数学 2019-03-07 Cyril Banderier , Florian Luca

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

数论 · 数学 2007-05-23 Wolfgang M. Ruppert

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

组合数学 · 数学 2013-04-18 Kevin Garbe

In 1974, Vegh proved that if $k$ is a prime and $m$ a positive integer, there is an $m$ term permutation chain of $k$th power residue for infinitely many primes [E.Vegh, $k$th power residue chains, J.Number Theory, 9(1977), 179-181]. In…

数论 · 数学 2010-01-21 Su Hu , Yan Li

Linear differential equations with polynomial coefficients over a field $K$ of positive characteristic $p$ with local exponents in the prime field have a basis of solutions in the differential extension $\mathcal{R}_p=K(z_1, z_2,…

数论 · 数学 2024-04-25 Florian Fürnsinn , Herwig Hauser , Hiraku Kawanoue

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

数论 · 数学 2019-12-03 C. G. Karthick Babu

We consider the $k$-error linear complexity of binary sequences derived from Eluer quotients modulo $2p$ ($p>3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of…

密码学与安全 · 计算机科学 2019-10-11 Chenhuang Wu , Vladimir Edemskiy , Chunxiang Xu

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…

数论 · 数学 2018-10-16 Julian Rosen

Let $K$ be a number field and $p$ a prime number $\geq 5$. Let us denote by $\mu_p$ the group of the $p$th roots of unity. We define $p$ to be $K$-regular if $p$ does not divide the class number of the field $K(\mu_p)$. Under the assumption…

数论 · 数学 2014-12-01 Alain Kraus

Recently the first author proved a congruence proposed in 2006 by Adamchuk: $\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2}$ for any prime $p=1 \pmod{3}$. In this paper, we provide more examples (with proofs) of…

数论 · 数学 2020-07-21 Guo-Shuai Mao , Roberto Tauraso

We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…

符号计算 · 计算机科学 2010-05-05 Manuel Kauers , Veronika Pillwein

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

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

We describe the trace representations of two families of binary sequences derived from Fermat quotients modulo an odd prime $p$ (one is the binary threshold sequences, the other is the Legendre-Fermat quotient sequences) via determining the…

数论 · 数学 2016-03-15 Zhixiong Chen

Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper, based on the work of Brillhart and Morton, by using the work of Ishii and Deuring's theorem for elliptic curves with complex multiplication we solve some…

数论 · 数学 2011-05-02 Zhi-Hong Sun

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

数论 · 数学 2019-05-07 Pablo Sáez , Xavier Vidaux , Maxim Vsemirnov

This paper is a contribution to the description of some congruences on the odd prime factors of the class number of the number fields. An example of results obtained is: Let L/Q be a finite Galois solvable extension with [L:Q]=N, where N >…

数论 · 数学 2007-05-23 Roland Queme

In this paper we mainly employ the Zeilberger algorithm to study congruences for sums of terms involving products of three binomial coefficients. Let $p>3$ be a prime. We prove that…

数论 · 数学 2014-04-29 Zhi-Wei Sun

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

数学物理 · 物理学 2007-07-06 Christopher J. Hillar , Charles R. Johnson