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. 
 
        
             
        
        
        
Answer:
Step-by-step explanation:
I’m not sure if this is super accurate, but since P is prime, the only factors it has is 1 and itself, meaning that the square root of it will be irrational
 
        
             
        
        
        
You have a good day and good luck on that question
        
             
        
        
        
5 is the answer 
I used my phone
        
                    
             
        
        
        
Answer:
it would be 32
Step-by-step explanation:
you would add them all up then divide it by five