6 Jan
2017
6 Jan
'17
5:54 p.m.
There's an excellent algorithm. Constant time. Print "Yes." Did you want to restrict the question more, perhaps? On Fri, Jan 6, 2017 at 4:30 PM, Dan Asimov <dasimov@earthlink.net> wrote:
Suppose we are given the prime factorization of a rather large integer Q.
Is there a good algorithm for determining from this whether the number Q is a binomial coefficient?
I.e., whether there exist positive integers k < n such that
Q = n! / (k! (n-k)!)
.
—Dan
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- -- http://cube20.org/ -- [ <http://golly.sf.net/>Golly link suppressed; ask me why] --