2009
DOI: 10.1515/integ.2009.029
|View full text |Cite
|
Sign up to set email alerts
|

On Relatively Prime Sets

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
18
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(20 citation statements)
references
References 0 publications
2
18
0
Order By: Relevance
“…In Section 3, we show that we need only to derive the formula for Φ k (X, n) as the others will follow as a consequence. This will cover the results in [2], [3], [5], [6], [12], and [13]. In Section 4, we extend the formulas obtained by Ayad and Kihel [2], [3], by El Bachraoui [7], [8], [9], and by El Bachraoui and Salim [10].…”
Section: Introductionmentioning
confidence: 62%
See 2 more Smart Citations
“…In Section 3, we show that we need only to derive the formula for Φ k (X, n) as the others will follow as a consequence. This will cover the results in [2], [3], [5], [6], [12], and [13]. In Section 4, we extend the formulas obtained by Ayad and Kihel [2], [3], by El Bachraoui [7], [8], [9], and by El Bachraoui and Salim [10].…”
Section: Introductionmentioning
confidence: 62%
“…In this section, we give a simple proof of the formula for Φ (a,b) k (m, n) and show that the formulas for Φ (a,b) (m, n), f (a,b) k (m), and f (a,b) (m) can be obtained as a consequence. In the notation used in [2], [3]…”
Section: Only One Formula Is Enoughmentioning
confidence: 99%
See 1 more Smart Citation
“…Let f .n/ andˆ.n/ denote respectively the number of relatively prime subsets of ¹1; 2; : : : ; nº and the number of nonempty subsets A of ¹1; 2; : : : ; nº such that gcd.A/ is relatively prime to n. Exact formulas and asymptotic estimates are given by M. B. Nathanson in [5]. Generalizations may be found in [1], [2], [3], [4] and [6]. Let OEx denote the greatest integer less than or equal to x and .n/ the Möbius function.…”
Section: Introductionmentioning
confidence: 99%
“…In [1], a new function ‰.n; p/ The research of the second author is partially supported by NSERC. generalizingˆis defined such that ‰.n; p/ represents the number of primitive elements of F p n over F p , where p is any prime number.…”
Section: Introductionmentioning
confidence: 99%