Answer:
C.5.7
Step-by-step explanation:
plug in the x value then add 4.5 to 1.2 and booyyah
Answer: N=-4
Step-by-step explanation:
STEP
1
:
STEP
2
:
Pulling out like terms
2.1 Pull out like factors :
-4n - 9 = -1 • (4n + 9)
Equation at the end of step
2
:
-3 • (4n + 9) - 21 = 0
STEP
3
:
STEP
4
:
Pulling out like terms
4.1 Pull out like factors :
-12n - 48 = -12 • (n + 4)
Equation at the end of step
4
:
-12 • (n + 4) = 0
STEP
5
:
Equations which are never true:
5.1 Solve : -12 = 0
This equation has no solution.
A a non-zero constant never equals zero.
Solving a Single Variable Equation:
5.2 Solve : n+4 = 0
Subtract 4 from both sides of the equation :
n = -4
One solution was found :
n = -4
Answer:
18 is the number good luck
Step-by-step explanation:
18+25=43
B is also correct answer for this question.
Answer:
a) Let r be a random number generated in the interval (0, 1). If we multiply r by n we will obtain a random number in the interval (0, n). We take the integer part of r*n+1 to generate a random integer between 1 and n.
Suppose that the tickets are numered and we order them ascendently. We generate a random integer K from 1 to 150 and we take the Kth ticket in the ordered list of tickets to design the first passanger to go to first class. We put the remaining tickets in order and pick another one by selecting, this time, a number from 1 to 149 (because we removed one ticket). Then we do this a third time to pick a passanger to the business class by picking a number from 1 to 148 and selecting the respective ticket.
After we select the 3 affortunate passangers, we select other 6 more using this same method to rebook them to a later flight.
b) You may move randomly two passangers from business class to first class and then move 3 passangers from economy class to business class, thus, a passanger that pay for a more economic ticket wont be in a more expensive site. Also, if the tickets are numered in order of purchase, then you can, instead of making a random selection, move only passangers with the lowest numbers.
