Hithere,
I have the following challenge.
Some pointers first:
For e.g. a sequence of whole numbers beginning with 1 and ending with 4, the sum will be 10. (1+2+3+4)
For a sequence from 1-6 the sum will be 21.
The sequence I want this formula to work on will always start with 1.
So a sequence that adheres to the above and contains 4 numbers (1,2,3,4) will have the sum of 10.
A sequence that adheres to the above and contains 6 numbers (1,2,3,4,5,6) will have the sum of 21.
What I am looking for is a formula that will output the sum of the count of numbers.
What I mean by this is that if you would input 4, it will return 10. If you input 6, it returns 21. Etc.
Can this be done?
T.I.A.!
I have the following challenge.
Some pointers first:
For e.g. a sequence of whole numbers beginning with 1 and ending with 4, the sum will be 10. (1+2+3+4)
For a sequence from 1-6 the sum will be 21.
The sequence I want this formula to work on will always start with 1.
So a sequence that adheres to the above and contains 4 numbers (1,2,3,4) will have the sum of 10.
A sequence that adheres to the above and contains 6 numbers (1,2,3,4,5,6) will have the sum of 21.
What I am looking for is a formula that will output the sum of the count of numbers.
What I mean by this is that if you would input 4, it will return 10. If you input 6, it returns 21. Etc.
Can this be done?
T.I.A.!