Answer:
B
Step-by-step explanation:
+ 6 = x ( subtract 6 from both sides )
= x - 6 ( square both sides )
x = (x - 6)² ← expand using FOIL
x = x² - 12x + 36 ( subtract x from both sides )
0 = x² - 13x + 36 , that is
x² - 13x + 36 = 0 ← in standard form
(x - 4)(x - 9) = 0 ← in factored form
Equate each factor to zero and solve for x
x - 4 = 0 ⇒ x = 4
x - 9 = 0 ⇒ x = 9
As a check
Substitute these values into the equation and if both sides are equal then they are the solutions.
x = 4
left side =
+ 6 = 2 + 6 = 8
right side = x = 4
Since 8 ≠ 4 then x = 4 is an extraneous solution
x = 9
left side =
+ 6 = 3 + 6 = 9
right side = x = 9
Thus the solution is x = 9 → B
Answer:
The graph in the attached figure
Step-by-step explanation:
we have

This is the equation of the line
To graph a line we need two points
<em>Find the intercepts</em>
1) The y-intercept is the value of y when the value of x is equal to zero
For x=0


The y-intercept is the point (0,3)
2) The x-intercept is the value of x when the value of y is equal to zero
For y=0


The x-intercept is the point (-1.5,0)
To draw the graph of the line plot the intercepts and join the points
using a graphing tool
see the attached figure
Convert to an equation:
50^2=2+25^2=2*5=10
Simplify:
2500=625=10=10
What is wrong is that 2500 does not equal 625 which does not equal 10.
Answer:
yesss it makes sense!!!!!!!!!!!
Hello,
Let's place the last digit: it must be 2 or 4 or 8 (3 possibilities)
It remainds 4 digits and the number of permutations fo 4 numbers is 4!=4*3*2*1=24
Thus there are 3*24=72 possibilities.
Answer A
If you do'nt believe run this programm
DIM n(5) AS INTEGER, i1 AS INTEGER, i2 AS INTEGER, i3 AS INTEGER, i4 AS INTEGER, i5 AS INTEGER, nb AS LONG, tot AS LONG
tot = 0
n(1) = 1
n(2) = 2
n(3) = 4
n(4) = 7
n(5) = 8
FOR i1 = 1 TO 5
FOR i2 = 1 TO 5
IF i2 <> i1 THEN
FOR i3 = 1 TO 5
IF i3 <> i2 AND i3 <> i1 THEN
FOR i4 = 1 TO 5
IF i4 <> i3 AND i4 <> i2 AND i4 <> i1 THEN
FOR i5 = 1 TO 5
IF i5 <> i4 AND i5 <> i3 AND i5 <> i2 AND i5 <> i1 THEN
nb = ((((n(i1) * 10) + n(i2)) * 10 + n(i3)) * 10 + n(i4)) * 10 + n(i5)
IF nb MOD 2 = 0 THEN
tot = tot + 1
END IF
END IF
NEXT i5
END IF
NEXT i4
END IF
NEXT i3
END IF
NEXT i2
NEXT i1
PRINT "tot="; tot
END