for every positive even integer n, the fonction h(n) is defined to be the product of all the even integers from 2 to n, inclusive.
So we could write the following: h(2)=2=2*1 h(4)=2*4=(2*1)*(2*2)=2^2*(1*2) h(6)=2*4*6=(2*1)*(2*2)*(2*3)=2^3*(1*2*3) h(8)=2*4*6*8=(2*1)*(2*2)*(2*3)*(2*4)=2^4*(1*2*3*4) ... You can see if n=2m then h(n)=2^m*(1*2*...*m)=2^m*m!
This is exactly what you need to know to solve the problem. At a minimum the smallest prime factor is 53.
For any factorial + 1 the smallest factor (apart from 1) is greater then any of the members of the factorial
2! + 1 = 3: smallest factor is 3 3! + 1 = 7: smallest factor is 7 4! + 1 = 25: smallest factor is 5 5! + 1 = 121: smallest factor is 11 Therefore, the solution has to be >50 (choose e)
|