Write a function divisibleBy which takes two arguments, a numberN and a list of numbers L, and returns a new list containing all numbers X in the list L where either X divides N exactly, or N divides X exactly. You can assume that all numbers will be integers, and you can assume that the input number N will never be 0 (but numbers in the list L may be 0). You probably want to use the built-in modulo function here. The call (modulo X N) gives the remainder you get after dividing X by N. For example, the call (divisibleBy 10 '(4 30 11 5 0)) returns the list (30 5 0) because 10 divides 30 exactly (3*10=30), 5 divides 10 exactly (5*2=10), and 10 divides 0 exactly (10*0 = 0). A hint: Notice a mathematical quirk here: every number E divides exactly into 0: (modulo 0 E)=0 for all possible numbers E, but you cannot divide a number by 0: (modulo E 0) will give a "divide-by-zero" error. This means that you will need to add a special case to your function to "catch" the situation where an element (car L) in the list L is equal to 0, to make sure you don't call (modulo E (car L)). For example: Test Result (divisibleBy 10 '(4 30 11 5 0)) (30 5 0) (divisibleBy 6 '(2 6 1 9 18) ) (2 6 1 18)

Write a function divisibleBy which takes two arguments, a numberN and a list of numbers L, and returns a new list containing all numbers X in the list L where either X divides N exactly, or N divides X exactly. You can assume that all numbers will be integers, and you can assume that the input number N will never be 0 (but numbers in the list L may be 0). You probably want to use the built-in modulo function here. The call (modulo X N) gives the remainder you get after dividing X by N. For example, the call (divisibleBy 10 '(4 30 11 5 0)) returns the list (30 5 0) because 10 divides 30 exactly (310=30), 5 divides 10 exactly (52=10), and 10 divides 0 exactly (10*0 = 0). A hint: Notice a mathematical quirk here: every number E divides exactly into 0: (modulo 0 E)=0 for all possible numbers E, but you cannot divide a number by 0: (modulo E 0) will give a "divide-by-zero" error. This means that you will need to add a special case to your function to "catch" the situation where an element (car L) in the list L is equal to 0, to make sure you don't call (modulo E (car L)). For example: Test Result (divisibleBy 10 '(4 30 11 5 0)) (30 5 0) (divisibleBy 6 '(2 6 1 9 18) ) (2 6 1 18)

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

It is essential to have a solid understanding of how programming languages have developed through time.
We refer to "low-level" programming languages as those that aren't as complex.
Give some examples of what features a good programming language should have.
What do you think is most important in high-quality programming languages?
A computer programmer is defined as.
This is a definition of explanatory language:
Some programming languages are typeless. What are the obvious advantages anddisadvantages of having no types in a language?
There is no need for a programmer who is already proficient in many languages to learn yet another.
The concepts described up to this point are the fundamental elements of a high-level programming language.
When it comes to writing code, are there fundamental differences between declarative and functional programming?
Are there benefits and drawbacks to strong and weak typing in a computer language?
I was curious as to which characteristics you believe the ideal programming language should possess.