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

Activity 7 Guessing Game There is list of word, the interpreter will choose a word randomly. The user has to input his names and then, he will be asked to guess the word by accepting any alphabet. If the random word contains accepted character, it will be shown as the output (with correct placement) else the program will ask you to guess another alphabet. User will be 50% of the total number of characters to guess the complete word. Requirements 1. There must be 10 words of different length. 2. The words must be in random. 3. It should accept lower case and upper case letter 4. The number of turns left must be display 5. All wrong characters are also display
Computer Science Flowchart for this code Please C PROGRAM : #include unsigned int x; sbit P11 = P1^1; main() { unsigned char xdata *ELET212; ELET212 = 0×FC48; %3D %3D *ELET212=0XFE; P11=0; while(1) { for(x=0; x<10000; x++); P11="P11; }
Sevens rule, zeros drool def seven_zero(n): Seven is considered a lucky number in Western cultures, whereas zero is what nobody wants to be. Let us briefly bring these two opposites together by looking at positive integers that consist of some solid sequence of sevens, followed by some (possibly empty) solid sequence of zeros. Examples integers of this form are 7, 77777, 7700000, 77777700, and 70000000000000. A surprising theorem proves that for any positive integer n, there exist infinitely many integers of such seven- zero form that are divisible by n. This function should return the smallest such seven-zero integer. Even though discrete math and number theory help, this exercise is not about coming up with a clever symbolic formula and the proof of its correctness. This is rather about iterating through the numbers of this constrained form of sevens and zeros efficiently and correctly in strictly ascending order, so that the function can mechanistically find the smallest working…
(-465)10 + (325)10 = ?
C Program It is the value that is automatically assigned to the remaining elements of the array when the initialize list is less than the size.
Pythom: Least Common Multiple, Greatest Common Factor (Grade Factor 1) This assignment assess problem solving ability and the use of the modulo operator, functions, lists and nested loops. The Modulo (%) operator returns a remainder of the two numbers divided. e.g. 9 % 2 will yield a 1 because 9/2 = 4 and the remainder is 1. Write one program that will compute both the Least Common Multiple, and the Greatest Common Factor of two random numbers between 2 and 30. The program will display all factors and multiples of the two numbers. When displaying the multiples of the numbers, only display up to the first input times the second input. Use functions to compute the answers. Loop the program so that the user try again. create the loop so that hitting enter will continue. The example is below: Integer1: 12Integer2: 3 The Multiples of 3 are 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, The Multiples of 12 are 12, 24, 36, The lowest common Multiples is 12 The Factors of 3 are…
Subject - Data Structure Write a method, remove, that takes three parameters: an array of integers, the length of the array, and an integer, say, The method should find and delete the first occurrence of removeItem in the array. If the value does not exist or the array is empty, output an appropriate message. (Note that after deleting the element, the array size is reduced by1.) You may assume that the array is unsorted. Test your code with phython array [2,5,7,58,9,14,67,7] removeitem 7 removeitem 20 Thank you in Advance.
Task - Median elements (C Langugage) Given an array of integer elements, the median is the value that separates the higher half from the lower half of the values. In other words, the median is the central element of a sorted array. Since multiple elements of an input array can be equal to the median, in this task you are asked to compute the number of elements equal to the median in an input array of size N, with N being an odd number. Requirements Name your program project4_median.c. Follow the format of the examples below. The program will read the value of N, then read in the values that compose the array. These values are not necessarily sorted. The program should include the following function. Do not modify the function prototype. int compute_median(int *a, int n); a represents the input array, n is the length of the array. The function returns the median of the values in a. This function should use pointer arithmetic– not subscripting – to visit array elements. In other…
18 Candy Sale Algorithm Putting the Steps in Order In a previous exercise on "thinking like a computer, you were given some unordered steps for a candy sale program and asked to put them in order. The problem was as follows: "Chocolate truffles cost $20 per pound for the first 5 pounds, but only $12 per pound for any amount in excess of 5 pounds. How would you compute the cost, stored in a variable named total, for any given amount of truffles? There are a few slightly different ways that the steps can be ordered. Here's one that works well for our purposes 1. Create a variable named pounds that can store an integer. 2. Create a variable named total that can store a floating-point number. 3. Record the amount of truffles in the variable named pounds. 4. If pounds is five or less, go to the next step, otherwise, go to Step 7. 5. Set total to pounds times 20 6. Go to Step 10, 7. Set total to 100 8. Subtract 5 from pounds 9. Multiply pounds by 12 and add it to total. 10. End Thinking at a…
Python Language - Bad Luck Numbers
ASSIGNMENT BRIEF Introduction Roulette is a popular casino game named after the French word for 'little wheel'. In the game, players may choose to place bets on single numbers or various groupings which will determine their payout. To determine the winning number a ball is spun in the opposite direction of a spinning wheel. As the ball loses momentum it comes to rest in one of the slots of the wheel. Winnings are then paid to anyone who places a successful bet. n 00 2. 1ST12 2ND12 3RD12 1T018 EVEN ODD |19то36 Figure 1: Layout of a European roulette table Numbers can be classified in several ways: 1. Red or Black 2. Odd or Even 3. High or Low - if a number is in the first half of the table it is considered low (1-18). If a number is in the second half of the table, it is considered high (19-36). 4. Dozens - a number can be in the first dozen(1-12), second dozen (13-24) or third dozen (25-36) 5. Columns - A number may be in any of the three columns of the table 6. Zero - the number '0'…
python regular expressions