I am working on my undergraduate thesis. I am using a paper that I attached below.
When I solving a polynomial with (n-1) degree from a falling factorial, the paper use this approximation
(a)n-1=a(a-1)(a-2)...(a-n+2) approximate to [a-(n-2)/2]n-1.
The paper mention about unsigned Stirling Number of the First Kind (uSNFK) before.
But I can't find any relation between uSNFK and the approximation.
Can you help tell me how to proof this approximation?
The problem is in page number 7 in the paper.