Program to find Nth term of series 0, 11, 28, 51, 79, 115, 156, 203, ….
Given a number N. The task is to write a program to find the Nth term of the below series:
0, 11, 28, 51, 79, 115, 156, 203…..(N Terms)
Examples:
Input: N = 4
Output: 51
For N = 4
4th Term = ( 3 * 4 * 4 + 2 * 4 - 5)
= 51
Input: N = 10
Output: 314
Approach: The generalized Nth term of this series:
Below is the required implementation:
C++
#include <iostream>
#include <math.h>
using namespace std;
int nthTerm( int n)
{
return 3 * pow (n, 2) + 2 * n - 5;
}
int main()
{
int N = 4;
cout << nthTerm(N) << endl;
return 0;
}
|
Java
import java.io.*;
class GFG
{
static int nthTerm( int n)
{
return 3 * ( int ) Math.pow(n, 2 ) +
2 * n - 5 ;
}
public static void main (String[] args)
{
int N = 4 ;
System.out.println(nthTerm(N));
}
}
|
Python3
def nthTerm(n):
return 3 * pow (n, 2 ) + 2 * n - 5
N = 4
print (nthTerm(N))
|
C#
using System;
class GFG
{
static int nthTerm( int n)
{
return 3 * ( int ) Math.Pow(n, 2) +
2 * n - 5;
}
public static void Main ()
{
int N = 4;
Console.WriteLine(nthTerm(N));
}
}
|
PHP
<?php
function nthTerm( $n )
{
return 3 * pow( $n , 2) + 2 * $n - 5;
}
$N = 4;
echo nthTerm( $N ) . "\n" ;
|
Javascript
<script>
function nthTerm( n)
{
return 3 * Math.pow(n, 2) + 2 * n - 5;
}
let N = 4;
document.write( nthTerm(N));
</script>
|
Time Complexity: O(1), since there is no loop or recursion.
Space Complexity: O(1) since using constant variables
Last Updated :
20 Aug, 2022
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...