Topics in Analytic, Combinatorial and Probabilistic Number Theory
Yang, Yifan
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/87008
Description
Title
Topics in Analytic, Combinatorial and Probabilistic Number Theory
Author(s)
Yang, Yifan
Issue Date
2000
Doctoral Committee Chair(s)
Hildebrand, A.J.
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Mathematics
Language
eng
Abstract
In 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.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
