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.
Integer, natural, whole, rational, irrational, natural (15/3=5), integer (-12/6=-2), rational, irrational, rational, rational
Natural-the counting numbers (1,2,3,100...)
Whole-all natural AND 0
Integers-add negative numbers (no fractions)
Rational-add fractions and decimals
Irrational-numbers that can’t be a fraction (square root of 3, pi)
Real-all numbers
Answer:
the will force away from one another please give brainlist
