Answer:
no because it doesnt pass the vertical line test
Step-by-step explanation:
give me brainliest pls
Where a, b, and c are real numbers and a ≠ 0 .
The quadratic term is ax
2
, the linear term is
bx, and the constant term is c. Quadratic
functions have degree two. The graph of a
quadratic function is called a parabola. If
a < 0, then the parabola opens downward,
like function g. If
a > 0, then the parabola
opens upward like function f. If
the parabola opens upward, then
the vertex is the point whose yvalue
is the minimum value of f.
If the parabola opens downward,
then the vertex is the point
whose y-value is the maximum
value of f. The vertical line that
goes through the vertex is called
the axis of symmetry of the
parabola.
Answer:
The first set of consecutive even integers equals (8 , 6)
The second set is ( - 8 and - 6) which also works.
Step-by-step explanation:
Equation
(x)^2 + (x + 2)^2 = (x)(x + 2) + 52 Remove the brackets on both sides
Solution
x^2 + x^2 + 4x + 4 = x^2 + 2x + 52 Collect the like terms on the left
2x^2+ 4x+ 4 = x^2 + 2x + 52 Subtract right side from left
2x^2 - x^2 + 4x - 2x + 4 - 52 = 0 Collect the like terms
x^2 + 2x - 48 = 0 Factor
(x + 8)(x - 6) = 0
Answer
Try the one you know works.
x - 6 = 0
x = 6
Therefore the two integers are 6 and 8
6^2 + 8^2 = 100
6*8 + 52 = 100
So 6 and 8 is one set of consecutive even numbers that works.
========================
What about the other set.
x + 8 = 0
x = - 8
x and x + 2
- 8 and -8 + 2 = - 8, - 6
(- 8 )^2 + (- 6)^2 = 100
(-8)(-6) + 52 = 100
Both sets of consecutive numbers work.
V = 389.02 cm³
hope this helps
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 = 
