1, 3p E Z*, p prime | (p | n)Half the points for this problem will be granted only if you show the correct form of the proof type. That is, showing formal start andend statements, explicitly proving...

Extracted text: Use the proof type strong mathematical induction to prove that every positive integer greater than one is divisible by at least one prime number. That is, prove that the following formal statement is true, Vn e Z+, n > 1, 3p E Z*, p prime | (p | n) Half the points for this problem will be granted only if you show the correct form of the proof type. That is, showing formal start and end statements, explicitly proving any needed basis case, explicitly proving the strong mathematical induction step, and explicitly asserting that the requirements for strong mathematical induction have been met before you conclude the proof. You can use the Canvas math editor or English language sentences. You must use the 2-column statement/justification format for your proof. Every statement must be justified. I will be looking for the use of formal definitions of prime number, composite number, and divisibility in your proof.