A geometric progression is a sequence of integers b1, b2, b3, …, where for each i > 1, the respective term satisfies the condition bi = bi-1 * q, where q is called the common ratio of the progression.
Given geometric progression b defined by two integers b1 and q, and m “bad” integers a1, a2, .., am, and an integer l, write all progression terms one by one (including repetitive) while condition |bi| <= l is satisfied (|x| means absolute value of x).
Calculate how many numbers will be there in our sequence, or print “inf” in case of infinitely many integers.
Note: If a term equals one of the “bad” integers, skip it and move forward to the next term.
Input : b1 = 3, q = 2, l = 30, m = 4 6 14 25 48 Output : 3 The progression will be 3 12 24. 6 will also be there but because it is a bad integer we won't include it Input : b1 = 123, q = 1, l = 2143435 m = 4 123 11 -5453 141245 Output : 0 As value of q is 1, progression will always be 123 and would become infinity but because it is a bad integer we won't include it and hence our value will become 0 Input : b1 = 123, q = 1, l = 2143435 m = 4 5234 11 -5453 141245 Output : inf In this case, value will be infinity because series will always be 123 as q is 1 and 123 is not a bad integer.
We can divide our solution in different cases:
Case 1: If starting value of series is greater than the given limit, output is 0.
Case 2: If starting value of series or q is 0, there are three more cases:
Case 2.a: If 0 is not given as a bad integer, answer will become inf.
Case 2.b: If b1 != 0 but q is 0 and b1 is also not a bad integer, answer will become 1.
Case 2.c: If 0 is given as a bad integer and b1 = 0, answer will become 0.
Case 3: If q = 1 we will check if b1 is given as a bad integer or not. If it is then answer will be 0 else answer will be inf.
Case 4: If q = -1, check if b1 and -b1 is present or not, if they are present our answer will be 0 else our answer will be inf.
Case 5: If none of the above cases hold, simply run a loop for b1 till l and calculate the number of elements.
Below is the implementation of above approach:
This article is contributed by Sarthak Kohli. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Product of N terms of a given Geometric series
- Find n terms of Fibonacci type series with given first two terms
- Sum of N-terms of geometric progression for larger values of N | Set 2 (Using recursion)
- Sum of P terms of an AP if Mth and Nth terms are given
- Number of quadruples where the first three terms are in AP and last three terms are in GP
- Program for sum of geometric series
- Program for N-th term of Geometric Progression series
- Find the sum of all the terms in the n-th row of the given series
- Sum of first n terms of a given series 3, 6, 11, .....
- Minimum number of operations to convert a given sequence into a Geometric Progression
- Number of K's such that the given array can be divided into two sets satisfying the given conditions
- Find the sum of the series 1+11+111+1111+..... upto n terms
- Sum of the series 0.6, 0.06, 0.006, 0.0006, ...to n terms
- Sum of the series 0.7, 0.77, 0.777, ... upto n terms
- Sum of series 2/3 - 4/5 + 6/7 - 8/9 + ------- upto n terms
- Sum of the series 1 / 1 + (1 + 2) / (1 * 2) + (1 + 2 + 3) / (1 * 2 * 3) + - - - - - - upto n terms.
- Sum of the series 5+55+555+.. up to n terms
- Print the first N terms of the series 6, 28, 66, 120, 190, 276, ...
- Find the sum of series 0.X + 0.XX + 0.XXX +... upto k terms
- Find the sum of n terms of the series 1,8,27,64 ....