Py+7=6y+q solve for y
1 answer:
You might be interested in
Let's try to find some primes that divide this number.
The number is not divisible by 2, because it is odd.
The number is divisible by 3 though, because the sum of its digits is:
So, we can divide the number by 3 and keep going with the factorization:
This number is again divisible by 3, because
We have
This number is no longer divisible by 3. Let's go on looking for primes that divide it: 5 doesn't because the number doesn't end in 0 nor 5. This number is not divisible by 7 or 11 either (just try). It is divisible by 13 though: we have
And 557 is prime, so we're done. This means that the prime factorization of 65169 is
Given that and
, we can say the following:
Now, remember what happens if we have a negative square root: it becomes an imaginary number. We don't want this, so we want to make sure whatever is under a square root is greater than 0 (given we are talking about real numbers only).
Thus, let's set what is under both square roots to be greater than 0:
Since both of the square roots are in the same function, we want to take the union of the domains of the individual square roots to find the domain of the overall function.
Now, let's look back at the function entirely, which is:
Since is on the bottom of the fraction, we must say that
, since the denominator can't equal 0. Thus, we must exclude
from the domain.
Thus, our answer is Choice C, or .
<em>If you are wondering why the choices begin with the symbol, it is because this is a way of representing that
lies within a particular set.</em>