1,398 * 4 = 5,592
5,592/3 = 1,864
Each pile would have 1,864 legos.
Answer:
100
Step-by-step explanation:
<h3>
Answer: Choice C</h3>
cos(a - b) = cos(a)cos(b) + sin(a)sin(b)
In this case, we'd have a = 180 and b = q, so,
cos(a-b) = cos(a)cos(b) + sin(a)sin(b)
cos(180 - q) = cos(180)cos(q) + sin(180)sin(q)
cos(180 - q) = -1*cos(q) + 0*sin(q)
cos(180 - q) = -cos(q) + 0
cos(180 - q) = -cos(q)
Answer:
Option 2)
Step-by-step explanation:
In a function, any number can be an x-coordinate only once.
Option 1) The 2 appears twice as x.
Option 2) All x-coordinates are different.
Option 3) The 2 appears twice as an x-coordinate.
Option 4) The 3 appears twice as an x-coordinate.
Answer: Option 2)
Using the Fundamental Counting Theorem, it is found that for each case, the total number of outcomes is:
a) 60,466,176.
b) 5,961,600.
<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:

Item a:
No restrictions, hence for each of the five characters, there are 36 outcomes, hence
.
Then, the possible number of passwords is:

Item b:
The letters and the digits have to be alternated, hence:
- Starting with a letter,
.
- Starting with a digit,
.
Then, the possible number of passwords is:

To learn more about the Fundamental Counting Theorem, you can take a look at brainly.com/question/24314866