On the longest length of arithmetic progressions
Abstract
Suppose that (n)1,(n)2,...,(n)n are i.i.d with P((n)i=1)=pn=1-P((n)i=0). Let U(n) and W(n) be the longest length of arithmetic progressions and of arithmetic progressions mod n relative to (n)1,(n)2,..., (n)n respectively. Firstly, the asymptotic distributions of U(n) and W(n) are given. Simultaneously, the errors are estimated by using Chen-Stein method. Next, the almost surely limits are discussed when all pn are equal and when considered on a common probability space. Finally, we consider the case that n∞pn=0 and n∞npn=∞. We prove that as n tends to ∞, the probability that U(n) takes two numbers and W(n) takes three numbers tends to 1.
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.