I believe it’s b but maybe e or l for the answers to the questions
Answer:
the easy way to figure this out is to just plug in answers.
start with a, (10)=3(3)+1
10=9+1
10=10
this makes this a true statement
feel free to try the other options but this is your answer
A. (3,10)
Answer:
It isn't possible.
Step-by-step explanation:
Let G be a graph with n vertices. There are n possible degrees: 0,1,...,n-1.
Observe that a graph can not contain a vertice with degree n-1 and a vertice with degree 0 because if one of the vertices has degree n-1 means that this vertice is adjacent to all others vertices, then the other vertices has at least degree 1.
Then there are n vertices and n-1 possible degrees. By the pigeon principle there are two vertices that have the same degree.
Answer:
-19
Step-by-step explanation:
Hope this helps
Answer: Satisfied for n=1, n=k and n=k+1
Step-by-step explanation:
The induction procedure involves two steps
First is
Basic Step
Here we consider that for the value n=1, there is one car and it will always make the full circle.
Induction Step
Since basic step is satisfied for n=1
Now we do it for n=k+1
Now according to the statement a car makes full circle by taking gas from other cars as it passes them. This means there are cars that are there to provide fuel to the car. So we have a car that can be eliminated i.e. it gives it fuels to other car to make full circle so it is always there.
Now ,go through the statement again that the original car gets past the other car and take the gas from it to eliminate it. So now cars remain k instead of k+1 as it's fuel has been taken. Now the car that has taken the fuel can make the full circle. The gas is enough to make a circle now.
So by induction we can find a car that satisfies k+1 induction so for k number of cars, we can also find a car that makes a full circle.
