Clock strikes once at one o clock, twice at two o clock, thrice at three o clock and so on. how many times will it strikes for 24 hours. this is a question for time word problem. if u know the answer please write it here.
Answer:
Hamish's earning = $20
Harry's earning = $26
Step-by-step explanation:
Given the following :
Let Harry's earning per hour = x
Let Hamish earning per hour = y
Harry earns a dollar more than more than 5/4 the amount hamish earns per hour;
Therefore,
x = 5/4y + 1
x - 5/4y = 1 - - - - (1)
the amount Harry earns per hour is $2 less than 7/5 the amount Hamish earns per hour
x = 7/5y - 2 - - - - (2)
Substituting (2) into (1)
7/5y - 2 - 5/4y = 1
7/5y - 5/4y = 1 + 2
7/5y - 5/4y = 3
Taking the L. C. M
(28y - 25y) / 20 = 3
28y - 25y = 60
3y = 60
y = 20
Substitute y = 20 into (1)
x - 5/4(20) = 1
x - 100/4 = 1
x - 25 = 1
x = 1 + 25
x = 26
y = Hamish's earning = $20
x = Harry's earning = $26
Answer:
- b ≤ 10, which means <em>number of books less than or equal to 10.</em>
Explanation:
In mathematical language a<em> constraint</em> is a limitation on the values that a variable can take.
In this case, the constraint is given by the fact that there are 10 books in the reading list from which Henry can choose to read this week.
So, the number of books that he can read is 1, 2, 3, ..., 10 (at most). This is, 10 books is an upper bound.
To represent an upper bound, you use the inequality symbol ≤, which means less than or equal to.
Henry can read as many as 10 books, so that is less than or equal to 10.
If you call b the number of books, the constrain may be written as:
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.[1
