Assembly Language Coding Challenge 1 Solution

Code the sum of n terms of an arithmetic progression.
S = (n/2)(2a+(n-1)d)
You can get access to the machine , assembler etc from Code The Machine here:
Support me with PayPal

[RossMcgowanMaths]

As pointed out by Tim - ' the same number in effect added twice which is the same as 2xnumber which is always positive giving 2S then we always get an integer when we divide by 2 ' so we will never run into division of an odd number so we can use integers for all values of n (even and odd).