Program to find the Nth term of series 5, 12, 21, 32, 45……

0 0 2 minutes read

Given a number N, The task is to write a program to find the Nth term of the below series:

5, 12, 21, 32, 45……

Examples:

Input: N = 2
Output: 12

Input: N = 5
Output: 45

Approach:
The generalized Nth term of this series:

Nth Term : n*n + 4*n

Below is the required implementation:

C++

// CPP program to find
// the N-th term of the series:
// 5, 12, 21, 32, 45......
 
#include <iostream>
#include <math.h>
using namespace std;
 
// calculate Nth term of series
int nthTerm(int n)
{
    return pow(n, 2) + 4 * n;
}
 
// Driver code
int main()
{
 
    // Get N
    int N = 4;
 
    // Get the Nth term
    cout << nthTerm(N) << endl;
 
    return 0;
}

C

// C program to find
// the N-th term of the series:
// 5, 12, 21, 32, 45......
#include <stdio.h>
#include <math.h>
 
// calculate Nth term of series
int nthTerm(int n)
{
    return pow(n, 2) + 4 * n;
}
 
// Driver code
int main()
{
 
    // Get N
    int N = 4;
 
    // Get the Nth term
    printf("%d\n",nthTerm(N));
 
    return 0;
}
 
// This code is contributed by kothavvsaakash.

Java

// Java  program to find
// the N-th term of the series:
// 5, 12, 21, 32, 45......
import java.io.*;
 
class GFG {
     
 
 
// calculate Nth term of series
static int nthTerm(int n)
{
    return (int)Math.pow(n, 2) + 4 * n;
}
 
// Driver code
 
    public static void main (String[] args) {
     
    // Get N
    int N = 4;
 
    // Get the Nth term
    System.out.println( nthTerm(N));
 
    }
}
// This code is contributed
// by  inder_verma

Python3

# Python3 program to find
# the N-th term of the series:
# 5, 12, 21, 32, 45......
 
# calculate Nth term of series
def nthTerm(n):
    return n ** 2 + 4 * n;
 
# Driver code
 
# Get N
N = 4
 
# Get the Nth term
print(nthTerm(N))
 
# This code is contributed by Raj

C#

// C# program to find the 
// N-th term of the series:
// 5, 12, 21, 32, 45......
using System;
 
class GFG
{
     
// calculate Nth term of series
static int nthTerm(int n)
{
    return (int)Math.Pow(n, 2) + 4 * n;
}
 
// Driver code
public static void Main () 
{
 
    // Get N
    int N = 4;
     
    // Get the Nth term
    Console.WriteLine(nthTerm(N));
}
}
 
// This code is contributed
// by sh..

PHP

<?php
// PHP program to find
// the N-th term of the series:
// 5, 12, 21, 32, 45......
 
// calculate Nth term of series
function nthTerm($n)
{
    return pow($n, 2) + 4 * $n;
}
 
// Driver code
$N = 4;
 
// Get the Nth term
echo nthTerm($N);
 
// This code is contributed
// by Mahadev99
?>

Javascript

<script>
// JavaScript program to find
// the N-th term of the series:
// 5, 12, 21, 32, 45......
 
 
// calculate Nth term of series
function nthTerm( n)
{
    return Math.pow(n, 2) + 4 * n;
}
 
// Driver code
    // Get N
    let N = 4;
 
    // Get the Nth term
    document.write( nthTerm(N));
 
// This code is contributed by todaysgaurav
 
</script>

Output:

Time complexity: O(1), since there is no loop or recursion.

Auxiliary Space: O(1), since no extra space has been taken.

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!