The Primes are 2-Accessible
Abstract
We prove that the set of positive integers having between 1 and n prime factors, counted with multiplicity, has degree of accessibility 2n. In particular, the case n=1 answers a question of Landman and Robertson asking whether the set of prime numbers is 2-accessible.
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.