ANSWER 2.48 as a whole number would be 2 because you would round to the nearest whole number. GIVE BRAINLIEST PLEASE
Answer:
(a)
(b)
Step-by-step explanation:
(a) For using Cramer's rule you need to find matrix
and the matrix
for each variable. The matrix
is formed with the coefficients of the variables in the system. The first step is to accommodate the equations, one under the other, to get
more easily.

![\therefore A=\left[\begin{array}{cc}2&5\\1&4\end{array}\right]](https://tex.z-dn.net/?f=%5Ctherefore%20A%3D%5Cleft%5B%5Cbegin%7Barray%7D%7Bcc%7D2%265%5C%5C1%264%5Cend%7Barray%7D%5Cright%5D)
To get
, replace in the matrix A the 1st column with the results of the equations:
![B_1=\left[\begin{array}{cc}1&5\\2&4\end{array}\right]](https://tex.z-dn.net/?f=B_1%3D%5Cleft%5B%5Cbegin%7Barray%7D%7Bcc%7D1%265%5C%5C2%264%5Cend%7Barray%7D%5Cright%5D)
To get
, replace in the matrix A the 2nd column with the results of the equations:
![B_2=\left[\begin{array}{cc}2&1\\1&2\end{array}\right]](https://tex.z-dn.net/?f=B_2%3D%5Cleft%5B%5Cbegin%7Barray%7D%7Bcc%7D2%261%5C%5C1%262%5Cend%7Barray%7D%5Cright%5D)
Apply the rule to solve
:

In the case of B2, the determinant is going to be zero. Instead of using the rule, substitute the values of the variable
in one of the equations and solve for
:

(b) In this system, follow the same steps,ust remember
is formed by replacing the 3rd column of A with the results of the equations:

![\therefore A=\left[\begin{array}{ccc}2&1&0\\1&2&1\\0&1&2\end{array}\right]](https://tex.z-dn.net/?f=%5Ctherefore%20A%3D%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D2%261%260%5C%5C1%262%261%5C%5C0%261%262%5Cend%7Barray%7D%5Cright%5D)
![B_1=\left[\begin{array}{ccc}1&1&0\\0&2&1\\0&1&2\end{array}\right]](https://tex.z-dn.net/?f=B_1%3D%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%261%260%5C%5C0%262%261%5C%5C0%261%262%5Cend%7Barray%7D%5Cright%5D)
![B_2=\left[\begin{array}{ccc}2&1&0\\1&0&1\\0&0&2\end{array}\right]](https://tex.z-dn.net/?f=B_2%3D%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D2%261%260%5C%5C1%260%261%5C%5C0%260%262%5Cend%7Barray%7D%5Cright%5D)
![B_3=\left[\begin{array}{ccc}2&1&1\\1&2&0\\0&1&0\end{array}\right]](https://tex.z-dn.net/?f=B_3%3D%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D2%261%261%5C%5C1%262%260%5C%5C0%261%260%5Cend%7Barray%7D%5Cright%5D)



The answer t our question is the first one
I just substituted he number one in every x
The original equation is equal to 147 when x equals to 1
And the first option is also equal to 147 when x equals to one
Based on the information given, it should be noted that the least number of marbles that can be in the bag will be 10 marbles.
<h2>
Solution to the probability.</h2>
If the bag contains 60 marbles, the number of red marbles will be:
= 1/5 × 60
= 12 marbles.
The number of white marbles will be:
= 3/10 × 60
= 18 marbles.
The number of blue marbles will be:
= 60 - (12 + 18)
= 60 - 30
= 30 marbles.
Furthermore, when the bag has 4 red marbles and 6 white marbles, there'll be 10 blue marbles.
Lastly, to find the probability of choosing a blue marble, we've to multiply 1/2 by the number given.
Learn more about probability on:
brainly.com/question/25870256
Let's call the stamps A, B, and C. They can each be used only once. I assume all 3 must be used in each possible arrangement.
There are two ways to solve this. We can list each possible arrangement of stamps, or we can plug in the numbers to a formula.
Let's find all possible arrangements first. We can easily start spouting out possible arrangements of the 3 stamps, but to make sure we find them all, let's go in alphabetical order. First, let's look at the arrangements that start with A:
ABC
ACB
There are no other ways to arrange 3 stamps with the first stamp being A. Let's look at the ways to arrange them starting with B:
BAC
BCA
Try finding the arrangements that start with C:
C_ _
C_ _
Or we can try a little formula; y×(y-1)×(y-2)×(y-3)...until the (y-x) = 1 where y=the number of items.
In this case there are 3 stamps, so y=3, and the formula looks like this: 3×(3-1)×(3-2).
Confused? Let me explain why it works.
There are 3 possibilities for the first stamp: A, B, or C.
There are 2 possibilities for the second space: The two stamps that are not in the first space.
There is 1 possibility for the third space: the stamp not used in the first or second space.
So the number of possibilities, in this case, is 3×2×1.
We can see that the number of ways that 3 stamps can be attached is the same regardless of method used.