Part 1 - Using your Geometric Progression, write a script that verifies a Geometric progression with -1

Python coding question


Part 1 - Using your Geometric Progression, write a script that verifies a Geometric progression with -1< r="">< 1 and != 0 sum approaches ( starting_value / ( 1 - r ) ), allow the user to enter an r value ( make sure to convert to a float ) and run until you are within .00001 of the calculated sum, outputting the current sum in each iteration. starting_value * r^nth-1 is each term 1st term is starting_value * r^0 2nd term is starting_value * r^1 3rd term is starting_value * r^2 part 2 - use the fibonacci progression to test the theory of number distribution - https://en.wikipedia.org/wiki/benford%27s_law (links to an external site.) grab the first 500 values of fibonacci and count the instances of each first digit ( the easy way is to convert it to a string and grab the first character https://en.wikipedia.org/wiki/benford%27s_law 1="" and="" !="0" sum="" approaches="" (="" starting_value="" (="" 1="" -="" r="" )="" ),="" allow="" the="" user="" to="" enter="" an="" r="" value="" (="" make="" sure="" to="" convert="" to="" a="" float="" )="" and="" run="" until="" you="" are="" within="" .00001="" of="" the="" calculated="" sum,="" outputting="" the="" current="" sum="" in="" each="" iteration.="" starting_value="" *="" r^nth-1="" is="" each="" term="" 1st="" term="" is="" starting_value="" *="" r^0="" 2nd="" term="" is="" starting_value="" *="" r^1="" 3rd="" term="" is="" starting_value="" *="" r^2="" part="" 2="" -="" use="" the="" fibonacci="" progression="" to="" test="" the="" theory="" of="" number="" distribution="" -="" https://en.wikipedia.org/wiki/benford%27s_law="" (links="" to="" an="" external="" site.)="" grab="" the="" first="" 500="" values="" of="" fibonacci="" and="" count="" the="" instances="" of="" each="" first="" digit="" (="" the="" easy="" way="" is="" to="" convert="" it="" to="" a="" string="" and="" grab="" the="" first="" character="">