Back to results
University of Illinois at Urbana-Champaign
Topics in Analytic, Combinatorial and Probabilistic Number Theory
Abstract
dc:descriptionIn the last chapter we consider the problem of determining how large an integer M should be so that almost every subset of {l, ..., N} of size M contains at least one arithmetic progression of length k. We also investigate the length of the longest arithmetic progression in a random subset of positive integers.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yang, Yifan
- Contributors dc:contributor
-
- Hildebrand, A.J.
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI9990197
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/87008