中文
相关论文

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

200 篇论文

Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper, by using the work of Ishii and Deuring's theorem for elliptic curves with complex multiplication we solve some conjectures of Zhi-Wei Sun concerning…

数论 · 数学 2011-04-19 Zhi-Hong Sun

If a real polynomial $f(x)=p(x^2)+xq(x^2)$ is Hurwitz stable (every root if $f$ lies in the open left half-plane), then the Hermite-Biehler Theorem says that the polynomials $p(-x^2)$ and $q(-x^2)$ have interlacing real roots. We extend…

经典分析与常微分方程 · 数学 2017-01-30 Richard Ellard , Helena Šmigoc

For positive integers $K$ and $L$, we introduce and study the notion of $K$-multiplicative dependence over the algebraic closure $\overline{\mathbb{F}}_p$ of a finite prime field $\mathbb{F}_p$, as well as $L$-linear dependence of points on…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

数论 · 数学 2022-07-19 Alina Carmen Cojocaru , McKinley Meyer

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

综合数学 · 数学 2008-03-10 William B. Everett

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

历史与综述 · 数学 2016-12-21 Akash Jena , Binod Kumar Sahoo

The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…

数论 · 数学 2025-06-27 Jean-Marc Deshouillers , Sunil Naik

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

组合数学 · 数学 2017-12-19 David G. L. Wang , Jiarui Zhang

The harmonic numbers $H_n=\sum_{0<k\le n}1/k\ (n=0,1,2,\ldots)$ play important roles in mathematics. Let $p>3$ be a prime. With helps of some combinatorial identities, we establish the following two new congruences:…

数论 · 数学 2016-02-25 Guo-Shuai Mao , Zhi-Wei Sun

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

交换代数 · 数学 2007-05-23 Winfried Bruns , Bogdan Ichim

For a prime number $q\neq 2$ and $r>0$ we study, whether there exists an isometry of order $q^r$ acting on a free $\mathbb{Z}_{p^k}$-module equipped with a scalar product. We investigate, whether there exists such an isometry with no…

几何拓扑 · 数学 2018-10-10 Maciej Borodzik , Przemysław Grabowski , Adam Król , Maria Marchwicka

We investigate the $k$-error linear complexity of pseudorandom binary sequences of period $p^{\mathfrak{r}}$ derived from the Euler quotients modulo $p^{\mathfrak{r}-1}$, a power of an odd prime $p$ for $\mathfrak{r}\geq 2$. When…

密码学与安全 · 计算机科学 2018-10-05 Zhixiong Chen , Vladimir Edemskiy , Pinhui Ke , Chenhuang Wu

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

数论 · 数学 2019-04-01 Lucile Devin

Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma=(\sigma_0,\sigma_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite field $\mathbb{F}_q$: $$ \sigma_n=\left\{…

密码学与安全 · 计算机科学 2019-01-30 Zhixiong Chen , Qiuyan 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

In 2014, Juul, Kurlberg, Madhu and Tucker asked the following: given $K$ a number field and $f$ a rational function with coefficients in $K$, if $f_\mathfrak{p}$ denotes the reduction of $f$ modulo a prime ideal $\mathfrak{p}$ in the ring…

数论 · 数学 2026-03-24 Santiago Radi

We present some congruences modulo $p^{6-d}$ for sums of the type $\sum_{k=0}^{(p-3)/2}x^k{2k\choose k}/(2k+1)^d$, for $d=1,2,3$ where $p>5$ is a prime.

数论 · 数学 2011-11-01 Roberto Tauraso

In 2002, M.Ram Murty showed that if p is a prime with k-adic expansion :$p = \sum_{i = 0}^n a_i k^i$ , then the polynomial $f(x) = \sum_{i = 0}^n a_ix^i$ is irreducible in $\mathbb{Z}[x]$.When $k = 10$ , it's a result of A.Cohn. I think…

综合数学 · 数学 2023-03-01 Boyang Zhao

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Let K be a totally real Galois number field and let A be a set of elliptic curves over K. We give sufficient conditions for the existence of a finite computable set of rational primes P such that for p not in P and E in A, the…

数论 · 数学 2014-07-17 Nuno Freitas , Samir Siksek