Answer:
$8.40
Step-by-step explanation:
8.6 plus 8.2 is 16.8 so they had a total of 16.8 ounces. $0.50 per ounce so you need to multiply 16.8 by 0.50 which is 8.40. you can also do 8.6(0.5) plus 8.2(0.5)= 4.3 plus 4.1 = 8.4
Answer:
c = 53 yd is the answer.
Step-by-step explanation:
a = 45 yd
b = 28 yd
c = ?
According to the Pythagorean Theorem,
a² + b² = c²
45² + 28² = c²
2025 + 784 = c²
c² = 2809
c = 53 yd
∴ The dog runs 53 yd
C^2-64 is a square roots factoring one. you take the square root of c^2 which is c and then the square root of 64 which is 8 or -8 so the answer is (c-8)(c+8). and it is a special product
9 3/10- 1 7/10 is 7.6 or 7 3/5
Answer:
There are 35990 ways in which 2 or 3 nodes fail
Step-by-step explanation:
Given : A computer network has 60 switching nodes.
To Find : In how many ways can 2 or 3 nodes fail?
Solution:
We are supposed to find no. of ways can 2 or 3 nodes fail.
So, we will use combination here .
No. of ways can 2 or 3 nodes fail=
Formula : 
No. of ways can 2 or 3 nodes fail=
=
Hence there are 35990 ways in which 2 or 3 nodes fail