Redefine the function power so that it also works for negative exponents. In order to do this, you will also have to change the type of the value returned to double. The function declaration and header comment for the redefined version of power is as follows:
double power(int x, int n); //Precondition: If n < 0, then x is not 0. //Returns x to the power n. |
(Hint: X–n is equal to 1/(Xn).)
Want to see the full answer?
Check out a sample textbook solutionChapter 14 Solutions
Problem Solving with C++ (10th Edition)
Additional Engineering Textbook Solutions
Modern Database Management (12th Edition)
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
Starting Out with Python (3rd Edition)
Web Development and Design Foundations with HTML5 (9th Edition) (What's New in Computer Science)
Database Concepts (8th Edition)
Introduction To Programming Using Visual Basic (11th Edition)
- Write the functions with the following headers:# Return the reversal of an integer, e.g. reverse(456) returns# 654def reverse(number):# Return true if number is a palindromedef isPalindrome(number): Use the reverse function to implement isPalindrome. A number is a palindrome if its reversal is the same as itself. Write a test program that prompts the user to enter an integer and reports whether the integer is a palindrome.arrow_forwardThe function doit(a,b,c,d) is a function that multiplies the smallest of its integers arguments by 2. If more than one arguments are equal and are the smallest, they are multiplied by 2. For example given a=5,b=3,c=7,d=9, doit (a,b,c,d) changes b to 6. Write the code of the function doit and test it.arrow_forwardDefine a function hypotenuse that calculates the hypotenuse of a right triangle when the other two sides are given. The function should take two double arguments and return the hypotenuse as a double. You can use the sqrt function from the cmath library. Use this function in a program to determine the hypotenuse for each of the following triangles: Triangle Side 1 Side 2 1 3.0 4.0 2 5.0 12.0 3 8.0 15.0arrow_forward
- Detect Even/Odd Write a function with no parameters, even_or_odd() in Python Specifications: read an integer from standard input return 0 if the integer is even, 1 if the integer is odd do not use a conditional ("if") statement, just use modular arithmetic (such as // or %) do not print the result, return it HINT: What is the remainder when you divide an even number by 2? What is the remainder when you divide an odd number by 2? REMINDER: DO NOT use prompts in your input statements for this problem. For example: Test Input Result ans = even_or_odd() print(ans) 5 1 ans = even_or_odd() print(ans) -14 0 ans = even_or_odd() print(ans) 0 0 ans = even_or_odd() print(ans) 99 1arrow_forward1. A prime number is a number that is only evenly divisible by itself and 1. For example, the number 5 is prime because it can only be evenly divided by 1 and 5. The number 6, however, is not prime because it can be divided evenly by 1, 2, 3, and 6.Write a Boolean function named is_prime which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. Use the function in a program that prompts the user to enter a number then displays a message indicating whether the number is prime.Tip:Recall that the % operator divides one number by another and returns the remainder of the division. In an expression such as num1 % num2, the % operator will return 0 if num1 is evenly divisible by num2.arrow_forwardComplete the code that returns the value of f(x), which has the value 1 inside the range −1 ≤ x ≤ 1 otherwise it is the value 0. f(x) [ ] # complete the function to return the value of 1, x = [-1, 1] 0, otherwise #f(x) given x. # return as the value called variable def function_f(x): # YOUR CODE HERE return fval "fval" ## Check your code below using print command ← → +0 0+arrow_forward
- 5. A prime number is a number that is only evenly divisible by itself and 1. For example, the number 5 is prime because it can only be evenly divided by 1 and 5. The number 6, how- ever, is not prime because it can be divided evenly by 1, 2, 3, and 6. Write a Boolean function named is_prime which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. Use the function in a program that prompts the user to enter a number then displays a message indicating whether the number is prime. 6. In another program, use the function you wrote in question 5 to print the prime numbers between 1 and 100 using for loop.arrow_forwardWrite a function called area circumference generator that takes a radius of a circle as a function parameter and calculates its circumference and area. Then returns these two results as a tuple and prints the results using tuple unpacking in the function call accorrding to the given format. [Must use tuple packing & unpacking] Example1: Function Call: area_circumference_generator(1) Output: (3.141592653589793, 6.283185307179586) Area of the circle is 3.141592653589793 and circumference is 6.283185307179586 ======== :===== Example2: Function Call: area_circumference_generator(1.5) Output: (7.0685834705770345, 9.42477796076938) Area of the circle is 7.0685834705770345 and circumference is 9.42477796076938arrow_forwardTrue or False 1-int fx(char x) is a function with int return value 2-int fx(char &x) is a function with parameter passed by value 3-void fx(char ch) is a function with no return value 4-char fx( int x) is a function with int return valuearrow_forward
- Write a pseudocode/method describing how the function works.arrow_forwardIn C++ Write a Convert() function that casts the parameter from a double to an integer and returns the result.Note that the main() function prints out the returned value of the Convert() function. Ex: If the double value is 19.9, then the output is: 19 Ex: If the double value is 3.1, then the output is: 3arrow_forwardA. The following code in the function "is_prime" attempts to examine a number and return whether the number is prime (i.e. it has no factors besides 1 and itself). It has a "Boolean Flag" called 'prime', however, the boolean logic is not implemented correctly, so the function won't always return the correct answer. # This function determines whether an integer is prime.def is_prime(n):prime = Truefor i in range(2, n): if n2 % i == 0: prime = Falseelse: prime = truereturn prime In what cases does the function report an incorrect answer? How can the code be fixed for it to always report the correct answer? Write your answers as "comments" and the fixed code as a separate python filearrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr