Answer: X intercept: (-4,0) Y Intercept: (0,-3)
Step-by-step explanation: i dont know if thats how it was suppose to be done or not but that is just the intercepts for it.
The greatest whole number that rounds to 7,400 would be 7,399. This is because there is no number that is larger than 7,399 that would round up to 7,400, since 7,400 is the next number.
The least whole number that rounds to 7,400 would be 7,401. This is because there is no number that is less than 7,401 that would round up to 7,400, since 7,400 is the next number.
It’s 6=6 I think I hope it’s help have a nice day
Answer:
8.5
Step-by-step explanation:
Answer:
Dimensions: 
Perimiter: 
Minimum perimeter: [16,16]
Step-by-step explanation:
This is a problem of optimization with constraints.
We can define the rectangle with two sides of size "a" and two sides of size "b".
The area of the rectangle can be defined then as:

This is the constraint.
To simplify and as we have only one constraint and two variables, we can express a in function of b as:

The function we want to optimize is the diameter.
We can express the diameter as:

To optimize we can derive the function and equal to zero.

The minimum perimiter happens when both sides are of size 16 (a square).