# For any positive integer n, show that µ(n)*µ(n+1)*µ(n+2)*µ(n+3)=0

For a positive integer n:

`mu(n)` = 1 if n has an even number of prime factors and none of them is a square.

`mu(n) = -1` if n has an odd number of prime factors and none of them are squares.

`mu(n) = 0` if n has factors that...

## See This Answer Now

Start your 48-hour free trial to unlock this answer and thousands more. Enjoy eNotes ad-free and cancel anytime.

For a positive integer n:

`mu(n)` = 1 if n has an even number of prime factors and none of them is a square.

`mu(n) = -1` if n has an odd number of prime factors and none of them are squares.

`mu(n) = 0` if n has factors that are squares.

Now for any number n, one of the four consecutive numbers n, (n+1), (n+2) or (n+3) will be divisible by 4. As 4 is a square number and `mu(n) = 0` if n has a factor that is a square one of the values `mu(n), mu(n+1),mu(n+2) or mu(n+3)` is equal to zero.

This proves that for any number n `mu(n)*mu(n+1)*mu(n+2)*mu(n+3) = 0`
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}