Congruences for sums of powers of an integer
Abstract
For coprime positive integers q and e, let m(q,e) denote the least positive integer t such that there exists a sum of t powers of q which is divisible by e. We prove an upper bound for m(q.e) and investigate the case where m(q,e) is "large". We also pay special attention to the situation where e is a prime power.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.