给定数字N,任务是找到级数的第n个项
5, 2, 19, 13, 41, 31, 71, 57….
假定n的值可以在1到10000之间。
例子:
Input: N = 4
Output:13
Input: N = 15
Output:272
方法:问题看起来很困难,但是方法非常简单。如果n的值是一个奇数,则第n个项将是((n + 1)^ 2)+ n。
否则,将为((n – 1)^ 2)+ n。
执行:
C++
// C++ program to find nth term of
// the series 5 2 13 41
#include
using namespace std;
// function to calculate nth term of the series
int nthTermOfTheSeries(int n)
{
// to store the nth term of series
int nthTerm;
// if n is even number
if (n % 2 == 0)
nthTerm = pow(n - 1, 2) + n;
// if n is odd number
else
nthTerm = pow(n + 1, 2) + n;
// return nth term
return nthTerm;
}
// Driver code
int main()
{
int n;
n = 8;
cout << nthTermOfTheSeries(n) << endl;
n = 12;
cout << nthTermOfTheSeries(n) << endl;
n = 102;
cout << nthTermOfTheSeries(n) << endl;
n = 999;
cout << nthTermOfTheSeries(n) << endl;
n = 9999;
cout << nthTermOfTheSeries(n) << endl;
return 0;
}
// This code is contributed
// by Akanksha Rai
C
// C program to find nth term of
// the series 5 2 13 41
#include
#include
// function to calculate nth term of the series
int nthTermOfTheSeries(int n)
{
// to store the nth term of series
int nthTerm;
// if n is even number
if (n % 2 == 0)
nthTerm = pow(n - 1, 2) + n;
// if n is odd number
else
nthTerm = pow(n + 1, 2) + n;
// return nth term
return nthTerm;
}
// Driver code
int main()
{
int n;
n = 8;
printf("%d\n", nthTermOfTheSeries(n));
n = 12;
printf("%d\n", nthTermOfTheSeries(n));
n = 102;
printf("%d\n", nthTermOfTheSeries(n));
n = 999;
printf("%d\n", nthTermOfTheSeries(n));
n = 9999;
printf("%d\n", nthTermOfTheSeries(n));
return 0;
}
Java
// Java program to find nth term of the series 5 2 13 41
import java.lang.Math;
class GFG
{
// function to calculate nth term of the series
static long nthTermOfTheSeries(int n)
{
// to store the nth term of series
long nthTerm;
// if n is even number
if (n % 2 == 0)
nthTerm = (long)Math.pow(n - 1, 2) + n;
// if n is odd number
else
nthTerm = (long)Math.pow(n + 1, 2) + n;
// return nth term
return nthTerm;
}
// Driver code
public static void main(String[] args)
{
int n;
n = 8;
System.out.println( nthTermOfTheSeries(n));
n = 12;
System.out.println( nthTermOfTheSeries(n));
n = 102;
System.out.println( nthTermOfTheSeries(n));
n = 999;
System.out.println( nthTermOfTheSeries(n));
n = 9999;
System.out.println( nthTermOfTheSeries(n));
//This code is contributed by 29AjayKumar
}
}
Python3
# Python3 program to find nth term
# of the series 5 2 13 41
from math import pow
# function to calculate nth term
# of the series
def nthTermOfTheSeries(n):
# to store the nth term of series
# if n is even number
if (n % 2 == 0):
nthTerm = pow(n - 1, 2) + n
# if n is odd number
else:
nthTerm = pow(n + 1, 2) + n
# return nth term
return nthTerm
# Driver code
if __name__ == '__main__':
n = 8
print(int(nthTermOfTheSeries(n)))
n = 12
print(int(nthTermOfTheSeries(n)))
n = 102
print(int(nthTermOfTheSeries(n)))
n = 999
print(int(nthTermOfTheSeries(n)))
n = 9999
print(int(nthTermOfTheSeries(n)))
# This code is contributed by
# Shashank_Sharma
C#
// C# program to find nth term
// of the series 5 2 13 41
using System;
class GFG
{
// function to calculate
// nth term of the series
static long nthTermOfTheSeries(int n)
{
// to store the nth term of series
long nthTerm;
// if n is even number
if (n % 2 == 0)
nthTerm = (long)Math.Pow(n - 1, 2) + n;
// if n is odd number
else
nthTerm = (long)Math.Pow(n + 1, 2) + n;
// return nth term
return nthTerm;
}
// Driver code
public static void Main()
{
int n;
n = 8;
Console.WriteLine(nthTermOfTheSeries(n));
n = 12;
Console.WriteLine( nthTermOfTheSeries(n));
n = 102;
Console.WriteLine( nthTermOfTheSeries(n));
n = 999;
Console.WriteLine( nthTermOfTheSeries(n));
n = 9999;
Console.WriteLine( nthTermOfTheSeries(n));
}
}
// This code is contributed by Ryuga
PHP
Javascript
输出:
57
133
10303
1000999
100009999