No squares allowed

Calculus Level 2

Any integer n n can be uniquely written as a product of the form n = s 2 m n = s^2 m . For example, 18 = 3 2 2 18 = 3^2 \cdot 2 . Square-free integers are integers such that s = 1 s=1 , so they are not divisible by any perfect square.

For the set of all square-free integers S S , evaluate

m S 1 m \displaystyle\sum_{m \in S}^\infty \frac{1}{m}

If the sum diverges, input 1 -1 .


The answer is -1.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Levi Walker
Nov 25, 2018

Notice that every prime number, p p , is squarefree. Thus, m = 1 1 m > p = 1 1 p \displaystyle \sum_{m=1}^\infty \frac{1}{m} > \displaystyle \sum_{p=1}^\infty \frac{1}{p}

The right hand side diverges (see this post , for the proof). We then have

< m = 1 1 m \infty < \displaystyle \sum_{m=1}^\infty \frac{1}{m}

Thus the sum in question diverges as well. So the answer is 1 \boxed{-1} .

You don't need an upper "bound" here (also, infinity is not a bound!) - the second half of your proof (together with the observation that every term in the sum is positive) is enough.

Chris Lewis - 2 years, 6 months ago
Otto Bretscher
Nov 25, 2018

Assuming that m S 1 m \sum_{m \in S}\frac{1}{m} converges (where S S denotes the square-free numbers), we must conclude that ( n 1 n 2 ) ( m S 1 m ) = n 1 n (\sum_n\frac{1}{n^2}) (\sum_{m \in S}\frac{1}{m})=\sum_n\frac{1}{n} converges too, a contradiction.

Thus the answer is 1 \boxed{-1}

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...