Article
Licensed
Unlicensed
Requires Authentication
On Relatively Prime Sets
-
and
Published/Copyright:
August 31, 2009
Abstract
Functions counting the number of subsets of {1, 2, . . . , n} having particular properties are defined by Nathanson. Here, generalizations in two directions are given.
Received: 2008-10-01
Revised: 2009-03-20
Accepted: 2009-03-30
Published Online: 2009-08-31
Published in Print: 2009-September
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On Relatively Prime Sets
- Combinatorial Properties of the Antichains of a Garland
- φ(Fn) = Fm
- Twelfth Power Qualified Residue Difference Sets
- On Pebbling Graphs by Their Blocks
- Conjugacy Classes and Class Number
- Infinite Families of Divisibility Properties Modulo 4 for Non-Squashing Partitions into Distinct Parts
- Waring's Number in a Finite Field
- Lucas Diophantine Triples
Keywords for this article
Relatively prime sets;
Φ function;
finite fields;
primitive elements
Articles in the same Issue
- On Relatively Prime Sets
- Combinatorial Properties of the Antichains of a Garland
- φ(Fn) = Fm
- Twelfth Power Qualified Residue Difference Sets
- On Pebbling Graphs by Their Blocks
- Conjugacy Classes and Class Number
- Infinite Families of Divisibility Properties Modulo 4 for Non-Squashing Partitions into Distinct Parts
- Waring's Number in a Finite Field
- Lucas Diophantine Triples