Combinatorial Identities Involving Mertens Function Through Relatively Prime Subsets

TL;DR

This paper presents new combinatorial identities involving the Mertens function M(n), utilizing the concept of relatively prime subsets to derive these results through combinatorial proofs.

Contribution

It introduces novel combinatorial identities related to the Mertens function using relatively prime subsets, providing new insights and proof techniques.

Findings

New identities involving M(n) derived

Combinatorial proofs based on relatively prime subsets

Enhanced understanding of Mertens function properties

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.