Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lucas congruences using modular forms (2408.16616v2)

Published 29 Aug 2024 in math.NT

Abstract: In this work, we prove that many Ap\'ery-like sequences arising from modular forms satisfy the Lucas congruences modulo any prime. As an implication, we completely affirm four conjectural Lucas congruences that were recently posed by S. Cooper and reinterpret a number of known results.

Summary

We haven't generated a summary for this paper yet.