For every positive even integer n, the function H(n) is defined to be the product of all even integers from 2 to n. What is the lowest possible prime factor of H(100) =1.
For every positive even integer n, the function H(n) is defined to be the product of all even integers from 2 to n. What is the lowest possible prime factor of H(100) =1.
Do you mean what is the lowest possible prime factor of H(100) - 1?
For every positive even integer n, the function H(n) is defined to be the product of all even integers from 2 to n. What is the lowest possible prime factor of H(100) =1.
So H(100) - 1 cannot be divisible by any prime less than 53, the first prime which does not appear on this list. I'm not a number theorist so there may be a way to prove that this is not divisible by a prime higher than this.
For every positive even integer n, the function H(n) is defined to be the product of all even integers from 2 to n. What is the lowest possible prime factor of H(100) + 1.
For every positive even integer n, the function H(n) is defined to be the product of all even integers from 2 to n. What is the lowest possible prime factor of H(100) + 1.
From my knowledge base, the answer would be the same as the one I gave for H(100) - 1.