Combinatorial Sums $\sum_{k\equiv r(\mbox{mod} m)}{n\choose k}a^k$ and Lucas Quotients (II)

preprint2016arXivOpen access

Abstract

In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed in terms of some recurrent sequences with orders not exceeding φ(m)φ{(m)} and give some new congruences.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.