For which p-adic integers x can Sumk binomial(x,k)(-1) be defined?
Abstract
Let f(n)= Sum binomial(n,k)(-1). First, we show that f:N to Qp is nowhere continuous in the p-adic topology. If x is a p-adic integer, we say that f(x) is p-definable if lim f(xj) exists in Qp, where xj denotes the jth partial sum for x. We prove that f(-1) is p-definable for all primes p, and if p is odd, then -1 is the only element of Zp - N for which f(x) is p-definable. For p=2, we show that if k is a positive integer, then f(-k-1) is not 2-definable, but that if the 1's in the binary expansion of x are eventually very sparse, then f(x) is 2-definable. Some of our proofs require that p satisfy one of two conditions. There are three small primes that do not satisfy the relevant condition, but our theorems can be proved directly for these primes. No other prime less than 100,000,000 fails to satisfy the conditions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.