Question

Let S = {0,1,2,3,4,...}, A = the set of natural numbers divisible by 2, and B...

Let S = {0,1,2,3,4,...}, A = the set of natural numbers divisible by 2, and B = the set of numbers divisible by 5. What is the set A intersection B? What is the set A union B? Please show your work.

Homework Answers

Answer #1

Let S = {0,1,2,3,4,...},

A = the set of natural numbers divisible by 2

i.e A={ 0,2,4,6,8,10......} all even numbers

, and B = the set of numbers divisible by 5.

i.e B={0,5,10,15,20..........}

All the numbers ending with 0 and 5

What is the set A intersection B?

Since the numbers ending with 5 are not divisible by 2. only the numbers ending with 0 are divisible by both 2 and 5.

So A n B = {0,10,20,30.............} i.e all numbers ending with 0

What is the set A union B?

A U B includes all the numbers in A and all numbers in B . Since the numbers in B ending with 0 are divisible by 2 , no need to repeat those numbers in A U B

So, it includes all even numbers and all numbers ending with 5

So, A U B ={ 0,2,4,5,6,8,10,12,14,15,16, 18,20 ....}

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Let N2K be the set of the first 2k natural numbers. Prove that if we choose...
Let N2K be the set of the first 2k natural numbers. Prove that if we choose k + 1 numbers out of these 2k, there is at least one pair of numbers a, b for which a is divisible by b.
prove that 2^2n-1 is divisible by 3 for all natural numbers n .. please show in...
prove that 2^2n-1 is divisible by 3 for all natural numbers n .. please show in detail trying to learn.
Let A be the set of all natural numbers less than 100. How many subsets with...
Let A be the set of all natural numbers less than 100. How many subsets with three elements does set A have such that the sum of the elements in the subset must be divisible by 3?
Exercise 6.6. Let the inductive set be equal to all natural numbers, N. Prove the following...
Exercise 6.6. Let the inductive set be equal to all natural numbers, N. Prove the following propositions. (a) ∀n, 2n ≥ 1 + n. (b) ∀n, 4n − 1 is divisible by 3. (c) ∀n, 3n ≥ 1 + 2 n. (d) ∀n, 21 + 2 2 + ⋯ + 2 n = 2 n+1 − 2.
Please show the proof that: Either [a]=[b] or [a] *union* [b] = empty set this will...
Please show the proof that: Either [a]=[b] or [a] *union* [b] = empty set this will be proof by contrapositibe but please show work: theorem: suppose R is an equivalence of a non-empty set A. let a,b be within A then [a] does not equal [b] implies that [a] *intersection* [b] = empty set
Let S be the set {(-1)^n +1 - (1/n): all n are natural numbers}. 1. find...
Let S be the set {(-1)^n +1 - (1/n): all n are natural numbers}. 1. find the infimum and the supremum of S, and prove that these are indeed the infimum and supremum. 2. find all the boundary points of the set S. Prove that each of these numbers is a boundary point. 3. Is the set S closed? Compact? give reasons. 4. Complete the sentence: Any nonempty compact set has a....
Let S(n) be the statement: The sum of the first n natural numbers is 1/2 n2...
Let S(n) be the statement: The sum of the first n natural numbers is 1/2 n2 + 1/2 n + 1000. Show that if S(k) is true, so is S(k+1).
If we let N stand for the set of all natural numbers, then we write 6N...
If we let N stand for the set of all natural numbers, then we write 6N for the set of natural numbers all multiplied by 6 (so 6N = {6, 12, 18, 24, . . . }). Show that the sets N and 6N have the same cardinality by describing an explicit one-to-one correspondence between the two sets.
Consider the definition of equivalence class. Let A be the set {0,1,2,3,4}. Is it possible to...
Consider the definition of equivalence class. Let A be the set {0,1,2,3,4}. Is it possible to have an equivalence relation on A with the equivalence classes: {0,1,2} and {2,3,4}? Explain. (Hint: Think about the element 2)
Prove: Let S be a bounded set of real numbers and let a > 0. Define...
Prove: Let S be a bounded set of real numbers and let a > 0. Define aS = {as : s ∈ S}. Show that inf(aS) = a*inf(S).
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT