# Series

Series questions in reasoning are basically of two types, Series completion (missing term, next term) and Series correction (finding the wrong element in the series).

### Sample Problems

**Question 1 : **Find the missing term : 157.5, 45, 15, _, 3, 2, 2

**Solution : **Le the missing number be ‘n’

157.5 / 45 = 3.5

45 / 15 = 3

15 / n = 2.5

n / 3 = 2

3 / 2 = 1.5

2 / 2 = 1

Therefore, the missing number is 6.

**Question 2 : **Find the next term in the series : 6, 7, 9, 13, _

**Solution : **Let the missing number be ‘n’

7 – 6 = 1

9 – 7 = 2

13 – 9 = 4

n – 13 = 8

Therefore, next number in the series = n = 21

**Question 3 : **Find the incorrect element in the series : 1, 3, 10, 36, 152, 760, 4632

**Solution : **

1 x 1 + 2 = 3

3 x 2 + 4 = 10

10 x 3 + 6 = 36

36 x 4 + 8 = 152

152 x 5 + 10 = 770

770 x 6 + 12 = 4632

Therefore, the incorrect element in the series is 760.

This article has been contributed by **Nishant Arora**

Please write comments if you have any doubts related to the topic discussed above, or if you are facing difficulty in any question or if you would like to discuss a question other than those mentioned above.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: **DSA Self Paced**. Become industry ready at a student-friendly price.

## Recommended Posts:

- Sudo Placement 2 | Matrix Series
- TCS Coding Practice Question | Fibonacci Series
- Count of all subsequences having adjacent elements with different parity
- Find the node at the centre of an N-ary tree
- Count of submatrix with sum X in a given Matrix
- Difference between sum of even and odd valued nodes in a Binary Tree
- Count of N-digit numbers with absolute difference of adjacent digits not exceeding K
- Calculate weight of parenthesis based on the given conditions
- Check if two nodes are on same path in a tree | Set 2
- Minimum count of numbers required with unit digit X that sums up to N
- Print the longest path from root to leaf in a Binary tree
- Largest number M less than N such that XOR of M and N is even
- Shortest path in a complement graph
- First element of every K sets having consecutive elements with exactly K prime factors less than N