Using the Fundamental Counting Theorem, it is found that there are 10 positive three-digit integers have the hundreds digit equal to 7 and the units (ones) digit equal to 1.
<h3>What is the Fundamental Counting Theorem?</h3>
It is a theorem that states that if there are n things, each with ways to be done, each thing independent of the other, the number of ways they can be done is:
The number of options for each selection are given as follows, considering there are 10 possible digits, and that the last two are fixed at 7 and 1, respectively:
Hence, the number of integers is given by:
N = 10 x 1 x 1 = 10.
More can be learned about the Fundamental Counting Theorem at brainly.com/question/24314866
#SPJ1
Answer:
a) 6
b) 6i
c) 6i
d) -6
Step-by-step explanation:
We are going to write down the numbers as a product of prime numbers and then proceed to solve:
Note: Remember that i = √-1 and that i²= -1
a) √9(√4)
√3² × √2² = 3 × 2 = 6
Thus, the answer is 6
b) √9 ×√-4
√3² x i√2² = 3 x 2i = 6i
Thus, the answer is 6i
c) √-9.√4
i√3² × √2² = 3i x 2 = 6i
Thus the answer is 6i
d) √-9.√-4
i√3² × i√2²
3i x 2i = -6
Thus the answer is -6
Answer:
a
Step-by-step explanation:
The reason being there is no pattern to it because the rest keep going up or down but a is all over the place.
Answer:
A reflection in the x-axis, and a vertical translation of 8 units down
Step-by-step explanation:
The given function is
The transformed function is
To see the transformation that occurred, we can rewrite g(x) in terms of f(x).
That is:
Therefore f(x) is reflected in the x-axis and translated 8 units down.
The resulting graph decreases from left to right over its entire domain.
Consider the binomial
,
where n=0, 1, 2, 3, ...
For example
...
...
Consider the Pascal's triangle, as shown in the picture, where the very first row is denoted by row 0, the second by row 1, the third by row 2 and so on...
We notice that the coefficients of the expansion of
, are the entries in the
row of Pascal's triangle.