Premium
A Divisibility Problem
Author(s) -
Lebensold Kenneth
Publication year - 1977
Publication title -
studies in applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 46
eISSN - 1467-9590
pISSN - 0022-2526
DOI - 10.1002/sapm1977563291
Subject(s) - divisibility rule , computation , mathematics , composition (language) , combinatorics , pure mathematics , discrete mathematics , algorithm , philosophy , linguistics
We discuss the question of the size and composition of the largest subset Q of N = f 1, 2, ..., nf so that no one divides two others. We find that, as n→, 0.6725 n ⩽ | Q | ⩽ 0.6736 n , with more accurate bounds achievable by additional computation.