PLEASE HELP ME QUICKLY!!! Given that N:{1,2,3,5,8,13} and M:{−9,−8,−6,−4,−2,4}, which statements about N and M are true?
Lelechka [254]
Answer:
The intersection of N and M contains only those elements that are in both N and M.
The intersection of N and M is ϕ.
N∩M=∅
Step-by-step explanation:
Given
M = { 1, 2, 3, 5, 8, 13}
N = {-9, -8, -6, -4, -2, 4}
Now let us see each statement one by one.
The intersection of N and M contains only those elements that are in both N and M.
The statement is true because by definition intersection of two sets consists of common elements of both sets.
The intersection of N and M is ϕ.
The statement is true. As there is no common element in both sets.
The intersection of N and M is {−9,−8,−6,−4,−2}.
The statement is false because there is not common element in M and N.
N∪M=∅
The statement is false as the union consists of elements of both sets so it can't be empty.
N∩M=∅
True. Because no common element so intersection will be an empty set..
The greatest possible number of club members is 7
<em><u>Solution:</u></em>
Given that, local readers’ club has a set of 49 hardback books and a set of 21 paperbacks
Each set can be divided equally among the club members
To find the greatest possible number of club members, we have to find the greatest common factor of 49 and 21
The greatest number that is a factor of two (or more) other numbers.
When we find all the factors of two or more numbers, and some factors are the same ("common"), then the largest of those common factors is the Greatest Common Factor.
<em><u>Greatest common factor of 49 and 21:</u></em>
The factors of 21 are: 1, 3, 7, 21
The factors of 49 are: 1, 7, 49
Then the greatest common factor is 7
Thus, the greatest possible number of club members is 7
Answer:
Step-by-step explanation: she only has 3 because of herself
Step-by-step explanation:
Here are four steps to help solve any math problems easily:
Read carefully, understand, and identify the type of problem. ...
Draw and review your problem. ...
Develop the plan to solve it. ...
Solve the problem.
