https://www.wolframalpha.com/input/?i=sum+%282%28k+mod+2%29+-+1%29%2F%28n+%5E+k%29+k%3D1+to+inf이게 결과가 저렇게 나오는이유가 뭐임?
sum (2(k mod 2) - 1)/(n ^ k) k=1 to inf = (sum 1/n^(2k-1) k=1 to inf) - (sum 1/n^2k k=1 to inf) = (sum (1/n^2k)*n k=1 to inf) - (sum 1/n^2k k=1 to inf) = n * (sum 1/n^2k k=1 to inf) - (sum 1/n^2k k=1 to inf) = (n - 1) * (sum 1/n^2k k=1 to inf) = (n - 1) * 1/n^2 * (sum 1/n^2(k-1) k=1 to inf) = (n - 1) * 1/n^2 * (1/(1-(1/n^2))) = (n - 1) * 1/n^2 * (n^2/(n^2-1)) = (n - 1) * (1/(n^2-1)
= (n - 1) / (n^2-1) = 1 / (n + 1)
등비수열 극한 조건에 의해서 |n|>1이어야함.
이산수학인가