For which 2-adic integers xx can ∑k(xk)−1\sum_k \binom xk^{-1} be defined?

preprint2013arXivOpen access

Abstract

Let f(n)=∑k(nk)−1f(n)=\sum_k \binom nk^{-1}. In a previous paper, we defined for a p-adic integer x that f(x) is p-definable if lim f(xj)f(x_j) exists in QpQ_p, where xjx_j denotes the mod pjp^j reduction of xx. We proved that if p is odd, then -1 is the only element of Zp−NZ_p-N for which f(x) is p-definable. For p=2, we proved that if the 1's in the binary expansion of x are eventually extraordinarily sparse, then f(x) is 2-definable. Here we present some conjectures that f(x) is 2-definable for many more 2-adic integers. We discuss the extent to which we can prove these conjectures.

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.