We investigate when the sequence of binomial coefficients \binom{k}{i} modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0\le i\le k. In particular, we prove that this cannot occur if 2h\le k<p-h. This hypothesis can be weakened to 2h\le k<p if we assume, in addition, that the characteristic polynomial of the relation does not have -1 as a root. We apply our results to recover a known bound for the number of points of a Fermat curve over a finite field.
We show that for any mod $2^m$ characters, $χ_1, χ_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}χ_1(x) χ_2(Ax^k+B), $$ has a simple explicit evaluation.
We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} χ(x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} χ_1 (x)χ_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for $m\geq 2$ if $p\nmid ABk$).
I use polynomial analogue of the Jacobi triple product identity together with the Eisenstein formula for the Legendre symbol modulo 3 . to prove six identities involving the $q$-binomial coefficients. These identities are then extended to the new infinite hierarchies of q-series identities by means of the special case of Bailey's lemma. Some of the identities of Ramanujan, Slater, McLaughlin and Sills are obtained this way.
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 into each of the residue classes modulo $\wp$. Our main result can be viewed as a function field analogue of the Garfield-Wilf theorem.
Much is known about binomial coefficients where primes are concerned, but considerably less is known regarding prime powers and composites. This paper provides two conjectures in these directions, one about counting binomial coefficients modulo 16 and one about the value of Binomial[n, 2p] modulo n.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
Due to some results by John P. D Angelo and Dusty Grundmeier about CR- mappings the main results of my 2001 paper about recurrences for some sequences of binomial sums can be simplified.
We study the three term recurrence modulo m. In particular, we prove that Pell numbers modulo m is residue complete if and only m is 2, a power of 3, or a power of 5. Pell-Lucas numbers modulo m is residue complete if and only if m is a power of 3.
Using recurrence matrices, defined and described with some details, we study a few determinants related to evaluations of binomial coefficients on Dirichlet characters modulo 2, 4 and 8.
In 1947 Fine obtained an expression for the number of binomial coefficients on row n of Pascal's triangle that are nonzero modulo p. In this paper we use Kummer's theorem to generalize Fine's theorem to prime powers, expressing the number of nonzero binomial coefficients modulo p^alpha as a sum over certain integer partitions. For fixed alpha, this expression can be rewritten to show explicit dependence on the number of occurrences of each subword in the base-p representation of n.
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly found by the recurrence relations.
An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.
In this study, we apply "r" times the binomial transform to k-Lucas sequence. Also, the Binet formula, summation, generating function of this transform are found using recurrence relation. Finally, we give the properties of iterated binomial transform with classical Lucas sequence.
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.
Abstract. We generalize the $b$-ary binomial coefficients with negative entries, which is based on the generating function obtained in early work. Besides an explicit expression involving the restricted partition, several properties such as symmetry, congruence and Pascal-like recurrence are studies. Finally, we also provide two different generalizations, partially satisfying Pascal-like recurrences.
Let p be an odd prime and let a be a positive integer. In this paper we investigate the sum $\sum_{k=0}^{p^a-1}\binom{hp^a-1}{k}\binom{2k}{k}/m^k$ mod p^2, where h,m are p-adic integers with m\not=0 (mod p). For example, we show that if h\not=0 (mod p) and p^a>3 then $$ sum_{k=0}^{p^a-1}\binom{hp^a-1}{k}\binom{2k}{k}(-h/2)^k =(\frac{1-2h}{p^a})(1+h((4h-2)^{p-1}/h^{p-1}-1)) (mod p^2),$$ where (-) denotes the Jacobi symbol. Here is another remarkable congruence: If p>3 then $$\sum_{k=0}^{p^a-1}\binom{p^a-1}{k}\binom{2k}{k}(-1)^k =3^{p-1}(\frac{p^a}3) (mod p^2).$$
In the work we have considered p-adic functional series with binomial coefficients and discussed its p-adic convergence. Then we have derived a recurrence relation following with a summation formula which is invariant for rational argument. More precisely, we have investigated a sufficient condition under which the p-adic power series converges to a rational invariant sum 0. Finally we have shown application of the invariant summation formula to get some intersting relations involving Bernoulli numbers and Bernoulli polynomials.
In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Apéry-like numbers modulo $p^3$, where $p$ is an odd prime.
We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equivη_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n} \equivη_{p}\sum\limits_{n=0}^{r-1}\dbinom {2n}{n}\mod p^{2}$$ and $$\sum\limits_{n=0}^{rp-1}\sum\limits_{m=0}^{sp-1}\dbinom{n+m}{m}^{2} \equivη_{p} \sum\limits_{m=0}^{r-1}\sum\limits_{n=0}^{s-1}\dbinom{n+m}{m}^2\mod p^2,$$ where $p$ is an odd prime, $r$ and $s$ are nonnegative integers, and $η_{p}= \begin{cases} 0, &\text{if }p\equiv0\mod 3;\\ 1, & \text{if }p\equiv1\mod 3;\\ -1, &\text{if }p\equiv2…
Let $C_n$ be the $n$th Catalan number. For any prime $p \geq 5$ we show that the set $\{C_n : n \in \mathbb{N} \}$ contains all residues mod $p$. In addition all residues are attained infinitely often. Any positive integer can be expressed as the product of central binomial coefficients modulo $p$. The directed sub-graph of the automata for $C_n \mod p$ consisting of the constant states and transitions between them has a cycle which visits all vertices.
We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$, and then use it to improve the bound of Akulinichev (1965) from $O(p^{5/6})$ to $O(p^{4/5})$ for $n | (p-1)$. The result is based on a new bound on the number of solutions and of degrees of irreducible components of certain equations over finite fields.
The q-binomial coefficients were assumed to be unimodal as early as the 1850's, but it remained unproven until Sylvester's 1878 proof using invariant theory. In 1982, Proctor gave an "elementary" proof using linear algebra. Finally, in 1989, Kathy O'Hara provided a combinatorial proof of the unimodality of the q-binomial coefficients. Very soon thereafter, Doron Zeilberger translated the argument into an elegant recurrence. We introduce several perturbations to the recurrence to create a larger family of unimodal polynomials. We analyze how these perturbations affect the final polynomial and a…
Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for all $d=0,1, \ldots n$ and $n= p^a$, where $a$ is a positive integer. In this paper, we present some $q$-analogues of these congruences in the cases $m=2, 4$ for any positive integer $n$.
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} -{2^{n+1}+4\over n6^n} B_{p-n}({1\over 3}) &\pmod{p} &{if $n$ is even}. $$ where $n$ is a positive integer and $p$ is prime such that $p>\max(n+1,3)$.
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and double binomial summation identities, partial sums and ordinary generating functions. Explicit examples are given for small $n$ values.
In 1878 É. 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 prime, $n=n_0+n_1p+\cdots +n_sp^s$ and $m=m_0+m_1p+\cdots +m_sp^s$ are the $p$-adic expansions of nonnegative integers $n$ and $m$, then \begin{equation*} {n\choose m}\equiv \prod_{i=0}^{s}{n_i\choose m_i}\pmod{p}. \end{equation*}} The above congruence, the so-called {\it Lucas' theorem} (or {\it Theorem of Lucas}), plays an important role in Number Theory and C…
We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary recurrence sequence by primes $p$, thus greatly extending recent work of Evink and Helminck and of Faisant. We also prove some new results on the number of solutions of the characteristic equation of the recurrence sequence modulo $p,$ extending and simplifying earlier work of Zhi-Hong Sun (2003).
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing on binary recurrences. We give the sums of the elements in rows and in rising diagonals, further we define two special classes of these arithmetical triangles.
Let $p$ be a prime number and $E_{p}$ denote the elliptic curve $y^2=x^3+px$. It is known that for $p$ which is congruent to $1, 9$ modulo $16$, the rank of $E_{p}$ over $\mathbb{Q}$ is equal to $0, 2$. Under the condition that the Birch and Swinnerton-Dyer conjecture is true, we give a necessary and sufficient condition that the rank is $2$ in terms of the constant term of some polynomial that is defined by a recurrence formula.
In this paper we prove that a matrix property of nettedness (all 2x2 cells satisfy a recurrence) is preserved for powers of such a matrix, where the coefficients are all instances of the same sequence. Also, we find an n-dimensional analog of the Q-matrix for the general Pell(Fibonacci) sequence. We close by giving a conjecture about the spectral properties of the binomial matrix we found.
Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac 1{(k+1)^2},\frac 1{(k+1)^3},\frac 1{2k-1},\frac 1{k+2}, \frac 1{k+3}, k,k^2,k^3,\frac 1{a+k},\frac 1{a+k-1}.$$ As consequences, taking $a=-\frac 12,-\frac 13,-\frac 14,-\frac 16$ we deduce many congruences modulo $p^3$ and so solve some conjectures posed by the author earlier.
We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over Gaussian polynomials or over $q$-binomial coefficients. We investigate basic properties and applications of over $q$-binomial coefficients. In particular, via the recurrences and combinatorial interpretations of over q-binomial coefficients, we prove a Rogers-Ramaujan type partition theorem.
Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For ρ=1 or -1, we determine $\prod_{0<c<d, (d/c)=ρ} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the fundamental unit and the class number of E, where (d/c) is the Kronecker symbol.
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 particular, $2h\le k$ suffices.) As an application, we prove that if G and H are multiplicative subgroups of a finite field, with H<G, and such that $1-α\in G$ for all $α\in G\setminus H$, then $G\cup\{0\}$ is a subfield.
Let $p>3$ be a prime. In this paper, we obtain the congruences for $$\sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^3}{(-8)^k},\ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{3k}k}{(-192)^k},\ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{4k}{2k}}{(-144)^k}\ \text{and} \ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{4k}{2k}}{648^k}$$ modulo $p^2$, and partial results for $\sum_{k=0}^{(p-1)/2} \binom{2k}k^3\frac{w(k)}{m^k}$ modulo $p^2$, where $m\in\{1,16,-64,256,-512,4096\}$ and $w(k)\in\{k^2,k^3,\frac 1{k+1},\frac 1{(k+1)^2},\frac 1{(k+1)^3}, \frac 1{2k-1},\frac 1{k+2}\}$.
Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a dense $G_δ$ set of $θ$ in the unit interval, $\{d_n(x)θ\}$ is almost surely dense but not uniformly distributed modulo 1.
In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4 (mod 5), p=13,17 (mod 30), and p=7,23 (mod 30) respectively, where {F_n} is the Fibonacci sequence. We also raise several conjectures.
Loeb showed that a natural extension of the usual binomial coefficient to negative (integer) entries continues to satisfy many of the fundamental properties. In particular, he gave a uniform binomial theorem as well as a combinatorial interpretation in terms of choosing subsets of sets with a negative number of elements. We show that all of this can be extended to the case of Gaussian binomial coefficients. Moreover, we demonstrate that several of the well-known arithmetic properties of binomial coefficients also hold in the case of negative entries. In particular, we show that Lucas' Theorem …
Picking binomial coefficients which cannot be divided by a given prime from Pascal's triangle, we find that they form a set with self-similarity. Essouabri studied on a class of meromorphic functions associated to the above set. These functions are related to fractal geometry and it is a problem whether such a function has a non-real pole on its axis of absolute convergence. Essouabri gave a proof of existence of such a non-real pole in the simplest case. The keys of his proof are Stein's and Wilson's estimates on how fast the points multiply in Pascal's triangle modulo a prime. This article w…
Second order Recurrences, quadratic number fields and cyclic codes
Anhui University（安徽大学）；École Supérieure de l’Education et de la Formation（教育与高等师范学院）；Sogang University（西江大学）；Aix Marseille Univ, CNRS（艾克斯-马赛大学，法国国家科学研究中心）
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences, where the underlying prime congruence structures of the rational sequence denominators enables the integer sequence to be recovered. From either the rational or the integer sequences we construct sequences of vectors in $\mathbb{Q}^m$, which converge to irrational algebraic points in $\mathbb{R}^m$. The rational sequence terms can be expressed as simple recurren…
Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete system of residues modulo any power of p.
In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$ and $m$--ary partitions with no gaps $(c_{m}(n))_{m\in\mathbb{N}}$. We prove, for example, that for any natural number $2<h\leq m+1$ in both sequences $(b_{m}(n))_{m\in\mathbb{N}}$ and $(c_{m}(n))_{m\in\mathbb{N}}$ any residue class modulo $h$ appears infinitely many times. Moreover, we give new proofs of characterisations modulo $m$ in terms of base--$m$ r…
