Advanced Search

Question: Is it possible to find the biggest divisor of (2011!)!, which equals 2^k (k::posint), with Maple?

Question:Is it possible to find the biggest divisor of (2011!)!, which equals 2^k (k::posint), with Maple?

Markiyan Hirnyk 7759 Maple
April 25 2011
0

This exponent is a number of order 2011! and Maple operates with such quantities. However, the simpleminded approaches fail:
> for k to 10 do is(`in`(2^k, numtheory[divisors](factorial(2011)))) end do;

Error, (in numtheory:-divisors) object too large
 
> for k to factorial(2020) do if is((factorial(factorial(2011))/2^k)::posint) then NULL else print(k) end if end do;

Error, (in fact) Cannot allocate memory (size=100728832)
Please Wait...