Some combinatorial theorems with an application to a problem in number theory

Gardner, Benjamin I. (1967) Some combinatorial theorems with an application to a problem in number theory. Masters thesis, Memorial University of Newfoundland.

[img] [English] PDF - Accepted Version
Available under License - The author retains copyright ownership and moral rights in this thesis. Neither the thesis nor substantial extracts from it may be printed or otherwise reproduced without the author's permission.

Download (1680Kb)

Abstract

The main object of this thesis is to study the following extremal problem in number theory: Let n and k be integers satisfying n ≥ k ≥ 3. Denote by f(n,k) the largest positive integer for which there exists a set S of f(n,k) integers satisfying -- (i) S ⊑ { 1,2...,n } and -- (ii) no k numbers in S have pairwise the same greatest common divisor. -- We investigate the behaviour of f(n,k) in the case where k → ∞ with n. In particular we obtain estimates for f(n, [logαn]) for fixed α > 0 and f(n,[nα]) for fixed α, 0 < α < 1. -- In the course of our investigations we make use of certain intersection theorems for systems of finite sets. We also include a number of new results concerning these theorems.

Item Type: Thesis (Masters)
URI: http://research.library.mun.ca/id/eprint/7133
Item ID: 7133
Additional Information: Bibliography: leaf 33.
Department(s): Science, Faculty of > Mathematics and Statistics
Date: 1967
Date Type: Submission
Library of Congress Subject Heading: Number theory; Combinatorial analysis

Actions (login required)

View Item View Item

Downloads

Downloads per month over the past year

View more statistics