All categories

3 years ago

Plz Help

Mathematics

1 answer:

GenaCL600 [577]3 years ago

6 0

Begin by factoring 2 out of 2x^2 - 2x - 12 equals 0:

2(x^2 - x - 6) = 0

2(x - 3)(x + 2) = 0. 2 is never zero, but x-3 and x+2 can each be set = to 0:

This results in x = 3 and x = -2. The equation is true for these two x-values.

You might be interested in

PLEASE PELASE PLEASE HELP ME

V125BC [204]

Answer:

In ∆ABC AND ∆DEF

ABC=DEF...........each 90°

SIDE AB =SIDE ED...........given

SIDE BC =SIDE EF............B-F-C and E-C-F

∆ABC =∆DEF....................by SAS test

3 0

2 years ago

The graph of a function f(x) is shown below: What is the domain of f(x)?

Pie

The domain is the scope of the x values. In this case (-2,-1) is a hole, so x>-2 is one end of the domain, while (3,3) is defined. So the domain using interval notation is (-2,3] which can also be expressed -2 < x ≤ 3, answer option 1

8 0

3 years ago

sam is 27 years old. his age is 6 years greater than 3 times Brandon's age. which method can be used to determine Brandon's age?

dezoksy [38]

Answer:

Step-by-step explanation:

6 times 3 = 18

27- 18 = 9 brandon is 9

3 0

3 years ago

Read 2 more answers

Help shaded parts need answers

Andrej [43]

Answer:

? i cant understand this!!!!!!!

Step-by-step explanation:

4 0

3 years ago

5. The recursive algorithm given below can be used to compute gcd(a, b) where a and b are non-negative integer, not both zero.

s2008m [1.1K]

Implementating the given algorithm in python 3, the greatest common divisors of (124 and 244) and (4424 and 2111) are 4 and 1 respectively.

The program implementation is given below and the output of the sample run is attached.

def gcd(a, b):

#initialize a function named gcd which takes in two parameters

if a>b:

#checks if a is greater than b

return gcd (b, a)

#if true interchange the Parameters and Recall the function

elif a == 0:

return b

elif a == 1:

return 1

elif((a%2 == 0)and(b%2==0)):

#even numbers leave no remainder when divided by 2, checks if a and b are even

return 2 * gcd(a/2, b/2)

elif((a%2 !=0) and (b%2==0)):

#checks if a is odd and B is even

return gcd(a, b/2)

else :

return gcd(a, b-a)

#since it's a recursive function, it recalls the function with new parameters until a certain condition is satisfied

print(gcd(124, 244))

print()

#leaves a space after the first output

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0

3 years ago