set notation

Set of all consonants in the word,'SECONDARY' Our set has 6 elements below: {C, D, N, R, S, Y}

set of days with the letter n We have the set below: {Monday, Wednesday, Sunday}

set of all letters in Australia We remove duplicate "a's" and treat A and a as the same letters. Our set S is: S = {a, i, l, r, s, t, u} If we want to find the properties of this set, we visit our set notation calculator.

The set of months of a year ending with the letters “ber”. We build set S below: S = {September, October, November, December} The cardinality of S, denoted |S|, is the number of items in S: |S| = 4

If a universal set contains 250 elements, n(A) = 90, n(B) = 125, and n(A ∩ B) = 35, find n(A ∪ B)'. We know from set theory that: n(A U B) = n(A) + n(B) - n(A ∩ B) Plugging in our given values, we get: n(A U B) = 90 + 125 - 35 n(A U B) = 180 The problem asks for n(A U B)'. This formula is...

what is a well defined set? A well defined set is with no ambiguity or confusion about what belongs to the set. Think of it as a collection of distinct objects: Examples: Set of the first 5 even numbers: {2, 4, 6, 8, 10} Set of weekend days: {Saturday, Sunday}

If set A ={1,2,3,4} and B={2,4,6,8}, what is A intersect B Using our set notation calculator, we get: A intersect B = {2, 4}

D= {a,b,c,d,e,f,g} the cardinality of set D is Cardinality of D, denoted |D|, is the number of items in the set: |D| = 7

The set of all letters in the word true is: We have {t, r, u, e}

d is the set of days of the week d = {Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday}

Let A={a,b,c} and B={1,2,3} Compute A∪B Union means all elements in either A or B, so we have: A∪B = {a,b,c,1,2,3}

Let U be the set of all integers between −3 and 3 (including −3 and 3). Let A={−2,0,1,3}. Find Ac. Give your answer in standard set notation Ac is anything not in A, but in U. So we have: Ac = {-3, -1, 2}

Write in set builder form {all possible numbers formed by any two of the digits 1 2 5} With 3 numbers, we got 3! = 6 possible numbers formed by the two digits 12 15 21 25 51 52 In set builder notation, we write this as: {x : x ∈ {12, 15, 21, 25, 51, 52}) x such that x is a element of the set...

x is a multiple of 6 and 1 ≤ x ≤ 16. We want multiples of 6 between 1 and 16. We start with 6. Another multiple of 6 is 12 The next multiple of 6 is 18, which is out side the range of 1 ≤ x ≤ 16. So our number set is x = {6, 12}

You are using a spinner with the numbers 1-10 on it. Find the probability that the pointer will stop on an odd number or a number less than 4. We want P(odd number) or P(n<4). Odd numbers are {1, 3, 5, 7, 9} n < 4 is {1, 2, 3} We want the union of these 2 sets: {1, 2, 3, 5, 7, 9} We have 6...

The sum is greater than 7, the sum is divisible by 2 2 dice sum greater than 7 means 8, 9, 10, 11, 12. Now take this set, and intersect it with sums divisible by 2. 8, 10, 12

A = { 0 , 2 , 4 , 6 , 8 } B = { 0 , 1 , 2 , 3 , 4 , 5 , 6 } C = { 4 , 5 , 6 , 7 , 8 , 9 , 10 } Find ( A ∪ B ) ∩ C A U B is everything in A and B A U B = {0, 1, 2, 3, 4, 5, 6, 8} ( A ∪ B ) ∩ C means everything in both ( A ∪ B ) and C ( A ∪ B ) ∩ C = {4, 5, 6, 8}

A = {1, 3, 5, 7, 9} B = {2, 4, 6, 8, 10} C = {1, 5, 6, 7, 9} A ∩ (B ∩ C) = B ∩ C = {6} A ∩ (B ∩ C) = {} or the empty set

The set of all odd numbers between 10 and 30 {11, 13, 15, 17, 19, 21, 23, 25, 27, 29}

A is the set of odd integers between 4 and 12 Let A be the set of odd numbers between 4 and 12: A = {5, 7, 9, 11}