Program to print Arithmetic Progression series
Given first term (a), common difference (d) and a integer n of the Arithmetic Progression series, the task is to print the series.
Examples :
Input : a = 5, d = 2, n = 10
Output : 5 7 9 11 13 15 17 19 21 23
Approach :
We know the Arithmetic Progression series is like = 2, 5, 8, 11, 14 …. …
In this series 2 is the starting term of the series .
Common difference = 5 – 2 = 3 (Difference common in the series).
so we can write the series as :
t1 = a1
t2 = a1 + (2-1) * d
t3 = a1 + (3-1) * d
.
.
.
tn = a1 + (n-1) * d
CPP
// CPP Program to print an arithmetic // progression series #include <bits/stdc++.h> using namespace std; void printAP( int a, int d, int n) { // Printing AP by simply adding d // to previous term. int curr_term; curr_term=a; for ( int i = 1; i <= n; i++) { cout << curr_term << " " ; curr_term =curr_term + d; } } // Driver code int main() { // starting number int a = 2; // Common difference int d = 1; // N th term to be find int n = 5; printAP(a, d, n); return 0; } |
Java
// Java Program to print an arithmetic // progression series class GFG { static void printAP( int a, int d, int n) { // Printing AP by simply adding d // to previous term. int curr_term; curr_term=a; for ( int i = 1 ; i <= n; i++) { System.out.print(curr_term + " " ); curr_term =curr_term + d; } } // Driver code public static void main(String[] args) { // starting number int a = 2 ; // Common difference int d = 1 ; // N th term to be find int n = 5 ; printAP(a, d, n); } } // This code is contributed by Anant Agarwal. |
Python3
# Python 3 Program to # print an arithmetic # progression series def printAP(a, d, n): # Printing AP by simply adding d # to previous term. curr_term = a for i in range ( 1 , n + 1 ): print (curr_term, end = ' ' ) curr_term = curr_term + d # Driver code a = 2 # starting number d = 1 # Common difference n = 5 # N th term to be find printAP(a, d, n) # This code is contributed # by Azkia Anam and Updated by Ameya Bavkar. |
C#
// C# Program to print an arithmetic // progression series using System; class GFG { static void printAP( int a, int d, int n) { // Printing AP by simply adding // d to previous term. int curr_term; curr_term=a; for ( int i = 1; i <= n; i++) { Console.Write(curr_term + " " ); curr_term += d; } } // Driver code public static void Main() { // starting number int a = 2; // Common difference int d = 1; // N th term to be find int n = 5; printAP(a, d, n); } } // This code is contributed by vgt_m. |
Javascript
<script> // JavaScript Program to print an arithmetic // progression series function printAP(a, d, n) { // Printing AP by simply adding d // to previous term. let curr_term; curr_term=a; for (let i = 1; i <= n; i++) { document.write(curr_term + " " ); curr_term =curr_term + d; } } // Driver code // starting number let a = 2; // Common difference let d = 1; // N th term to be find let n = 5; printAP(a, d, n); // This code is contributed by Surbhi Tyagi </script> |
PHP
<?php // PHP Program to print an arithmetic // progression series function printAP( $a , $d , $n ) { // Printing AP by simply adding d // to previous term. $curr_term = $a ; for ( $i = 1; $i <= $n ; $i ++) { echo ( $curr_term . " " ); $curr_term += $d ; } } // Driver code // starting number $a = 2; // Common difference $d = 1; // N th term to be find $n = 5; printAP( $a , $d , $n ); // This code is contributed by Ajit and Updated by Ameya Bavkar. ?> |
Output
2 3 4 5 6
Time complexity: O(n) where n is the total number of terms of a given A.P
Auxiliary Space: O(1)
Contact Us