2x+y=5
y+3=2x
y+3-3 = 2x-3
y= 2x -3
2x + y =5
2x + 2x -3 = 5
Answer:
r < 4
Step-by-step explanation:
r+6<10
r < 4
Answer:
The members of the cabinet can be appointed in 121,080,960 different ways.
Step-by-step explanation:
The rank is important(matters), which means that the order in which the candidates are chosen is important. That is, if we exchange the position of two candidates, it is a new outcome. So we use the permutations formula to solve this quesiton.
Permutations formula:
The number of possible permutations of x elements from a set of n elements is given by the following formula:

If there are 14 eligible candidates for these positions (where rank matters), how many different ways can the members of the cabinet be appointed?
Permutations of 8 from a set of 14. So

The members of the cabinet can be appointed in 121,080,960 different ways.
Answer:
x≈13.08
Step-by-step explanation:
We use the pythagora's theorem

So, first determine what half of the denominator or bottom number would be.
Half of 13 would be 6.5 (Do 13 divided by 2).
Next, see if the numerator or top number on the fraction is smaller, the same, or bigger than that number.
Since 6.5 is bigger than 6, the numerator would be smaller.
If it is smaller, keep the whole number (in this case 12) the same. If it is the same or equal, round up (in this case 13).
Since 6 is smaller than 6.5, you keep 12 the same.
Your answer would be 12.
Hope this helped!