First, add t to each side:
2t - 6 = 8
Add 6 to each side:
2t = 14
Divide both sides by 2:
t = 7
Hope this helps!! :)
Complete Question
The complete question is shown on the first uploaded image
Answer:
FWOC should hire 70,000 hunters to completely remove the python in the area
Step-by-step explanation:
From the question we are given that the Initial Pythons
100,000
And the final python


For Max Number of Python
=> 
=>

=> 
Hence the maximum number of pythons


Using Mathematical relations
from the Question
5 python is killed by = 1 hunter
1 python is killed by = 
350 , 000 pythons are killed by = 

Answer:
3/4 or 0.75
Step-by-step explanation:
the image is 3 1/4 models so basically 3 times 1
Proof by induction
Base case:
n=1: 1*2*3=6 is obviously divisible by six.
Assumption: For every n>1 n(n+1)(n+2) is divisible by 6.
For n+1:
(n+1)(n+2)(n+3)=
(n(n+1)(n+2)+3(n+1)(n+2))
We have assumed that n(n+1)(n+2) is divisble by 6.
We now only need to prove that 3(n+1)(n+2) is divisible by 6.
If 3(n+1)(n+2) is divisible by 6, then (n+1)(n+2) must be divisible by 2.
The "cool" part about this proof.
Since n is a natural number greater than 1 we can say the following:
If n is an odd number, then n+1 is even, then n+1 is divisible by 2 thus (n+1)(n+2) is divisible by 2,so we have proved what we wanted.
If n is an even number" then n+2 is even, then n+1 is divisible by 2 thus (n+1)(n+2) is divisible by 2,so we have proved what we wanted.
Therefore by using the method of mathematical induction we proved that for every natural number n, n(n+1)(n+2) is divisible by 6. QED.