Question #c9d66

1 Answer
Jan 6, 2017

11

Explanation:

We need the maximum n such that

(n+1)!1109 or

(n+1)!109+1. We will try to obtain a reasonable firts approximation for n.

Applying log to both sides

log((n+1)!)log(109+1) or

nk=0log(k+1)log(109+1) or

n0log(ξ+1)dξ=(n+1)log(n+1)nlog(109+1)

Now using an iterative procedure like Newton

xk+1=xkfk/(dfdx)k with

f(x)=(x+1)log(x+1)xlog(109+1)

we obtain in few iterations the value for n

n=11.75=11 so with n=11 we have

(11+1)!1=479001599<109 and

(12+1)!1=6227020799>109