The Last Digit of (2nn)\binom{2n}{n} and ∑(ni)(2n−2in−i)\sum\binom{n}{i}\binom{2n-2i}{n-i}

preprint2013arXivOpen access

Abstract

Let fn=∑i=0n(ni)(2n−2in−i)f_{n}=\sum_{i=0}^n \binom{n}{i}\binom{2n-2i}{n-i}, gn=∑i=1n(ni)(2n−2in−i)g_{n}= \sum_{i=1}^n \binom{n}{i}\binom{2n-2i}{n-i}. Let {ak}k=1\{a_k\}_{k=1} be the set of all positive integers n, in increasing order, for which (2nn)\binom{2n}{n} is not divisible by 5, and let {bk}k=1\{b_k\}_{k=1} be the set of all positive integers n, in increasing order, for which gng_n is not divisible by 5. This note finds simple formulas for aka_k, bkb_k, (2nn) mod 10\binom{2n}{n}\ mod\ 10, fn mod 10 f_{n}\ mod\ 10, and gn mod 10 g_{n}\ mod\ 10.

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.