The input is the y
y = x^2 - 5
plug in what we're given
-1 = x^2 -5
add 5 to both sides
4 = x^2
take the square root of both sides
2 = x

Hope this helps :)

4 0

3 years ago

The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is

HACTEHA [7]

Answer:

False

Step-by-step explanation:

Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.

Quotient and/or Remainder = $\frac{N}{D}$

8 0

3 years ago

Help need awnser ASAP

zzz [600]

Answer:

(B)

Step-by-step explanation:

It is given that: From ΔONP and ΔMLP,

$\frac{PO}{PL}=\frac{PN}{PM}$ (By basic proportionality theorem)

∠MPL=LPM(Common)

Therefore, ΔONP is similar to ΔMLP by SAS similarity postulate.

Also, From ΔONP and ΔKPJ,

$\frac{PO}{PK}=\frac{PN}{PJ}$ (By basic proportionality theorem)

∠OPN=KPJ(Common)

therefore, ΔONP is similar to ΔKPJ by SAS similarity postulate.

Now, since ΔONP is similar to ΔMLP by SAS similarity postulate and ΔONP is similar to ΔPJK by SAS similarity postulate, therefore ΔMLP is similar to ΔPJK by SAS similarity postulate.

Thus, all the three center triangles are similar by SSS similarity postulate.

3 0

3 years ago