Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions
Abstract
Recently, there has been a sharp rise of interest in properties of digits primes. Here we study yet another question of this kind. Namely, we fix an integer base g 2 and then for every infinite sequence D = \di\i=0∞ ∈ \0, …, g-1\∞ of g-ary digits we consider the counting function D,g(N) of integers n N for which Σi=0n-1 di gi is prime. We construct sequences D for which D,g(N) grows fast enough, and show that for some constant g< g there are at most O(gN) initial elements (d0, …, dN-1) of D for which D,g(N)=N+O(1). We also discuss joint arithmetic properties of integers and mirror reflections of their g-ary expansions.
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.