Theory:
The standard form of set-builder notation is <span>
{ x | “x satisfies a condition” } </span>
This set-builder notation can be read as “the set
of all x such that x (satisfies the condition)”.
For example, { x | x > 0 } is
equivalent to “the set of all x such that x is greater than 0”.
Solution:
In the problem, there are 2 conditions that must
be satisfied:
<span>1st: x must be a real number</span>
In the notation, this is written as “x ε R”.
Where ε means that x is “a member of” and R means “Real number”
<span>2nd: x is greater than or equal to 1</span>
This is written as “x ≥ 1”
Answer:
Combining the 2 conditions into the set-builder
notation:
<span>
X =
{ x | x ε R and x ≥ 1 } </span>
Answer: 11113200
Step-by-step explanation:
We know that , the number of combination of choosing r things from n things is given by :-

Then , the number of ways to choose a dancing committee if it is to consist of 4 freshmen, 5 sophomores, 2 juniors, and 3 seniors :-
Then , the number of ways to choose a dancing committee if it is to consist of 4 freshmen, 5 sophomores, 2 juniors, and 3 seniors :-
Then , the number of ways to choose a dancing committee if it is to consist of 4 freshmen, 5 sophomores, 2 juniors, and 3 seniors :-


∴ The number of ways to choose a dancing committee if it is to consist of 4 freshmen, 5 sophomores, 2 juniors, and 3 seniors = 11113200
Answer:
2^-18
Step-by-step explanation:
The least common multiple between 3 and 4 is 12, so we can use this fact to rewrite both 1/3 and 1/4 in 12ths:

We're left with an answer of
7/12, which can't be reduced.