mjhjmtu

Let $a_1=1 $ and $ a_n=2-frac 1n$ for $ngeq 2$. Then $$sum_n=1^inftybigg(frac1a_n^2-frac1a_n+1^2bigg)$$
converges to?

I started by expanding the sum:

$sum_n=1^inftybigg(frac1a_n^2-frac1a_n+1^2bigg)=bigg(frac1a_1^2-frac1a_2^2bigg)+bigg(frac1a_2^2-frac1a_3^2bigg)+bigg(frac1a_3^2-frac1a_4^2bigg)+ldots$

$=frac1a_1^2+bigg(-frac1a_2^2+frac1a_2^2bigg)+bigg(-frac1a_3^2+frac1a_3^2bigg)+bigg(-frac1a_4^2+frac1a_4^2bigg)+ldots$

$=frac1a_1^2$

$=1$

Now, the strange part is that the answer to this question is known to me as $0.75$. Is there something wrong with what I did? How does one arrive at $0.75$ as a solution?

PS: I am aware that infinite sums can behave in strange ways, and sometimes more than one solution may follow logically. Is this one such case?

Let $$S_N=sum_n=1^Nleft(frac1a_n^2-frac1a_n+1^2right)=frac1a_1^2-frac1a_N+1^2.$$
Since $a_1=1$ and $a_nto 2$, we have
$$lim_NtoinftyS_N=1-frac12^2=frac34.$$

Infinite sums can behave in strange ways

True!

Sometimes more than one solution may follow logically

Definitely not true. There is one answer in every case (as long as you allow "the sum diverges" as an answer). Sure, there are subtle errors which may make it appear that a sum has more than one value, but that's exactly what they are - errors.

To avoid these errors, don't manipulate infinite sums unless you have a conclusive proof that the manipulation is justified. If you don't, go back to the definition. In your case this says
$$eqalignsum_n=1^inftybigg(frac1a_n^2-frac1a_n+1^2bigg)
&=lim_Ntoinftysum_n=1^Nbigg(frac1a_n^2-frac1a_n+1^2bigg)cr
&=lim_Ntoinftybiggl(frac1a_1^2-frac1a_N+1^2biggr) .cr$$
See if you can finish the job from here.

$a_n$ does not approach zero,
so the end term can not
be disregarded.

In other words,
the sum up to $n$ is
$frac1a_1^2
-frac1a_n^2
to 1-frac14
=frac34
$.