Geometric Progression Printer As you might recall, a Geometric Progression (or GP) is a sequence of elements in which the next number in the sequence is obtained by multiplying the previous number by the common ratio. The next number in the sequence is obtained by using this formula: a_na_1*r(n-1) While the sum of all numbers in the sequence is obtained using any of these formulae: * If r 1, sum = a n If r = 1 and r> 1, sum = a[(rn - 1)/(r - 1)] If r != 1 and r < 1, sum = a[(1 - r )/(1-r)] where a n = next number in the sequence, a_1= first number in the sequence, r = common ratio, n = number of terms Your task is to write a Python program that 1. Accepts the necessary inputs from the user, i.e., start value (a_1), common ratio (r), and number of generate to generate (n). 2. Generates the Geometric Progression (GP) sequence starting from a_1 to n. 3. Prints out the GP HORIZONTALLY not VERTICALLY, e.g. 3, 9, 27, 81, 243, 729.... 4. Calculates the sum of all numbers in the GP sequence 5. Prints out the sum on the next line.

Geometric Progression Printer As you might recall, a Geometric Progression (or GP) is a sequence of elements in which the next number in the sequence is obtained by multiplying the previous number by the common ratio. The next number in the sequence is obtained by using this formula: a_na_1r(n-1) While the sum of all numbers in the sequence is obtained using any of these formulae: If r 1, sum = a n If r = 1 and r> 1, sum = a[(rn - 1)/(r - 1)] If r != 1 and r < 1, sum = a[(1 - r )/(1-r)] where a n = next number in the sequence, a_1= first number in the sequence, r = common ratio, n = number of terms Your task is to write a Python program that 1. Accepts the necessary inputs from the user, i.e., start value (a_1), common ratio (r), and number of generate to generate (n). 2. Generates the Geometric Progression (GP) sequence starting from a_1 to n. 3. Prints out the GP HORIZONTALLY not VERTICALLY, e.g. 3, 9, 27, 81, 243, 729.... 4. Calculates the sum of all numbers in the GP sequence 5. Prints out the sum on the next line.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Alphabet Random Walk• Write a program to generate a random walk that spans a 10*10 character array (The initial values of the elements are all.). The program must randomly walk from one element to another, moving one element position up, down, left or right each time. The elements that have been visited are labeled with the letters A through Z in the order in which they were visited
Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for the rugged hero to tame it, positive integers can be broken down as sums of consecutive positive integers in various ways. For example, the integer 42 often used as placeholder in this kind of discussions can be broken down into such a sum in four different ways: (a) 3 + 4 + 5 + 6 + 7 + 8 + 9, (b) 9 + 10 + 11 + 12, (c) 13 + 14 + 15 and (d) 42. As the last solution (d) shows, any positive integer can always be trivially expressed as a singleton sum that consists of that integer alone. Given a positive integer n, determine how many different ways it can be expressed as a sum of consecutive positive integers, and return that count. The number of ways that a positive integer n can be represented as a sum of consecutive integers is called its politeness, and can also be computed by tallying up the number of odd divisors of that number. However, note that the linked Wikipedia de0inition…
C++ Coding: Arrays Implement a two-dimensional character array. Use a nested loop to store a 12x6 flag. 5 x 2 stars as * Alternate = and – to represent stripe colors Use a nested loop to output the character array to the console.
*Data Structures and Algorithm Sliding (or k 2 − 1) puzzle using A* algorithm A sliding puzzle is a puzzle that challenges a player to slide flat pieces along certain routes on a k × k board to establish a certain end-configuration. The fifteen puzzle is the oldest type of sliding block puzzle and it was invented by Noyes Chapman in 1880s. It is played on a 4-by-4 grid with 15 square blocks labeled 1 through 15 and a blank square. The goal is to rearrange the blocks so that they are in order, using as few moves as possible. Blocks are permitted to be slid horizontally or vertically into the blank square. Search time for the goal state can be shortened by adding a priority for the direction of the search to proceed. A* algorithm is commonly used as an efficient alternative to find an answer to the sliding puzzle with the minimum number of steps. you will implement A* algorithm to solve the sliding puzzle problem. A* Algorithm A* (pronounced A-star) is an informed search algorithm,…
C++ Programming
C++
Programming Language: C++ Create a structure Student and ask the user how many students. Create an array which will save the number of students in the input. Ask for the data of the first and last student and display them.
Multiple Choice Identify the choice that best completes the statement or answers the question. 1. A list of numbers has n elements, indexed from 1 to n. The following algorithm is intended to display the number of elements in the list that have a value greater than 100. The algorithm uses the variables count and position. Steps 3 and 4 are missing. Step 1: Set count to 0 and position to 1. Step 2: If the value of the element at index position is greater than 100, increase the value of count by 1. Step 3: (missing step) Step 4: (missing step) na viliog dbod cour pot Step 5: Display the value of count. Which of the following could be used to replace steps 3 and 4 so that the algorithm works as intended? Step 3: Repeat step 2 until the value of count is greater than 100. Step 3: Repeat step 2 until the value of position is greater than n. a. c. Step 4: Increase the value of position by Step 4: Increase the value of count by 1. 1. b. Step 3: Increase the value of position by d. Step 3:…
True or False You can store a mixture of data types in an array.
Count consecutive summers def count_consecutive_summers(n): Like a majestic wild horse waiting for someone to come and tame it, positive integers can be broken down as sums of consecutive positive integers in various ways. For example, the integer 42 often used as placeholder in this kind of discussions can be broken down into such a sum in four different ways: (a) 3 + 4 + 5 + 6 + 7 + 8 + 9, (b) 9 + 10 + 11 + 12, (c) 13 + 14 + 15 and (d) 42. As the last solution (d) shows, any positive integer can always be trivially expressed as a singleton sum that consists of that integer alone. Given a positive integer n, determine how many different ways it can be expressed as a sum of consecutive positive integers, and return that count. The count of how many different ways a positive integer n can be represented as a sum of consecutive integers is also called its politeness, and can be alternatively computed by counting how many odd divisors that number has. However, note that the linked…
C Program Removing Elements in an Array Make a program that creates an array by asking the size n of the array and n integer inputs. Example: Input size of array: 5 Array elements: 1 2 3 4 5 After creating the array, you need to prompt the user again to pick m number of elements to remove. If the input is invalid, prompt the user to try again. An input is invalid if it meets either one of these criteria: Greater than size n of the array Negative number Example: Number of elements to remove: -2 Invalid number. Try again: 3 After a valid input, prompt the user for the valid indices to remove. An index is valid if it is within the range of the array size. Output the array elements after a valid index input and consider the new size of the array after. Example: Index (1): 2 Array elements: 1 2 4 5 Index (2): 4 Invalid index! Try again. Index (2): 0 Array elements: 2 4 5 Index (3): 2 Array elements: 2 4 After everything, print FINISHED! Input 1. Size of array 2.…