# Find n-th term in series 1 2 2 3 3 3 4 4 4 4….

Given series 1 2 2 3 3 3 4 4 4 4 …., find n-th term of the series. The “pattern” is obvious. There is one “1”, two “2”s three “3”s, etc.

Examples:

```Input : n = 5
Output : 3

Input :  n = 7
Output : 4
```

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

A naive approach is to run two loops one from 1 to n and the other from 1 to i, and for every iteration of the inner loop keep a count, whenever the count reaches n, we can break out of both the loops and i will be our answer.
Time Complexity: O(n)

An efficient approach will be to note down a small observation which is:
The trick is to find a pattern.

Consider numbering the given sequence as follows:
1 is at position 1
2 is at positions 2, 3
3 is at positions 4, 5, 6
4 is at positions 7, 8, 9, 10
and so on…

Notice that the last positions of the individual values form a sequence.
1, 3, 6, 10, 15, 21…

If we want a formula for the “nth” term, start by looking at it the other way around. In which term does the number “n” first appear? Taking the first term to be the “0th” term. “1” appears in term 0, “2” appears in term 1, “3” appears in term 1+2=3, “4” appears in term 1+2+3= 6, etc. The number “x” first appears in term 1 + 2 + …+ (x- 2)+ (x-1) = x(x-1)/2.
So solving for the n-th term we get n = x*(x-1)/2

Solving it using quadratic equation we get

x = ( ( 1 + sqrt(1+8*n) )/2 )

n in every case is NOT an integer which means the n-th number is not the first of a sequence of the same integer, but it is clear that the n-th integer is the integer value.

## C++

 `// CPP program to find the nth term of the series ` `// 1 2 2 3 3 3 ... ` `#include ` `using` `namespace` `std; ` ` `  `// function to solve the quadratic equation ` `int` `term(``int` `n) ` `{ ` `    ``// calculating the Nth term ` `    ``int` `x = (((1) + (``double``)``sqrt``(1 + (8 * n))) / 2); ` `    ``return` `x; ` `} ` ` `  `// driver code to check the above function ` `int` `main() ` `{ ` `    ``int` `n = 5; ` `    ``cout << term(n); ` `    ``return` `0; ` `} `

## Java

 `// Java program to find the nth ` `// term of the series 1 2 2 3 3 3 ... ` `import` `java.io.*; ` ` `  `class` `Series { ` `     `  `    ``// function to solve the quadratic ` `    ``// equation ` `    ``static` `int` `term(``int` `n) ` `    ``{ ` `        ``// calculating the Nth term ` `        ``int` `x = (((``1``) + (``int``)Math.sqrt(``1` `+  ` `                           ``(``8` `* n))) / ``2``); ` `        ``return` `x; ` `    ``} ` `     `  `    ``// driver code to check the above function ` `    ``public` `static` `void` `main (String[] args) { ` `        ``int` `n = ``5``; ` `        ``System.out.println(term(n)); ` `    ``} ` `} ` ` `  `// This code is contributed by Chinmoy Lenka `

## Python3

 `# Python program to find the nth term  ` `# of the series 1 2 2 3 3 3 ... ` `import` `math  ` ` `  `# function to solve the quadratic equation ` `def` `term( n ): ` ` `  `    ``# calculating the Nth term ` `    ``x ``=` `(((``1``) ``+` `math.sqrt(``1` `+` `(``8` `*` `n))) ``/` `2``) ` `    ``return` `x ` ` `  `# Driver code ` `n ``=` `5` `print``(``int``(term(n))) ` ` `  `# This code is contributed by Sharad_Bhardwaj. `

## C#

 `// C# program to find the nth ` `// term of the series 1 2 2 3 3 3 ... ` `using` `System; ` ` `  `class` `Series ` `{ ` `    ``// function to solve the quadratic ` `    ``// equation ` `    ``static` `int` `term(``int` `n) ` `    ``{ ` `        ``// calculating the Nth term ` `        ``int` `x = (((1) + (``int``)Math.Sqrt(1 + (8 * n))) / 2); ` `        ``return` `x; ` `    ``} ` ` `  `    ``// driver code to check the above function ` `    ``public` `static` `void` `Main() ` `    ``{ ` `        ``int` `n = 5; ` `        ``Console.WriteLine(term(n)); ` `    ``} ` `} ` ` `  `// This code is contributed by vt_m. `

## PHP

 ` `

Output:

```3
```

Time Complexity: O(log(n)) as sqrt function takes O(log n).

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Improved By : jit_t

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.