Sunday, 29 May 2016

Why arithmetic progression formula Sn=(a1+an)n/2 works with uneven number of integer members?



Let's consider arithmetic progression with integer numbers.



Arithmetic progression sum Sn=(a1+an)n/2, where an=a1+d(n1)



So Sn=(2a1+d(n1))n/2=a1n+d(n1)n/2




I cannot understand, why it always happens that d(n1)n/2 is always an integer number? So that Sn is also always an integer.



Besides, everything seems clear with even number of progression members: 1 + 2 + 3 + 4 + 5 + 6 = (1+6) + (2+5) + (3+4) = (1+6)* (6 members / 2)



But if number of progression members is not even (1 + 2 + 3), it is unclear why Sn=(a1+an)n/2 formula works perfectly! Because (3 members / 2) is not an integer!


Answer



d(n1)n2 is always an integer because (n1)n2 is always an integer. This is simply because n and n1 differ by 1, and so atleast one of them must be even.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...