How can we compute the value of $\mathrm{gcd}(2^n-1,n!)$ efficiently where $n$ is very large? I couldn't think of any fast and efficient method.
Efficient method to compute $\mathrm{gcd}(2^n-1,n!)$
9
$\begingroup$
number-theory
-
1How large is very large? n=1000? n=1000000? – 2011-01-31
-
0TonyK : ~10^5 . . – 2011-02-01