Answer:
Correct
The solution is Sarah; The pi button on the calculator gives a more accurate representation for pi than 3.14. Using 3.14 as an approximation for pi yields a less accurate result.
Step-by-step explanation:
ANSWER
The general solution is
, where
is an integer
<u>EXPLANATION</u>
In order to solve the linear congruence;

We need to determine the inverse of
(which is a Bézout coefficient for 33).
To do that we must first use the Euclidean Algorithm to verify the existence of the inverse by showing that;

Now, here we go;



The greatest common divisor is the last remainder before the remainder of zero.
Hence, the
.
We now express this gcd of 1 as a linear combination of 33 and 280.
We can achieve this by making all the non zero remainders the subject and making a backward substitution.


Equation (2) in equation (1) gives,



The above linear combination tells us that
is the inverse of
.
Now we multiply both sides of our congruence relation by
.

This implies that;

.
Since this is modulo, the solution is not unique because any integral addition or subtraction of the modulo (280 in this case) produces an equivalent solution.
Therefore the general solution is,
, where
is an integer
Answer:
y<(x-2)^2
Step-by-step explanation:
To graph this inequality, we first identify the function.
This is a quadratic function y=x^2
The function is translated horizontally to the right two. (x-2)^2
It is also a dotted line, <.
The answer is true. example 100 cm is 1m and you got it by 100 dividing by 100
Answer:
There is a 9/15 or 3/5
Step-by-step explanation:
There are a total of 15 cards, of those, 6 are red, so if you subtract 6 from 15, you get 9, which is the total amount of yellow and blue cards, which is what you were to not get a red card.