Revision as of 17:36, 25 January 2020 view source Thundergnat (talk \| contribs) 10,352 edits m →‎{{header\|Perl 6}}: Whitespace twiddles ← Older edit		Revision as of 17:51, 25 January 2020 view source Thundergnat (talk \| contribs) 10,352 edits m Clarify wording Newer edit →
Line 5: There are several ways to implement a Möbius function. A fairly straightforward ~~one~~method is to find the prime factors of a positive integer '''n''', ~~and~~then define '''μ(n)''' as the sum of the primitive ~~nth roots of unity~~factors. It has ~~values~~the invalues '''{−1, 0, 1}''' depending on the factorization of '''n''' ~~into prime factors~~: :* '''μ(n) = 1''' if '''n''' is a square-free positive integer with an '''even''' number of prime factors.

Möbius function: Difference between revisions