Even Integer N - Function Question

This is based on a famous theorem: "the number of primes is infinite". The proof goes along the following lines.

A = p_1*p_2*...*p_k +1, where p_i's are first k different prime numbers.

If A is a composite, A's prime factor can't be any of p_i and > p_k, which is the largest among first k primes.
If A is a prime, that prime can't any of p_i, and is greater than any p_i.

--------------------------------------------------------------------------------------------

h(100) + 1 = 2.4.6....100 +1 = 2^50 * 50! + 1

The above number is not divisible any any numbers from 2 to 50.

Assume that h(100)+1 is divided by k, such that 2 <=k <= 50

h(100) + 1 = 0 (mod) k

The right hand side = 1 (mod k)

reductio ad absurdum.


Therefore, if it has any prime factor, it must be greater than > 50

Answer: e