Check the picture below.
let's recall that 2π is a full go-around or namely a revolution

16/2 times 2 =16, 2/2 times 16 = 16
Prove:
Using mathemetical induction:
P(n) = 
for n=1
P(n) =
= 6
It is divisible by 2 and 3
Now, for n=k, 
P(k) = 
Assuming P(k) is divisible by 2 and 3:
Now, for n=k+1:
P(k+1) = 
P(k+1) = 
P(k+1) = 
Since, we assumed that P(k) is divisible by 2 and 3, therefore, P(k+1) is also
divisible by 2 and 3.
Hence, by mathematical induction, P(n) =
is divisible by 2 and 3 for all positive integer n.
There is no congruence between the triangles based on the given information. In general, two sides and an angle not between them are insufficient to specify the triangle completely. In this case, the angles that are congruent are adjacent to non-corresponding sides, so even if SSA correspondence were sufficient to ensure congruence, it would not be sufficient in this case.
The appropriate choice is
... none
Answer: The correct statements are
The GCF of the coefficients is correct.
The variable c is not common to all terms, so a power of c should not have been factored out.
David applied the distributive property.
Step-by-step explanation:
GCF = Greatest common factor
1) GCF of coefficients : (80,32,48)
80 = 2 × 2 × 2 × 2 × 5
32 = 2 × 2 × 2 × 2 × 2
48 = 2 × 2 × 2 × 2 × 3
GCF of coefficients : (80,32,48) is 16.
2) GCF of variables :(
)
= b × b × b × b
= b × b
=b × b × b × b
GCF of variables :(
) is 
3) GCF of
and c: c is not the GCF of the polynomial. The variable c is not common to all terms, so a power of c should not have been factored out.
4) 
David applied the distributive property.