Let x be the large number, and y be the smaller one: x=3+2y, 2x-5y=0 (from the question) --> substitute the first equation in the second --> 2(3+2y)-5y=0 --> 6+4y-5y=0 -->6-y=0 --> y=6, substitute y=6 in the first equation --> x=3+2(6) --> x=15. therefore the two numbers are 6,15
Answer:
$440588.24
Step-by-step explanation:
Let x be the value of Zlatans house before the increase.
We are told that the value of Zlatans house has increased by 7%. His house is now valued at $749,000. This means that value of house(x) before increase plus 7% of x will be equal to $749000.
We can set this information in an equation as:
Upon combining like terms we will get,
Therefore, the value of the house before increase will be $440588.24.
Answer:
<h2>The distance from the pitcher's mound and to second base is 37.99 approximately.</h2>
Step-by-step explanation:
The diamond is a square, which in this case has 50 feet long each side, and from home to pitcher is 38 feet. Notice that home is a vertex of the square and the pitcher's mound is the intersection of the diagonals, where they cut half.
We can find the distance from the pitcher to first base using Pythagorean's Theorem, where 50 feet is the hypothenuse.

Therefore, the distance from the pitcher to first base is 32.5 feet, approximately.
Now, we can use again Pythagorean's Theorem to find the distance from pitcher to second base, where the hypothenuse is 50 feet.

Therefore, the distance from the pitcher's mound and to second base is 37.99 approximately.
<em>(this results make sense, because the diagonals of a square intersect at half, that means all bases have the same distance from pitcher's mound, so the second way to find the distance asked in the question is just using theory)</em>
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.
What’s the whole question???!