Expanded form:
1 × 100,000,000
+ 5 × 10,000,000
+ 4 × 1,000,000
+ 7 × 100,000
+ 9 × 10,000
+ 8 × 1,000
+ 1 × 100
+ 0 × 10
+ 5 × 1
I hope it helps :)
Answer:
161700 ways.
Step-by-step explanation:
The order in which the transistors are chosen is not important. This means that we use the combinations formula to solve this question.
Combinations formula:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
In this question:
3 transistors from a set of 100. So
So 161700 ways.
Answer:
No, it is not a right triangle.
Step-by-step explanation:
The simplest way to determine is testing out the numbers with Pythagorian theorem.
If it complies with the theorem, it is a right triangle.
let's assume c = 28, b = 21, and a = 20
the longest side is the hypotenuse so side c (28 in) will be the hypotenuse.
According to the Pythagorian theorem, the square of the length of hypotenuse must equal to the sum of squares of other two sides.
check:
c^2 = 28^2 = 784
a^2 + b^2 = 21^2 + 20^2 = 841
because c^2 is not equal to a^2 + b^2, the triangle is not a right triangle.
2x - 1 + 3x = 0
2x + 3x - 1 = 0
(2 + 3)x - 1 = 0
5x - 1 = 0
<span>i guess it means that its a cake with a top shaped like a hexagon. if you were to use paper and cut out a hexagon then fold it, you would find out that it has 9 diagonals(meaning that you are able to fold it equally into 9 pieces). when it is unfolded, you will see 24 pieces and you will have to figure out which of the 24 pieces are triangles and which are not. after that, you calculate the percentage of triangles.
after you are finished with the paper, you apply the information to the cake.
i'm not sure if this is right, but you can try it out.</span>
