If p = 4/5, what is the smallest value of n?

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

2

step-by-step explanation:

answer: 7. if the functions had a negative leading coefficient and is of even degree, which statement about the graph is true?

step-by-step explanation:

answer: plz mark me brainliest

7 hours, 0 minutes, 0 seconds

or:  

0.04

total weeks

or:  

0.29

total days

or:  

7.00

total hours

or:  

420.00

total minutes

or:  

25,200.00

total seconds

step-by-step explanation: