Use the formula V=AbH and 48=16h will be the second step and then divide by 16 and then you get the answer
Answer:
It's answer is 8
Step-by-step explanation:
hypotenuse (h) = 10
base (b) = 6
perpendicular (p) = x = ?
We know by using Pythagoras theorem
p = √ h² - b²
= √ 10² - 6²
= √ 100 - 36
= √ 64
x = 8
Hope it will help : ) ❤
Answer: At least 713 paintballs
Step-by-step explanation:
Based on the information that has been given in the question, the inequality that'll be used to solve the question will be:
18+0.08B≥75
0.08B≥75-18
0.08B≥57
B≥57/0.08
B≥712.5
Carolina needs to buy at least 713 paintballs along with the entrance fee to get the promotion.
Answer:
No, Lance's thinking is wrong because you cannot compare decimal numbers with alphabetizing words. For example, if we compare 37.6 to 7.42 using the method of Lance, we would probably say 37.6 is less than 7.42 because 3 is less than 7. But it is wrong. The 3 in 37.6 is in the tens place. On the other hand, 7.42 contains no tense. Therefore, 37.6 is actually higher.
Step-by-step explanation:
No, Lance's thinking is wrong because you cannot compare decimal numbers with alphabetizing words. For example, if we compare 37.6 to 7.42 using the method of Lance, we would probably say 37.6 is less than 7.42 because 3 is less than 7. But it is wrong. The 3 in 37.6 is in the tens place. On the other hand, 7.42 contains no tense. Therefore, 37.6 is actually higher.
Answer:
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.
In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected, the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory.
The adjacency matrix should be distinguished from the incidence matrix for a graph, a different matrix representation whose elements indicate whether vertex–edge pairs are incident or not, and degree matrix which contains information about the degree of each vertex.
