Author: Brendan McKay
Posted: Sat, 11 Jan 2003 10:37:53 +1100
>> From: Brendan McKay "bdm"
The following problem has no important application that I know of.
It just occurred to me as something that would interest a few
people in this group.
Say that a binomial coefficient binomial(n,k) is "non-trivial" if
n and k are integers such that 2 <= k <= n-2. The problem is to
determine if (and how) a given number is a non-trivial binomial
coefficient.
For example, if we are given
11159690566590580740354583612991667619792058478202676400
we would like to quickly recognise that it equals binomial(187,92).
I suspect that considering the theory of binomial coefficients
modulo a prime might be productive.
"Without the Maple software, we would have to spend weeks generating the equations of motion for every experiment. Then the chances that we did it right would basically be near zero. There would always be a mistake somewhere. It is very difficult to set up a dynamic motion model by hand." - Jean-Claude PiedBeouf, Ph.D Manager of Robotics, Canadian Space Agency
"Its very good - highly accurate and easy to use. The speed of Maple allows me to change equations and quickly reintegrate them into the application, so more possibilities can be explored to achieve the precise effect desired." Shawn Neely, Senior R & D Director for PDI/Dreamworks
(NAG)
