n is a positive integer, and k is the product of all integers from 1 to n inclusive. If k is a multiple of 1440, then the smallest possible value of n is
k = n! = 1440x
n! = 720*2*x
n! = 6! *2*x
we have to make it a factorial, smallest possible:
next possible factorial is 7 :- x ==> 3.5 (hmm i m assuming that x is positive integer)
next possible factorial is 8 :- x ==> 28
put x = 28
n! = 6!*2*28 ==> 6!*7*8
n!= 8!
n = 8 :---> least possible value of n is 8.
