1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
adoni [48]
3 years ago
13

Graph this function:f(x)=x^2-4x-5

Mathematics
1 answer:
defon3 years ago
4 0
A= 1 b= -4.
Hope this helps

You might be interested in
What is 2+6 then add 10 x 20 plus 480
miss Akunina [59]

Answer:

688

Step-by-step explanation:

(2 + 6) + (10 x 20) + 480

8 + 200 + 480

8 0
3 years ago
Read 2 more answers
*****BRAINLIEST AVAILABLE********
sweet-ann [11.9K]

Answer: C, D

<u>Explanation:</u>

Length: L = x + 3

width: x ≥ y + 2   ⇒  y ≤ x - 2

wheels: y

0.50(L * x) + 4(2.25y) ≤ 50

0.50(x + 3)(x) + 4(2.25y) ≤ 50

0.50(x² + 3x) + 9y ≤ 50

                        9y ≤ 50 - 0.50(x² + 3x)

                        <u>9y</u> ≤ <u>50 - 0.50x² - 1.5x</u>

                        ÷9               ÷9

                          y ≤ \frac{50}{9}-\frac{1}{6}x-\frac{1}{18}x^{2}

*******************************************************************************

15 per person is the rate

22 is the constant

y = 15x + 22

<em>divide that by the number of people (x) to get:</em>

y = \frac{15x + 22}{x}

8 0
3 years ago
Read 2 more answers
What % of 25 is 15. Please help me
erik [133]

Answer:

15 is 60% (percent) of 25.

Step-by-step explanation:

6 0
3 years ago
uppose that we have a function with a constant amount of work done in initialization, a call to a log-linearsorting algorithm, a
White raven [17]

Answer:

The running time is quadratic (O(n²) )

Step-by-step explanation:

For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n),  is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is

C + T(n) + n*(a*n+b) = an²+bn + T + C

Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).

7 0
3 years ago
Help with everything please thank you
valentinak56 [21]

Step-by-step explanation:

1) 8=64÷r

8r=64

r = 64/8

r = 8

(8×8=64)

2)5p=30

p =30/5

p =6

3)56÷f =8

8f = 56

f =56/8=7

4)155/7

22.14...

aproximately 22 tables

5)185/8

=23.125

to serve each with a whole slice there should be 24 pizzas

6 0
3 years ago
Other questions:
  • Using the technique in the model above, find the missing sides in this 30° 600-90 right triangle.longShort 7Hypotenuse3.571314
    14·1 answer
  • There are 10 less red skittles than orange skittles in the bag. The orange skittles are also twice the number of red skittles. F
    15·2 answers
  • The minimum and maximum temperature on a cold day can be modeled by the equation 2[x-6]+14=38 What are the min and max temperatu
    9·2 answers
  • How are the two angles related?
    5·1 answer
  • What is angle C if B = 89°, a =14, and c = 21
    12·1 answer
  • Help plz !!!!! Isosceles and Equilateral.
    7·1 answer
  • Type the expression that results from the following series of steps:
    9·1 answer
  • Megan has a pen for her dog. The dimensions of the pen are in meters (m) as shown below.
    10·2 answers
  • Please help me find all the answers.
    12·2 answers
  • Find the value of<br> (-3)<br> Show work<br> Must show work!!
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!