On the primes in floor function sets
Abstract
Let [t] be the integral part of the real number t and let 1 P be the characteristic function of the primes. Denote by π G (x) the number of primes in the floor function set G(x) := [ x n ] : 1 n x and by S 1 P (x) the number of primes in the sequence [ x n ] n 1. Very recently, Heyman proves
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.