Parity of the number of primes in a given interval and algorithms of the sublinear summation
Abstract
Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x1/2-c+) steps for some absolute constant c. We propose a slightly different approach, which leads to the implicit value of c. To achieve this aim we discuss the summation of multiplicative functions, developing sublinear algorithms and proving several general theorems.
0
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.