Why do you want to find something more complicated ? You can view it like n*(n-1)!
I know that we are able to derive a formula for the sum of the first 'n' positive natural numbers, that sum being:
I know that we can derive this formula by writing out the sum as
and doing some algebraic manipulation. But, what if we have the following:
Is there a way in which we can manipulate the product expansion (simmilar to the way in which we can manipulate the summation expansion) which will cause us to arrive at a direct formula for the product of the first 'n' positive integers simmilar to
such that we'd have something like the following
[p.s. also, I realize that would denote the function I am refering to, but that sort if "notation" is not what I am refering to here. I'm asking weather there exists an explicit forumula for the product which does not have to be written in the form or any form that includes the ".....", but rather a precise formula simmilar to the one used for the sum of the first "n" positive integers.]
The reason why we define n! to be the product of the first n positive integers is precisely because there is no simple formula for that product!
I suspect that the reason there is a nice formula for the sum but not the product is that the ordering is defined by addition (1, 1+ 1, 1+ 1+ 1, ...) and multiplication just does not "play nicely" with addition.
It's worth mentioning Stirling's Approximation. The fact that people bother with this may help convince the OP that coming up with a "nice" formula for is a lofty goal indeed.