The program is to find a mathematical series, where we need to accept the value of n and m. n is the base number and m is the number of times till which the series run.

Examples:

Input : 2 + 22 + 222 + 2222 + 22222 Output : 24690 Input : 12 + 1212 + 121212 Output : 122436

We first convert the numbers into string format and concatenate them regularly. Later, we convert them back to integer and add them upto mth term. as shown in the following program.

`# Python program to sum the given series ` ` ` `# Returns sum of n + nn + nnn + .... (m times) ` `def` `Series(n, m): ` ` ` ` ` `# Converting the number to string ` ` ` `str_n ` `=` `str` `(n) ` ` ` ` ` `# Initializing result as number and string ` ` ` `sums ` `=` `n ` ` ` `sum_str ` `=` `str` `(n) ` ` ` ` ` `# Adding remaining terms ` ` ` `for` `i ` `in` `range` `(` `1` `, m): ` ` ` ` ` `# Concatenating the string making n, nn, nnn... ` ` ` `sum_str ` `=` `sum_str ` `+` `str_n ` ` ` ` ` `# Before adding converting back to integer ` ` ` `sums ` `=` `sums ` `+` `int` `(sum_str) ` ` ` ` ` `return` `sums ` ` ` `# Driver Code ` `n ` `=` `2` `m ` `=` `5` `total ` `=` `Series(n, m) ` `print` `(total) ` |

*chevron_right*

*filter_none*

Output:

24690

## Recommended Posts:

- Program to Calculate e^x by Recursion
- What is the maximum possible value of an integer in Python ?
- Longest subsequence of a number having same left and right rotation
- Least common element in given two Arithmetic sequences
- 3 Different ways to print Fibonacci series in Java
- How to store a very large number of more than 100 digits in C++
- Check if a large number is divisible by a number which is a power of 2
- Represent K as sum of N-bonacci numbers
- Find all numbers up to N which are both Pentagonal and Hexagonal
- Smallest number whose square has N digits
- Practical Numbers
- Junction Numbers
- Tcefrep Numbers
- Katadrome number

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.