Javascript is not enabled. This site can still works but it'll be more interactive when javascript is enabled.
loading...
Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
imglorp
5 hours ago
|
on: Fast Factorial Algorithms
I've always wondered if Stirling(n) can be used to arrive quickly in the vicinity of n!, and then use a search of some kind to get to the exact target.
reply