A positive integer is perfect if it equals the sum of all of its factors, excluding the number itself. Using a list comprehension, define a function perfects :: Int -> [Int] that returns the list of all perfect numbers up to a given limit. For example: > perfects 500 [6,28,496] Many variations of this exercise are possible: o A number which is less than the sum of its proper divisors is called abundant. o A number which is greater than the sum of its proper divisions is called deficient. o A number for which the sum of all its divisors (including itself) is greater than the sum of the divisors of any smaller number is called highly abundant. For each of these variations, write a function which finds all the numbers with the stated property below a given number.

A positive integer is perfect if it equals the sum of all of its factors, excluding the number itself. Using a list comprehension, define a function perfects :: Int -> [Int] that returns the list of all perfect numbers up to a given limit. For example: > perfects 500 [6,28,496] Many variations of this exercise are possible: o A number which is less than the sum of its proper divisors is called abundant. o A number which is greater than the sum of its proper divisions is called deficient. o A number for which the sum of all its divisors (including itself) is greater than the sum of the divisors of any smaller number is called highly abundant. For each of these variations, write a function which finds all the numbers with the stated property below a given number.

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

Please answer it in Python Write a function convertir_liste that takes as an argument a list of strings representing real numbers, and returns the corresponding list of reals. Example: convertir_liste(['1', '12.3', '4.12']) returns [1, 12.3, 4.12]
Please answer in Python 1) Write a function towards which takes as an argument a list li (attention, not a word, unlike the other functions of this exercise) and which returns a list obtained from li by reversing the order of the elements. Example: towards(['a', 'b', 'c', 'd']) is ['d', 'c', 'b', 'a'] 2) Write a palindrome function that takes a word as an argument and returns a Boolean indicating whether the word is a palindrome. A palindrome is a word that remains the same when read from right to left instead of the usual order from left to right. Example: palindrome('here') is True but palindrome('go') is False.
Write a function called `filler(A, l)` that takes an integer `A`, and a list of integers `l` and if some of the numbers in `l` sum up to `A` then it returns a list of these numbers. Otherwise, it returns `None`. For example, filler(5, [1,6,3,4]) returns [1,4]. filler(5, [1,6,3,7]) returns None. filler(0, [-1,-1,2,-3]) returns [-1,-1,2]. filler(10, [2,3,2,3,1]) returns [2,3,2,3]. If there are multiple answers, then return any of them. You can use each number in the list once for each occurence. """ def filler(A, l): # remove the following line to solve this question return
Write a function that takes two arguments, a list L1 and a list L2. • If the length of the list L1 is greater than twice the length of the list L2, then append the first three values of L1 to the three last values of L2. E.g. if L1 = ‘(1 2 3 4 5 6 7) and L2 = ‘(8 9 10), then return ‘(1 2 3 8 9 10) Should be written in the Racket programming language
Please answer it in Python Write a function indice_de that takes as an argument an integer (supposedly even) and a list, and returns the index to which this integer appears in the list. If the integer does not appear, the function will return None. It is assumed here for simplicity that the integer searched for does not appear several times in the list. Hint: if the for e in list loop doesn't suit you, remember that you can make a for + range or a while. .. Example: indice_de(12, [4, 7, 12, 0, 21, 5]) return => 2 (because 12 is placed at index 2), and indice_de(6, [4, 7, 12, 0, 21, 5]) return => None. Write a function trouve_premier_pair that takes a list as an argument and returns the even integer that appears first in the list. If the list does not contain an even integer, the function will return None. Example: trouve_premier_pair([1, 15, 4, 7, 12, 3]) return =>4 and trouve_premier_pair([1, 17, 7]) return =>None. Write a function extrait_even that takes as an…
Please answer it in Python Write a decale function that takes as an argument a list l and a number d and returns the list obtained from l by adding an offset of d to each element of l. Example: decale([4, 17, 12], 3) is [7, 20, 15]. Write a function intercale_zeros that takes as an argument a list l and returns the list obtained from l by inserting a zero after each element of l. Example: intercale_zeros([4, 17, 12]) is [4, 0, 17, 0, 12, 0].
Use Standard ML Code: Write a function that returns the factorial of a number. Write a function that sums all numbers in a list of pairs. e.g.: sum_of_pairs [(1, 2), (4, 3), (2, 5)] should return 17 (which is equal to 1 + 2 + 4 + 3 + 2 + 5) Write a function to return a list of second elements in a list of pairs. e.g.: sends [(1, 2), (4, 3), (2, 5)] should return [2, 3, 5]।
rite a function numPairs that accepts two arguments, a target number and a list of numbers. The function then returns the count of pairs of numbers from the list that sum to the target number. In the first example the answer is 2 because the pairs (0,3) and (1,2) both sum to 3. The pair can be two of the same number, e.g. (2,2) but only if the two 2’s are separate twos in the list.In the last example below, there are three 2’s, so there are three different pairs (2,2) so there are 5 pairs total that sum to 4. Sample usage: >> numPairs( 3, [0,1,2,3] )2
Write a function that accepts two arguments, a list and a number n. The list contains numbers. The function return a list of all the numbers from the input list that are greater than number n. greater_than_n(list, n)
Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
Please answer it in Python Write a function min_odd that takes a list as an argument and returns the smallest even integer contained in the list. If the list contains no even integers, the function will return None. For Example : min_odd([45, 62, 19, 22, 26, 18, 3, 5, 14])Expected answer is 14 min_odd([])Expected answer is None Write a function index_of that takes as an argument an integer (supposedly even) and a list, and returns the index to which this integer appears in the list. If the integer does not appear, the function will return None. It is assumed here for simplicity that the integer searched for does not appear several times in the list. Hint: if the for e in list loop doesn't suit you, remember that you can make a for + range or a while. .. For Example: index_of(34, [3, 67, 62, 34, 19, 24])Expected answer is 3 index_of(16, [2, 6, 104, 5, 25, 18, 50, 16])Expected answer is 7
Please answer it in Python Write a function min_pair that takes a list as an argument and returns the smallest even integer contained in the list. If the list contains no even integers, the function will return None. Example: min_pairs([4, 7, 12, 0, 21, 5]) is 0 min_pairs([9, 3, 1]) is None. min_pair([16, 13, 10, 102, 7, 23]) is 10