In [3]: def isPerfect (x):***Returns whether or not the given number x is perfect.A number is said to be perfect if it is equal to the sum of all itsfactors (for obvious reasons the list of factors being considered doesnot include the number itself).Example: 6 = 3 + 2 + 1, hence 6 is perfect.Example: 28 is another example since 1 + 2 + 4 + 7 + 14 is 28.Note, the number 1 is not a perfect number.your code hereSum - 0for i in range(1, x)if(x1= 0):Sun - Sum + 1if (Sum X)Iprint(" td is a Perfect Number" 1x)print(" td is not a Perfect Number 1x)else:print (isPerfect (6))File "cipython-input-3-b9df3e539e48", line 15for i in range(1, x):IndentationError: unexpected indentIn [411 perfect numbers [6, 28, 496, 8128, 335503361for i in perfect_numbers:assert true (isPerfect (i), str(i) + is perfect')not_perfect_numbers [2, 3, 4, 5, 7, 8, 9, 10,495, 8127, 8129,335503351for i in not perfect_numbers:assert true (not (isPerfect (i)), str(i) is not perfect')#test existence of doestringassert true (len (isPerfect._doc_) > 1, "there is no docstring for isPerfect")print("Success!")

Indentation error occurs when there are extra spaces. for loop should start right below the sum…

In (3) def isPerfect (x) ***Returns whether or not the given number x is perfect. A number is said to be perfect if it is equal to the sum of all its factors (for obvious reasons the list of factors being considered does not include the number itself). Example: 63+2+1, hence 6 is perfect. Example: 20 is another example since 1+2 +4 + 7 + 14 in 28. Note, the number 1 is not a perfect number. *** your code here Sum - 0 for i in range(1, x) LE(0)1 Sun Bum + 1 if (Bum=-X) else! print(" td is a Perfect Number 1x) print(td is not a Perfect Number" 1x) print (isPerfect (6)) File "cipython-input-3-b9df3e539048", line 15 for i in range(1, x) IndentationError: unexpected indent In 1411 perfect numbers 16, 28, 496, 8126, 335503361 for i in perfect numbers: assert true (isPerfect (i), str(i)+ is perfect') not perfect numbers (2, 3, 4, 5, 7, 8, 9, 10, 495, 8127, 8129, 335503351 for i in not perfect numbers assert true (not (isPerfect (i)), str(i) is not perfect') test existence of doestring assert true(len (isPerfect._doc_) 1, "there is no docstring for isPerfect") print("Success!")

In (3) def isPerfect (x) Returns whether or not the given number x is perfect. A number is said to be perfect if it is equal to the sum of all its factors (for obvious reasons the list of factors being considered does not include the number itself). Example: 63+2+1, hence 6 is perfect. Example: 20 is another example since 1+2 +4 + 7 + 14 in 28. Note, the number 1 is not a perfect number. your code here Sum - 0 for i in range(1, x) LE(0)1 Sun Bum + 1 if (Bum=-X) else! print(" td is a Perfect Number 1x) print(td is not a Perfect Number" 1x) print (isPerfect (6)) File "cipython-input-3-b9df3e539048", line 15 for i in range(1, x) IndentationError: unexpected indent In 1411 perfect numbers 16, 28, 496, 8126, 335503361 for i in perfect numbers: assert true (isPerfect (i), str(i)+ is perfect') not perfect numbers (2, 3, 4, 5, 7, 8, 9, 10, 495, 8127, 8129, 335503351 for i in not perfect numbers assert true (not (isPerfect (i)), str(i) is not perfect') test existence of doestring assert true(len (isPerfect._doc_) 1, "there is no docstring for isPerfect") print("Success!")

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

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…
def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. ''' pass
Implement the sieve of Eratosthenes: a function for computing prime numbers, known to the ancient Greeks. Choose an integer n. This function will compute all prime numbers up to, and including, n. First insert all numbers from 1 to n into a set. Then erase all multiples of 2 (except 2); that is, 4, 6, 8, 10, 12, ... . Erase all multiples of 3, that is, 6, 9, 12, 15, ... . Go up to ?⎯⎯√n. The remaining numbers are all primes. Make sure that you use functions in your solution, including a main function. Define def sieveOfEratosthenes(n) that receives the maximum value and returns a list of all prime numbers less than or equal to this value in main() print the list of prime numbers.
int a[10] = {0,1,2,3,4,5,6,7,8,9};int *m = &a[0];int *p = &a[5];int *q = &a[1]; p = (int) m + (int) p - (int) q; what is the value of of *p
INT_MIN = -32767 def cut_rod(price): """ Returns the best obtainable price for a rod of length n and price[] as prices of different pieces """ n = len(price) val = [0]*(n+1) # Build the table val[] in bottom up manner and return # the last entry from the table for i in range(1, n+1): max_val = INT_MIN for j in range(i): max_val = max(max_val, price[j] + val[i-j-1]) val[i] = max_val return val[n] # Driver program to test above functionsarr = [1, 5, 8, 9, 10, 17, 17, 20].
In java pls! Thank you! In many cryptographic applications the Modular Inverse is a key operation. This programming problem involves finding the modular inverse of a number. Given 0 < x < m, where x and m are integers, the modular inverse of x is the unique integer n, 0 < n < m, such that the remainder upon dividing x × n by m is 1. That is, x × n mod m = 1. Modular inverse is a concept that extends the arithmetic inverse. For example, the inverse of 2 is ½ because 2 x ½ = 1 with decimal operation. Here the inverse number can be a fraction. In modular inverse, we only allow integers, no fraction. So not all integer has an inverse. For example, m = 26, x = 3, the modular inverse of 3 is 9 because 3 x 9 mod 26 = 1. However, m = 26, x = 2, the modular inverse of 2 does not exist because you cannot find a number y so that 2 x y mod 26 = 1. Here is another example, m = 17, 4 x 13 = 52 = 17 x 3 + 1, so the remainder when 52 is divided by 17 is 1, and thus 13 is the inverse…
Write a program that lists all Fibonacci numbers that are less than or equal to the number k (k≥2) entered by the user. Definition:The Fibonacci sequence is a sequence of numbers in which each additional term is the sum of the previous two. It is based on the fact that each member of the sequence is formed by the sum of the previous two members, the sequence starting with the numbers 1 and 1. (Example 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233 , 377, 610, 987 write program in c language
in C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE SO I CAN UNDERSTAND EVERY STEP PLEASE, A C program can represent a real polynomial p(X) of degree n as an array of the real coefficients al, al, ..., an (an ‡ 0). p(X) = a0 + a1X + a2 X2 + . . .+ anXn Write a program that inputs a polynomial of maximum degree 8 and then evaluates the polynomial at various values of x. Include a function get_poly that fills the array of coefficients and sets the degree of the polynomial, and a function eval_poly that evaluates a polynomial at a given value of x. Use these function prototypes: void get_poly ( double coeffIl, int* degreep); double eval_poly( const double coeffIl, int degree, double x);
In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
Write a function that takes in an integer n and computes n!. Do this without recursion. In [ ]: deffactorial_iter(n):"""Takes in an integer n>0 and returns the product of all integers from 1 to n."""# YOUR CODE HEREraiseNotImplementedError() In [ ]: In [ ]: assert factorial_iter(6) == 720 assert factorial_iter(7) == 5040 assert factorial_iter(10) == 3628800
in c++ 1. Write a function that takes a 1 Dimensional array and an integer n andreturns the number of times ‘n’ appears in the array. If ‘n’ does not appearin the array, return -1.2. Write a function that takes a 2 Dimensional array and returns the positionof the first row with an odd sum. Assume that the column size is fixed at 4.If no sum is odd, return -13. Write a class, “pie”, that has a number of slices (int slices) as a privateproperty. Construct the pie with a number of slices and remove a slice witha function. Tell the user how many slices are in the pie.
Write a program in C/C++ that reads N number of nonnegative decimal numbers from a user and creates a hash table to store the numbers. The output of the program displays the order of the numbers in the hash table. The program then prompts the user to enter a target value. The program searches the target value to the hash table, and displays the search outcome. For simplicity, let’s assume that N = 6 and the size of the hash table is 10. Use this hash function in your code h(k) = 2k+3 where k is the key value. Use linear probe method for collision resolution. Example test run Test Run 1: Enter 6 elements: 3 2 9 6 11 13 Hash table order: 13 9 - - - 6 11 2 - 3 Enter the target: 1111 is located at index: 6 Test Run 2: Enter 6 elements: 3 2 9 6 11 13 Hash table order: 13 9 - - - 6 11 2 - 3 Enter the target: 1515 is not in the table