To find the GCF, list the prime factors of each number, then multiply the factors that both number have in common. To find the LCD, find the smallest possible integer divisible by both numbers.
I believe this would be 51
Hint to start out the problem:
eg. For f(4), use the first expression, (x-3)^2 because 4 is greater than 1.
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>
