n, n+1 - two consecutive integers
n(n + 1) = 50 <em>use distributive property</em>
n² + n = 50 <em>subtract 50 from both sides</em>
n² + n - 50 = 0
-----------------------------------------------------
ax² + bx + c =0
if b² - 4ac > 0 then we have two solutions:
[-b - √(b² - 4ac)]/2a and [-b - √(b² + 4ac)]/2a
if b² - 4ac = 0 then we have one solution -b/2a
if b² - 4ac < 0 then no real solution
----------------------------------------------------------
n² + n - 50 = 0
a = 1, b = 1, c = -50
b² - 4ac = 1² - 4(1)(-50) = 1 + 200 = 201 > 0 → two solutions
√(b² - 4ac) = √(201) - it's the irrational number
Answer: There are no two consecutive integers whose product is 50.
(f o g)(x) = 2(5x + 1) - 6 = 10x - 4
(g o f)(x) = 5(2x - 6) + 1 = 10x - 29
So (f o g)(x) produces the greatest output.
Answer: 0.03%
Explanation: 3/100
Answer:
x=4 z=117
Step-by-step explanation:
Answer:
for 12 people cut everything in half
for 36 add the 12 to 24 people
