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.
Answer:
-f(n+1) = f(n) x 2
-on the 10th day you'd receive $512
-this function works by taking the output of the last input and multiplying it by 2 to find the new output.
-i'd rather take 40 days of this money scheme.
example of use:
f(10) = f(9) x 2
output of f(9) is 256 so f(10) = 256 x 2
Answer:
The slope is: 3
The y-intercept is: 
or 
Step-by-step explanation:
The equation of the line in Slope-Intercept form is:
Where "m" is the slope of the line and "b" is the y-intercept.
To write the given equation in this form, we need to solve for "y":
Therefore, you can identify that the slope of this line is:
And the y-intercept is:
The answer is 2x-10.
(x-5)2
=(x+-5)(2)
=(x)(2)+(-5)(2)
=2x-10
The answer is the option 3. (the arrow aimed to the center of the polygon)
Why?. Because the particle changed the direction of its movement due to a force inclined respect the motion and aimed to the center. Take in account that the vectors net force and acceleration are parallel.
