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, Ep 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.

the correct functions are

h(x) = 3x + 2  

g(x) = 2^x

step-by-step explanation:

i proceed to calculate the different values ​​of k (x)

case 1)  k(x) = g(x) ∘ h(x)

g(x) ∘ h(x)=g(h(x))

k(x) = [2]^[3x + > is the option  4. k(x) = 2^(3x + 2 )

case 2)  k(x) = g(x) + h(x)

k(x) = [2^x]+[3x + 2]=2^x+3x+> is the option  1.) k(x) = 2^x + 3x + 2

case 3)k(x) = h(x) ÷ g(x)

k(x) =  [3x + 2]/[2^x]=3x/(2^x)+2/(2^x)=3x*(2^-x)+2^(1-x)

is the option  3.)   k(x) = (3x)2^(-x) + 2^(-x + 1 )

case 4)k(x) = g(x) - h(x)

k(x) =  [2^x]-[3x + 2]=2^x-3x-> is the option  2.) k(x) = 2^x - 3x - 2 

case 5)  k(x) = g(x) × h(x)

k(x) = [2^x]*[3x + > is the option  5.) k(x) = 2^x(3x + 2)

case 6)k(x) = h(x) ∘ g(x)

h(x) ∘ g(x)=h(g(x))

k(x)=3*[2^x]+> is the option  6. k(x) = 3(2^x) +2

c

c

c

c

c

c

c

cc

c

step-by-step explanation:

i use my brain for prombles like this maybe you could try it

step-by-step explanation: