\[\sum_{n=1}^{\infty} \mu (n)\]

**1]** Prove/Disprove , that the sum mentioned above converges.

Also ,

\[\sum_{n=1}^{\infty}(-1) ^{\mu (n)}\]

**2]** Prove / Disprove , the sum mentioned above converges.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestTHe first sum diverges Link

The second sum follows suit.

Log in to reply

EDIT: My new thinking is that both sums does not converge or diverge since it's value fluctuates.

Either ways, here's my approach:

Let \(f\) be a completely multiplicative function.

\[\sum_{n>0}f(n)=\left[\prod_{p \text{ is prime}}(1-f(p))\right]^{-1}\]

Through euler product.

Expanding the product gives

\[\prod_{p \text{ is prime}}(1-f(p))=\sum_{n>0}\mu(n)f(n)\]

Putting it all together

\[\sum_{n>0}f(n)=\left[\sum_{n>0}\mu(n)f(n)\right]^{-1}\]

Substituting \(f=1\) gives

\[\sum_{n>0}1=\left[\sum_{n>0}\mu(n)\right]^{-1}\]

\[\sum_{n>0}\mu(n)=0\]

Of course there is a lot of hand waving here.

Log in to reply

Till some point I also thought like this , but later , I left it as I thought it may be wrong.

Log in to reply

Log in to reply

@Julian Poon , @Aareyan Manzoor I'm waiting for your reply

Log in to reply

Diverges means doesnt converge to a specific finite value, so it has to be eother one.

Log in to reply

Log in to reply

@Julian Poon , @Aareyan Manzoor any modifications ?

Log in to reply

Both sums diverges.

Log in to reply