Complete the function that calculates the sum of the first n+1 terms of the geometric series a, ar, ar² ar³, ar4 ... ar Note that the series begins with a and the last term is ar", in total there are n+1 terms. # complete the function given the variables a,r,n and return the value as series_sum. def sum geometric_series (a,r,n): # YOUR CODE HERE return series_sum print (sum_geometric_series (4.0, 5, 10))

Complete the function that calculates the sum of the first n+1 terms of the geometric series a, ar, ar² ar³, ar4 ... ar Note that the series begins with a and the last term is ar", in total there are n+1 terms. # complete the function given the variables a,r,n and return the value as series_sum. def sum geometric_series (a,r,n): # YOUR CODE HERE return series_sum print (sum_geometric_series (4.0, 5, 10))

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

A cantilever beam is under a concentrate load P (N), the beam has a length of L (m). P L y Complete the Python function below to find the support reaction force in y direction RF (N) and reaction moment RM (N*m) at the clamped end of the beam x = 0. Be careful of the sign of force and moment.
Complete the get_sum_of_evens (lower_bound, upper_bound) function that takes two integer parameters, lower bound and upper bound. The function returns the sum of all the even numbers between the two bounds, both included, passed to the function. You can assume that lower bound will always be smaller than or equal to upper_bound. For example: Test result get sum_of_evens (2, 4) print("The sum of all even numbers are:", result) print (get_sum_of_evens (9, 17)) Result The sum of all even numbers are: 6 52
A prime number is an integer value that is only divisible by 1 and itself. 2, 3, 5, 7, and 11 are examples of prime numbers. You have been provided with two function definitions: The is_prime () function takes an integer parameter number, and returns True if number is prime and False otherwise. The get_next_prime () function also takes a single integer parameter number, and returns the first prime number larger than it. You must not change the implementation of these 2 functions. Complete the get_primes_list() function that takes a single list of integers called numbers as parameter. You can assume that the integer items in this list will be non-negative. The function must update this list so that items that are not prime numbers are updated to the first prime number larger than them. To implement this function you must call both the is_prime () and get_next_prime () functions. Some examples of the function being called are shown below. Note: the get_primes_list() function does not…
Cyclops numbersdef is_cyclops(n):A nonnegative integer is said to be a cyclops number if it consists of an odd number of digits so that the middle (more poetically, the “eye”) digit is a zero, and all other digits of that number are nonzero. This function should determine whether its parameter integer n is a cyclops number, and return either True or False accordingly n Expected result 0 True 101 True 98053 True 777888999 False 1056 False 675409820 False
Sum of two squares def sum_of_two_squares(n): Some positive integers can be expressed as a sum of two squares of some positive integers greater than zero. For example, 74 = 49 + 25 = 72 + 52. This function should find and return a tuple of two positive integers whose squares together add up to n, or return None if the parameter n cannot be broken into a sum of two squares. To facilitate the automated testing, the returned tuple must present the larger of its two numbers first. Furthermore, if some integer can be broken down to a sum of squares in several ways, return the breakdown that maximizes the larger number. For example, the number 85 allows two such representations 72 + 62 and 92 + 22 , of which this function must return (9, 2). The technique of two approaching indices that start from the beginning and end of a sequence, respectively, and approach each other until they meet somewhere, used in the function two_summers in one of our class examples, is directly applicable to this…
Sum of two squares def sum_of_two_squares(n): Some positive integers can be expressed as a sum of two squares of some positive integers greater than zero. For example, 74 = 49 + 25 = 7^2 + 5^2. This function should find and return a tuple of two positive integers whose squares together add up to n, or return None if the parameter n cannot be broken into a sum of two squares.To facilitate the automated testing, the returned tuple must present the larger of its two numbers first. Furthermore, if some integer can be broken down to a sum of squares in several ways, return the breakdown that maximizes the larger number. For example, the number 85 allows two such representations 7^2 + 6^2 and 9^2 + 2^2 , of which this function must return (9, 2).The technique of two approaching indices that start from the beginning and end of a sequence, respectively, and approach each other until they meet somewhere is directly applicable to this problem. In this problem, these indices crawl towards each…
Jacobsthal numbers are an integer sequence, where the nth Jacobsthal number can be defined as follows: 0 -- {₁-1+2√₁ Jn=" if n = = 1; if n = 2; Jn-1+2Jn_2 if n>2. Complete the print_jacobsthal_numbers () function that takes an integer parameter number_of_terms specifying the number of Jacobsthal numbers the function needs to print. You can assume that number_of_terms will always be an integer that is 1 or more. The function should print the specified number of Jacobsthal numbers on a single line with each Jacobsthal number separated by a ", ". Some examples of the function being called are shown below. For example: Test Result print_jacobsthal_numbers (3) 0, 1, 1 print_jacobsthal_numbers (5) 0, 1, 1, 3, 5 Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %) Reset answer 1 def print_jacobsthal_numbers(number_of_terms): ▼
Sum of two squares def sum_of_two_squares(n): Some positive integers can be expressed as a sum of two squares of some positive integers greater than zero. For example, 74 = 49 + 25 = 72 + 52. This function should find and return a tuple of two positive integers whose squares together add up to n, or return None if the parameter n cannot be broken into a sum of two squares.To facilitate the automated testing, the returned tuple must present the larger of its two numbers first. Furthermore, if some integer can be broken down to a sum of squares in several ways, return the breakdown that maximizes the larger number. For example, the number 85 allows two such representations 72 + 62 and 92 + 22 , of which this function must return (9, 2).The technique of two approaching indices that start from the beginning and end of a sequence, respectively, and approach each other until they meet somewhere, used in the function two_summers in one of our class examples, is directly applicable to this…
In physics, an object that is in motion is said to have kinetic energy. The following formula can be used to determine a moving object’s kinetic energy:KE=12mv2The variables in the formula are as follows: KE is the kinetic energy, m is the object’s mass in kilograms, and v is the object’s velocity in meters per second. Write a function named kinetic_energy that accepts an object’s mass (in kilograms) and velocity (in meters per second) as arguments. The function should return the amount of kinetic energy that the object has. Write a program that asks the user to enter values for mass andvelocity, then calls the kinetic_energy function to get the object’s kinetic energy.
Create a function which returns the type of triangle, given the side lengths. Return the following values if they match the criteria. • No sides equal: "scalene" • Two sides equal: "isosceles" • All sides equal: "equilateral" • Less or more than 3 sides given: "not a triangle" Examples get_triangle_type([2, 6, 5]) "scalene" get_triangle_type([4, 4, 7]) "isosceles" get_triangle_type([8, 8, 8]) "equilateral" get_triangle_type([3, 5, 5, 2]) → "not a triangle"
There is only 1 ques with 2 part. Please answer the questions ( Answer in python ) Part I: Cities. Write a function called describe_city which accepts the name of a city and its country. The function should print a simple sentence as shown in the output example. Give the parameter for the country a default value. Make 5 calls to the function using the following arguments: Reykjavik, Iceland Pittsburg Ontario, Canada Cairo, Egypt Miami, USA Output Example : ( FOLLOW THE OUTPUT SAME AS GIVEN BELOW ) Reykjavik is in Iceland Pittsburg is in USA Ontario is in Canada Cairo is in Egypt Miami is in USA Part II: Blastoff!!! Write a function called count_down which has 1 integer parameter. The function should countdown from that parameter value to 1. Each step in the countdown should be printed on the same line followed by ‘Blastoff!!!’ also on the same line. All of this should happen in the function. Make 3 calls to the function with the following arguments: 3 5 10 Output…
Consider the following code. How many times is the function rec_func_2( ) called in total? Question options: 0 1 2 3 4 5 6 7 8 None of these options