Any integer n can be uniquely written as a product of the form n = s 2 m . For example, 1 8 = 3 2 ⋅ 2 . Square-free integers are integers such that s = 1 , so they are not divisible by any perfect square.
For the set of all square-free integers S , evaluate
m ∈ S ∑ ∞ m 1
If the sum diverges, input − 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.
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.
Assuming that ∑ m ∈ S m 1 converges (where S denotes the square-free numbers), we must conclude that ( ∑ n n 2 1 ) ( ∑ m ∈ S m 1 ) = ∑ n n 1 converges too, a contradiction.
Thus the answer is − 1
Problem Loading...
Note Loading...
Set Loading...
Notice that every prime number, p , is squarefree. Thus, m = 1 ∑ ∞ m 1 > p = 1 ∑ ∞ p 1
The right hand side diverges (see this post , for the proof). We then have
∞ < m = 1 ∑ ∞ m 1
Thus the sum in question diverges as well. So the answer is − 1 .