Combinatorial Identities Involving Mertens Function Through Relatively Prime Subsets

2009/12/08 by Mohamed El Bachraoui, Bachraoui, Mohamed El · 1 citation
Mathematics · #11A25 #11B05 #11B75 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Advanced Mathematical Theories #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11A25 #msc:11B05 #msc:11B75

paper · pdf · doi:10.48550/arxiv.0912.1518

7 pages

arxiv created 2009/12/08 · openalex publication_date 2009/12/08 · arxiv updated 2010/01/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note we give some identities which involve the Mertens function M(n). Our proofs are combinatorial with relatively prime subsets as a main tool.

Cited by

• Combinatorial Identities Via Phi Functions and Relatively Prime Subsets

Related

• Combinatorial Identities Via Phi Functions and Relatively Prime Subsets
• A remark on relatively prime sets
• Combinatorial proofs of several partition identities of Andrews and Merca
• On some properties of the function of the number of relatively prime subsets of \1, 2, ..., n\
• Multiple Mertens evaluations