Daily Challenge #84

[vknow360 (Sunny Gupta)]

Hi
Finally the day came which I was waiting for weeks
Although I wanted to make 85th DC but no one posted 84th DC so I have to post it.
Today’s challenge is to make a procedure which takes

a - initial value
d - common difference
f - number of terms

as input (int) and returns the terms of A.P.(arithmetic progression) in CSV format.
Something like this:

Note: 1.Number of blocks does not matters.You can use as much blocks as you want but don’t compromise with speed and accuracy
2.number of terms means next n number of terms.First number is the initial value and you have to find next n terms of A.P

Arithmetic Progression is 5th chapter of my Math’s book which I have read today in the morning

[Fabio (FábioESantos)]

I've given it a try!

[themaayur (Mayur Berad)]

I have almost solved the challange
One dout If the no. Of terms is 5 then why the o/p is 6.

I am not so good in maths

[vknow360 (Sunny Gupta)]

@themaayur

One dout If the no. Of terms is 5 then why the o/p is 6.

Oops…my mistake
I forgot to mention that number of terms means next n number of terms.
First number is the initial value and you have to find next n terms of A.P.

[WatermelonIce (Bryan)]

Noooo! I missed it. I think I still have time.

[Yoshi (KidKoder)]

It’s 10:06 in EU. And you’re saying

@WatermelonIce

Noooo! I missed it.

Well, for me, the DC has just began!

[dora_paz (Dora)]

Here is mine

My blocks

[WatermelonIce (Bryan)]

@dora_paz the output should be is csv format. See the first post.

@vknow360

returns the terms of A.P.(arithmetic progression) in CSV format

Btw, here is mine

My solution

Total block = 18

Proof of functionality:

[vknow360 (Sunny Gupta)]

Here is my solution:

Well done guys
Everyone has posted unique and correct solution so it was quite hard for me to choose the best solution.
But since @Fabio posted the correct solution first so I think he deserves this Green Tick

[WatermelonIce (Bryan)]

@vknow360

posted the correct solution first

So we have to compete who is faster rather than who has the best answer?

[vknow360 (Sunny Gupta)]

@WatermelonIce

So we have to compete who is faster rather than who has the best answer?

No , not at all.
You have to compete to post the best solution.
As I said

@vknow360

Everyone has posted unique and correct solution so it was quite hard for me to choose the best solution.

But I can’t mark everyone’s post as solution so I thought to go with his solution.
Everyone’s solution was best and I appreciate your work