w1676 w4688
十进制下,(n+1)!比n!多两位数时,n的最小值为何整数...
十进制下，n!比(n-1)!多w=2位数时，n的最小值为何整数？Lg[(n-1)!]=K+a,0≤a<1,此时(n-1)!为1+K位数.Lg[n!]=w+K+b,...4613,4616,4619,4622,4625,4628,4631,4634,4637,4640,4643,4646,4649,4652,4655,4658,4661,4664,4667,4670,4673,4676,4679,4682,4685,4688...