Papers
Topics
Authors
Recent
Search
2000 character limit reached

Supercongruences for the Almkvist-Zudilin numbers

Published 28 Jun 2015 in math.NT and math.CO | (1506.08437v1)

Abstract: Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$; while the latter (essentially) focuses on the maximal powers $r$ and $t$ such that $c(prn)$ is congruent to $c(p{r-1}n)$ modulo $pt$. This is called supercongruence. In this paper, we prove a conjecture on supercongruences for sequences that have come to be known as the Almkvist-Zudilin numbers. Some other (naturally) related family of sequences will be considered in a similar vain.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.