Combinatorial Identities Involving Mertens Function Through Relatively Prime Subsets
Number Theory
2009-12-09 v1
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.
Cite
@article{arxiv.0912.1518,
title = {Combinatorial Identities Involving Mertens Function Through Relatively Prime Subsets},
author = {Mohamed El Bachraoui},
journal= {arXiv preprint arXiv:0912.1518},
year = {2009}
}
Comments
7 pages