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/71225
Description
Title
Topics in Combinatorial Number Theory
Author(s)
Filaseta, Michael Anthony
Issue Date
1984
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
Abstract
In this dissertation we present a number of new results in combinatorial number theory. Chapter I discusses a generalization of B(,2)-sequences which are used in Chapter II and Chapter III to obtain short interval results about k-free values of irreducible polynomials. Chapter IV deals with the number of partitions of an integer using a set of distinct parts; Chapter V demonstrates how a single prime value of a polynomial with non-negative coefficients can be used to show that the polynomial is irreducible; Chapter VI compares simple continued fraction convergents for SQRT.(N) with Newton approximations to SQRT.(N); and Chapter VII obtains exact formulas for a certain class of ballot problems. An introduction is included which gives preliminary discussions on various aspects of the problems.
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.
