Arithmetic properties of multiplicative integer-valued perturbed random walks
Abstract
Let (1, η1), (2, η2),… be independent identically distributed N2-valued random vectors with arbitrarily dependent components. The sequence (k)k∈N defined by k=k-1·ηk, where 0=1 and k=1·…· k for k∈N, is called a multiplicative perturbed random walk. We study arithmetic properties of the random sets \1,2,…, k\⊂ N and \1,2,…, k\⊂ N, k∈N. In particular, we derive distributional limit theorems for their prime counts and for the least common multiple.
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.